论文信息 - On generalized quantifiers, finite sets and data mining

On generalized quantifiers, finite sets and data mining

Logical foundations of data mining are described using the apparatus of finite model theory and generalized quantifiers and in the spirit of the theory of the GUHA method of hypothesis formation. Several results on coputational coplexity are obtained.

Petr Hájek

[1] Jan Rauch,et al. Mining for Association Rules by 4ft-Miner , 2001, INAP.

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

[3] Jan Rauch,et al. Interesting Association Rules and Multi-relational Association Rules , 2002 .

[4] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

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

[6] Ronald Fagin,et al. Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[7] Jean-Marc Adamo,et al. Data Mining for Association Rules and Sequential Patterns , 2000, Springer New York.

[8] Georg Gottlob. Relativized logspace and generalized quantifiers over finite structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[9] Petr Hájek. Relations in GUHA Style Data Mining , 2001, RelMiCS.

[10] Jan Rauch,et al. Classes of Four-Fold Table Quantifiers , 1998, PKDD.

[11] Georg Gottlob,et al. Relativized logspace and generalized quantifiers over finite ordered structures , 1997, Journal of Symbolic Logic.

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

[13] Dimitrios Gunopulos,et al. Constraint-Based Rule Mining in Large, Dense Databases , 2004, Data Mining and Knowledge Discovery.

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