Context Graphs - Representing Formal Concepts by Connected Subgraphs

被引：0

作者：

Koetters, Jens ^{[1
]}

Schmidt, Heinz ^{[2
]}

Squire, David McG. ^{[1
]}

机构：

[1] Monash Univ, Melbourne, Vic 3004, Australia

[2] RMIT Univ, Melbourne, Vic, Australia

来源：

FORMAL CONCEPT ANALYSIS: 7TH INTERNATIONAL CONFERENCE, ICFCA 2009 | 2009年 / 5548卷

关键词：

Context Graphs; Formal Concept Analysis; Graph Theory; Information Retrieval; Navigation; INFORMATION-RETRIEVAL; CONCEPT LATTICES;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：178 / +

页数：2

共 16 条

[1]

Breiger RonaldL., 1988, Social Structures: A Network Approach, P83

[2] Information retrieval through hybrid navigation of lattice representations [J].