{"id":"https://openalex.org/W2161366614","doi":"https://doi.org/10.1109/icc.2011.5962945","title":"A Robust Collaborative Filtering Algorithm Using Ordered Logistic Regression","display_name":"A Robust Collaborative Filtering Algorithm Using Ordered Logistic Regression","publication_year":2011,"publication_date":"2011-06-01","ids":{"openalex":"https://openalex.org/W2161366614","doi":"https://doi.org/10.1109/icc.2011.5962945","mag":"2161366614"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2011.5962945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"},"type":"article","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/A5100520054","display_name":"Shanshan Zheng","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shanshan Zheng","raw_affiliation_strings":["Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100678341","display_name":"Tao Jiang","orcid":"https://orcid.org/0000-0002-8482-1046"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tao Jiang","raw_affiliation_strings":["Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044395526","display_name":"John S. Baras","orcid":"https://orcid.org/0000-0002-4955-8561"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John S. Baras","raw_affiliation_strings":["Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Systems Research, Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2924,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.91660204,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"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.9998000264167786,"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.9998000264167786,"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/T11478","display_name":"Caching and Content Delivery","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11644","display_name":"Spam and Phishing Detection","score":0.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8065674304962158},{"id":"https://openalex.org/keywords/collaborative-filtering","display_name":"Collaborative filtering","score":0.6698726415634155},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5394381880760193},{"id":"https://openalex.org/keywords/markov-chain-monte-carlo","display_name":"Markov chain Monte Carlo","score":0.48687806725502014},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4842810034751892},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4663756489753723},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46089687943458557},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.4606137275695801},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.44633492827415466},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.43329566717147827},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.37988734245300293},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.35869500041007996},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.3461032509803772},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33566850423812866},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.11937212944030762},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0983249843120575}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8065674304962158},{"id":"https://openalex.org/C21569690","wikidata":"https://www.wikidata.org/wiki/Q94702","display_name":"Collaborative filtering","level":3,"score":0.6698726415634155},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5394381880760193},{"id":"https://openalex.org/C111350023","wikidata":"https://www.wikidata.org/wiki/Q1191869","display_name":"Markov chain Monte Carlo","level":3,"score":0.48687806725502014},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4842810034751892},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4663756489753723},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46089687943458557},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.4606137275695801},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.44633492827415466},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.43329566717147827},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37988734245300293},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35869500041007996},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.3461032509803772},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33566850423812866},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.11937212944030762},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0983249843120575},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2011.5962945","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2011.5962945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Communications (ICC)","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":27,"referenced_works":["https://openalex.org/W52770770","https://openalex.org/W1502996661","https://openalex.org/W1528905581","https://openalex.org/W1601015633","https://openalex.org/W1746680969","https://openalex.org/W1980202081","https://openalex.org/W1989279326","https://openalex.org/W2018605660","https://openalex.org/W2066459332","https://openalex.org/W2072651985","https://openalex.org/W2108207895","https://openalex.org/W2110325612","https://openalex.org/W2133266261","https://openalex.org/W2138108551","https://openalex.org/W2151052953","https://openalex.org/W2155106456","https://openalex.org/W2171849943","https://openalex.org/W2171960770","https://openalex.org/W2622684336","https://openalex.org/W2950332743","https://openalex.org/W4210310779","https://openalex.org/W4234189512","https://openalex.org/W4255975151","https://openalex.org/W6630221451","https://openalex.org/W6676522543","https://openalex.org/W6682423454","https://openalex.org/W6685496212"],"related_works":["https://openalex.org/W2772628444","https://openalex.org/W1484355083","https://openalex.org/W2735929803","https://openalex.org/W4220714703","https://openalex.org/W3008845055","https://openalex.org/W2098758514","https://openalex.org/W2170391450","https://openalex.org/W4376854386","https://openalex.org/W2202724490","https://openalex.org/W2508671622"],"abstract_inverted_index":{"The":[0,103,143],"Internet":[1],"offers":[2],"tremendous":[3],"opportunities":[4],"for":[5,34],"information":[6,19,37,41],"sharing":[7],"and":[8,65,74,85,88,119],"content":[9,118],"distribution.":[10],"However,":[11],"without":[12],"proper":[13],"filtering,":[14],"the":[15,23,39,72,77,131,158],"large":[16,40],"amount":[17],"of":[18,105,133,166],"may":[20],"likely":[21],"swarm":[22],"users":[24,73],"rather":[25],"than":[26],"benefit":[27],"them.":[28],"Collaborative":[29],"filtering":[30,56],"is":[31,59,109,161],"a":[32,53,90,147],"technique":[33],"extracting":[35],"useful":[36],"from":[38],"pool":[42],"generated":[43],"by":[44],"interconnected":[45],"online":[46],"communities.":[47],"In":[48],"this":[49],"paper,":[50],"we":[51],"develop":[52],"probabilistic":[54],"collaborative":[55],"algorithm,":[57],"which":[58],"based":[60,95],"on":[61,146],"ordered":[62],"logistic":[63],"regression":[64],"takes":[66],"into":[67],"account":[68],"both":[69],"similarities":[70,75],"among":[71,76],"items.":[78],"We":[79,112],"make":[80],"inference":[81],"with":[82,157],"maximum":[83],"likelihood":[84],"Bayesian":[86],"frameworks,":[87],"propose":[89],"Markov":[91],"Chain":[92],"Monte":[93],"Carlo":[94],"Expectation":[96],"Maximization":[97],"algorithm":[98,108,156],"to":[99,129,139],"optimize":[100],"model":[101],"parameters.":[102],"power":[104],"our":[106,154],"proposed":[107,155],"its":[110],"extensibility.":[111],"show":[113,152],"that":[114,153],"it":[115,124],"can":[116,125],"incorporate":[117],"contextual":[120],"information.":[121],"More":[122],"importantly,":[123],"be":[126],"easily":[127],"extended":[128],"include":[130],"trustworthiness":[132],"users,":[134],"thus":[135],"being":[136],"more":[137],"robust":[138,162],"malicious":[140],"data":[141,150],"manipulation.":[142],"experimental":[144],"results":[145],"real":[148],"world":[149],"set":[151],"trust":[159],"extension":[160],"under":[163],"different":[164],"types":[165],"attacks":[167],"in":[168],"recommendation":[169],"systems.":[170]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}