Relational concept discovery in structured datasets
Publication:2385432
DOI10.1007/s10472-007-9056-3zbMath1125.68097OpenAlexW2078761037MaRDI QIDQ2385432
Clément Roume, Marianne Huchard, M. Rouane Hacene, Petko Valtchev
Publication date: 12 October 2007
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-007-9056-3
concept latticerelational data miningGalois latticeconceptual scalinglattice constructing algorithmsrelational loops
Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Lattices (06B99)
Related Items (12)
Uses Software
Cites Work
- A partition-based approach towards constructing Galois (concept) lattices
- Relational concept discovery in structured datasets
- Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
- Treillis de Galois maximaux et capacités de Choquet
- Comparing performance of algorithms for generating concept lattices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Relational concept discovery in structured datasets