ATTRIBUTE CLUSTERING IN HIGH DIMENSIONAL FEATURE SPACES
In this paper, we will do clustering for the attributes rather than the objects.Like the conventional clustering for objects, the attributes within the same cluster have high similarity, but within different clusters have high dissimilarity.A distance measure for a pair of attributes based on the relative dependency is proposed.An attribute clustering algorithm called Most Neighbors First (MNP) is also proposed to cluster the attributes into a fixed number of groups.An example is also given to illustrate the proposed algorithm.
Attribute clustering Feature space Dissimilarity measure Rough set
TZUNG-PEI HONG YAN-LIANG LIOU
Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung, 811, Taiwan;Depar Department of Electrical Engineering, National University of Kaohsiung, Kaohsiung, 811, Taiwan
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
2286-2289
2007-08-19(万方平台首次上网日期,不代表论文的发表时间)