Two Basic Algorithms in Concept Analysis
B. Ganter.
Formal Concept Analysis, Volume 5986 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2010)

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.

URL

http://dx.doi.org/10.1007/978-3-642-11928-6_22

Suchen auf

Diese Publikation wurde noch nicht bewertet.

Bewertungsverteilung

Durchschnittliche Benutzerbewertung0,0 von 5.0 auf Grundlage von 0 Rezensionen

Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.

@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.},
  added-at = {2014-11-27T11:59:29.000+0100},
  author = {Ganter, Bernhard},
  biburl = {https://puma.uni-kassel.de/bibtex/200d3cdaea05efaed9cb99c94f93ddacc/stephandoerfel},
  booktitle = {Formal Concept Analysis},
  description = {Two Basic Algorithms in Concept Analysis - Springer},
  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},
  keywords = {algorithm fca nextClosure},
  language = {English},
  pages = {312-340},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  timestamp = {2014-11-27T11:59:29.000+0100},
  title = {Two Basic Algorithms in Concept Analysis},
  url = {http://dx.doi.org/10.1007/978-3-642-11928-6_22},
  volume = 5986,
  year = 2010
}

%0 Book Section
%1 ganter2010basic
%A Ganter, Bernhard
%B Formal Concept Analysis
%D 2010
%E Kwuida, Léonard
%E Sertkaya, Barış
%I Springer Berlin Heidelberg
%K algorithm fca nextClosure
%P 312-340
%R 10.1007/978-3-642-11928-6_22
%T Two Basic Algorithms in Concept Analysis
%U http://dx.doi.org/10.1007/978-3-642-11928-6_22
%V 5986
%X 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.
%@ 978-3-642-11927-9

PUMA

Two Basic Algorithms in Concept Analysis
B. Ganter.
Formal Concept Analysis, Volume 5986 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2010)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

PUMA

Two Basic Algorithms in Concept AnalysisB. Ganter. Formal Concept Analysis, Volume 5986 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2010)

Tags

Nutzer

Kommentare und Rezensionen

Zitieren Sie diese Publikation

Two Basic Algorithms in Concept Analysis
B. Ganter.
Formal Concept Analysis, Volume 5986 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2010)