Attribute (Feature) Completion - The Theory of Attributes from Data'Mining Prospect

A ”correct” selection of attributes (features) is vital in data mining. As afirst step, this paper constructs all possible attributes of a given relation. The results are based on the observations that each relation is isomorphic to a unique abstract relation, called canonical model. The complete set of attributes of the canonical model is, then. constructed. Any attribute of a relation can be interpreted (via isomorphism) from such a complete set.

[1]  Tsau Young Lin,et al.  Semantics oriented association rules , 2002, 2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291).

[2]  Tsau Young Lin,et al.  Finding Association Rules Using Fast Bit Computation: Machine-Oriented Modeling , 2000, ISMIS.

[3]  Tsau Young Lin,et al.  Attribute transformations for data mining II: Applications to economic and stock market data , 2002, Int. J. Intell. Syst..

[4]  T. T. Lee.  An algebraic theory of relational databases , 1983, The Bell System Technical Journal.

[5]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[6]  Jiawei Han,et al.  Attribute-Oriented Induction in Relational Databases , 1991, Knowledge Discovery in Databases.

[7]  Tsau Young Lin,et al.  Association Rules in Semantically Rich Relations: Granular Computing Approach , 2001, JSAI Workshops.

[8]  E. Louie,et al.  Modeling the real world for data mining: granular computing approach , 2001, Proceedings Joint 9th IFSA World Congress and 20th NAFIPS International Conference (Cat. No. 01TH8569).

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

[10]  Laks V. S. Lakshmanan,et al.  Exploratory mining and pruning optimizations of constrained associations rules , 1998, SIGMOD '98.