How triadic diagrams represent conceptual structures

Biedermann, Klaus

doi:10.1007/bfb0027879

Cited by 26 publications

(11 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The set of triadic concepts can be ordered and form a complete trilattice [4], [16]. Indeed, for each i∈ {1, 2, 3}, the relation ( …”

Section: Dyadic Concept and Triadic Conceptmentioning

confidence: 99%

“…Then the dyadic association rules are extracted by applying the formal concept analysis. Finally from these last, we apply the algorithms that we have proposed for the research of triadic association rules in their various onditional Attribute Association Rule (BCAAR) Biedermann ule (BACAR) [7], [4], [17], [8], [12]. dyadic concepts and dyadic generators and to order the succession of the latter.…”

Section: Computer Science and Information Technology (Cs And It)mentioning

confidence: 99%

“…According to the bibliographic study that we conducted, [4] was the first to study the problem of extracting implications in triadic contexts. A triadic implication has the following form:…”

Section: C(sc) Where Bc⊆ C'|/|g| Is Called Is Its Confidence[1] Anmentioning

confidence: 99%

See 2 more Smart Citations

Mining Triadic Association Rules

Selmane

Missaoui²,

Boussaïd³

et al. 2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

“…The set of triadic concepts can be ordered and form a complete trilattice [4], [16]. Indeed, for each i∈ {1, 2, 3}, the relation ( …”

Section: Dyadic Concept and Triadic Conceptmentioning

confidence: 99%

Section: Computer Science and Information Technology (Cs And It)mentioning

confidence: 99%

See 1 more Smart Citation

Mining Triadic Association Rules

Selmane

Missaoui²,

Boussaïd³

et al. 2013

Computer Science &Amp; Information Technology ( CS &Amp; IT )

View full text Add to dashboard Cite

show abstract

“…Following the initial paper [40] by Lehmann and Wille, several researchers started to analyse the mathematical properties of trilattices, e. g., [7][8][9]19,23,75,76]. [40] and [19] present several ways to project a triadic context to a dyadic one.…”

Section: Triadic Concept Analysismentioning

confidence: 99%

Discovering shared conceptualizations in folksonomies

Jäschke

Hotho

Schmitz

et al. 2008

Journal of Web Semantics

101

View full text Add to dashboard Cite

Social bookmark tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualisations are not formalised, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualisations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.

show abstract

“…In this paper, however, we won't make use of these hierarchies. 1 An additional feature of OLAP is dicing 2 which rotates the data cube. This is particularly useful if the results are presented by spreadsheets, as it allows to permute rows and columns.…”

Section: On-line Analytical Processing and Triadic Contextsmentioning

confidence: 99%

A Finite State Model for On-Line Analytical Processing in Triadic Contexts

Stumme

2005

Formal Concept Analysis

View full text Add to dashboard Cite

Abstract. About ten years ago, triadic contexts were presented by Lehmann and Wille as an extension of Formal Concept Analysis. However, they have rarely been used up to now, which may be due to the rather complex structure of the resulting diagrams. In this paper, we go one step back and discuss how traditional line diagrams of standard (dyadic) concept lattices can be used for exploring and navigating triadic data. Our approach is inspired by the slice & dice paradigm of On-Line-Analytical Processing (OLAP). We recall the basic ideas of OLAP, and show how they may be transferred to triadic contexts. For modeling the navigation patterns a user might follow, we use the formalisms of finite state machines. In order to present the benefits of our model, we show how it can be used for navigating the IT Baseline Protection Manual of the German Federal Office for Information Security.

show abstract

How triadic diagrams represent conceptual structures

Cited by 26 publications

References 5 publications

Mining Triadic Association Rules

Mining Triadic Association Rules

Discovering shared conceptualizations in folksonomies

A Finite State Model for On-Line Analytical Processing in Triadic Contexts

Contact Info

Product

Resources

About