{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:55Z","timestamp":1725487075290},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426127"},{"type":"electronic","value":"9783540454229"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45422-5_24","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:01:34Z","timestamp":1183546894000},"page":"335-350","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis"],"prefix":"10.1007","author":[{"given":"Gerd","family":"Stumme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafik","family":"Taouil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Bastide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Pasquier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. Proc. SIGMOD Conf., 1993, 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"24_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. Proc. VLDB Conf., 1994, 478\u2013499 (Expanded version in IBM Report RJ9839)"},{"key":"24_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/10722280_20","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"F. Baader","year":"2000","unstructured":"F. Baader, R. Molitor: Building and structuring Description Logic knowledge bases using least common subsumers and Concept Analysis. In: B. Ganter, G. W. Mineau (eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS 2000. LNAI 1867, Springer, Heidelberg 2000, 292\u2013305"},{"issue":"1","key":"24_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1008637019359","volume":"9","author":"E. Baralis","year":"1997","unstructured":"E. Baralis and G. Psaila. Designing templates for mining association rules. Journal of Intelligent Information Systems 9(1), 1997, 7\u201332","journal-title":"Journal of Intelligent Information Systems"},{"key":"24_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic-CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, L. Lakhal: Mining minimal nonredundant association rules using frequent closed itemsets. In: J. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, P. J. Stuckey (Eds.): Computational Logic-CL 2000. Proc. 1st Intl. Conf. on CL (6th Intl. Conf. on Database Systems). LNAI 1861, Springer, Heidelberg 2000, 972\u2013986"},{"issue":"2","key":"24_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, L. Lakhal: Mining Frequent Patterns with Counting Inference. SIGKDD Explorations 2(2), Special Issue on Scalable Algorithms, 2000, 66\u201375","journal-title":"SIGKDD Explorations"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. Proc. SIGMOD Conf., 1998, 85\u201393","DOI":"10.1145\/276305.276313"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo, R. Agrawal, D. Gunopulos. Constraint-based rule mining in large, dense databases. Proc. ICDE Conf., 1999, 188\u2013197","DOI":"10.1109\/ICDE.1999.754924"},{"key":"24_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-39967-4_27","volume-title":"Knowledge Engineering and Knowledge Management. Methods, Models, and Tools","author":"K. Becker","year":"2000","unstructured":"K. Becker, G. Stumme, R. Wille, U. Wille, M. Zickwolff: Conceptual Information Systems discussed through an IT-security tool. In: R. Dieng, O. Corby (Eds.): Knowledge Engineering and Knowledge Management. Methods, Models, and Tools. Proc. EKAW\u2019 00. LNAI 1937, Springer, Heidelberg 2000, 352\u2013365"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, C. Silverstein: Beyond market baskets: Generalizing association rules to correlation. Proc. SIGMOD Conf., 1997, 265\u2013276","DOI":"10.1145\/253262.253327"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J. D. Ullman, S. Tsur: Dynamic itemset counting and implication rules for market basket data. Proc. SIGMOD Conf., 1997, 255\u2013264","DOI":"10.1145\/253262.253325"},{"issue":"95","key":"24_CR12","first-page":"5","volume":"24","author":"V. Duquenne","year":"1986","unstructured":"V. Duquenne, J.-L. Guigues: Famille minimale d\u2019implication informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines 24(95), 1986, 5\u201318","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"volume-title":"Advances in knowledge discovery and data mining","year":"1996","key":"24_CR13","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (eds.): Advances in knowledge discovery and data mining. AAAI Press, Cambridge 1996"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"B. Ganter, K. Reuter: Finding all closed sets: A general approach. Order. Kluwer Academic Publishers, 1991, 283\u2013290","DOI":"10.1007\/BF00383449"},{"key":"24_CR15","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":"B. Ganter, R. Wille: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg 1999"},{"key":"24_CR16","volume-title":"Begriffliche Wissensverarbeitung: Methoden und Anwendungen","author":"A. Grosskopf","year":"2000","unstructured":"A. Grosskopf and G. Harras: Eine TOSCANA-Anwendung f\u00fcr Sprechaktverben des Deutschen. In: G. Stumme and R. Wille (eds.), Begriffliche Wissensverarbeitung: Methoden und Anwendungen. Springer, Berlin-Heidelberg-New York 2000."},{"key":"24_CR17","unstructured":"J. Han, Y. Fu: Discovery of multiple-level association rules from large databases. Proc. VLDB Conf., 1995, 420\u2013431 1995."},{"key":"24_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/10722280_29","volume-title":"Conceptual Structures: Logical, Linguistic, and Computational Issues","author":"J. Hereth","year":"2000","unstructured":"J. Hereth, G. Stumme, U. Wille, R. Wille: Conceptual Knowledge Discovery and Data Analysis. In: B. Ganter, G. W. Mineau (eds.): Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS 2000. LNAI 1867, Springer, Heidelberg 2000, 421\u2013437"},{"key":"24_CR19","series-title":"LNAI","volume-title":"A new algorithm for faster mining of generalized association rules","author":"J. Hipp","year":"1998","unstructured":"J. Hipp, A. Myka, R. Wirth, U. G\u00fcntzer: A new algorithm for faster mining of generalized association rules. LNAI 1510, Springer, Heidelberg 1998"},{"key":"24_CR20","unstructured":"U. Kaufmann: Begriffliche Analyse \u00fcber Flugereignisse-Implementierung eines Erkundungs-und Analysesystems mit TOSCANA. Diplomarbeit, FB4, TU Darmstadt 1996."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"M. Klemettinen, H. Mannila, P. Ronkainen, H. Toivonen, A. I. Verkamo: Finding interesting rules from large sets of discovered association rules. Proc. CIKM Conf., 1994, 401\u2013407","DOI":"10.1145\/191246.191314"},{"issue":"113","key":"24_CR22","first-page":"35","volume":"29","author":"M. Luxenburger","year":"1991","unstructured":"M. Luxenburger: Implications partielles dans un contexte. Math\u00e9matiques, Informatique et Sciences Humaines, 29(113), 1991, 35\u201355","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"key":"24_CR23","volume-title":"Implikationen, Abh\u00e4ngigkeiten und Galois Abbildungen","author":"M. Luxenburger","year":"1993","unstructured":"M. Luxenburger: Partial implications. Part I of Implikationen, Abh\u00e4ngigkeiten und Galois Abbildungen. PhD thesis, TU Darmstadt. Shaker, Aachen 1993"},{"key":"24_CR24","unstructured":"H. Mannila, H. Toivonen: Multiple uses of frequent sets and condensed representations (Extended abstract). Proc. KDD 1996, 189\u2013194"},{"key":"24_CR25","unstructured":"R. Meo, G. Psaila, S. Ceri: A new SQL-like operator for mining association rules. Proc. VLDB Conf., 1996, 122\u2013133"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"R. T. Ng, V. S. Lakshmanan, J. Han, A. Pang: Exploratory mining and pruning optimizations of constrained association rules. Proc. SIGMOD Conf., 1998, 13\u201324","DOI":"10.1145\/276305.276307"},{"key":"24_CR27","unstructured":"N. Pasquier: Data Mining: algorithmes d\u2019extraction et de r\u00e9duction des r\u00e9gles d\u2019association dans les bases de donn\u00e9es. PhD thesis. Universit\u00e9 Blaise Pascal, Clermont-Ferrand II, 2000"},{"key":"24_CR28","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal: Pruning closed itemset lattices for association rules. Proc. 14i\u00e9mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es (BDA\u201998), Hammamet, Tunisie, 177\u2013196"},{"key":"24_CR29","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal: Closed set based discovery of small covers for association rules. Proc. 15\u00e9mes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es, Bordeaux, France, 25-27 October 1999, 361\u2013381","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"24_CR30","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal: Discovering frequent closed itemsets for association rules. Proc. ICDT Conf., 1999, 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"24_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal: Efficient mining of association rules using closed itemset lattices. Journal of Information Systems, 24(1), 1999, 25\u201346","journal-title":"Journal of Information Systems"},{"key":"24_CR32","unstructured":"J. Pei, J. Han, R. Mao:CLOSET: An efficient algorithm for mining frequent closed itemsets. Proc. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery2000, 21\u201330"},{"key":"24_CR33","unstructured":"M. Roth-Hintz, M. Mieth, T. Wetter, S. Strahringer, B. Groh, R. Wille: Investgating SNOMED by Formal Concept Analysis. Preprint, FB4, TU Darmstadt 1997."},{"key":"24_CR34","unstructured":"R. Srikant, R. Agrawal: Mining generalized association rules. Proc. VLDB Conf., 1995, 407\u2013419"},{"key":"24_CR35","unstructured":"R. Srikant, Q. Vu, R. Agrawal: Mining association rules with item constraints. Proc. KDD Conf., 1997, 67\u201373"},{"key":"24_CR36","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/BFb0094849","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"G. Stumme","year":"1998","unstructured":"G. Stumme, R. Wille, U. Wille: Conceptual Knowledge Discovery in Databases Using Formal Concept Analysis Methods. In: J. M. \u017bytkow, M. Quafofou (eds.): Principles of Data Mining and Knowledge Discovery. Proc. 2nd European Symposium on PKDD\u201998, LNAI 1510, Springer, Heidelberg 1998, 450\u2013458"},{"key":"24_CR37","unstructured":"G. Stumme: Conceptual Knowledge Discoverywith Frequent Concept Lattices. FB4-Preprint 2043, TU Darmstadt 1999"},{"key":"24_CR38","unstructured":"G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, L. Lakhal: Fast Computation of Concept Lattices Using Data Mining Techniques. Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases, Berlin, 21 22. August 2000. CEUR-Workshop Proceeding. http:\/\/sunsite.informatik.rwthaachen. de\/Publications\/CEUR-WS\/"},{"key":"24_CR39","unstructured":"G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, L. Lakhal: Computing Iceberg Concept Lattices with Titanic. J. on Knowledge and Data Engineering. (submitted)"},{"key":"24_CR40","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/3-540-58950-3_374","volume-title":"TOSCANA-A graphical tool for analyzing and exploring data","author":"F. Vogt","year":"1995","unstructured":"F. Vogt, R. Wille: TOSCANA-A graphical tool for analyzing and exploring data. LNCS 894, Springer, Heidelberg 1995, 226\u2013233"},{"key":"24_CR41","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered sets","author":"R. Wille","year":"1982","unstructured":"R. Wille: Restructuring lattice theory: an approach based on hierarchies of concepts. In: I. Rival (ed.). Ordered sets. Reidel, Dordrecht-Boston 1982, 445\u2013470"},{"key":"24_CR42","first-page":"1","volume":"7","author":"M. J. Zaki","year":"1998","unstructured":"M. J. Zaki, M. Ogihara: Theoretical Foundations of Association Rules, 3rd SIGMOD\u2019 98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), Seattle, WA, June 1998, 7:1\u20137:8","journal-title":"3rd SIGMOD\u2019 98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD)"},{"key":"24_CR43","unstructured":"M. J. Zaki, C.-J. Hsiao: ChARM: An efficient algorithm for closed association rule mining. Technical Report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, October 1999"},{"key":"24_CR44","doi-asserted-by":"crossref","unstructured":"M. J. Zaki: Generating non-redundant association rules. Proc. KDD 2000. 34\u201343","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","KI 2001: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45422-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T17:14:59Z","timestamp":1683911699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45422-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426127","9783540454229"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/3-540-45422-5_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"3 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}