A Novel Clustering Algorithm Using Hypergraph-Based Granular Computing

被引:3
作者
Liu, Qun [1 ,2 ]
Liao, XiaoFeng [2 ]
Wu, Yu [1 ]
机构
[1] Chongqing Univ Post & Telecommun, Dept Comp Sci & Technol, Chongqing 400065, Peoples R China
[2] Chongqing Univ, Dept Comp Sci & Engn, Chongqing 400044, Peoples R China
关键词
D O I
10.1002/int.20393
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering is an important technique in data mining. In this paper, we introduce a new clustering algorithm. This algorithm, based on granular computing, constructs a hypergraph (simplicial complex) by the hypergraph bisection algorithm. It will discover the similarities and associations among documents. In some experiments on Web data, the proposed algorithm is used; the results are quite satisfactory. (C) 2009 Wiley Periodicals, Inc.
引用
收藏
页码:155 / 164
页数:10
相关论文
共 15 条
[11]  
LOUIE E, 2000, P 12 INT S FDN INT S, P486
[12]  
MOORE J, 1997, 7 WORKSH INF TECHN S
[13]  
Qian Wei-ning, 2002, Journal of Software, V13, P1382
[14]  
Song Qin-bao, 2002, Journal of Software, V13, P417
[15]  
Wang Jian-Hui, 2004, Journal of Software, V15, P697