Graduality, Uncertainty and Typicality in Formal Concept Analysis

Djouadi, Yassine; Dubois, Didier; Prade, Henri

doi:10.1007/978-3-642-16629-7_7

Cited by 6 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another way 16,15 is related to the idea of uncertainty. The possibilistic manner of representing uncertainty here is to associate with each link (x, y) a pair of number (α, β ) such as α, β ∈ [0, 1] and min(α, β ) = 0 expressing respectively to what extent it is certain that the link exists (α), and does not exists (β ).…”

Section: Weighted Extensions Of Formal Concept Analysismentioning

confidence: 99%

See 1 more Smart Citation

Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts

Gaume¹,

Navarro²,

Prade³

2013

IJCIS

Self Cite

View full text Add to dashboard Cite

The paper first offers a parallel between two approaches to conceptual clustering, namely formal concept analysis (augmented with the introduction of new operators) and bipartite graph analysis. It is shown that a formal concept (as defined in formal concept analysis) corresponds to the idea of a maximal bi-clique, while sub-contexts, which correspond to independent "conceptual worlds" that can be characterized by means of the new operators introduced, are disconnected sub-graphs in a bipartite graph. The parallel between formal concept analysis and bipartite graph analysis is further exploited by considering "approximation" methods on both sides. It leads to suggest new ideas for providing simplified views of datasets, taking also inspiration from the search for approximate itemsets in data mining (with relaxed requirements), and the detection of communities in hierarchical small worlds. *

show abstract

Section: Weighted Extensions Of Formal Concept Analysismentioning

confidence: 99%

“…One may also consider that some properties are less important, or that some objects are more typical 15 . Then weights are no longer put on links or edges, but rather on the nodes.…”

Section: Weighted Extensions Of Formal Concept Analysismentioning

confidence: 99%

Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts

Gaume¹,

Navarro²,

Prade³

2013

IJCIS

Self Cite

View full text Add to dashboard Cite

show abstract

A Formal Concept View of Abstract Argumentation

Amgoud

Prade

2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The paper presents a parallel between two important theories for the treatment of information which address questions that are apparently unrelated and that are studied by different research communities: an enriched view of formal concept analysis and abstract argumentation. Both theories exploit a binary relation (expressing object-property links, attacks between arguments). We show that when an argumentation framework rather considers the complementary relation does not attack, then its stable extensions can be seen as the exact counterparts of formal concepts. This leads to a cube of oppositions, a generalization of the well-known square of oppositions, between eight remarkable sets of arguments. This provides a richer view for argumentation in cases of bi-valued attack relations and fuzzy ones.

show abstract

3-Way Concept Analysis Based on 3-Valued Formal Contexts

Ling

Ren

2021

Cogn Comput

View full text Add to dashboard Cite

Graduality, Uncertainty and Typicality in Formal Concept Analysis

Cited by 6 publications

References 23 publications

Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts

Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts

A Formal Concept View of Abstract Argumentation

3-Way Concept Analysis Based on 3-Valued Formal Contexts

Contact Info

Product

Resources

About