BibSonomyburst/tag/fcaBibSonomy RSS feed for /tag/fca2012-02-14T19:18:00+01:00http://www.bibsonomy.org/bibtex/29694689a034cc02aae1e27114ca26a94/jaeschkejaeschke2012-02-06T17:42:47+01:00analysis concept discovery fca formal kdd knowledge survey <span class="authorEditorList"><a href="/author/Poelmans">Jonas Poelmans</a>, <a href="/author/Elzinga">Paul Elzinga</a>, <a href="/author/Viaene">Stijn Viaene</a>, and <a href="/author/Dedene">Guido Dedene</a> </span><em>Conceptual Structures: From Information to Intelligence, </em><em>volume 6208 of Lecture Notes in Computer Science, </em><em>Springer, </em><em>Berlin/Heidelberg, </em>(<em>2010</em>)Mon Feb 06 17:42:47 CET 2012Berlin/HeidelbergConceptual Structures: From Information to Intelligence139--153Lecture Notes in Computer ScienceFormal Concept Analysis in Knowledge Discovery: A Survey62082010analysis concept discovery fca formal kdd knowledge survey In this paper, we analyze the literature on Formal Concept Analysis (FCA) using FCA. We collected 702 papers published between 2003-2009 mentioning Formal Concept Analysis in the abstract. We developed a knowledge browsing environment to support our literature analysis process. The pdf-files containing the papers were converted to plain text and indexed by Lucene using a thesaurus containing terms related to FCA research. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. As a case study, we zoom in on the 140 papers on using FCA in knowledge discovery and data mining and give an extensive overview of the contents of this literature.http://www.bibsonomy.org/bibtex/29694689a034cc02aae1e27114ca26a94/sdosdo2012-02-06T17:32:51+01:00analysis fca survey <span class="authorEditorList"><a href="/author/Poelmans">Jonas Poelmans</a>, <a href="/author/Elzinga">Paul Elzinga</a>, <a href="/author/Viaene">Stijn Viaene</a>, and <a href="/author/Dedene">Guido Dedene</a> </span><em>Conceptual Structures: From Information to Intelligence, </em><em>volume 6208 of Lecture Notes in Computer Science, </em><em>Springer, </em><em>Berlin / Heidelberg, </em>(<em>2010</em>)Mon Feb 06 17:32:51 CET 2012Berlin / HeidelbergConceptual Structures: From Information to Intelligence139-153Lecture Notes in Computer ScienceFormal Concept Analysis in Knowledge Discovery: A Survey62082010analysis fca survey In this paper, we analyze the literature on Formal Concept Analysis (FCA) using FCA. We collected 702 papers published between 2003-2009 mentioning Formal Concept Analysis in the abstract. We developed a knowledge browsing environment to support our literature analysis process. The pdf-files containing the papers were converted to plain text and indexed by Lucene using a thesaurus containing terms related to FCA research. We use the visualization capabilities of FCA to explore the literature, to discover and conceptually represent the main research topics in the FCA community. As a case study, we zoom in on the 140 papers on using FCA in knowledge discovery and data mining and give an extensive overview of the contents of this literature.Abstract - SpringerLinkhttp://www.bibsonomy.org/bibtex/223959c014b9b6d46c93f45cf68e52294/jaeschkejaeschke2012-02-02T14:43:39+01:00analysis concept fca formal triadic <span class="authorEditorList"><a href="/author/Wille">Rudolf Wille</a> </span><em>Order</em> <em>12(2):149--158</em> (<em>1995</em>)Thu Feb 02 14:43:39 CET 2012Order2149--158The Basic Theorem of triadic concept analysis121995analysis concept fca formal triadic Experiences with applications of concept lattices and the pragmatic philosophy founded by Ch. S. Peirce have suggested a triadic approach to formal concept analysis. It starts with the notion of a triadic context combining objects, attributes, and conditions under which objects may have certain attributes. The Basic Theorem of triadic concept analysis clarifies the class of structures which are formed by the triadic concepts of triadic contexts: These structures are exactly the complete trilattices up to isomorphism.http://www.bibsonomy.org/bibtex/245374b975834248c0cd87022fc854e25/jaeschkejaeschke2012-01-20T10:30:56+01:00analysis concept fca formal ontology rdf semantic web <span class="authorEditorList"><a href="/author/d&#039;Aquin">Mathieu d&#039;Aquin</a>, and <a href="/author/Motta">Enrico Motta</a> </span><em>Proceedings of the sixth international conference on Knowledge capture, </em><em>page 121--128. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2011</em>)Fri Jan 20 10:30:56 CET 2012New York, NY, USAProceedings of the sixth international conference on Knowledge capture121--128Extracting relevant questions to an RDF dataset using formal concept analysis2011analysis concept fca formal ontology rdf semantic web With the rise of linked data, more and more semantically described information is being published online according to the principles and technologies of the Semantic Web (especially, RDF and SPARQL). The use of such standard technologies means that this data should be exploitable, integrable and reusable straight away. However, once a potentially interesting dataset has been discovered, significant efforts are currently required in order to understand its schema, its content, the way to query it and what it can answer. In this paper, we propose a method and a tool to automatically discover questions that can be answered by an RDF dataset. We use formal concept analysis to build a hierarchy of meaningful sets of entities from a dataset. These sets of entities represent answers, which common characteristics represent the clauses of the corresponding questions. This hierarchy can then be used as a querying interface, proposing questions of varying levels of granularity and specificity to the user. A major issue is however that thousands of questions can be included in this hierarchy. Based on an empirical analysis and using metrics inspired both from formal concept analysis and from ontology summarization, we devise an approach for identifying relevant questions to act as a starting point to the navigation in the question hierarchy.http://www.bibsonomy.org/bibtex/21ab6ebc7e975a5b4019814bb7935f9bc/sdosdo2011-12-23T01:22:26+01:00algorithms basic closure fca next <span class="authorEditorList"><a href="/author/Ganter">Bernhard Ganter</a> </span><em>Formal Concept Analysis, </em><em>volume 5986 of Lecture Notes in Computer Science, </em><em>Springer, </em><em>Berlin / Heidelberg, </em>(<em>2010</em>)Fri Dec 23 01:22:26 CET 2011Berlin / HeidelbergFormal Concept Analysis312-340Lecture Notes in Computer ScienceTwo Basic Algorithms in Concept Analysis59862010algorithms basic closure fca next Abstract - SpringerLinkhttp://www.bibsonomy.org/bibtex/2df19796e33c1e2c861b613e3c8a86f58/sdosdo2011-12-23T01:05:17+01:00fca introduction lattice order <span class="authorEditorList"><a href="/author/Davey">Brian A. Davey</a>, and <a href="/author/Priestley">Hilary A. Priestley</a> </span><em>Cambridge University Press, </em><em>Cambridge, </em>(<em>1990</em>)Fri Dec 23 01:05:17 CET 2011CambridgeIntroduction to lattices and order1990fca introduction lattice order Introduction to Lattices and Order: B. A. Davey, H. A. Priestley: 9780521367660: Englische Bücherhttp://www.bibsonomy.org/bibtex/2cf66c378d2516971007ffa26e02d86f8/sdosdo2011-12-23T00:04:28+01:00erkundungssystem fca literatursuche toscana tutorial <span class="authorEditorList"><a href="/author/Rock">Tammo Rock</a>, and <a href="/author/Wille">Rudolf Wille</a> </span><em>FB4--Preprint, </em><em>TH Darmstadt, </em>(<em>1997</em>)Fri Dec 23 00:04:28 CET 2011Ein TOSCANA--Erkundungssystem zur LiteratursucheFB4--Preprint1997erkundungssystem fca literatursuche toscana tutorial FCA publications after 1995http://www.bibsonomy.org/bibtex/25544eac0fd55b4862dde20cad8edc11a/jaeschkejaeschke2011-12-20T13:31:35+01:00analysis citation fca <span class="authorEditorList"><a href="/author/Tilley">T. Tilley</a>, and <a href="/author/Eklund">P. Eklund</a> </span><em>18th International Workshop on Database and Expert Systems Applications DEXA, </em><em>page 545--550. </em><em>IEEE Computer Society, </em>(<em>September 2007</em>)Tue Dec 20 13:31:35 CET 201118th International Workshop on Database and Expert Systems Applications (DEXA)sep545--550Citation Analysis using Formal Concept Analysis: A case study in Software Engineering2007analysis citation fca In this paper formal concept analysis (FCA) is used as a means to analyse afield of research using published academic papers as its input. In particular, results are presented based on a case study of 47 academic papers in a scientific field of study. The analysis includes inferences about the field of study based on the domain background knowledge derived from the ISO12207 software engineering standard. Additionally, a number of alternative classifications based on the target application language and the reported application size are introduced. FCA reveals useful insights about the nature of the subject matter: identifying fruitful areas of research as well as producing details about characteristics of the community under examination.http://www.bibsonomy.org/bibtex/218ace92c8d892a1d0f0e0fb72bd71832/jaeschkejaeschke2011-12-01T11:53:14+01:00analysis concept fca formal overview <span class="authorEditorList"><a href="/author/Ganter">Bernhard Ganter</a>, <a href="/author/Stumme">Gerd Stumme</a>, and <a href="/author/Wille">Rudolf Wille</a> (Eds.). </span><em>Lecture Notes in Computer Science </em><em>Springer, </em><em>Berlin/Heidelberg, </em>(<em>2005</em>)Thu Dec 01 11:53:14 CET 2011Berlin/HeidelbergLecture Notes in Computer ScienceFormal Concept Analysis, Foundations and Applications36262005analysis concept fca formal overview http://www.bibsonomy.org/bibtex/21ac91a922a872523de0ce8d4984e53a3/hothohotho2011-11-16T16:51:09+01:00bibsonomy bookmarking dissertation fca recommender social tag tagging taggingsurvey <span class="authorEditorList"><a href="/author/Jäschke">Robert Jäschke</a> </span><em>Amsterdam, </em>(<em>2011</em>)Wed Nov 16 16:51:09 CET 2011[Amsterdam]--Formal concept analysis and tag recommendations in collaborative tagging systems2011bibsonomy bookmarking dissertation fca recommender social tag tagging taggingsurvey http://www.bibsonomy.org/bibtex/2ae14b00b5489de8da6e4578ac3062bfc/utahellutahell2011-10-07T13:52:20+02:00fca <span class="authorEditorList"><a href="/author/Ganter">Bernhard Ganter</a>, and <a href="/author/Wille">Rudolf Wille</a> </span><em>Springer, </em><em>Berlin/Heidelberg, </em>(<em>1999</em>)Fri Oct 07 13:52:20 CEST 2011Berlin/HeidelbergFormal Concept Analysis: Mathematical Foundations1999fca http://www.bibsonomy.org/bibtex/2302115fb0b48a9cc466e031cee986624/utahellutahell2011-09-28T15:27:08+02:00completion fca ontology <span class="authorEditorList"><a href="/author/Rudolph">Sebastian Rudolph</a> </span><em>PhD thesis, </em>(<em>Dezember 2006</em>)Wed Sep 28 15:27:08 CEST 2011DezemberRelational Exploration - Combining Description Logics and Formal Concept Analysis for Knowledge SpecificationPhD thesis2006completion fca ontology Institut AIFB - Book1380http://www.bibsonomy.org/bibtex/2ee7dd70387e57ddc47b5267ceff0deec/utahellutahell2011-09-16T14:23:42+02:00fca <span class="authorEditorList"><a href="/author/Sertkaya">Barıs Sertkaya</a> </span><em>Proceedings of the 6th European Semantic Web Conference, ESWC 2009, </em><em>volume 5554 of Lecture Notes in Computer Science, </em><em>page 898-902. </em><em>Springer Verlag, </em>(<em>2009</em>)Fri Sep 16 14:23:42 CEST 2011Proceedings of the 6th European Semantic Web Conference, {(ESWC 2009)}898-902Lecture Notes in Computer ScienceOntoComP: A Protege Plugin for Completing OWL Ontologies55542009fca Publicationshttp://www.bibsonomy.org/bibtex/25d99c6a6dcd4a402abea799e79018343/utahellutahell2011-09-14T18:40:45+02:00fca mining semweb <span class="authorEditorList"><a href="/author/Shi">Lian Shi</a>, <a href="/author/Toussaint">Yannick Toussaint</a>, <a href="/author/Napoli">Amedeo Napoli</a>, and <a href="/author/Blansché">Alexandre Blansché</a> </span><em>Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II, </em><em>page 421--435. </em><em>Berlin, Heidelberg, </em><em>Springer-Verlag, </em>(<em>2011</em>)Wed Sep 14 18:40:45 CEST 2011Berlin, HeidelbergProceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II421--435ESWC'11Mining for Reengineering: an Application to Semantic Wikis using Formal and Relational Concept Analysis2011fca mining semweb Mining for reengineeringhttp://www.bibsonomy.org/bibtex/205142ff7e147b19c9f1608d134b1714a/utahellutahell2011-09-04T18:46:31+02:00fca learning ontology <span class="authorEditorList"><a href="/author/Stumme">Gerd Stumme</a>, and <a href="/author/Maedche">Alexander Maedche</a> </span><em>Proceedings of the 17th International Joint Conference on Artificial Intelligence IJCAI&#039;01, </em><em>page 225--230. </em>(<em>2001</em>)Sun Sep 04 18:46:31 CEST 2011Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01)225--230FCA-MERGE: Bottom-Up Merging of Ontologies2001fca learning ontology CiteSeerX — FCA-MERGE: Bottom-Up Merging of Ontologieshttp://www.bibsonomy.org/bibtex/2069236af437f22faaf83171af499ce4a/utahellutahell2011-08-28T14:20:45+02:00fca ontology <span class="authorEditorList"><a href="/author/Baader">Franz Baader</a>, <a href="/author/Ganter">Bernhard Ganter</a>, <a href="/author/Sertkaya">Baris Sertkaya</a>, and <a href="/author/Sattler">Ulrike Sattler</a> </span><em>Proceedings of the 20th International Joint Conference on Artificial Intelligence IJCAI 2007, </em><em>page 230-235. </em><em>Hyderabad, India, </em>(<em>January 2007</em>)Sun Aug 28 14:20:45 CEST 2011Hyderabad, IndiaProceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007)conf/ijcai/2007January230-235Completing Description Logic Knowledge Bases Using Formal Concept Analysis.2007fca ontology dblphttp://www.bibsonomy.org/bibtex/2066d7bf97c8581ce0ea0597b15adb5e2/sacsac2011-07-19T12:37:35+02:00analysis concept fca links menu navigation web <span class="authorEditorList"><a href="/author/Zhang">Gq Zhang</a>, <a href="/author/Shen">Gongqin Shen</a>, <a href="/author/Staiger">Josh Staiger</a>, <a href="/author/Troy">Adam Troy</a>, and <a href="/author/Sun">Jiayang Sun</a> </span><em>Conceptual Structures at Work, Shaker Verlag, </em><em>page 141--145. </em>(<em>2004</em>)Tue Jul 19 12:37:35 CEST 2011Conceptual Structures at Work, Shaker Verlag141--145FcAWN: Concept Analysis as a Formal Method for Automated Web-Menu Design2004analysis concept fca links menu navigation web Abstract. Web-menu is one of the most important and widely used modalities in Human-Computer Interaction (HCI). The design and construction of navigation menus for websites, however, have traditionally been left to the intuition of a web developer. This paper proposes the use of a mathematical theory called Formal Concept Analysis (FCA) [5, 9, 14, 16, 17] to assist in the design and automatic generation of a navigation hierarchy for a set of web documents. We demonstrate how multi-layered menu models can be devised and automatically generated by an adaptation and application of the principle of FCA and its associated algorithms. Our approach, FcAWN (pronounced fawn) – Formal concepts Applied to Web Navigation – reveals a fundamental difference between existing web-menu layouts and the ones generated using FCA: many of today’s web-menu hierarchies are tree structures in which submenus do not overlap, while menu-hierarchies obtained using FCA are part of a lattice structure in which sub-menus are not required to be mutually exclusive. FcAWN is one of the few semi-automated web-menu design methods with which one can construct consistent and logical menu hierarchies for web navigation. 1FcAWN: Concept Analysis as a Formal Method for Automated Web-Menu Designhttp://www.bibsonomy.org/bibtex/2afd54a24a2eeca1a07f811bd89800d28/jaeschkejaeschke2011-03-15T17:00:57+01:002011 analysis concept cyprus fca formal icfca myown nicosia <span class="authorEditorList"><a href="/author/Valtchev">Petko Valtchev</a>, and <a href="/author/Jäschke">Robert Jäschke</a> (Eds.). </span><em>volume 6628 of Lecture Notes in Artificial Intelligence, </em><em>Berlin/Heidelberg, </em><em>Springer, </em>(<em>2011</em>)Tue Mar 15 17:00:57 CET 2011Berlin/HeidelbergLecture Notes in Artificial IntelligenceFormal Concept Analysis662820112011 analysis concept cyprus fca formal icfca myown nicosia 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. Proceedings of the 9th International Conference on Formal Concept Analysis, ICFCA 2011, Nicosia, Cyprus, May 2-6, 2011http://www.bibsonomy.org/bibtex/20c2b212b9ea3d822bf4729fd5fe6b6e1/dbenzdbenz2011-02-17T17:42:33+01:002007 analysis bibsonomy bookmarking fca folksonomy iccs l3s ol_web2.0 social trias widely_related emergentsemantics_evidence <span class="authorEditorList"><a href="/author/Jäschke">Robert Jäschke</a>, <a href="/author/Hotho">Andreas Hotho</a>, <a href="/author/Schmitz">Christoph Schmitz</a>, and <a href="/author/Stumme">Gerd Stumme</a> </span><em>Proceedings of the 15th International Conference on Conceptual Structures ICCS 2007, </em><em>volume 4604 of Lecture Notes in Artificial Intelligence, </em><em>page 283--295. </em><em>Berlin, Heidelberg, </em><em>Springer-Verlag, </em>(<em>July 2007</em>)Thu Feb 17 17:42:33 CET 2011Berlin, HeidelbergProceedings of the 15th International Conference on Conceptual Structures (ICCS 2007)July283--295Lecture Notes in Artificial IntelligenceAnalysis of the Publication Sharing Behaviour in {BibSonomy}460420072007 analysis bibsonomy bookmarking fca folksonomy iccs l3s ol_web2.0 social trias widely_related emergentsemantics_evidence BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.http://www.bibsonomy.org/bibtex/2e387c294129e11f4221514d5fa807e26/dbenzdbenz2011-02-17T17:42:33+01:0012 2006 algorithm fca iccs_example l3s ol_web2.0 trias trias_example methods_concepts <span class="authorEditorList"><a href="/author/Jäschke">Robert Jäschke</a>, <a href="/author/Hotho">Andreas Hotho</a>, <a href="/author/Schmitz">Christoph Schmitz</a>, <a href="/author/Ganter">Bernhard Ganter</a>, and <a href="/author/Stumme">Gerd Stumme</a> </span><em>Proceedings of the 6th IEEE International Conference on Data Mining ICDM 06, </em><em>page 907-911. </em><em>Hong Kong, </em><em>IEEE Computer Society, </em>(<em>December 2006</em>)Thu Feb 17 17:42:33 CET 2011Hong KongProceedings of the 6th IEEE International Conference on Data Mining (ICDM 06)December907-911TRIAS - An Algorithm for Mining Iceberg Tri-Lattices200612 2006 algorithm fca iccs_example l3s ol_web2.0 trias trias_example methods_concepts In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example.