{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:14:37Z","timestamp":1725862477782},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319439457"},{"type":"electronic","value":"9783319439464"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43946-4_2","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T09:20:03Z","timestamp":1470388803000},"page":"19-33","source":"Crossref","is-referenced-by-count":1,"title":["TopPI: An Efficient Algorithm for Item-Centric Mining"],"prefix":"10.1007","author":[{"given":"Martin","family":"Kirchgessner","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Leroy","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Termier","sequence":"additional","affiliation":[]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[]},{"given":"Marie-Christine","family":"Rousset","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"2_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)"},{"key":"2_CR2","volume-title":"The Long Tail: Why the Future of Business Is Selling Less of More","author":"C Anderson","year":"2006","unstructured":"Anderson, C.: The Long Tail: Why the Future of Business Is Selling Less of More. Hyperion, New York (2006)"},{"key":"2_CR3","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: simplified data processing on large clusters. In: Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI) (2004)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. In: Proceedings of the Symposium on Principles of Database Systems (PODS) (2001)","DOI":"10.1145\/375551.375567"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Goel, S., Broder, A., Gabrilovich, E., Pang, B.: Anatomy of the long tail: ordinary people with extraordinary tastes. In: Proceedings of the Third International Conference on Web Search and Data Mining (WSDM), pp. 201\u2013210 (2010)","DOI":"10.1145\/1718487.1718513"},{"key":"2_CR6","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P.: Mining top-k frequent closed patterns without minimum support. In: Proceedings of the International Conference on Data Mining (ICDM), pp. 211\u2013218. IEEE (2002)"},{"key":"2_CR7","unstructured":"Kirchgessner, M., Mishra, S., Leroy, V., Amer-Yahia, S.: Testing interestingness measures in practice: a large-scale analysis of buying patterns (2016). http:\/\/arxiv.org\/abs\/1603.04792"},{"key":"2_CR8","series-title":"Annals of Information Systems","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4419-1280-0_4","volume-title":"Data Mining","author":"Y Bras Le","year":"2010","unstructured":"Le Bras, Y., Lenca, P., Lallich, S.: Mining interesting rules without support requirement: a general universal existential upward closure property. In: Stahlbock, R., Crone, S.F., Lessmann, S. (eds.) Data Mining. Annals of Information Systems, vol. 8, pp. 75\u201398. Springer, New York (2010)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: PFP: parallel FP-growth for query recommendation. In: Proceedings of the Second Conference on Recommender Systems (RecSys), pp. 107\u2013114 (2008)","DOI":"10.1145\/1454008.1454027"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-662-44851-9_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"S Minato","year":"2014","unstructured":"Minato, S., Uno, T., Tsuda, K., Terada, A., Sese, J.: A fast method of statistical assessment for combinatorial hypotheses based on frequent itemset enumeration. In: Calders, T., Esposito, F., H\u00fcllermeier, E., Meo, R. (eds.) ECML PKDD 2014, Part II. LNCS, vol. 8725, pp. 422\u2013436. Springer, Heidelberg (2014)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"N\u00e9grevergne, B., Termier, A., M\u00e9haut, J.F., Uno, T.: Discovering closedfrequent itemsets on multicore: parallelizing computations and optimizing memory accesses. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS). pp. 521\u2013528 (2010)","DOI":"10.1109\/HPCS.2010.5547082"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","first-page":"398","volume-title":"Database Theory - ICDT\u201999","author":"N Pasquier","year":"1998","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"2_CR13","unstructured":"Pei, J., Han, J., Mao, R.: Closet: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, vol. 4, pp. 21\u201330 (2000)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16\u201331. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43946-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T06:47:40Z","timestamp":1568270860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43946-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319439457","9783319439464"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43946-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}