{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T07:41:26Z","timestamp":1762674086825,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,2,11]],"date-time":"2016-02-11T00:00:00Z","timestamp":1455148800000},"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":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2016,4]]},"abstract":"<jats:p>Recommender systems (RS) can now be found in many commercial Web sites, often presenting customers with a short list of additional products that they might purchase. Many commercial sites do not typically have the ability and resources to develop their own system and may outsource the RS to a third party. This had led to the growth of a recommendation as a service industry, where companies, referred to as RS providers, provide recommendation services. These companies must carefully balance the cost of building recommendation models and the payment received from the e-business, as these payments are expected to be low. In such a setting, restricting the computational time required for model building is critical for the RS provider to be profitable.<\/jats:p>\n          <jats:p>In this article, we propose anytime algorithms as an attractive method for balancing computational time and the recommendation model performance, thus tackling the RS provider problem. In an anytime setting, an algorithm can be stopped after any amount of computational time, always ensuring that a valid, although suboptimal, solution will be returned. Given sufficient time, however, the algorithm should converge to an optimal solution. In this setting, it is important to evaluate the quality of the returned solution over time, monitoring quality improvement. This is significantly different from traditional evaluation methods, which mostly estimate the performance of the algorithm only after its convergence is given sufficient time.<\/jats:p>\n          <jats:p>We show that the popular item-item top-N recommendation approach can be brought into the anytime framework by smartly considering the order by which item pairs are being evaluated. We experimentally show that the time-accuracy trade-off can be significantly improved for this specific problem.<\/jats:p>","DOI":"10.1145\/2835496","type":"journal-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T13:07:16Z","timestamp":1456146436000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Anytime Algorithms for Recommendation Service Providers"],"prefix":"10.1145","volume":"7","author":[{"given":"David","family":"Ben-Shimon","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lior","family":"Rokach","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Shani","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bracha","family":"Shapira","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507189"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2124295.2124354"},{"key":"e_1_2_1_3_1","unstructured":"R. Anil T. Dunning and E. Friedman. 2011. Clustering algorithms in Mahout. In Mahout in Action S. Owen R. Anil T. Dunning and E. Friedman (Eds.). Manning Shelter Island NY 145--183.  R. Anil T. Dunning and E. Friedman. 2011. Clustering algorithms in Mahout. In Mahout in Action S. Owen R. Anil T. Dunning and E. Friedman (Eds.). Manning Shelter Island NY 145--183."},{"key":"e_1_2_1_4_1","volume-title":"Clouds: A Berkeley View of Cloud Computing. Technical Report UCB\/EECS-2009-28. EECS Department","author":"Armbrust M.","year":"2009","unstructured":"M. Armbrust , O. Fox , R. Griffith , A. D. Joseph , Y. Katz , A. Konwinski , and M. Zaharia . 2009 . Above the Clouds: A Berkeley View of Cloud Computing. Technical Report UCB\/EECS-2009-28. EECS Department , University of California at Berkeley , Berkeley, CA . M. Armbrust, O. Fox, R. Griffith, A. D. Joseph, Y. Katz, A. Konwinski, and M. Zaharia. 2009. Above the Clouds: A Berkeley View of Cloud Computing. Technical Report UCB\/EECS-2009-28. EECS Department, University of California at Berkeley, Berkeley, CA."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909). 2016","author":"Bachrach Y.","year":"2021","unstructured":"Y. Bachrach , E. Porat , and J. S. Rosenschein . 2009, July. Sketching techniques for collaborative filtering . In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909). 2016 -- 2021 . Y. Bachrach, E. Porat, and J. S. Rosenschein. 2009, July. Sketching techniques for collaborative filtering. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI\u201909). 2016--2021."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559184.2559194"},{"volume-title":"Proceedings of the 7th International Conference on Agents and Artificial Intelligence.","author":"Ben-Shimon D.","key":"e_1_2_1_7_1","unstructured":"D. Ben-Shimon , L. Rokach , B. Shapira , and G. Shani . 2015. Fast item-based collaborative filtering . In Proceedings of the 7th International Conference on Agents and Artificial Intelligence. D. Ben-Shimon, L. Rokach, B. Shapira, and G. Shani. 2015. Fast item-based collaborative filtering. In Proceedings of the 7th International Conference on Agents and Artificial Intelligence."},{"volume-title":"Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD\u201998)","author":"Bradley P. S.","key":"e_1_2_1_8_1","unstructured":"P. S. Bradley , U. M. Fayyad , and C. Reina . 1998. Scaling clustering algorithms to large databases . In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD\u201998) . 9--15. P. S. Bradley, U. M. Fayyad, and C. Reina. 1998. Scaling clustering algorithms to large databases. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD\u201998). 9--15."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"D. Bridge and J. Kelleher. 2002. Experiments in sparsity reduction: Using clustering in collaborative recommenders. In Artificial Intelligence and Cognitive Science. Springer Berlin Germany 144--149.   D. Bridge and J. Kelleher. 2002. Experiments in sparsity reduction: Using clustering in collaborative recommenders. In Artificial Intelligence and Cognitive Science. Springer Berlin Germany 144--149.","DOI":"10.1007\/3-540-45750-X_18"},{"volume-title":"Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. 43--52","author":"Breese J. S.","key":"e_1_2_1_10_1","unstructured":"J. S. Breese , D. Heckerman , and C. Kadie . 1998. Empirical analysis of predictive algorithms for collaborative filtering . In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. 43--52 . J. S. Breese, D. Heckerman, and C. Kadie. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence. 43--52."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718538"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207548908942606"},{"key":"e_1_2_1_13_1","volume-title":"Rectree: A Linear Collaborative Filtering Algorithm","author":"Chee S. H. S.","year":"2000","unstructured":"S. H. S. Chee . 2000 . Rectree: A Linear Collaborative Filtering Algorithm . Simon Fraser University . S. H. S. Chee. 2000. Rectree: A Linear Collaborative Filtering Algorithm. Simon Fraser University."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864721"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-30-9.50013-5"},{"key":"e_1_2_1_17_1","volume-title":"Retrieved","author":"Funk S.","year":"2006","unstructured":"S. Funk . 2006 . Netflix Update: Try This at Home . Retrieved January 14, 2016, from http:\/\/sifter.org\/&sim;simon\/journal\/20061211.html. S. Funk. 2006. Netflix Update: Try This at Home. Retrieved January 14, 2016, from http:\/\/sifter.org\/&sim;simon\/journal\/20061211.html."},{"volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999)","author":"Gionis A.","key":"e_1_2_1_18_1","unstructured":"A. Gionis , P. Indyk , and R. Motwani . 1999. Similarity search in high dimensions via hashing . In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999) . 518--529. A. Gionis, P. Indyk, and R. Motwani. 1999. Similarity search in high dimensions via hashing. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999). 518--529."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"M. Grcar B. Fortuna D. Mladeni\u010d and M. Grobelnik. 2006. kNN versus SVM in the collaborative filtering framework. In Data Science and Classification. Springer Berlin Germany 251--260.  M. Grcar B. Fortuna D. Mladeni\u010d and M. Grobelnik. 2006. kNN versus SVM in the collaborative filtering framework. In Data Science and Classification. Springer Berlin Germany 251--260.","DOI":"10.1007\/3-540-34416-0_27"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963772"},{"key":"e_1_2_1_21_1","unstructured":"P. Jaccard. 1901. Etude Comparative de la Distribution Florale dans une Portion des Alpes et du Jura. Lausanne.  P. Jaccard. 1901. Etude Comparative de la Distribution Florale dans une Portion des Alpes et du Jura. Lausanne."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2212351.2212354"},{"volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases. 950--961","author":"Lv Q.","key":"e_1_2_1_25_1","unstructured":"Q. Lv , W. Josephson , Z. Wang , M. Charikar , and K. Li . 2007. Multi-probe LSH: Efficient indexing for high-dimensional similarity search . In Proceedings of the 33rd International Conference on Very Large Data Bases. 950--961 . Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li. 2007. Multi-probe LSH: Efficient indexing for high-dimensional similarity search. In Proceedings of the 33rd International Conference on Very Large Data Bases. 950--961."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the ACM SIGIR Workshop on Recommender Systems","volume":"128","author":"O\u2019Connor M.","unstructured":"M. O\u2019Connor and J. Herlocker . 1999. Clustering items for collaborative filtering . In Proceedings of the ACM SIGIR Workshop on Recommender Systems , Vol. 128 . M. O\u2019Connor and J. Herlocker. 1999. Clustering items for collaborative filtering. In Proceedings of the ACM SIGIR Workshop on Recommender Systems, Vol. 128."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.16"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864726"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"A. Rajaraman and J. D. Ullman. 2011. Mining of Massive Datasets. Cambridge University Press.   A. Rajaraman and J. D. Ullman. 2011. Mining of Massive Datasets. Cambridge University Press.","DOI":"10.1017\/CBO9781139058452"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2508221"},{"volume-title":"Proceedings of the IEEE\/WIC International Conference on Web Intelligence (WI\u201903)","author":"Robles V.","key":"e_1_2_1_31_1","unstructured":"V. Robles , P. Larranaga , E. Menasalvas , M. S. P\u00e9rez , and V. Herves . 2003. Improvement of naive Bayes collaborative filtering using interval estimation . In Proceedings of the IEEE\/WIC International Conference on Web Intelligence (WI\u201903) . IEEE, Los Alamitos, CA. V. Robles, P. Larranaga, E. Menasalvas, M. S. P\u00e9rez, and V. Herves. 2003. Improvement of naive Bayes collaborative filtering using interval estimation. In Proceedings of the IEEE\/WIC International Conference on Web Intelligence (WI\u201903). IEEE, Los Alamitos, CA."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 5th International Conference on Computer and Information Technology","volume":"1","author":"Sarwar B. M.","unstructured":"B. M. Sarwar , G. Karypis , J. Konstan , and J. Riedl . 2002. Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering . In Proceedings of the 5th International Conference on Computer and Information Technology , Vol. 1 . B. M. Sarwar, G. Karypis, J. Konstan, and J. Riedl. 2002. Recommender systems for large-scale e-commerce: Scalable neighborhood formation using clustering. In Proceedings of the 5th International Conference on Computer and Information Technology, Vol. 1."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013284820704"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"G. Shani and A. Gunawardana. 2011. Evaluating recommendation systems. In Recommender Systems Handbook. Springer 257--297.  G. Shani and A. Gunawardana. 2011. Evaluating recommendation systems. In Recommender Systems Handbook. Springer 257--297.","DOI":"10.1007\/978-0-387-85820-3_8"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD\u201997)","author":"Srnyth P.","year":"1997","unstructured":"P. Srnyth . 1997 . Anytime exploratory data analysis for massive data sets . In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD\u201997) . P. Srnyth. 1997. Anytime exploratory data analysis for massive data sets. In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining (KDD\u201997)."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2365952.2365972"},{"key":"e_1_2_1_38_1","volume-title":"Proceedings of the AAAI Workshop on Recommendation Systems","volume":"1","author":"Ungar L. H.","unstructured":"L. H. Ungar and D. P. Foster . 1998. Clustering methods for collaborative filtering . In Proceedings of the AAAI Workshop on Recommendation Systems , Vol. 1 . L. H. Ungar and D. P. Foster. 1998. Clustering methods for collaborative filtering. In Proceedings of the AAAI Workshop on Recommendation Systems, Vol. 1."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-003-0123-8"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516404"},{"key":"e_1_2_1_41_1","first-page":"3","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"Zilberstein S.","year":"1996","unstructured":"S. Zilberstein . 1996 . Using anytime algorithms in intelligent systems . AI Magazine 17 , 3 , 73. S. Zilberstein. 1996. Using anytime algorithms in intelligent systems. AI Magazine 17, 3, 73.","journal-title":"AI Magazine"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2835496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:20Z","timestamp":1750225700000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2835496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,11]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["10.1145\/2835496"],"URL":"https:\/\/doi.org\/10.1145\/2835496","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2016,2,11]]},"assertion":[{"value":"2014-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-02-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}