{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:49:33Z","timestamp":1725551373400},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642119279"},{"type":"electronic","value":"9783642119286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11928-6_11","type":"book-chapter","created":{"date-parts":[[2010,4,7]],"date-time":"2010-04-07T07:21:07Z","timestamp":1270624867000},"page":"145-160","source":"Crossref","is-referenced-by-count":6,"title":["An Algorithm for Extracting Rare Concepts with Concise Intents"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Okubo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","first-page":"284","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, 284 p. Springer, Heidelberg (1999)"},{"key":"11_CR2","series-title":"Lecture Notes in Artificial Intelligence","first-page":"348","volume-title":"Formal Concept Analysis","year":"2005","unstructured":"Ganter, B., Stumme, G., Wille, R. (eds.): Formal Concept Analysis \u2013 Foundations and Applications. LNCS (LNAI), vol.\u00a03626, 348 p. Springer, Heidelberg (2005)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Int\u2019l Conf. on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"11_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/11528784_10","volume-title":"Formal Concept Analysis","author":"L. Lakhal","year":"2005","unstructured":"Lakhal, L., Stumme, G.: Efficient Mining of Association Rules Based on Formal Concept Analysis. In: Ganter, B., Stumme, G., Wille, R. (eds.) Formal Concept Analysis. LNCS (LNAI), vol.\u00a03626, pp. 180\u2013195. Springer, Heidelberg (2005)"},{"key":"11_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\/956755.956779"},{"issue":"1","key":"11_CR6","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":"11_CR7","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), http:\/\/sunsite.informatik.rwth-aachen.de\/verb+Publications\/CEUR-WS\/\/Vol-126\/"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Dong, G., Li, J.: Efficient Mining of Emerging Patterns: Discovering Trends and Differences. In: Proc. of the 5th ACM SIGKDD Int\u2019l Conf. on Knowledge Discovery and Data Mining - KDD 1999, pp. 43\u201352 (1999)","DOI":"10.1145\/312129.312191"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Alhammady, H., Ramamohanarao, K.: Using Emerging Patterns and Decision Trees in Rare-Class Classification. In: Proc. of the 4th IEEE Int\u2019l Conf. on Data Mining - ICDM 2004, pp. 315\u2013318 (2004)","DOI":"10.1109\/ICDM.2004.10058"},{"issue":"3","key":"11_CR10","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S.D. Bay","year":"2001","unstructured":"Bay, S.D., Pazzani, M.J.: Detecting Group Differences: Mining Contrast Sets. Data Mining and Knowledge Discovery\u00a05(3), 213\u2013246 (2001)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"11_CR11","first-page":"377","volume":"10","author":"P.K. Novak","year":"2009","unstructured":"Novak, P.K., Lavrac, N.: Supervised Descriptive Rule Discovery: A Unifying Survey of Contrast Set, Emerging Pattern and Subgroup Mining. The Journal of Machine Learning Research Archive\u00a010, 377\u2013403 (2009)","journal-title":"The Journal of Machine Learning Research Archive"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Li, A., Haraguchi, M., Okubo, Y.: Implicit Groups of Web Pages as Constrained Top-N Concepts. In: Proc. of the 2008 IEEE\/WIC\/ACM Int\u2019l Conf. on Web Intelligence and Intelligent Agent Technology Workshops, pp. 190\u2013194 (2008)","DOI":"10.1109\/WIIAT.2008.325"},{"key":"11_CR13","volume-title":"Reasoning and Revision in Hybrid Representation","author":"B. Nebel","year":"1989","unstructured":"Nebel, B.: Reasoning and Revision in Hybrid Representation. Springer, Heidelberg (1989)"},{"key":"11_CR14","unstructured":"Sinka, M.P., Corne, D.W.: A Large Benchmark Dataset for Web Document Clustering. In: Soft Computing Systems: Design, Management and Applications. Series of Frontiers in Artificial Intelligence and Applications, vol.\u00a087, pp. 881\u2013890 (2002)"},{"issue":"1","key":"11_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/IDA-2005-9105","volume":"9","author":"J. Besson","year":"2005","unstructured":"Besson, J., Robardet, C., Boulicaut, J.: Constraint-Based Concept Mining and Its Application to Microarray Data Analysis. Intelligent Data Analysis\u00a09(1), 59\u201382 (2005)","journal-title":"Intelligent Data Analysis"},{"key":"11_CR16","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"},{"issue":"1","key":"11_CR17","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":"11_CR18","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, 95\u2013111 (2007)","journal-title":"Journal of Global Optimization"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An Efficient Branch and Bound Algorithm for Finding a Maximum Clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/3-540-45749-6_44","volume-title":"Algorithms - ESA 2002","author":"T. Fahle","year":"2002","unstructured":"Fahle, T.: Simple and Fast: Improving a Branch-and-Bound Algorithm for Maximum Clique. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 485\u2013498. Springer, Heidelberg (2002)"},{"issue":"3","key":"11_CR21","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1108\/eb046814","volume":"14","author":"M.F. Porter","year":"1980","unstructured":"Porter, M.F.: An Algorithm for Suffix Stripping. Program\u00a014(3), 130\u2013137 (1980)","journal-title":"Program"},{"volume-title":"WordNet - An Electronic Lexical Database","year":"1998","key":"11_CR22","unstructured":"Fellbaum, C. (ed.): WordNet - An Electronic Lexical Database. MIT Press, Cambridge (1998)"},{"key":"11_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-69902-6_24","volume-title":"New Frontiers in Artificial Intelligence","author":"M. Haraguchi","year":"2007","unstructured":"Haraguchi, M., Okubo, Y.: An Extended Branch-and-Bound Search Algorithm for Finding Top-N Formal Concepts of Documents. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol.\u00a04384, pp. 276\u2013288. Springer, Heidelberg (2007)"},{"key":"11_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11605126_4","volume-title":"Federation over the Web","author":"M. Haraguchi","year":"2006","unstructured":"Haraguchi, M., Okubo, Y.: A Method for Pinpoint Clustering of Web Pages with Pseudo-Clique Search. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol.\u00a03847, pp. 59\u201378. Springer, Heidelberg (2006)"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Okubo, Y., Haraguchi, M.: Finding Conceptual Document Clusters with Improved Top-N Formal Concept Search. In: Proc. of the 2006 IEEE\/WIC\/ACM International Conference on Web Intelligence - WI 2006, pp. 347\u2013351 (2006)","DOI":"10.1109\/WI.2006.81"}],"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-11928-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:45:30Z","timestamp":1606167930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11928-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119279","9783642119286"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11928-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}