{"id":"https://openalex.org/W2792635648","doi":"https://doi.org/10.1109/iisa.2017.8316436","title":"Using tripartite graphs to make long tail recommendations","display_name":"Using tripartite graphs to make long tail recommendations","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2792635648","doi":"https://doi.org/10.1109/iisa.2017.8316436","mag":"2792635648"},"language":"en","primary_location":{"id":"doi:10.1109/iisa.2017.8316436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iisa.2017.8316436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013670342","display_name":"Joseph Johnson","orcid":"https://orcid.org/0000-0001-9576-1045"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Johnson","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086456104","display_name":"Yiu\u2010Kai Ng","orcid":"https://orcid.org/0000-0002-5680-2796"},"institutions":[{"id":"https://openalex.org/I100005738","display_name":"Brigham Young University","ror":"https://ror.org/047rhhm47","country_code":"US","type":"education","lineage":["https://openalex.org/I100005738"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiu-Kai Ng","raw_affiliation_strings":["Computer Science Department, Brigham Young University, Provo, Utah"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Brigham Young University, Provo, Utah","institution_ids":["https://openalex.org/I100005738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I100005738"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.27066498,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10203","display_name":"Recommender Systems and Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7438551187515259},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6923342943191528},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.6400358080863953},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5655473470687866},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.4532032608985901},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4527845084667206},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42264053225517273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4194837510585785},{"id":"https://openalex.org/keywords/long-tail","display_name":"Long tail","score":0.4143190383911133},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34308335185050964},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2544729709625244},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17052093148231506}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7438551187515259},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6923342943191528},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.6400358080863953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5655473470687866},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.4532032608985901},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4527845084667206},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42264053225517273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4194837510585785},{"id":"https://openalex.org/C15189868","wikidata":"https://www.wikidata.org/wiki/Q534685","display_name":"Long tail","level":2,"score":0.4143190383911133},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34308335185050964},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2544729709625244},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17052093148231506},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iisa.2017.8316436","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iisa.2017.8316436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 8th International Conference on Information, Intelligence, Systems & Applications (IISA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1488971269","https://openalex.org/W1532325895","https://openalex.org/W1690919088","https://openalex.org/W1972156947","https://openalex.org/W2023954349","https://openalex.org/W2042281163","https://openalex.org/W2051082454","https://openalex.org/W2054141820","https://openalex.org/W2066827437","https://openalex.org/W2105953200","https://openalex.org/W2124756613","https://openalex.org/W2132314908","https://openalex.org/W2138899136","https://openalex.org/W2140942692","https://openalex.org/W2148117599","https://openalex.org/W2153190022","https://openalex.org/W2162868779","https://openalex.org/W2171960770","https://openalex.org/W2474047286","https://openalex.org/W2520082712","https://openalex.org/W2963993568","https://openalex.org/W4213009331"],"related_works":["https://openalex.org/W2136735429","https://openalex.org/W170547082","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W4301044568","https://openalex.org/W2091340890","https://openalex.org/W2008009586","https://openalex.org/W3114116576","https://openalex.org/W2663782410"],"abstract_inverted_index":{"While":[0,89],"current":[1],"state-of-the-art":[2],"recommendation":[3],"systems":[4,77],"perform":[5],"fairly":[6],"well,":[7],"they":[8],"generally":[9],"do":[10],"better":[11,105],"at":[12],"recommending":[13],"the":[14,26,37,45,57,65,98,101,130,152,184,189,192,204],"popular":[15],"subset":[16],"of":[17,29,118,123,142,188,203],"all":[18],"products":[19,31,84],"available":[20],"rather":[21],"than":[22,85],"matching":[23],"consumers":[24],"with":[25],"vast":[27],"amount":[28],"niche":[30],"in":[32,159],"what":[33],"has":[34],"been":[35],"termed":[36],"\u201cLong":[38],"Tail\u201d.":[39],"In":[40,125],"their":[41,69],"seminal":[42],"work,":[43,173],"\u201cChallenging":[44],"Long":[46],"Tail":[47],"Recommendation\u201d,":[48],"Yin":[49,134],"et":[50,135,148],"al.":[51],"make":[52],"an":[53],"eloquent":[54],"argument":[55],"that":[56,74,114,207],"long":[58,82,102,193,205],"tail":[59,83,103,194,206],"is":[60,104],"where":[61],"organizations":[62],"can":[63],"create":[64],"most":[66],"value":[67],"for":[68,81,86,97],"consumers.":[70],"They":[71],"also":[72],"argue":[73],"existing":[75],"recommender":[76],"operate":[78],"fundamentally":[79],"different":[80],"mainstream":[87],"goods.":[88,124],"matrix":[90],"factorization,":[91],"nearest-neighbors,":[92],"and":[93,165],"clustering":[94],"work":[95],"well":[96,138,175],"\u201chead\u201d":[99],"market,":[100],"represented":[106],"by":[107,133,146],"a":[108,111,116,121,140,156,179],"graph;":[109],"specifically":[110,198],"bipartite":[112,153],"graph":[113,190],"connects":[115],"set":[117,122,141],"users":[119,164],"to":[120,161,182,210],"this":[126],"paper,":[127],"we":[128],"show":[129],"algorithms":[131,144],"presented":[132],"al.,":[136,149],"as":[137,139,174,176],"similar":[143,163],"proposed":[145],"Shang":[147],"which":[150],"traverse":[151],"graphs":[154],"through":[155],"random":[157,185],"walker":[158],"order":[160],"identify":[162],"products.":[166],"We":[167],"build":[168],"on":[169],"elements":[170,177],"from":[171,178],"each":[172],"Markov":[180],"process,":[181],"facilitate":[183],"walker's":[186],"traversal":[187],"into":[191,201],"regions.":[195],"This":[196],"method":[197],"constructs":[199],"paths":[200],"regions":[202],"are":[208],"favorable":[209],"users.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}