Using difunctional relations in information organization
From MaRDI portal
Recommendations
- Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires
- scientific article; zbMATH DE number 85818
- Design of relational database schemes by deleting attributes in the canonical decomposition
- Data mining, reasoning and incremental information retrieval through non enlargeable rectangular relation coverage
- Decomposing a relation into a tree of binary relations
Cites work
- Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- Relations binaires, fermetures, correspondances de Galois
Cited in
(6)- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
- Incremental Pseudo Rectangular Organization of Information Relative to a Domain
- Data mining, reasoning and incremental information retrieval through non enlargeable rectangular relation coverage
- Décomposition Rectangulaire Optimale D’une Relation Binaire: Application Aux Bases De Données Documentaires
- Formal context coverage based on isolated labels: an efficient solution for text feature extraction
- On difunctions
This page was built for publication: Using difunctional relations in information organization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5938655)