{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:19:35Z","timestamp":1725574775172},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283317"},{"type":"electronic","value":"9783540318286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11540007_52","type":"book-chapter","created":{"date-parts":[[2011,1,12]],"date-time":"2011-01-12T22:26:32Z","timestamp":1294871192000},"page":"420-429","source":"Crossref","is-referenced-by-count":0,"title":["An Efficiently Algorithm Based on Itemsets-Lattice and Bitmap Index for Finding Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Fuzan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minqiang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Zhao, Q.: Association Rule Mining:A Survey, Technical Report, CAIS, Nanyang Technological University, Singapore, No. 2003116 (2003)","key":"52_CR1"},{"doi-asserted-by":"crossref","unstructured":"Hipp, J.: Algorithms for Association Rule Mining: A General Survey and Comparison. In: ACM SIGKDD, vol.\u00a02(1), pp. 58\u201365 (2000)","key":"52_CR2","DOI":"10.1145\/360402.360421"},{"unstructured":"Nation, J.B.: Notes on Lattice Theory, http:\/\/www.Hawaii.edu","key":"52_CR3"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0306-4379(01)00046-1","volume":"27","author":"K.K. Loo","year":"2002","unstructured":"Loo, K.K., et al.: A Lattice-based approach for I\/O efficient association rule mining. Information Systems\u00a027, 41\u201374 (2002)","journal-title":"Information Systems"},{"unstructured":"Fu, H.: Partitioning large data to scale up lattice-based algorithm. In: ICTAI 2003 (2003)","key":"52_CR5"},{"doi-asserted-by":"crossref","unstructured":"Lin, T.Y., Hu, X., Louie, E.: A Fast Association Rule Algorithm Based On Bitmap and Granular Computing. In: The Proceedings of the IEEE International Conference Fuzzy Systems, pp. 678\u2013683 (2003)","key":"52_CR6","DOI":"10.1109\/FUZZ.2003.1209445"},{"unstructured":"Hu, X., Lin, T.Y., Louie, E.: Bitmap Techniques for Optimizing Decision Support Queries and Association. In: Rule Algorithms, IDEAS (2003)","key":"52_CR7"},{"key":"52_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-540-39403-7_19","volume-title":"Advances in Databases and Information Systems","author":"M. Morzy","year":"2003","unstructured":"Morzy, M.: Hierarchical Bitmap Index: An Efficient and Scalable Indexing Technique for Set-Valued Attributes. In: Kalinichenko, L.A., Manthey, R., Thalheim, B., Wloka, U. (eds.) ADBIS 2003. LNCS, vol.\u00a02798, pp. 236\u2013252. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential Pattern Mining Using a Bitmap Representation. In: Proc. of the 8th Int. Conf. on Knowledge Discovery and Data Mining, pp. 429\u2013435 (2002)","key":"52_CR9","DOI":"10.1145\/775047.775109"},{"unstructured":"Gardarin, G., Pucheral, P., Wu, F.: Bitmap Based Algorithms for Mining Association Rules. In: Proc. of the 14th Bases de Donnes Avancees, pp. 157\u2013176 (1998)","key":"52_CR10"},{"doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation. In: Proc. 2000 ACM-SIGMOD Int. Conf. on Management of Data (SIGMOD 2000), Dallas, TX (May 2000)","key":"52_CR11","DOI":"10.1145\/342009.335372"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"3","author":"J. Zaki Mohammed","year":"2004","unstructured":"Zaki Mohammed, J.: Mining Non-Redundant Association Rules. Data Mining and Knowledge Discovery\u00a03, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"doi-asserted-by":"crossref","unstructured":"Wang, H.: Demand-driven frequent itemset mining using pattern structures. Knowledge and Information Systems (2004)","key":"52_CR13","DOI":"10.1007\/s10115-004-0170-9"},{"doi-asserted-by":"crossref","unstructured":"Morishita, S.: Traversing Itemset Lattices with Statistical Metric Pruning In: Symposium on Principles of Database Systems, pp. 226\u2013236 (2000)","key":"52_CR14","DOI":"10.1145\/335168.335226"},{"unstructured":"Changliu, H.: The basic of Lattice Theory. Henan University Publishing Company (1990)","key":"52_CR15"}],"container-title":["Lecture Notes in Computer Science","Fuzzy Systems and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11540007_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:03Z","timestamp":1605644283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11540007_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283317","9783540318286"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11540007_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}