On generalized quantifiers, finite sets and data mining

MaRDI QIDQ4829332zbMATH OpenFDO

Authors Petr Hájek

Publication date 29 November 2004

zbMATH Keywords

computational complexityLogical foundations

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Logic with extra quantifiers and operators (03C80) Database theory (68P15) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Theory and Applications of Relational Structures as Knowledge Instruments
• Relations and GUHA-style data mining. II
• Relations in GUHA style data mining
• On monotone data mining languages
• The GUHA method and observational calculi: tools for data mining

Cited in

(9)

• The GUHA method and its meaning for data mining
• Generalized quantifiers in formal concept analysis
• scientific article; zbMATH DE number 5000954 (Why is no real title available?)
• Relations in GUHA style data mining
• Relations and GUHA-style data mining. II
• On monotone data mining languages
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• Theory and Applications of Relational Structures as Knowledge Instruments
• Listing closed sets of strongly accessible set systems with applications to data mining

This page was built for publication: On generalized quantifiers, finite sets and data mining

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