{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T21:56:33Z","timestamp":1791410193654,"version":"4.3.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425342","type":"print"},{"value":"9783540447948","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44794-6_40","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:37:34Z","timestamp":1184603854000},"page":"484-491","source":"Crossref","is-referenced-by-count":8,"title":["Lightweight Collaborative Filtering Method for Binary-Encoded Data"],"prefix":"10.1007","author":[{"given":"Sholom M.","family":"Weiss","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nitin","family":"Indurkhya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,8,28]]},"reference":[{"issue":"12","key":"40_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/138859.138867","volume":"35","author":"D. Goldberg","year":"1992","unstructured":"D. Goldberg, D. Nichols, B. Oki, and D. Terry. Using collaborative filtering to weave an information tapestry. CACM, 35(12):61\u201370, 1992.","journal-title":"CACM"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T. Cover","year":"1967","unstructured":"T. Cover and P. Hart. Nearest neighbour pattern classification. IEEE Transactions on Information Theory, 13:21\u201327, 1967.","journal-title":"IEEE Transactions on Information Theory"},{"key":"40_CR3","unstructured":"J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the Fourteenth Conference on Uncertainty in AI, 1998."},{"key":"40_CR4","unstructured":"D. Chickering, D. Heckerman, and C. Meek. A bayesian approach to learning bayesian networks with local structure. In Proceedings of the Thirteenth Conference on Uncertainty in AI, 1997."},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"P. Resnick, N. Iacovou, M. Suchak, P Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of the ACM Conference on Computer Supported Cooperative Work, pages 175\u2013186, 1994.","DOI":"10.1145\/192844.192905"},{"key":"40_CR6","volume-title":"Introduction to Modern Information Retrieval","author":"G. Salton","year":"1983","unstructured":"G. Salton and M. McGill. Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983."},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"S. Weiss, H. White, and C. Apt\u00e9. Lightweight document clustering. In Proceedings of PKDD-2000, pages 665\u2013672. Springer, 2000.","DOI":"10.1007\/3-540-45372-5_82"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"S. Weiss, B. White, C. Apte, and F. Damerau. Lightweight document matching for help-desk applications. IEEE Intelligent Systems, pages 57\u201361, 2000.","DOI":"10.1109\/5254.850828"},{"key":"40_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1162\/153244301753344614","volume":"1","author":"D. Heckerman","year":"2000","unstructured":"D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering and data visualization. Journal of Machine Learning Research, 1:49\u201375, 2000.","journal-title":"Journal of Machine Learning Research"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"G. Karypis. Evaluation of item-based top-n recommendation algorithms. Technical Report 046, Department of Computer Science, University of Minnesota, 2000.","DOI":"10.21236\/ADA439546"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"M. Deshpande and G. Karypis. Selective markov models for predicting web-page accesses. In Proceedings of SIAM Data Mining Conference, 2001.","DOI":"10.1137\/1.9781611972719.4"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44794-6_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T03:40:12Z","timestamp":1556682012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44794-6_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425342","9783540447948"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44794-6_40","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}