@incollection{ganter2007relational, abstract = {Galois connections can be defined for lattices and for ordered sets. We discuss a rather wide generalisation, which was introduced by Weiqun Xia and has been reinvented under different names: Relational Galois connections between relations. It turns out that the generalised notion is of importance for the original one and can be utilised, e.g., for computing Galois connections.}, author = {Ganter, Bernhard}, booktitle = {Formal Concept Analysis}, doi = {10.1007/978-3-540-70901-5_1}, editor = {Kuznetsov, Sergei O. and Schmidt, Stefan}, interhash = {03a1b0464331a319f3ef868bc280aa67}, intrahash = {5d4d028f5cc93398e2acb5d3cb939bfc}, isbn = {978-3-540-70828-5}, language = {English}, pages = {1-17}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, title = {Relational Galois Connections}, url = {http://dx.doi.org/10.1007/978-3-540-70901-5_1}, volume = 4390, year = 2007 } @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 } @proceedings{onformalconceptanalysis2012formal, address = {Berlin; New York}, author = {on Formal Concept Analysis, International Conference and Domenach, Florent and Ignatov, Dmitry I. and Poelmans, Jonas}, interhash = {1be060bc57048d4eb5c62246ae56c00d}, intrahash = {1165c61ea9c11811918c29fb06ba514a}, isbn = {9783642298929 3642298923}, publisher = {Springer}, refid = {798572178}, title = {Formal concept analysis 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings}, url = {http://dx.doi.org/10.1007/978-3-642-29892-9}, 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 = {Formal Concept Analysis}, doi = {10.1007/978-3-642-29892-9_12}, editor = {Domenach, F. and Ignatov, D.I. and Poelmans, J.}, interhash = {f34f31e8dd1e07b1b0a5ab688f10084a}, intrahash = {9207cd4b1cf7d87c9ae959ac780e152c}, isbn = {978-3-642-29891-2}, month = may, pages = {77--95}, publisher = {Springer}, series = {Lecture Notes in Artificial Intelligence}, title = {Publication Analysis of the Formal Concept Analysis Community}, url = {http://link.springer.com/chapter/10.1007/978-3-642-29892-9_12}, volume = 7278, year = 2012 } @article{prediger1998kontextuelle, abstract = {Zugl.: Darmstadt, Techn. Universiẗat, Diss., 1998.}, author = {Prediger, Susanne.}, institution = {OCLC's Experimental Thesis Catalog [http://alcme.oclc.org/xtcat/servlet/OAIHandler] (United States)}, interhash = {1f369f1feb78e0a337b3efc0fc0822fd}, intrahash = {aa951cb7dc759d2353b7925ac0c497fe}, location = {http://www.scientificcommons.org/30801175}, publisher = {Aachen : Shaker,}, title = {Kontextuelle Urteilslogik mit Begriffsgraphen : ein Beitrag zur Restrukturierung der mathematischen Logik /}, url = {http://worldcat.org/oclc/75902761}, year = 1998 } @book{carpineto2004concept, address = {Chichester, England; Hoboken, NJ}, author = {Carpineto, Claudio and Romano, Giovanni}, interhash = {a500f448e7826fe97f0ec54e205c0636}, intrahash = {6adef3d056294240001c83fa88df1eca}, isbn = {0470850558}, publisher = {John Wiley \& Sons}, title = {Concept Data Analysis: Theory and Applications}, year = 2004 } @proceedings{valtchev2011formal, abstract = {The present volume features a selection of the papers presented at the 9th International Conference on Formal Concept Analysis (ICFCA 2011). Over the years, the ICFCA conference series has grown into the premier forum for dissemination of research on topics from formal concept analysis (FCA) theory and applications, as well as from the related fields of lattices and partially ordered structures. FCA is a multi-disciplinary field with strong roots in the mathematical theory of partial orders and lattices, with tools originating in computer science and artificial intelligence. FCA emerged in the early 1980s from efforts to restructure lattice theory to promote better communication between lattice theorists and potential users of lattice-based methods for data management. Initially, the central theme was the mathematical formalization of concept and conceptual hierarchy. Since then, the field has developed into a constantly growing research area in its own right with a thriving theoretical community and an increasing number of applications in data and knowledge processing including disciplines such as data visualization, information retrieval, machine learning, software engineering, data analysis, data mining, social networks analysis, etc. ICFCA 2011 was held from May 2 to May 6, 2011, in Nicosia, Cyprus. The program committee received 49 high-quality submissions that were subjected to a highly competitive selection process. Each paper was reviewed by three referees (exceptionally two or four). After a first round, some papers got a definitive acceptance status, while others got accepted conditionally to improvements in their content. The latter got to a second round of reviewing. The overall outcome was the acceptance of 16 papers as regular ones for presentation at the conference and publication in this volume. Another seven papers have still been assessed as valuable for discussion at the conference and were therefore collected in the supplementary proceedings. The regular papers presented hereafter cover advances on a wide range of subjects from FCA and related fields. A first group of papers tackled mathematical problems within the FCA field. A subset thereof focused on factor identification within the incidence relation or its lattice representation (papers by Glodeanu and by Krupka). The remainder of the group proposed characterizations of particular classes of ordered structures (papers by Doerfel and by Meschke et al.). A second group of papers addressed algorithmic problems from FCA and related fields. Two papers approached their problems from an algorithmic complexity viewpoint (papers by Distel and by Babin and Kuznetsov) while the final paper in this group addressed algorithmic problems for general lattices, i.e., not represented as formal contexts, with an FCA-based approach (work by Balcázar and Tîrnăucă). A third group studied alternative approaches for extending the expressive power of the core FCA, e.g., by generalizing the standard one-valued attributes to attributes valued in algebraic rings (work by González Calabozo et al.), by introducing pointer-like attributes, a.k.a. links (paper by Kötters), or by substituting set-shaped concept intents with modal logic expressions (paper by Soldano and Ventos). A fourth group focused on data mining-oriented aspects of FCA: agreement lattices in structured data mining (paper by Nedjar et al.), triadic association rule mining (work by Missaoui and Kwuida) and bi-clustering of numerical data (Kaytoue et al.). An addional paper shed some initial light on a key aspect of FCA-based data analysis and mining, i.e., the filtering of interesting concepts (paper by Belohlavek and Macko). Finally, a set of exciting applications of both basic and enhanced FCA frameworks to practical problems have beed described: in analysis of gene expression data (the already mentioned work by González Calabozo et al.), in web services composition (paper by Azmeh et al.) and in browsing and retrieval of structured data (work by Wray and Eklund). This volume also contains three keynote papers submitted by the invited speakers of the conference. All these contributions constitute a volume of high quality which is the result of the hard work done by the authors, the invited speakers and the reviewers. We therefore wish to thank the members of the Program Committee and of the Editorial Board whose steady involvement and professionalism helped a lot. We would also like to acknowledge the participation of all the external reviewers who sent many valuable comments. Kudos also go to EasyChair for having made the reviewing/editing process a real pleasure. Special thanks go to the Cyprus Tourism Organisation for sponsoring the conference and to the University of Nicosia for hosting it. Finally we wish to thank the Conference Chair Florent Domenach and his colleagues from the Organization Committee for the mountains of energy they put behind the conference organization process right from the beginning in order to make it a total success. We would also like to express our gratitude towards Dr. Peristianis, President of the University of Nicosia, for his personal support. }, address = {Berlin/Heidelberg}, doi = {10.1007/978-3-642-20514-9_2}, editor = {Valtchev, Petko and Jäschke, Robert}, interhash = {a7fd7ebbb14eacc605ff61cf2759cb06}, intrahash = {afd54a24a2eeca1a07f811bd89800d28}, isbn = {978-3-642-20513-2}, month = may, publisher = {Springer}, series = {Lecture Notes in Artificial Intelligence}, title = {Formal Concept Analysis}, url = {http://www.springer.com/computer/ai/book/978-3-642-20513-2}, vgwort = {452}, volume = 6628, year = 2011 } @article{springerlink:10.1007/s11238-008-9109-z, abstract = {In this paper, we study a model of influence in a social network. It is assumed that each player has an inclination to say YES or NO which, due to influence of other players, may be different from the decision of the player. The point of departure here is the concept of the Hoede–Bakker index—the notion which computes the overall decisional ‘power’ of a player in a social network. The main drawback of the Hoede–Bakker index is that it hides the actual role of the influence function, analyzing only the final decision in terms of success and failure. In this paper, we separate the influence part from the group decision part, and focus on the description and analysis of the influence part. We propose among other descriptive tools a definition of a (weighted) influence index of a coalition upon an individual. Moreover, we consider different influence functions representative of commonly encountered situations. Finally, we propose a suitable definition of a modified decisional power.}, affiliation = {Université Paris I Panthéon-Sorbonne Centre d’Economie de la Sorbonne 106-112 Bd de l’Hôpital 75013 Paris France}, author = {Grabisch, Michel and Rusinowska, Agnieszka}, doi = {10.1007/s11238-008-9109-z}, interhash = {e905db2be4b4d2e792719e9b8f445951}, intrahash = {37444465dc4376fd111296cc8c9ba1de}, issn = {0040-5833}, issue = {1}, journal = {Theory and Decision}, keyword = {Business and Economics}, pages = {69-96}, publisher = {Springer Netherlands}, title = {A model of influence in a social network}, url = {http://dx.doi.org/10.1007/s11238-008-9109-z}, volume = 69, year = 2010 }