Context graphs - representing formal concepts by connected subgraphs

Koetters, J, Schmidt, H and Squire, D 2009, 'Context graphs - representing formal concepts by connected subgraphs', Lecture Notes in Computer Science, vol. 5548, pp. 178-193.

Document type: Journal Article
Collection: Journal Articles

Title Context graphs - representing formal concepts by connected subgraphs
Author(s) Koetters, J
Schmidt, H
Squire, D
Year 2009
Journal name Lecture Notes in Computer Science
Volume number 5548
Start page 178
End page 193
Total pages 16
Publisher Springer-Verlag
Abstract The article introduces a representation of a formal context by an undirected graph called a context graph with the formal objects being the nodes of the graph. We use as a defining property for this graph that it contains every concept extent as a connected subgraph. The graph is not uniquely defined by this property - we focus on those graphs that are edge-minimal and present a result with respect to the number of their edges. We then study how the structure of an edge-minimal context graph can be updated to adjust to the subsequent addition of an object to the context. This leads to an incremental construction algorithm that does not require the explicit computation of formal concepts.
Subject Analysis of Algorithms and Complexity
Keyword(s) Context Graphs
Formal Concept Analysis
Graph Theory
Information Retrieval
DOI - identifier 10.1007/978-3-642-01815-2
Copyright notice © Springer-Verlag Berlin Heidelberg 2009
ISSN 0302-9743
Version Filter Type
Citation counts: Scopus Citation Count Cited 2 times in Scopus Article | Citations
Altmetric details:
Access Statistics: 132 Abstract Views  -  Detailed Statistics
Created: Wed, 22 Dec 2010, 10:15:00 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us