Skip to Main content Skip to Navigation
Conference papers

FCA and Knowledge Discovery (Tutorial)

Amedeo Napoli 1
1 ORPAILLEUR - Knowledge representation, reasonning
Inria Nancy - Grand Est, LORIA - NLPKD - Department of Natural Language Processing & Knowledge Discovery
Abstract : In this tutorial we will introduce and discuss how FCA and two main extensions, namely Pattern Structures and Relational Concept Analysis (RCA), can be used for knowledge discovery purposes, especially in pattern and rule mining, in data and knowledge processing, data analysis, and classification. Indeed, FCA is aimed at building a concept lattice starting from a binary table where objects are in rows and attributes in columns. But FCA can deal with more complex data. Pattern Structures allow to consider objects with descriptions based on numbers, intervals, sequences, trees and general graphs. RCA was introduced for taking into account relational data and especially relations between objects. These two extensions rely on adapted FCA algorithms and can be efficiently used in real-world applications for knowledge discovery, e.g. text mining and ontology engineering, information retrieval and recommendation, analysis of sequences based on stability, semantic web and classification of Linked Open Data, biclustering, and functional dependencies.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03122350
Contributor : Amedeo Napoli Connect in order to contact the contributor
Submitted on : Tuesday, January 26, 2021 - 11:22:57 PM
Last modification on : Wednesday, November 3, 2021 - 7:57:51 AM
Long-term archiving on: : Tuesday, April 27, 2021 - 7:53:53 PM

File

iccs20-tutorial-200918sp.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Amedeo Napoli. FCA and Knowledge Discovery (Tutorial). ICCS 2020 - 25th International Conference on Conceptual Structures, Sep 2020, Bolzano/ Virtual, Italy. ⟨10.1007/978-3-030-57855-8⟩. ⟨hal-03122350⟩

Share

Metrics

Les métriques sont temporairement indisponibles