An incremental concept formation approach for learning from databases

DOI10.1016/0304-3975(94)90195-3MaRDI QIDQ1341713zbMATH OpenOpenAlexFDO

Authors Robert Godin, Rokia Missaoui

Publication date 15 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(94)90195-3

Mathematics Subject Classification ID

Database theory (68P15) Theory of data (68P99) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1827093
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• scientific article; zbMATH DE number 754420
• scientific article; zbMATH DE number 2016086
• scientific article; zbMATH DE number 2168560

Cites work

• scientific article; zbMATH DE number 4016967 (Why is no real title available?)
• scientific article; zbMATH DE number 4147465 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3954298 (Why is no real title available?)
• scientific article; zbMATH DE number 4106925 (Why is no real title available?)
• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 3559622 (Why is no real title available?)
• scientific article; zbMATH DE number 3604894 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 3332577 (Why is no real title available?)
• scientific article; zbMATH DE number 3420808 (Why is no real title available?)
• Inductive Logic Programming: Theory and methods
• Lattice model of browsable data spaces
• Two basic algorithms in concept analysis

Cited in

(20)

• Enumeration aspects of maximal cliques and bicliques
• On the power of incremental learning.
• Variants of iterative learning
• Monotone concepts for formal concept analysis
• A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
• Reduction method for concept lattices based on rough set theory and its application
• The Galois lattice as a hierarchical structure for topological relations
• A framework for incremental generation of closed itemsets
• Interesting rough lattice-based implication rules discovery
• A hierarchical model learning approach for refining and managing concept clusters discovered from databases
• scientific article; zbMATH DE number 4166894 (Why is no real title available?)
• Rule acquisition and attribute reduction in real decision formal contexts
• scientific article; zbMATH DE number 599109 (Why is no real title available?)
• Generating frequent itemsets incrementally: two novel approaches based on Galois lattice theory
• scientific article; zbMATH DE number 2016086 (Why is no real title available?)
• Design and comparison of lattices of topological relations for spatial representation and reasoning
• scientific article; zbMATH DE number 754420 (Why is no real title available?)
• scientific article; zbMATH DE number 1827093 (Why is no real title available?)
• Rough fuzzy concept lattice and its properties
• Approaches to the representations and logic operations of fuzzy concepts in the framework of axiomatic fuzzy set theory. II.

This page was built for publication: An incremental concept formation approach for learning from databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341713)