{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:12:15Z","timestamp":1725505935038},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_38","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"486-495","source":"Crossref","is-referenced-by-count":0,"title":["An Indexed Trie Approach to Incremental Mining of Closed Frequent Itemsets Based on a Galois Lattice Framework"],"prefix":"10.1007","author":[{"given":"B.","family":"Kalpana","sequence":"first","affiliation":[]},{"given":"R.","family":"Nadarajan","sequence":"additional","affiliation":[]},{"given":"J. Senthil","family":"Babu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"59","volume-title":"Advances in Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz., R.R.: Moment Maintaining Closed Frequent Itemsets Over a Stream Sliding Window. In: Perner, P. (ed.) ICDM 2004. LNCS (LNAI), vol.\u00a03275, pp. 59\u201366. Springer, Heidelberg (2004)"},{"key":"38_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"Davey","year":"2002","unstructured":"Davey, Priestly.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","edition":"2"},{"key":"38_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille., R.: Formal Concept Analysis Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C. Lucchese","year":"2005","unstructured":"Lucchese, C., Orlando, S., Perego., R.: Fast and Memory Efficient Mining of Frequent Closed Itemsets. IEEE Transaction on Knowledge and Data Engineering\u00a018, 21\u201336 (2005)","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","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.\u00a01540, pp. 398\u2013416. Springer, Heidelberg (1998)"},{"key":"38_CR6","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal., L.: Closed Set Based Discovery Of Small Covers For Association Rules. In: BDA 1999, pp. 361\u2013381 (1999)"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Efficient Mining Of Association Rules Using Closed Itemset Lattices. Information Systems\u00a024(1), 25\u201346 (1999)","journal-title":"Information Systems"},{"issue":"1","key":"38_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10844-005-0266-z","volume":"24","author":"N. Pasquier","year":"2005","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Stumme, G., Lakhal., L.: Generating A Condensed Representation For Association Rules. Journal of Intelligent Information Systems\u00a024(1), 29\u201360 (2005)","journal-title":"Journal of Intelligent Information Systems"},{"key":"38_CR9","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, pp. 21\u201330 (2000)"},{"key":"38_CR10","unstructured":"Pei, J., Han, J., Wang, J.: Closet+. Searching For Best Strategies For Mining Frequent Closed Itemsets. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2003)"},{"issue":"2-3","key":"38_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/09528130210164198","volume":"14","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Godin, R., Meridji, M.: Generating Frequent Itemsets Incrementally: Two Novel Approaches Based On Galois Lattice Theory. Journal of experimental and theoretical AI\u00a014(2-3), 115\u2013142 (2002)","journal-title":"Journal of experimental and theoretical AI"},{"issue":"4","key":"38_CR12","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsaio, C.: Efficient Algorithms For Mining Closed Itemsets And Their Lattice Structure. IEEE Transactions on Knowledge and Data Engineering\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:24Z","timestamp":1619522004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_38","relation":{},"subject":[]}}