{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:36Z","timestamp":1750307256349,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T00:00:00Z","timestamp":1301011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,25]]},"DOI":"10.1145\/1980422.1980444","type":"proceedings-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T12:59:14Z","timestamp":1305637154000},"page":"1-4","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Using lower-bound similarity to enhance the performance of recommender systems"],"prefix":"10.1145","author":[{"given":"Mohak","family":"Sharma","sequence":"first","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[{"name":"International Institute of Information Technology, Hyderabad, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.99"},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/978-3-642-01307-2_14","volume-title":"Clustering with lower bound on similarity","author":"Hasan M. A.","year":"2009","unstructured":"M. A. Hasan , S. Salem , B. Pupacdi , and M. J. Zaki . Clustering with lower bound on similarity . In T. Theeramunkong, B. Kijsirikul, N. Cercone, and T. B. Ho, editors, PAKDD, volume 5476 of Lecture Notes in Computer Science , pages 122 -- 133 . Springer , 2009 . 10.1007\/978-3-642-01307-2_14 M. A. Hasan, S. Salem, B. Pupacdi, and M. J. Zaki. Clustering with lower bound on similarity. In T. Theeramunkong, B. Kijsirikul, N. Cercone, and T. B. Ho, editors, PAKDD, volume 5476 of Lecture Notes in Computer Science, pages 122--133. Springer, 2009. 10.1007\/978-3-642-01307-2_14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020443909834"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/245108.245126"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/1008992.1009050","volume-title":"SIGIR","author":"McLaughlin M. R.","year":"2004","unstructured":"M. R. McLaughlin and J. L. Herlocker . A collaborative filtering algorithm and evaluation metric that accurately model the user experience. In M. Sanderson, K. J\u00e4rvelin, J. Allan, and P. Bruza, editors , SIGIR , pages 329 -- 336 . ACM, 2004 . 10.1145\/1008992.1009050 M. R. McLaughlin and J. L. Herlocker. A collaborative filtering algorithm and evaluation metric that accurately model the user experience. In M. Sanderson, K. J\u00e4rvelin, J. Allan, and P. Bruza, editors, SIGIR, pages 329--336. ACM, 2004. 10.1145\/1008992.1009050"},{"key":"e_1_3_2_1_6_1","first-page":"175","volume-title":"CSCW","author":"Resnick P.","year":"1994","unstructured":"P. Resnick , N. Iacovou , M. Suchak , P. Bergstrom , and J. Riedl . Grouplens: An open architecture for collaborative filtering of netnews . In CSCW , pages 175 -- 186 , 1994 . 10.1145\/192844.192905 P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In CSCW, pages 175--186, 1994. 10.1145\/192844.192905"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/352871.352887","volume-title":"ACM Conference on Electronic Commerce","author":"Sarwar B. M.","year":"2000","unstructured":"B. M. Sarwar , G. Karypis , J. A. Konstan , and J. Riedl . Analysis of recommendation algorithms for e-commerce . In ACM Conference on Electronic Commerce , pages 158 -- 167 , 2000 . 10.1145\/352871.352887 B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In ACM Conference on Electronic Commerce, pages 158--167, 2000. 10.1145\/352871.352887"}],"event":{"name":"Compute'11: ACM Bangalore Chapter 4th Annual Conference","sponsor":["ACM Bangalore chapter","SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Bangalore India","acronym":"Compute'11"},"container-title":["Proceedings of the Fourth Annual ACM Bangalore Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980422.1980444","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1980422.1980444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:26Z","timestamp":1750243946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1980422.1980444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,25]]},"references-count":7,"alternative-id":["10.1145\/1980422.1980444","10.1145\/1980422"],"URL":"https:\/\/doi.org\/10.1145\/1980422.1980444","relation":{},"subject":[],"published":{"date-parts":[[2011,3,25]]},"assertion":[{"value":"2011-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}