A MULTI-RELATIONAL HIERARCHICAL CLUSTERING ALGORITHM BASED ON SHARED NEAREST NEIGHBOR SIMILARITY
The clustering about relational databases is an active study subject in data mining.In this paper, we introduce a Multi-relational Hierarchical Clustering Algorithm Based on Shared Nearest Neighbor Similarity (MHSNNS).First, this algorithm joins every table through the tuple ID propagation.Then, groups objects into a large number of relatively small sub-clusters using the shared nearest neighbor algorithm and the cluster cohesion.Last, find the genuine clusters by repeatedly combining these sub-clusters using the cluster separation.The experiment shows the efficiency and scalability of this approach.
Data mining Shared nearest neighbor Relational databases Hierarchical clustering Multi-relational clustering
JING-FENG GUO YU-YAN ZHAO JING LI
The College of Information Science and Engineering, Yanshan University, Hebei Qinhuangdao 066004, China
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
3951-3955
2007-08-19(万方平台首次上网日期,不代表论文的发表时间)