@inproceedings{conf/cla/BorchmannH16,
  author = {Borchmann, Daniel and Hanika, Tom},
  booktitle = {CLA},
  crossref = {conf/cla/2016},
  editor = {Huchard, Marianne and Kuznetsov, Sergei},
  ee = {http://ceur-ws.org/Vol-1624/paper5.pdf},
  interhash = {e8ddef8aeb9b874f97a1a8230332b7c4},
  intrahash = {8af414e45f306527e8316ac681fe7f08},
  pages = {57-69},
  publisher = {CEUR-WS.org},
  series = {CEUR Workshop Proceedings},
  title = {Some Experimental Results on Randomly Generating Formal Contexts.},
  url = {http://dblp.uni-trier.de/db/conf/cla/cla2016.html#BorchmannH16},
  volume = 1624,
  year = 2016
}

@inproceedings{stumme01conceptualclustering,
  address = {Universität Dortmund 763},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
  booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
  editor = {Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.},
  interhash = {c99f2ae002435208c58f9244d298a10b},
  intrahash = {f4ec21d5f63dbc213a3a6eae076c4b62},
  month = {October},
  title = {Conceptual Clustering with Iceberg Concept Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf},
  year = 2001
}

@article{pasquier1999efficient,
  abstract = {Discovering association rules is one of the most important task in data mining. Many efficient algorithms have been proposed in the literature. The most noticeable are Apriori, Mannila's algorithm, Partition, Sampling and DIC, that are all based on the Apriori mining method: pruning the subset lattice (itemset lattice). In this paper we propose an efficient algorithm, called Close, based on a new mining method: pruning the closed set lattice (closed itemset lattice). This lattice, which is a sub-order of the subset lattice, is closely related to Wille's concept lattice in formal concept analysis. Experiments comparing Close to an optimized version of Apriori showed that Close is very efficient for mining dense and/or correlated data such as census style data, and performs reasonably well for market basket style data. },
  author = {Pasquier, Nicolas and Bastide, Yves and Taouil, Rafik and Lakhal, Lotfi},
  doi = {http://dx.doi.org/10.1016/S0306-4379(99)00003-4},
  interhash = {14f55460561c18e8d47a1ffaad6bb738},
  intrahash = {dd4cac14856b487b0819ebe042301d56},
  issn = {0306-4379},
  journal = {Information Systems },
  number = 1,
  pages = {25 - 46},
  title = {Efficient mining of association rules using closed itemset lattices },
  url = {http://www.sciencedirect.com/science/article/pii/S0306437999000034},
  volume = 24,
  year = 1999
}

@presentation{petersen2008qualitative,
  author = {Petersen, Wiebke and Heinrich, Petja},
  howpublished = {presented at the 32th annual meeting of the Classification Society in Hamburg },
  interhash = {cb0721cb3aa84ba0898e3afc784559c8},
  intrahash = {cd5002cf2f214097cb7ff855b4af5db3},
  month = {07},
  title = {Qualitative Citation Analysis Based on Formal Concept Analysis},
  url = {http://user.phil-fak.uni-duesseldorf.de/~petersen/slides/Petersen_Heinrich_GFKL2008_slides.pdf},
  year = 2008
}

@article{duquenne1986famille,
  author = {Guigues, J. L. and Duquenne, Vincent},
  interhash = {ed5aac1ce34fbb024fe280628d3634fe},
  intrahash = {863a47ad7e52e4ec62c7445b10fad4f9},
  journal = {Math\'{e}matiques et Sciences Humaines},
  number = 95,
  pages = {5--18},
  title = {Famille minimale d'implications informatives r\'{e}\-sultant d'un
    tableau de donn\'{e}es binaires},
  volume = 24,
  year = 1986
}

@techreport{ganter1984basic,
  author = {Ganter, Bernhard},
  institution = {TH Darmstadt},
  interhash = {62fd13c2ddd3bc2b4efd48401685e995},
  intrahash = {cc066741de040b942172228ea254c52c},
  number = 831,
  title = {Two basic algorithms in concept analysis},
  type = {FB4-Preprint},
  year = 1984
}

@incollection{wray2011exploring,
  abstract = {Within the cultural informatics community, there is a strong desire to mine and understand relationships within and among collections of objects. In this paper we describe a case study of applied },
  author = {Wray, Tim and Eklund, Peter},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-642-20514-9_19},
  editor = {Valtchev, Petko and Jäschke, Robert},
  interhash = {63a1dd1d7e53a545b10ced96469aa2cf},
  intrahash = {8b0b6e80e3f9344120e24111e86efcb0},
  isbn = {978-3-642-20513-2},
  language = {English},
  pages = {251-266},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Exploring the Information Space of Cultural Collections Using Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/978-3-642-20514-9_19},
  volume = 6628,
  year = 2011
}

@incollection{gonzalezcalabozo2011expression,
  abstract = {DNA micro-arrays are a mechanism for eliciting gene expression values, the concentration of the transcription products of a set of genes, under different chemical conditions. The phenomena of interest—up-regulation, down-regulation and co-regulation—are hypothesized to stem from the functional relationships among transcription products.},
  author = {González Calabozo, JoséMaría and Peláez-Moreno, Carmen and Valverde-Albacete, FranciscoJosé},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-642-20514-9_11},
  editor = {Valtchev, Petko and Jäschke, Robert},
  interhash = {e7ab7a1eb367c8d8b9a12c5d65727217},
  intrahash = {9cbde0288d6e5ff5e6cf92796acef0a1},
  isbn = {978-3-642-20513-2},
  language = {English},
  pages = {119-134},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Gene Expression Array Exploration Using \mathcal{K}-Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/978-3-642-20514-9_11},
  volume = 6628,
  year = 2011
}

@incollection{tilley2005formal,
  abstract = {Formal Concept Analysis (FCA) has typically been applied in the field of software engineering to support software maintenance and object-oriented class identification tasks. This paper presents a broader overview by describing and classifying academic papers that report the application of FCA to software engineering. The papers are classified using a framework based on the activities defined in the ISO12207 Software Engineering standard. Two alternate classification schemes based on the programming language under analysis and target application size are also discussed. In addition, the authors work to support agile methods and formal specification via FCA is introduced.},
  acmid = {2137755},
  address = {Berlin, Heidelberg},
  author = {Tilley, Thomas and Cole, Richard and Becker, Peter and Eklund, Peter},
  chapter = {A Survey of Formal Concept Analysis Support for Software Engineering Activities},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {cc08f431729dfbf3d1c23cb0eb07201e},
  intrahash = {5343a1ed9ea7c5492afbcf198fae7caa},
  isbn = {3-540-27891-5, 978-3-540-27891-7},
  numpages = {22},
  pages = {250--271},
  publisher = {Springer-Verlag},
  title = {Formal Concept Analysis},
  url = {http://dl.acm.org/citation.cfm?id=2137739.2137755},
  year = 2005
}

@incollection{lakhal2005efficient,
  abstract = {Association rules are a popular knowledge discovery technique for warehouse basket analysis. They indicate which items of the warehouse are frequently bought together. The problem of association rule mining has first been stated in 1993. Five years later, several research groups discovered that this problem has a strong connection to },
  author = {Lakhal, Lotfi and Stumme, Gerd},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/11528784_10},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  interhash = {f5777a0f9dccfcf4f9968119d77297fc},
  intrahash = {fbb41ddbb0a52d1ecca438655e652f09},
  isbn = {978-3-540-27891-7},
  language = {English},
  pages = {180-195},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/11528784_10},
  volume = 3626,
  year = 2005
}

@incollection{ferre2007efficient,
  abstract = {Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of },
  author = {Ferré, Sébastien},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-540-70901-5_7},
  editor = {Kuznetsov, SergeiO. and Schmidt, Stefan},
  interhash = {133009b4ec80fb0de399a0ce54142599},
  intrahash = {ba4fe6826e3895f2aab04d0f8b59c880},
  isbn = {978-3-540-70828-5},
  language = {English},
  pages = {98-113},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees},
  url = {http://dx.doi.org/10.1007/978-3-540-70901-5_7},
  volume = 4390,
  year = 2007
}

@article{poelmans2013formal2,
  abstract = {Abstract This is the second part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 papers published between 2003 and 2011 mentioning terms related to Formal Concept Analysis in the title, abstract and keywords. We developed a knowledge browsing environment to support our literature analysis process. We use the visualization capabilities of \{FCA\} to explore the literature, to discover and conceptually represent the main research topics in the \{FCA\} community. In this second part, we zoom in on and give an extensive overview of the papers published between 2003 and 2011 which applied FCA-based methods for knowledge discovery and ontology engineering in various application domains. These domains include software mining, web analytics, medicine, biology and chemistry data. },
  author = {Poelmans, Jonas and Ignatov, Dmitry I. and Kuznetsov, Sergei O. and Dedene, Guido},
  doi = {http://dx.doi.org/10.1016/j.eswa.2013.05.009},
  interhash = {2a69c00103c8bde11fccfb70efcd16d0},
  intrahash = {fdfbf5941c34042ddcb5fbbb58bfe9c1},
  issn = {0957-4174},
  journal = {Expert Systems with Applications },
  number = 16,
  pages = {6538 - 6560},
  title = {Formal concept analysis in knowledge processing: A survey on applications },
  url = {http://www.sciencedirect.com/science/article/pii/S0957417413002959},
  volume = 40,
  year = 2013
}

@article{poelmans2013formal1,
  abstract = {Abstract This is the first part of a large survey paper in which we analyze recent literature on Formal Concept Analysis (FCA) and some closely related disciplines using FCA. We collected 1072 papers published between 2003 and 2011 mentioning terms related to Formal Concept Analysis in the title, abstract and keywords. We developed a knowledge browsing environment to support our literature analysis process. We use the visualization capabilities of \{FCA\} to explore the literature, to discover and conceptually represent the main research topics in the \{FCA\} community. In this first part, we zoom in on and give an extensive overview of the papers published between 2003 and 2011 on developing FCA-based methods for knowledge processing. We also give an overview of the literature on \{FCA\} extensions such as pattern structures, logical concept analysis, relational concept analysis, power context families, fuzzy FCA, rough FCA, temporal and triadic concept analysis and discuss scalability issues. },
  author = {Poelmans, Jonas and Kuznetsov, Sergei O. and Ignatov, Dmitry I. and Dedene, Guido},
  doi = {http://dx.doi.org/10.1016/j.eswa.2013.05.007},
  interhash = {7c70b9621e962c7688ee8ea2670af869},
  intrahash = {ba0e43c2318a5433d9a3d9a253dea6ca},
  issn = {0957-4174},
  journal = {Expert Systems with Applications },
  number = 16,
  pages = {6601 - 6623},
  title = {Formal Concept Analysis in knowledge processing: A survey on models and techniques },
  url = {http://www.sciencedirect.com/science/article/pii/S0957417413002935},
  volume = 40,
  year = 2013
}

@incollection{endres2012understanding,
  abstract = {We investigate whether semantic information related to object categories can be obtained from human },
  author = {Endres, Dominik and Adam, Ruth and Giese, MartinA. and Noppeney, Uta},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-642-29892-9_13},
  editor = {Domenach, Florent and Ignatov, DmitryI. and Poelmans, Jonas},
  interhash = {503c7d043e8417377991ad75db1e590e},
  intrahash = {13b038c3996f8a0e9abf02d9344c7170},
  isbn = {978-3-642-29891-2},
  language = {English},
  pages = {96-111},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Understanding the Semantic Structure of Human fMRI Brain Recordings with Formal Concept Analysis},
  url = {http://dx.doi.org/10.1007/978-3-642-29892-9_13},
  volume = 7278,
  year = 2012
}

@incollection{agrawal2014mining,
  abstract = {We propose a system for mining videos from the web for supplementing the content of electronic textbooks in order to enhance their utility. Textbooks are generally organized into sections such that each section explains very few concepts and every concept is primarily explained in one section. Building upon these principles from the education literature and drawing upon the theory of },
  author = {Agrawal, Rakesh and Christoforaki, Maria and Gollapudi, Sreenivas and Kannan, Anitha and Kenthapadi, Krishnaram and Swaminathan, Adith},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-319-07248-7_16},
  editor = {Glodeanu, CynthiaVera and Kaytoue, Mehdi and Sacarea, Christian},
  interhash = {fc34406f5a91a9561ba0e12b98830f28},
  intrahash = {76ac675e26647d14199da79c3467bc90},
  isbn = {978-3-319-07247-0},
  language = {English},
  pages = {219-234},
  publisher = {Springer International Publishing},
  series = {Lecture Notes in Computer Science},
  title = {Mining Videos from the Web for Electronic Textbooks},
  url = {http://dx.doi.org/10.1007/978-3-319-07248-7_16},
  volume = 8478,
  year = 2014
}

@incollection{ganter2010basic,
  abstract = {We describe two algorithms for closure systems. The purpose of the first is to produce all closed sets of a given closure operator. The second constructs a minimal family of implications for the ”logic” of a closure system. These algorithms then are applied to problems in concept analysis: Determining all concepts of a given context and describing the dependencies between attributes. The problem of finding all concepts is equivalent, e.g., to finding all maximal complete bipartite subgraphs of a bipartite graph.},
  author = {Ganter, Bernhard},
  booktitle = {Formal Concept Analysis},
  doi = {10.1007/978-3-642-11928-6_22},
  editor = {Kwuida, Léonard and Sertkaya, Barış},
  interhash = {f44d214d7176b9183d2bf29b8efbdc00},
  intrahash = {00d3cdaea05efaed9cb99c94f93ddacc},
  isbn = {978-3-642-11927-9},
  language = {English},
  pages = {312-340},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Two Basic Algorithms in Concept Analysis},
  url = {http://dx.doi.org/10.1007/978-3-642-11928-6_22},
  volume = 5986,
  year = 2010
}

@book{ganter1999formal,
  address = {Berlin; New York},
  author = {Ganter, Bernhard and Wille, Rudolf},
  interhash = {1b0bf49069eadcdfac42e52addf4eb9d},
  intrahash = {72729e14c41cfb00745c9a21f3265fed},
  isbn = {3540627715 9783540627715},
  publisher = {Springer},
  refid = {40163504},
  title = {Formal concept analysis : mathematical foundations},
  url = {http://www.amazon.de/Formal-Concept-Analysis-Mathematical-Foundations/dp/3540627715/ref=sr_1_1?ie=UTF8&qid=1417077494&sr=8-1&keywords=formal+concept+analysis+mathematical+foundations},
  year = 1999
}

@incollection{wille1982restructuring,
  abstract = {Lattice theory today reflects the general status of current mathematics: there is a rich production of theoretical concepts, results, and developments, many of which are reached by elaborate mental gymnastics; on the other hand, the connections of the theory to its surroundings are getting weaker and weaker, with the result that the theory and even many of its parts become more isolated. Restructuring lattice theory is an attempt to reinvigorate connections with our general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattice theory.},
  author = {Wille, Rudolf},
  booktitle = {Ordered Sets},
  doi = {10.1007/978-94-009-7798-3_15},
  editor = {Rival, Ivan},
  interhash = {1e021e8bace9683c92416cd882eb4c4d},
  intrahash = {9f2962c0b9b15ddd770ed8eba3935e72},
  isbn = {978-94-009-7800-3},
  language = {English},
  pages = {445-470},
  publisher = {Springer Netherlands},
  series = {NATO Advanced Study Institutes Series},
  title = {Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts},
  url = {http://dx.doi.org/10.1007/978-94-009-7798-3_15},
  volume = 83,
  year = 1982
}

@article{cimiano05learning,
  author = {Cimiano, Philipp and Hotho, Andreas and Staab, Steffen},
  ee = {http://www.jair.org/papers/paper1648.html},
  interhash = {4c09568cff62babd362aab03095f4589},
  intrahash = {eaaf0e4b3a8b29fab23b6c15ce2d308d},
  journal = {Journal on Artificial Intelligence Research},
  pages = {305-339},
  title = {Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis},
  url = {http://dblp.uni-trier.de/db/journals/jair/jair24.html#CimianoHS05},
  volume = 24,
  year = 2005
}

@incollection{noKey,
  abstract = {Formal Concept Analysis (FCA) is an unsupervised clustering technique and many scientific papers are devoted to applying FCA in Information Retrieval (IR) research. We collected 103 papers published between 2003-2009 which mention FCA and information retrieval in the abstract, title or keywords. Using a prototype of our FCA-based toolset CORDIET, we converted the pdf-files containing the papers to plain text, indexed them with Lucene using a thesaurus containing terms related to FCA research and then created the concept lattice shown in this paper. We visualized, analyzed and explored the literature with concept lattices and discovered multiple interesting research streams in IR of which we give an extensive overview. The core contributions of this paper are the innovative application of FCA to the text mining of scientific papers and the survey of the FCA-based IR research.},
  author = {Poelmans, Jonas and Ignatov, DmitryI. and Viaene, Stijn and Dedene, Guido and Kuznetsov, SergeiO.},
  booktitle = {Advances in Data Mining. Applications and Theoretical Aspects},
  doi = {10.1007/978-3-642-31488-9_22},
  editor = {Perner, Petra},
  interhash = {04d543b37049a90f2cbd796585bda214},
  intrahash = {f6eddba1f2c6b7cdbfa67a0c79ae5ae8},
  isbn = {978-3-642-31487-2},
  language = {English},
  pages = {273-287},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Text Mining Scientific Papers: A Survey on FCA-Based Information Retrieval Research},
  url = {http://dx.doi.org/10.1007/978-3-642-31488-9_22},
  volume = 7377,
  year = 2012
}