{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T01:31:43Z","timestamp":1690421503812},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,24]],"date-time":"2013-11-24T00:00:00Z","timestamp":1385251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s11280-013-0265-x","type":"journal-article","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T00:47:50Z","timestamp":1385167670000},"page":"709-729","source":"Crossref","is-referenced-by-count":4,"title":["Correlation range query for effective recommendations"],"prefix":"10.1007","volume":"18","author":[{"given":"Wenjun","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Hao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,24]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Record, vol. 22, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170035.170072"},{"key":"265_CR2","unstructured":"Bell, R.M., Koren, Y.: Improved neighborhood-based collaborative filtering. In: Proceedings of KDD-Cup Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007)"},{"key":"265_CR3","unstructured":"Bennett, J., Lanning, S.: The netflix prize. In: Proceedings of KDD-Cup Workshop at the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2007)"},{"key":"265_CR4","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: ACM SIGMOD Record, vol. 26, pp. 265\u2013276. ACM (1997)","DOI":"10.1145\/253260.253327"},{"issue":"1","key":"265_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1287\/ijoc.1050.0135","volume":"19","author":"J Feng","year":"2007","unstructured":"Feng, J., Bhargava, H.K., Pennock, D.M.: Implementing sponsored search in web search engines: computational evaluation of alternative mechanisms. INFORMS J. Comput. 19(1), 137\u2013148 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"265_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10791-010-9152-6","volume":"14","author":"D Hillard","year":"2011","unstructured":"Hillard, D., Manavoglu, E., Raghavan, H., Leggetter, C., Cant\u00fa-Paz, E., Iyer, R.: The sum of its parts: reducing sparsity in click estimation with query segments. Inf. Retr. 14(3), 315\u2013336 (2011)","journal-title":"Inf. Retr."},{"key":"265_CR7","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Markl, V., Haas, P.J., Brown, P., Aboulnaga, A.: CORDS: automatic discovery of correlations and soft functional dependencies. In: ACM SIGMOD International Conference on Management of Data, pp. 647\u2013658 (2004)","DOI":"10.1145\/1007568.1007641"},{"key":"265_CR8","unstructured":"Jermaine, C.: The computational complexity of high-dimensional correlation search. In: Proceedings IEEE International Conference on Data Mining, 2001. ICDM 2001, pp. 249\u2013256. IEEE (2001)"},{"key":"265_CR9","doi-asserted-by":"crossref","unstructured":"Jermaine, C.: Playing hide-and-seek with correlations. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 559\u2013564. ACM (2003)","DOI":"10.1145\/956750.956819"},{"key":"265_CR10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0167-8116(02)00121-0","volume":"20","author":"WA Kamakura","year":"2003","unstructured":"Kamakura, W.A., Wedel, M., de Rosa, F., Mazzon, J.A.: Cross-selling through database marketing: a mixed data factor analyzer for data augmentation and prediction. Int. J. Res. Mark. 20, 45\u201365 (2003)","journal-title":"Int. J. Res. Mark."},{"issue":"6","key":"265_CR11","doi-asserted-by":"crossref","first-page":"1842","DOI":"10.1109\/18.165464","volume":"38","author":"W Li","year":"1992","unstructured":"Li, W.: Random texts exhibit zipf\u2019s-law-like word frequency distribution. IEEE Trans. Inf. Theory 38(6), 1842\u20131845 (1992)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"265_CR12","doi-asserted-by":"crossref","first-page":"4285","DOI":"10.1073\/pnas.96.8.4285","volume":"96","author":"M Pellegrini","year":"1999","unstructured":"Pellegrini, M., Marcotte, E.M., Thompson, M.J., Eisenberg, D., Yeates, T.O.: Assigning protein functions by comparative genome analysis: protein phylogenetic profiles. Proc. Natl. Acad. Sci 96(8), 4285\u20134288 (1999)","journal-title":"Proc. Natl. Acad. Sci"},{"key":"265_CR13","unstructured":"Seller, M., Gray, P.: A survey of database marketing. Tech. rep., I.T. in Business, Center for Research on Information Technology and Organizations, UC Irvine (1999)"},{"key":"265_CR14","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley (2006)"},{"key":"265_CR15","doi-asserted-by":"crossref","unstructured":"Xiong, H., Shekhar, S., Ning Tan, P., Kumar, V.: Exploiting a support-based upper bound of pearson\u2019s correlation coefficient for efficiently identifying strongly correlated pairs. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 334\u2013343 (2004)","DOI":"10.1145\/1014052.1014090"},{"key":"265_CR16","doi-asserted-by":"crossref","unstructured":"Xiong, H., He, X., Ding, C., Zhang, Y., Kumar, V., Holbrook, S.R.: Identification of functional modules in protein complexes via hyperclique pattern discovery. In: Proceedings of the Pacific Symposium on Biocomputing, pp. 221\u2013232 (2005)","DOI":"10.1142\/9789812702456_0021"},{"key":"265_CR17","doi-asserted-by":"crossref","unstructured":"Xiong, H., Brodie, M., Ma, S.: TOP-COP: mining top-k strongly correlated pairs in large databases. In: Proceedings of the 2006 IEEE International Conference on Data Mining, pp. 1162\u20131166 (2006)","DOI":"10.1109\/ICDM.2006.161"},{"issue":"4","key":"265_CR18","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1109\/TKDE.2006.1599388","volume":"18","author":"H Xiong","year":"2006","unstructured":"Xiong, H., Shekhar, S., Tan, P.N., Kumar, V.: TAPER: a two-step approach for all-strong-pairs correlation query in large databases. IEEE Trans. Knowl. Data Eng. 18(4), 493\u2013508 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"265_CR19","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1287\/ijoc.1080.0265","volume":"20","author":"H Xiong","year":"2008","unstructured":"Xiong, H., Zhou, W., Brodie, M., Ma, S.: Top-k \u03d5 correlation computation. INFORMS J. Comput. 20(4), 539\u2013552 (2008)","journal-title":"INFORMS J. Comput."},{"key":"265_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, L., Tang, L., Luo, P., Chen, E., Jiao, L., Wang, M., Liu, G.: Harnessing the wisdom of the crowds for accurate web page clipping. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2012), pp. 570\u2013578 (2012)","DOI":"10.1145\/2339530.2339621"},{"key":"265_CR21","doi-asserted-by":"crossref","unstructured":"Zhou, W., Xiong, H.: Volatile correlation computation: a checkpoint view. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 848\u2013856 (2008)","DOI":"10.1145\/1401890.1401991"},{"issue":"1","key":"265_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s10994-010-5204-9","volume":"83","author":"W Zhou","year":"2011","unstructured":"Zhou, W., Xiong, H.: Checkpoint evolution for volatile correlation computing. Mach. Learn. 83(1), 103\u2013131 (2011)","journal-title":"Mach. Learn."},{"key":"265_CR23","doi-asserted-by":"crossref","unstructured":"Zhou, W., Zhang, H.: Correlation range query. In: Proceedings of the 14th International Conference on Web-Age Information Management (WAIM 2013), pp. 490\u2013501 (2013)","DOI":"10.1007\/978-3-642-38562-9_50"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0265-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-013-0265-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-013-0265-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,3]],"date-time":"2019-08-03T20:39:51Z","timestamp":1564864791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-013-0265-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,24]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s11280-013-0265-x","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,24]]}}}