{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T20:37:33Z","timestamp":1780519053199,"version":"3.54.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,8,1]],"date-time":"2002-08-01T00:00:00Z","timestamp":1028160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2002,8]]},"DOI":"10.1016\/s0169-023x(02)00057-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"189-222","source":"Crossref","is-referenced-by-count":303,"title":["Computing iceberg concept lattices with Titanic"],"prefix":"10.1016","volume":"42","author":[{"given":"Gerd","family":"Stumme","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafik","family":"Taouil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yves","family":"Bastide","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Pasquier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lotfi","family":"Lakhal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(02)00057-5_BIB1","series-title":"Proceedings of SIGMOD Conference","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB2","series-title":"Proceedings of VLDB Conference","first-page":"478","article-title":"Fast algorithms for mining association rules","author":"Agrawal","year":"1994"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB3","unstructured":"A. Arnauld, P. Nicole, La logique ou l'art de penser\u2013\u2013contenant, outre les r\u00e8gles communes plusieurs, observations nouvelles, propres\u00e0 former le jugement, Ch Saveux, Paris, 1668"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB4","series-title":"Proceedings of the 1st International Conference on CL (6th International Conference on Database Systems)","first-page":"972","article-title":"Mining minimal non-redundant association rules using frequent closed itemsets","volume":"LNAI 1861","author":"Bastide","year":"2000"},{"issue":"2","key":"10.1016\/S0169-023X(02)00057-5_BIB5","first-page":"71","article-title":"Mining frequent patterns with counting inference","volume":"2","author":"Bastide","year":"2000","journal-title":"SIGKDD Explorations, Special Issue on Scalable Algorithms"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB6","series-title":"Proceedings of SIGMOD'98","first-page":"85","article-title":"Efficiently mining long patterns from databases","author":"Bayardo","year":"1998"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB7","series-title":"Proceedings of EKAW'00","first-page":"352","article-title":"Conceptual information systems discussed through an IT-security tool","volume":"LNAI 1937","author":"Becker","year":"2000"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB8","series-title":"Proceedings ICML","first-page":"33","article-title":"GALOIS: an order-theoretic approach to conceptual clustering","author":"Carpineto","year":"1993"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB9","series-title":"Proceedings ICCS'00","first-page":"438","article-title":"CEM: a conceptual e-mail manager","volume":"LNAI 1867","author":"Cole","year":"2000"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/236337.236364","article-title":"On automatic class insertion with overloading","author":"Dicky","year":"1996","journal-title":"OOPSLA"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB11","series-title":"Order","first-page":"283","article-title":"Finding all closed sets: A general approach","author":"Ganter","year":"1991"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB12","series-title":"Formal Concept Analysis: Mathematical Foundations","author":"Ganter","year":"1999"},{"issue":"2","key":"10.1016\/S0169-023X(02)00057-5_BIB13","first-page":"117","article-title":"Design of class hierarchies based on concept Galois lattices","volume":"4","author":"Godin","year":"1998","journal-title":"TAPOS"},{"issue":"2","key":"10.1016\/S0169-023X(02)00057-5_BIB14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0304-3975(94)90195-3","article-title":"An incremental concept formation approach for learning from databases","volume":"133","author":"Godin","year":"1994","journal-title":"TCS"},{"issue":"2\/3","key":"10.1016\/S0169-023X(02)00057-5_BIB15","first-page":"293","article-title":"Towards principles for the design of ontologies used for knowledge sharing","volume":"46","author":"Gruber","year":"1997","journal-title":"International Journal of Human and Computer Studies"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB16","series-title":"Proceedings ICCS2000","first-page":"421","article-title":"Conceptual knowledge discovery and data analysis","volume":"LNAI 1867","author":"Hereth","year":"2000"},{"issue":"2","key":"10.1016\/S0169-023X(02)00057-5_BIB17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","article-title":"TANE: an efficient algorithm for discovering functional and approximate dependencies","volume":"42","author":"Huhtala","year":"1999","journal-title":"The Computer Journal"},{"issue":"1","key":"10.1016\/S0169-023X(02)00057-5_BIB18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","article-title":"Approximate inference of functional dependencies from relations","volume":"149","author":"Kivinen","year":"1995","journal-title":"TCS"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB19","series-title":"Proceedings 16th International Conference on Software Engineering","first-page":"49","article-title":"On the inference of configuration structures from source code","author":"Krone","year":"1994"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB20","doi-asserted-by":"crossref","unstructured":"Ch. Lindig, Concepts, ftp:\/\/ftp.ips.cs.tu-bs.de\/pub\/local\/softech\/misc\/concepts-0.3d.tar.gz, 1997 (Open Source implementation of concept analysis in C)","DOI":"10.1145\/253228.253354"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB21","first-page":"350","article-title":"Efficient discovery of functional dependencies and Amstrong relations","volume":"LNCS 1777","author":"Lopes","year":"2000"},{"issue":"113","key":"10.1016\/S0169-023X(02)00057-5_BIB22","first-page":"35","article-title":"Implications partielles dans un contexte","volume":"29","author":"Luxenburger","year":"1991","journal-title":"Math\u00e9matiques, Informatique et Sciences Humaines"},{"issue":"33","key":"10.1016\/S0169-023X(02)00057-5_BIB23","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1004305723553","article-title":"Qualitative text analysis supported by conceptual data systems","volume":"2","author":"Mackensen","year":"1999","journal-title":"Quality and Quantity: International Journal of Methodology"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB24","series-title":"Proceedings EKAW'00","first-page":"189","article-title":"Mining ontologies from text","volume":"LNAI 1937","author":"M\u00e4dche","year":"2000"},{"issue":"3","key":"10.1016\/S0169-023X(02)00057-5_BIB25","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","article-title":"Levelwise search and borders of theories in knowledge discovery","volume":"1","author":"Mannila","year":"1997","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"10.1016\/S0169-023X(02)00057-5_BIB26","first-page":"219","article-title":"Knowledge acquisition through conceptual clustering: a theoretical framework and an algorithm for partitioning data into conjunctive concepts","volume":"4","author":"Michalski","year":"1980","journal-title":"Policy Analysis and Information Systems"},{"issue":"5","key":"10.1016\/S0169-023X(02)00057-5_BIB27","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/69.469834","article-title":"Automatic structuring of knowledge bases by conceptual clustering","volume":"7","author":"Mineau","year":"1995","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB28","first-page":"64","article-title":"An algorithm for insertion into a lattice: application to type classification","volume":"LNCS 367","author":"Missikoff","year":"1989"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB29","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","article-title":"A fast algorithm for building lattices","volume":"71","author":"Nourine","year":"1999","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB30","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, L. Lakhal, Pruning closed itemset lattices for association rules, 14\u00e8mes Journes Bases de Donnes Avances (BDA'98), Hammamet, Tunisia, 26\u201330 October, 1998"},{"issue":"1","key":"10.1016\/S0169-023X(02)00057-5_BIB31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","article-title":"Efficient mining of association rules using closed itemset lattices","volume":"24","author":"Pasquier","year":"1999","journal-title":"Journal of Information Systems"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB32","first-page":"398","article-title":"Discovering frequent closed itemsets for association rules","volume":"LNCS 1540","author":"Pasquier","year":"1999"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB33","unstructured":"J. Pei, J. Han, R. Mao, CLOSET: An efficient algorithm for mining frequent closed itemsets, in: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, pp. 21\u201330"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB34","series-title":"Information and Classification","first-page":"72","article-title":"Conceptual data systems","author":"Scheich","year":"1993"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB35","doi-asserted-by":"crossref","unstructured":"I. Schmitt, G. Saake, Merging inheritance hierarchies for database integration, in: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems, New York City, New York, USA, 20\u201322 August, 1998, pp. 122\u2013131","DOI":"10.1109\/COOPIS.1998.706276"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB36","doi-asserted-by":"crossref","unstructured":"G. Snelting, F. Tip, Reengineering class hierarchies using concept analysis, in: Proceedings ACM SIGSOFT Symposium on the Foundations of Software Engineering, November 1998, pp. 99\u2013110","DOI":"10.1145\/288195.288273"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB37","series-title":"Information and Classification","first-page":"85","article-title":"Conceptual clustering via convex-ordinal structures","author":"Strahringer","year":"1993"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB38","unstructured":"G. Stumme, A. Mdche, FCA Merge: bottom-up merging of ontologies, in: Proceedings 17th International Conference on Artificial Intelligence (IJCAI'01), Seattle, WA, USA, 2001, pp. 225\u2013230"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB39","unstructured":"G. Stumme, R. Taouil, Y. Bastide, L. Lakhal, Conceptual clustering with iceberg concept lattices, in: Proceedings of GI\u2013Fachgruppentreffen Maschinelles Lernen'01, Universit\u00e4t Dortmund, vol. 763, Oktober 2001"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB40","doi-asserted-by":"crossref","unstructured":"G. Stumme, R. Taouil, Y. Bastide, N. Pasquier, L. Lakhal, Fast computation of concept lattices using data mining techniques, in: Proceedings 7th International Workshop on Knowledge Representation Meets Databases, Berlin, 21\u201322 August 2000, CEUR-Workshop Proceeding. http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/","DOI":"10.1145\/380995.381017"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB41","series-title":"Proceedings KI 2001 LNAI 2174","first-page":"335","article-title":"Intelligent structuring and reducing of association rules with formal concept analysis","author":"Stumme","year":"2001"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB42","series-title":"Proceedings 2nd European Symposium on PKDD'98","first-page":"450","article-title":"Conceptual knowledge discovery in databases using formal concept analysis methods","volume":"LNAI 1510","author":"Stumme","year":"1998"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB43","series-title":"Begriffliche Wissensverarbeitung\u2013\u2013Methoden und Anwendungen","year":"2000"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB44","series-title":"TOSCANA\u2013\u2013A graphical tool for analyzing and exploring data, LNCS 894","author":"Vogt","year":"1995"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB45","series-title":"Proceedings 16th International Conference on Conceptual Modeling, LNCS 1331","first-page":"299","article-title":"Towards an object database approach for managing concept lattices","author":"Waiyamai","year":"1997"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB46","series-title":"Ordered Sets","first-page":"445","article-title":"Restructuring lattice theory: an approach based on hierarchies of concepts","author":"Wille","year":"1982"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB47","first-page":"77","article-title":"Line diagrams of hierarchical concept systems","volume":"11","author":"Wille","year":"1984","journal-title":"Int. Classif."},{"key":"10.1016\/S0169-023X(02)00057-5_BIB48","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0898-1221(92)90120-7","article-title":"Concept lattices and conceptual knowledge systems","volume":"23","author":"Wille","year":"1992","journal-title":"Computers and Mathematics with Applications"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB49","first-page":"517","article-title":"Maschinelles lernen und data mining","volume":"vol. 3","author":"Wrobel","year":"2000"},{"key":"10.1016\/S0169-023X(02)00057-5_BIB50","series-title":"Proceedings 15th International Conference on Conceptual Modeling, LNCS 1157","first-page":"422","article-title":"iO2: An algorithmic method for building inheritance graphs in object database design","author":"Yahia","year":"1996"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X02000575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X02000575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:39:23Z","timestamp":1578451163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X02000575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0169023X02000575"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(02)00057-5","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}