Relations in GUHA Style Data Mining

Authors:
Petr Hájek
Affiliations:
-
Venue:
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Year:
2001

Citing 6
Cited 0

GUHA for personal computers

Computational Statistics & Data Analysis - Special issue dedicated to Toma´sˇ Havra´nek
Fast discovery of association rules

Advances in knowledge discovery and data mining
Relational attribute systems

International Journal of Human-Computer Studies
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Formal Logics of Discovery and Hypothesis Formation by Machine

DS '98 Proceedings of the First International Conference on Discovery Science
Complexity of Fuzzy Probability Logics

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The formalism of GUHA style data mining is confronted with the approach of relational structures of Orlowska and others. A computational complexity result on tautologies with implicational quantifiers is presented.