{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:40:53Z","timestamp":1759178453450,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303524"},{"type":"electronic","value":"9783642303531"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30353-1_6","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T09:44:29Z","timestamp":1337939069000},"page":"61-73","source":"Crossref","is-referenced-by-count":56,"title":["Mining Top-K Association Rules"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Fournier-Viger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng-Wei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielminski, T., Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. In: Proc. ACM Intern. Conf. on Management of Data, pp. 207\u2013216. ACM Press (June 1993)","DOI":"10.1145\/170036.170072"},{"key":"6_CR2","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2006","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann Publ., San Francisco (2006)","edition":"2"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1080\/07408170600897460","volume":"39","author":"J. Pei","year":"2007","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-Mine: Fast and space-preserving frequent pattern mining in large databases. IIE Trans.\u00a039(6), 593\u2013605 (2007)","journal-title":"IIE Trans."},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10618-005-0255-4","volume":"10","author":"G.I. Webb","year":"2005","unstructured":"Webb, G.I., Zhang, S.: K-Optimal-Rule-Discovery. Data Mining and Knowledge Discovery\u00a010(1), 39\u201379 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"G.I. Webb","year":"2011","unstructured":"Webb, G.I.: Filtered top-k association discovery. WIREs Data Mining and Knowledge Discovery\u00a01, 183\u2013192 (2011)","journal-title":"WIREs Data Mining and Knowledge Discovery"},{"issue":"5","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"C. Kun Ta","year":"2008","unstructured":"Kun Ta, C., Huang, J.-L., Chen, M.-S.: Mining Top-k Frequent Patterns in the Presence of the Memory Constraint. VLDB Journal\u00a017(5), 1321\u20131344 (2008)","journal-title":"VLDB Journal"},{"issue":"5","key":"6_CR8","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Lu, Y., Tzvetkov, P.: Mining Top-k Frequent Closed Itemsets. IEEE Trans. Knowledge and Data Engineering\u00a017(5), 652\u2013664 (2005)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-540-75488-6_29","volume-title":"Discovery Science","author":"A. Pietracaprina","year":"2007","unstructured":"Pietracaprina, A., Vandin, F.: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS 2007. LNCS (LNAI), vol.\u00a04755, pp. 275\u2013280. Springer, Heidelberg (2007)"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","volume":"7","author":"P. Tzvetkov","year":"2005","unstructured":"Tzvetkov, P., Yan, X., Han, J.: TSP: Mining Top-k Closed Sequential Patterns. Knowledge and Information Systems\u00a07(4), 438\u2013457 (2005)","journal-title":"Knowledge and Information Systems"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"You, Y., Zhang, J., Yang, Z., Liu, G.: Mining Top-k Fault Tolerant Association Rules by Redundant Pattern Disambiguation in Data Streams. In: Proc. 2010 Intern. Conf. Intelligent Computing and Cognitive Informatics, pp. 470\u2013473. IEEE Press (March 2010)","DOI":"10.1109\/ICICCI.2010.91"},{"key":"6_CR12","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C. Lucchese","year":"2006","unstructured":"Lucchese, C., Orlando, S., Perego, R.: Fast and Memory Efficient Mining of Frequent Closed Itemsets. IEEE Trans. Knowl. and Data Eng.\u00a018(1), 21\u201336 (2006)","journal-title":"IEEE Trans. Knowl. and Data Eng."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30353-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:51:07Z","timestamp":1558299067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30353-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303524","9783642303531"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30353-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}