PUMA publications for /user/stephandoerfel/concepthttps://puma.uni-kassel.de/user/stephandoerfel/conceptPUMA RSS feed for /user/stephandoerfel/concept2024-03-29T10:31:01+01:00Publication Analysis of the Formal Concept Analysis Communityhttps://puma.uni-kassel.de/bibtex/20ac1296af204a499490bf61a48d03e48/stephandoerfelstephandoerfel2012-03-18T00:45:03+01:002012 analysis community concept fca home info20pub itegpub myown scientometrics <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Stephan Doerfel" itemprop="url" href="/author/Stephan%20Doerfel"><span itemprop="name">S. Doerfel</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Robert Jäschke" itemprop="url" href="/author/Robert%20J%c3%a4schke"><span itemprop="name">R. Jäschke</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gerd Stumme" itemprop="url" href="/author/Gerd%20Stumme"><span itemprop="name">G. Stumme</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">ICFCA 2012</span>, </em></span><em>Volume 7278 von Lecture Notes in Artificial Intelligence, </em><em>Seite <span itemprop="pagination">77--95</span>. </em><em>Berlin/Heidelberg, </em><em><span itemprop="publisher">Springer</span>, </em>(<em><span>2012<meta content="2012" itemprop="datePublished"/></span></em>)Sun Mar 18 00:45:03 CET 2012Berlin/HeidelbergICFCA 201277--95Lecture Notes in Artificial IntelligencePublication Analysis of the Formal Concept Analysis Community727820122012 analysis community concept fca home info20pub itegpub myown scientometrics 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.
Comparing performance of algorithms for generating concept latticeshttps://puma.uni-kassel.de/bibtex/2582910e7a14a80469b2cb328fa0d9884/stephandoerfelstephandoerfel2011-12-22T15:08:39+01:00algorithms comparing concept generating performance <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei O. Kuznetsov" itemprop="url" href="/author/Sergei%20O.%20Kuznetsov"><span itemprop="name">S. Kuznetsov</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sergei A. Obiedkov" itemprop="url" href="/author/Sergei%20A.%20Obiedkov"><span itemprop="name">S. Obiedkov</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Journal of Experimental & Theoretical Artificial Intelligence</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">14 </span></span>(<span itemprop="issueNumber">2-3</span>):
<span itemprop="pagination">189-216</span></em> </span>(<em><span>2002<meta content="2002" itemprop="datePublished"/></span></em>)Thu Dec 22 15:08:39 CET 2011Journal of Experimental & Theoretical Artificial Intelligence2-3189-216Comparing performance of algorithms for generating concept lattices142002algorithms comparing concept generating performance Taylor & Francis Online :: Comparing performance of algorithms for generating concept lattices - Journal of Experimental & Theoretical Artificial Intelligence - Volume 14, Issue 2-3Computing iceberg concept lattices with TITANIChttps://puma.uni-kassel.de/bibtex/2fc31933f0eec502e305b6aecb9ef6e8a/stephandoerfelstephandoerfel2011-01-19T15:17:53+01:00computing concept fca iceberg kdd titanic <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gerd Stumme" itemprop="url" href="/author/Gerd%20Stumme"><span itemprop="name">G. Stumme</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Data & Knowledge Engineering</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">42 </span></span>(<span itemprop="issueNumber">2</span>):
<span itemprop="pagination">189--222</span></em> </span>(<em><span>August 2002<meta content="August 2002" itemprop="datePublished"/></span></em>)Wed Jan 19 15:17:53 CET 2011Amsterdam, The Netherlands, The NetherlandsData & Knowledge Engineeringaug2189--222Computing iceberg concept lattices with TITANIC422002computing concept fca iceberg kdd titanic 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.Distributive laws for concept latticeshttps://puma.uni-kassel.de/bibtex/2dd7f97b10532feab21d486ebb6783939/stephandoerfelstephandoerfel2010-12-19T13:14:14+01:00complete concept distributive distributivity fba fca lattice math theory <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Marcel Erné" itemprop="url" href="/author/Marcel%20Ern%c3%a9"><span itemprop="name">M. Erné</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Algebra Universalis</em></span></span> </span>(<em><span>1993<meta content="1993" itemprop="datePublished"/></span></em>)Sun Dec 19 13:14:14 CET 2010Algebra Universalis538-580Distributive laws for concept lattices301993complete concept distributive distributivity fba fca lattice math theory We study several kinds of distributivity for concept lattices of contexts. In particular, we find necessary and sufficient conditions for a concept lattice to be(1)distributive,(2)a frame (locale, complete Heyting algebra),(3)isomorphic to a topology,(4)completely distributive,(5)superalgebraic (i.e., algebraic and completely distributive).SpringerLink - Algebra Universalis, Volume 30, Number 4Formal Concept Analysis: Mathematical Foundationshttps://puma.uni-kassel.de/bibtex/2ae14b00b5489de8da6e4578ac3062bfc/stephandoerfelstephandoerfel2010-12-17T13:46:00+01:00analysis cited concept da diplomarbeit fca formal lattice <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Bernhard Ganter" itemprop="url" href="/author/Bernhard%20Ganter"><span itemprop="name">B. Ganter</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rudolf Wille" itemprop="url" href="/author/Rudolf%20Wille"><span itemprop="name">R. Wille</span></a></span>. </span><em><span itemprop="publisher">Springer-Verlag</span>, </em><em>Berlin/Heidelberg, </em>(<em><span>1999<meta content="1999" itemprop="datePublished"/></span></em>)Fri Dec 17 13:46:00 CET 2010Berlin/HeidelbergFormal Concept Analysis: Mathematical Foundations1999analysis cited concept da diplomarbeit fca formal lattice