@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 } @inproceedings{doerfel2012publication, abstract = {We present an analysis of the publication and citation networks of all previous editions of the three conferences most relevant to the FCA community: ICFCA, ICCS and CLA. Using data mining methods from FCA and graph analysis, we investigate patterns and communities among authors, we identify and visualize influential publications and authors, and we give a statistical summary of the conferences’ history. }, address = {Berlin/Heidelberg}, author = {Doerfel, Stephan and Jäschke, Robert and Stumme, Gerd}, booktitle = {ICFCA 2012}, editor = {Domenach, F. and Ignatov, D.I. and Poelmans, J.}, interhash = {f34f31e8dd1e07b1b0a5ab688f10084a}, intrahash = {0ac1296af204a499490bf61a48d03e48}, pages = {77--95}, publisher = {Springer}, series = {Lecture Notes in Artificial Intelligence}, title = {Publication Analysis of the Formal Concept Analysis Community}, url = {https://www.kde.cs.uni-kassel.de/pub/pdf/doerfel2012publication.pdf}, volume = 7278, year = 2012 } @incollection{cimiano2004conceptual, address = {Berlin/Heidelberg}, author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien}, booktitle = {Concept Lattices}, editor = {Eklund, Peter}, interhash = {e42d9895b0d816f231227f1be15b03dc}, intrahash = {9676ee1ded2b73fa90253a2a5dccdbf8}, isbn = {978-3-540-21043-6}, pages = {189--207}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies}, url = {http://dx.doi.org/10.1007/978-3-540-24651-0_18}, volume = 2961, year = 2004 } @article{stumme2002computing, abstract = {We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.}, address = {Amsterdam, The Netherlands, The Netherlands}, author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi}, doi = {10.1016/S0169-023X(02)00057-5}, interhash = {d500ac8a249ca8bf0fb05f382799d48f}, intrahash = {fc31933f0eec502e305b6aecb9ef6e8a}, issn = {0169-023X}, journal = {Data \& Knowledge Engineering}, number = 2, pages = {189--222}, publisher = {Elsevier Science Publishers B. V.}, title = {Computing iceberg concept lattices with TITANIC}, url = {http://portal.acm.org/citation.cfm?id=606457}, volume = 42, year = 2002 } @inproceedings{jaschke2013attribute, abstract = {We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.}, author = {Jäschke, Robert and Rudolph, Sebastian}, booktitle = {Contributions to the 11th International Conference on Formal Concept Analysis}, editor = {Cellier, Peggy and Distel, Felix and Ganter, Bernhard}, interhash = {000ab7b0ae3ecd1d7d6ceb39de5c11d4}, intrahash = {45e900e280661d775d8da949baee3747}, month = may, organization = {Technische Universität Dresden}, pages = {19--34}, title = {Attribute Exploration on the Web}, url = {http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-113133}, urn = {urn:nbn:de:bsz:14-qucosa-113133}, year = 2013 }