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

Authors:
Tsay Young ('T. Y. ') Lin
Affiliations:
-
Venue:
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Year:
2002

Citing 0
Cited 5

A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering

International Journal of Approximate Reasoning
Granular computing: structures, representations, and applications

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Deductive data mining: mathematical foundation of database mining

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Feature selection with adjustable criteria

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Unifying Rough Set Theories via Large Scaled Granular Computing

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

Abstract

A "correct" selection of attributes (features) is vital indata mining. As a first step, this paper constructs all possibleattributes of a given relation. The results are basedon the observations that each relation is isomorphic to aunique abstract relation, called canonical model. The completeset of attributes of the canonical model is, then, constructed.Any attribute of a relation can be interpreted (viaisomorphism) from such a complete set.