论文信息 - Relations in GUHA Style Data Mining

Relations in GUHA Style Data Mining

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.

Petr Hájek

[1] Ewa Orlowska,et al. Relational Methods for Computer Science Applications , 2001 .

[2] Petr Hájek,et al. GUHA for personal computers , 1995 .

[3] Ivo Düntsch,et al. Relational attribute systems , 2002, Int. J. Hum. Comput. Stud..

[4] Witold Lipski,et al. Informational Systems with Incomplete Information , 1976, ICALP.

[5] T. Havránek,et al. Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory , 1978 .

[6] Petr Hájek,et al. Formal logics of discovery and hypothesis formation by machine , 2003, Theor. Comput. Sci..

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[9] Petr Hájek,et al. Complexity of Fuzzy Probability Logics , 2001, Fundam. Informaticae.

[10] Petr Hájek,et al. Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[11] Dimiter Vakarelov,et al. Information Systems, Similarity Relations and Modal Logics , 1998 .

[12] Sndor Dominich. Mathematical Foundations of Information Retrieval , 2002, Computational Linguistics.

[13] Jerzy W. Grzymala-Busse,et al. Rough Sets , 1995, Commun. ACM.