{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:05:40Z","timestamp":1725897940172},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298912"},{"type":"electronic","value":"9783642298929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29892-9_23","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:34:23Z","timestamp":1340627663000},"page":"244-259","source":"Crossref","is-referenced-by-count":1,"title":["Finding Top-N Colossal Patterns Based on Clique Search with Dynamic Update of Graph"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Okubo","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J. Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent Pattern Mining - Current Status and Future Directions. Data Mining and Knowledge Discovery\u00a015(1), 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo Jr., R.J.: Efficiently Mining Long Patterns from Databases. In: Proc. of the 1998 ACM SIGMOD Int\u2019l. Conf. on Management of Data, pp. 85\u201393 (1998)","DOI":"10.1145\/276305.276313"},{"issue":"11","key":"23_CR3","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D. Burdick","year":"2005","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A Maximal Frequent Itemset Algorithm. IEEE Transactions on Knowledge and Data Engineering\u00a017(11), 1490\u20131504 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"23_CR4","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"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., Pei, J.: CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets. In: Proc. of the 9th ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining - KDD 2003, pp. 236\u2013245 (2003)","DOI":"10.1145\/956750.956779"},{"key":"23_CR6","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: LCM ver. 2: Efficient Mining Algorithm for Frequent\/Closed\/Maximal Itemsets. In: Proc. of IEEE ICDM 2004 Workshop - FIMI 2004 (2004), \n                    \n                      http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-126\/"},{"key":"23_CR7","unstructured":"Flouvat, F., Marchi, F.D., Petit, J.: ABS: Adaptive Borders Search of Frequent Itemsets. In: Proc. of IEEE ICDM 2004 Workshop - FIMI 2004 (2004), \n                    \n                      http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/\/Vol-126\/"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E.R. Omiecinski","year":"2003","unstructured":"Omiecinski, E.R.: Alternative Interest Measures for Mining Associations in Databases. IEEE Transactions on Knowledge and Data Engineering\u00a015(1), 57\u201369 (2003)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Szathmary, L., Napoli, A., Valtchev, P.: Towards Rare Itemset Mining. In: Proc. of the 19th IEEE Int\u2019l Conf. on Tools with Artificial Intelligence - ICTAI 2007, pp. 305\u2013312 (2007)","DOI":"10.1109\/ICTAI.2007.30"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Troiano, L., Scibelli, G., Birtolo, C.: A Fast Algorithm for Mining Rare Itemsets. In: Proc. of the 2009 9th Int\u2019l Conf. on Intelligent Systems Design and Applications \u2013 ISDA 2009, pp. 1149\u20131155 (2009)","DOI":"10.1109\/ISDA.2009.55"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis - Mathematical Foundations, p. 284. Springer (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining Colossal Frequent Patterns by Core Pattern Fusion. In: Proc. of the 23rd IEEE Int\u2019l Conf. on Data Engineering - ICDE 2007, pp. 706\u2013715 (2007)","DOI":"10.1109\/ICDE.2007.367916"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Xie, Y., Yu, P.S.: Max-Clique: A Top-Down Graph-Based Approach to Frequent Pattern Mining. In: Proc. of the 2010 IEEE Int\u2019l Conf. on Data Mining - ICDM 2010, pp. 1139\u20131144 (2010)","DOI":"10.1109\/ICDM.2010.73"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Tomita, E., Akutsu, T., Matsunaga, T.: Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics. In: Laskovski, A.N. (ed.) Biomedical Engineering, Trends in Electronics, Communications and Software, pp. 625\u2013640. InTech (2011)","DOI":"10.5772\/13245"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E. Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments. Journal of Global Optimization\u00a037(1), 95\u2013111 (2007)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"23_CR16","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balas","year":"1986","unstructured":"Balas, E., Yu, C.S.: Finding a Maximum Clique in an Arbitrary Graph. SIAM Journal on Computing\u00a015(4), 1054\u20131068 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D. Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing All Maximal Cliques in Large Sparse Real-World Graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Okubo, Y., Haraguchi, M., Nakajima, T.: Finding Rare Patterns with Weak Correlation Constraint. In: Proceedings of the 2010 IEEE International Conference on Data Mining Workshops - ICDMW 2010, pp. 822\u2013829 (2010)","DOI":"10.1109\/ICDMW.2010.78"},{"key":"23_CR19","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-11928-6_11","volume-title":"Formal Concept Analysis","author":"Y. Okubo","year":"2010","unstructured":"Okubo, Y., Haraguchi, M.: An Algorithm for Extracting Rare Concepts with Concise Intents. In: Kwuida, L., Sertkaya, B. (eds.) ICFCA 2010. LNCS(LNAI), vol.\u00a05986, pp. 145\u2013160. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29892-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:20:07Z","timestamp":1620112807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29892-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298912","9783642298929"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29892-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}