Mining Graph Data 2006
DOI: 10.1002/9780470073049.ch10
|View full text |Cite
|
Sign up to set email alerts
|

Some Links between Formal Concept Analysis and Graph Mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…complex object descriptions, defining so-called similarity operators which induce a semi-lattice on data descriptions. Several attempts were made for defining such semi-lattices on sets of graphs [8,17,18,22] and logical formulas [5,7] (see also [10,37] for FCA extensions). Indeed, if one is able to order object descriptions in complex data, e.g.…”
Section: Introductionmentioning
confidence: 99%
“…complex object descriptions, defining so-called similarity operators which induce a semi-lattice on data descriptions. Several attempts were made for defining such semi-lattices on sets of graphs [8,17,18,22] and logical formulas [5,7] (see also [10,37] for FCA extensions). Indeed, if one is able to order object descriptions in complex data, e.g.…”
Section: Introductionmentioning
confidence: 99%
“…B(G, M, I) denotes the set of all concepts of context (G, M, I) and forms a complete lattice (so called Gallois lattice). Reader may consult [5] for more technical details and [9] for the connection between graphs and FCA.…”
Section: Formal Concept Of the Context (G M I) Is A Pair (A B) Witmentioning
confidence: 99%