{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,14]],"date-time":"2023-11-14T05:20:38Z","timestamp":1699939238532},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,19]],"date-time":"2011-03-19T00:00:00Z","timestamp":1300492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s10115-011-0390-8","type":"journal-article","created":{"date-parts":[[2011,3,18]],"date-time":"2011-03-18T18:45:05Z","timestamp":1300473905000},"page":"543-568","source":"Crossref","is-referenced-by-count":7,"title":["Boosted ranking models: a unifying framework for ranking predictions"],"prefix":"10.1007","volume":"30","author":[{"given":"Kevin","family":"Dela Rosa","sequence":"first","affiliation":[]},{"given":"Vangelis","family":"Metsis","sequence":"additional","affiliation":[]},{"given":"Vassilis","family":"Athitsos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,19]]},"reference":[{"issue":"6","key":"390_CR1","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng (TKDE) 17(6): 734\u2013749","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"key":"390_CR2","doi-asserted-by":"crossref","unstructured":"Andoni A, Indyk P (2006) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: IEEE symposium on foundations of computer science (FOCS), pp 459\u2013468","DOI":"10.1109\/FOCS.2006.49"},{"issue":"2","key":"390_CR3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10115-009-0195-1","volume":"22","author":"L Aronovich","year":"2010","unstructured":"Aronovich L, Spiegler I (2010) Bulk construction of dynamic clustered metric trees. Knowl Inf Syst (KAIS) 22(2): 211\u2013244","journal-title":"Knowl Inf Syst (KAIS)"},{"issue":"1","key":"390_CR4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/TPAMI.2007.1140","volume":"30","author":"V Athitsos","year":"2008","unstructured":"Athitsos V, Alon J, Sclaroff S, Kollios G (2008) Boostmap: an embedding method for efficient nearest neighbor retrieval. IEEE Trans Pattern Anal Mach Intell (PAMI) 30(1): 89\u2013104","journal-title":"IEEE Trans Pattern Anal Mach Intell (PAMI)"},{"key":"390_CR5","doi-asserted-by":"crossref","unstructured":"Athitsos V, Hadjieleftheriou M, Kollios G, Sclaroff S (2007) Query-sensitive embeddings. ACM Trans on Database Syst (TODS) 32(2):1\u201337","DOI":"10.1145\/1242524.1242525"},{"key":"390_CR6","unstructured":"Athitsos V, Sclaroff S (2005) Boosting nearest neighbor classifiers for multiclass recognition. In: IEEE workshop on learning in computer vision and pattern recognition"},{"key":"390_CR7","doi-asserted-by":"crossref","unstructured":"Becchetti L, Colesanti U, Marchetti-Spaccamela A, Vitaletti A (2010) Recommending items in pervasive scenarios: models and experimental analysis. Knowledge and Information Systems (KAIS) (published online). doi: 10.1007\/s10115-010-0338-4","DOI":"10.1007\/s10115-010-0338-4"},{"issue":"2","key":"390_CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/1345448.1345465","volume":"9","author":"R Bell","year":"2007","unstructured":"Bell R, Koren Y (2007) Lessons from the Netflix prize challenge. SIGKDD Explor 9(2): 75\u201379","journal-title":"SIGKDD Explor"},{"key":"390_CR9","doi-asserted-by":"crossref","unstructured":"Bell R, Koren Y, Volinsky C (2007) Modeling relationships at multiple scales to improve accuracy of large recommender systems. In: ACM SIGKDD international conference on knowledge discovery and data mining, pp 95\u2013104","DOI":"10.1145\/1281192.1281206"},{"issue":"4","key":"390_CR10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/34.993558","volume":"24","author":"S Belongie","year":"2002","unstructured":"Belongie S, Malik J, Puzicha J (2002) Shape matching and object recognition using shape contexts. IEEE Trans Pattern Anal Mach Intell (PAMI) 24(4): 509\u2013522","journal-title":"IEEE Trans Pattern Anal Mach Intell (PAMI)"},{"issue":"2","key":"390_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/1345448.1345459","volume":"9","author":"J Bennett","year":"2007","unstructured":"Bennett J, Elkan C, Liu B, Smyth P, Tikk D (2007) Kdd cup and workshop 2007. SIGKDD Explor 9(2): 51\u201352","journal-title":"SIGKDD Explor"},{"key":"390_CR12","doi-asserted-by":"crossref","unstructured":"Bezerra BLD, Carvalho FAT (2010) Symbolic data analysis tools for recommendation systems. Knowledge and Information Systems (KAIS), (published online) doi: 10.1007\/s10115-009-0282-3","DOI":"10.1007\/s10115-009-0282-3"},{"issue":"3","key":"390_CR13","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/502807.502809","volume":"33","author":"C B\u00f6hm","year":"2001","unstructured":"B\u00f6hm C, Berchtold S, Keim DA (2001) Searching in high-dimensional spaces: index structures for improving the performance of multimedia databases. ACM Comput Surv 33(3): 322\u2013373","journal-title":"ACM Comput Surv"},{"issue":"3","key":"390_CR14","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T Bozkaya","year":"1999","unstructured":"Bozkaya T, \u00d6zsoyoglu Z (1999) Indexing large metric spaces for similarity search queries. ACM Trans Database Syst (TODS) 24(3): 361\u2013404","journal-title":"ACM Trans Database Syst (TODS)"},{"key":"390_CR15","unstructured":"Bridge D (2001) Product recommendation systems: a new direction. In: Proceedings of the workshop programme at the fourth international conference on case-based reasoning, pp 79\u201386"},{"issue":"2","key":"390_CR16","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10844-005-0319-3","volume":"24","author":"H-C Chen","year":"2005","unstructured":"Chen H-C, Chen ALP (2005) A music recommendation system based on music and user grouping. J Intell Inf Syst 24(2): 113\u2013132","journal-title":"J Intell Inf Syst"},{"key":"390_CR17","doi-asserted-by":"crossref","unstructured":"Chen H, Liu J, Furuse K, Yu J, Ohbo N (2010) Indexing expensive functions for efficient multi-dimensional similarity search. Knowl Inf Syst (KAIS). (published online). doi: 10.1007\/s10115-010-0303-2","DOI":"10.1007\/s10115-010-0303-2"},{"key":"390_CR18","unstructured":"Ciaccia P, Patella M, Zezula P (1997) M-tree: an efficient access method for similarity search in metric spaces. In: Proceedings of international conference on very large databases (VLDB), pp 426\u2013435"},{"key":"390_CR19","doi-asserted-by":"crossref","unstructured":"Flickner M, Sawhney H, Niblack W, Ashley J, Huang Q, Dom B, Gorkani M, Hafner J, Lee D, Petkovic D, Steele D, Yanker P (1995) Query by image and video content: the QBIC system. IEEE Comput 28(9): 23\u201332","DOI":"10.1109\/2.410146"},{"key":"390_CR20","first-page":"933","volume":"4","author":"Y Freund","year":"2003","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res (JMLR) 4: 933\u2013969","journal-title":"J Mach Learn Res (JMLR)"},{"issue":"2","key":"390_CR21","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J Friedman","year":"2000","unstructured":"Friedman J, Hastie T, Tibshirani R (2000) Additive logistic regression: a statistical view of boosting. Ann Stat 28(2): 337\u2013374","journal-title":"Ann Stat"},{"key":"390_CR22","unstructured":"Funk S (2006) Netflix update: Try this at home, http:\/\/sifter.org\/simon\/journal\/20061211.html"},{"key":"390_CR23","doi-asserted-by":"crossref","unstructured":"Gantner Z, Drumond L, Freudenthaler C, Rendle S, Schmidt-Thieme L (2010) Learning attribute-to-feature mappings for cold-start recommendations. In: IEEE International Conference on Data Mining (ICDM)","DOI":"10.1109\/ICDM.2010.129"},{"key":"390_CR24","unstructured":"Gionis A, Indyk P, Motwani R (1999) Similarity search in high dimensions via hashing. In: Proceedings of international conference on very large databases (VLDB), pp 518\u2013529"},{"issue":"12","key":"390_CR25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/138859.138867","volume":"35","author":"D Goldberg","year":"1992","unstructured":"Goldberg D, Nichols D, Oki B, Terry D (1992) Using collaborative filtering to weave an information tapestry. Commun ACM 35(12): 61\u201370","journal-title":"Commun ACM"},{"issue":"4","key":"390_CR26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"GR Hjaltason","year":"2003","unstructured":"Hjaltason GR, Samet H (2003) Index-driven similarity search in metric spaces. ACM Trans Database Syst (TODS) 28(4): 517\u2013580","journal-title":"ACM Trans Database Syst (TODS)"},{"issue":"5","key":"390_CR27","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TPAMI.2003.1195989","volume":"25","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason G, Samet H (2003) Properties of embedding methods for similarity searching in metric spaces. IEEE Trans Pattern Anal Mach Intell (PAMI) 25(5): 530\u2013549","journal-title":"IEEE Trans Pattern Anal Mach Intell (PAMI)"},{"key":"390_CR28","doi-asserted-by":"crossref","unstructured":"Kanth KVR, Agrawal D, Singh A (1998) Dimensionality reduction for similarity searching in dynamic databases. In: ACM International Conference on Management of Data (SIGMOD), pp 166\u2013176","DOI":"10.1145\/276305.276320"},{"key":"390_CR29","first-page":"32","volume":"19","author":"CY Kim","year":"2004","unstructured":"Kim CY, Lee JK, Cho YH, Kim DH (2004) VISCORS: a visual-content recommender for the mobile web. IEEE Intell Syst 19: 32\u201339","journal-title":"IEEE Intell Syst"},{"key":"390_CR30","doi-asserted-by":"crossref","unstructured":"Kim Y, Chung C-W, Lee S-L, Kim D-H (2010) Distance approximation techniques to reduce the dimensionality for multimedia databases. Knowl Inf Syst (KAIS) (published online) doi: 10.1007\/s10115-010-0322-z","DOI":"10.1007\/s10115-010-0322-z"},{"key":"390_CR31","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 426\u2013434","DOI":"10.1145\/1401890.1401944"},{"key":"390_CR32","doi-asserted-by":"crossref","unstructured":"Koren Y (2009) Collaborative filtering with temporal dynamics. In: Proceedings of ACM SIGKDD international conference on knowledge discovery and data mining, pp 447\u2013456","DOI":"10.1145\/1557019.1557072"},{"key":"390_CR33","unstructured":"Kruskal JB, Liberman M (1983) The symmetric time warping algorithm: From continuous to discrete. In: \u2018Time Warps\u2019. Addison-Wesley"},{"issue":"8","key":"390_CR34","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Sov Phys 10(8): 707\u2013710","journal-title":"Sov Phys"},{"issue":"4","key":"390_CR35","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1109\/TKDE.2002.1019214","volume":"14","author":"C Li","year":"2002","unstructured":"Li C, Chang E, Garcia-Molina H, Wiederhold G. (2002) Clustering for approximate similarity search in high-dimensional spaces. IEEE Trans Knowl Data Eng (TKDE) 14(4): 792\u2013808","journal-title":"IEEE Trans Knowl Data Eng (TKDE)"},{"issue":"9","key":"390_CR36","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TPAMI.2004.68","volume":"26","author":"SZ Li","year":"2004","unstructured":"Li SZ, Zhang ZQ (2004) FloatBoost learning and statistical face detection. IEEE Trans Pattern Anal Mach Intell (PAMI) 26(9): 1112\u20131123","journal-title":"IEEE Trans Pattern Anal Mach Intell (PAMI)"},{"issue":"1","key":"390_CR37","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","volume":"7","author":"G Linden","year":"2003","unstructured":"Linden G, Smith B, York J (2003) Amazon.com recommendations: item-to-item collaborative filtering. IEEE Internet Comput 7(1): 76\u201380","journal-title":"IEEE Internet Comput"},{"key":"390_CR38","unstructured":"Paterek A (2007) Improving regularized singular value decomposition for collaborative filtering. In: Proceedings of KDD cup and workshop"},{"key":"390_CR39","unstructured":"Sakurai Y, Yoshikawa M, Uemura S, Kojima H (2000) The A-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of international conference on very large databases (VLDB), pp 516\u2013526"},{"key":"390_CR40","doi-asserted-by":"crossref","unstructured":"Salakhutdinov R, Mnih A, Hinton GE (2007) Restricted Boltzmann machines for collaborative filtering. In: Proceedings of international conference on machine learning (ICML), pp 791\u2013798","DOI":"10.1145\/1273496.1273596"},{"key":"390_CR41","doi-asserted-by":"crossref","unstructured":"Sarwar B, Karypis G, Konstan J, Riedl J (2001) Item-based collaborative filtering recommendation algorithms: In: Proceedings of international World Wide Web Conference (WWW), pp 285\u2013295","DOI":"10.1145\/371920.372071"},{"key":"390_CR42","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/978-3-540-72079-9_9","volume-title":"The adaptive web: methods and strategies of web personalization","author":"JB Schafer","year":"2007","unstructured":"Schafer JB, Frankowski D, Herlocker JL, Sen S (2007) Collaborative filtering recommender systems. In: Brusilovsky P, Kobsa A, Nejdl W (eds) The adaptive web: methods and strategies of web personalization. Springer, Berlin, pp 291\u2013324"},{"issue":"3","key":"390_CR43","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R Schapire","year":"1999","unstructured":"Schapire R, Singer Y (1999) Improved boosting algorithms using confidence-rated predictions. Mach Learn 37(3): 297\u2013336","journal-title":"Mach Learn"},{"key":"390_CR44","first-page":"623","volume":"10","author":"G Tak\u00e1cs","year":"2009","unstructured":"Tak\u00e1cs G, Pil\u00e1szy I, N\u00e9meth B, Tikk D (2009) Scalable collaborative filtering approaches for large recommender systems. J Mach Learn Res (JMLR) 10: 623\u2013656","journal-title":"J Mach Learn Res (JMLR)"},{"key":"390_CR45","doi-asserted-by":"crossref","unstructured":"Toescher A, Jahrer M, Legenstein R (2008) Improved neighborhood-based algorithms for large-scale recommender systems. In: Proceedings of KDD Cup and workshop","DOI":"10.1145\/1722149.1722153"},{"key":"390_CR46","unstructured":"Traina C Jr, Traina A, Seeger B, Faloutsos C (2000) Slim-trees: High performance metric trees minimizing overlap between nodes. In: Proceedings of 7th international conference on extending database technology (EDBT), pp 51\u201365"},{"key":"390_CR47","doi-asserted-by":"crossref","unstructured":"Tuncel E, Ferhatosmanoglu H, Rose K (2002) VQ-index: An index structure for similarity searching in multimedia databases, In: Proceedings of ACM Multimedia, pp 543\u2013552","DOI":"10.1145\/641113.641117"},{"issue":"4","key":"390_CR48","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J Uhlman","year":"1991","unstructured":"Uhlman J (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4): 175\u2013179","journal-title":"Inf Process Lett"},{"key":"390_CR49","doi-asserted-by":"crossref","unstructured":"Viola PA, Jones MJ, Snow D (2003) Detecting pedestrians using patterns of motion and appearance. In: Proceedings of IEEE international conference on computer vision (ICCV), pp 734\u2013741","DOI":"10.1109\/ICCV.2003.1238422"},{"key":"390_CR50","doi-asserted-by":"crossref","unstructured":"Viola P, Jones M (2001) Rapid object detection using a boosted cascade of simple features. In: Proceedings of IEEE conference on computer vision and pattern recognition (CVPR), vol 1, pp 511\u2013518","DOI":"10.1109\/CVPR.2001.990517"},{"issue":"1","key":"390_CR51","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-003-0123-8","volume":"7","author":"S Vucetic","year":"2005","unstructured":"Vucetic S, Obradovic Z (2005) Collaborative filtering using a regression-based approach. Knowl Inf Syst (KAIS) 7(1): 1\u201322","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"390_CR52","doi-asserted-by":"crossref","unstructured":"Weber R, B\u00f6hm K (2000) Trading quality for time with nearest-neighbor search. In: Proceedings of international conference on extending database technology: advances in database technology, pp 21\u201335","DOI":"10.1007\/3-540-46439-5_2"},{"key":"390_CR53","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of international conference on very large databases (VLDB), pp 194\u2013205"},{"key":"390_CR54","unstructured":"White DA, Jain R (1996) Similarity indexing: algorithms and performance. In: Storage and retrieval for image and video databases (SPIE), pp 62\u201373"},{"key":"390_CR55","doi-asserted-by":"crossref","unstructured":"Wu J (2009) Binomial matrix factorization for discrete collaborative filtering. In: IEEE international conference on data mining (ICDM), pp 1046\u20131051","DOI":"10.1109\/ICDM.2009.79"},{"key":"390_CR56","unstructured":"Yianilos P (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM-SIAM symposium on discrete algorithms, pp 311\u2013321"},{"issue":"1","key":"390_CR57","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-008-0190-y","volume":"22","author":"M Zhang","year":"2010","unstructured":"Zhang M, Alhajj R (2010) Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space. Knowl Inf Syst (KAIS) 22(1): 1\u201326","journal-title":"Knowl Inf Syst (KAIS)"},{"key":"390_CR58","doi-asserted-by":"crossref","unstructured":"Zhang R, Tran T (2010) An information gain-based approach for recommending useful product reviews. Knowl Inf Syst (KAIS), (published online) doi: 10.1007\/s10115-010-0287-y","DOI":"10.1007\/s10115-010-0287-y"},{"key":"390_CR59","doi-asserted-by":"crossref","unstructured":"Zheng Z, Chen K, Sun G, Zha H (2007) A regression framework for learning ranking functions using relative relevance judgments. In: Proceedings of ACM SIGIR conference on research and development in information (SIGIR), pp 287\u2013294","DOI":"10.1145\/1277741.1277792"},{"key":"390_CR60","doi-asserted-by":"crossref","unstructured":"Zhou Y, Wilkinson D, Schreiber R, Pan R (2008) Large-scale parallel collaborative filtering for the Netflix prize. In: Algorithmic aspects in information and management (AAIM), pp 337\u2013348","DOI":"10.1007\/978-3-540-68880-8_32"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0390-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-011-0390-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-011-0390-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T10:08:03Z","timestamp":1560074883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-011-0390-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,19]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["390"],"URL":"https:\/\/doi.org\/10.1007\/s10115-011-0390-8","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,19]]}}}