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

来源：

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS | 2010年 / 25卷 / 02期

关键词：

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 条

[1] Partitioning-based clustering for Web document categorization [J].

Boley, D ;

Gini, M ;

Gross, R ;

Han, EH ;

Hastings, K ;

Karypis, G ;

Kumar, V ;

Mobasher, B ;

Moore, J .

DECISION SUPPORT SYSTEMS, 1999, 27 (03) :329-341

[2]

FAN M, 2001, DATA MINING CONCEPTS

[3]

Fan Yun, 2003, Journal of Software, V14, P857

[4] Chameleon: Hierarchical clustering using dynamic modeling [J].

Karypis, G ;

Han, EH ;

Kumar, V .

COMPUTER, 1999, 32 (08) :68-+

[5]

Karypis G, 1997, DES AUT CON, P526, DOI 10.1145/266021.266273

[6]

Lin T.Y., 1997, P EUR C INT TECHN SO, P1602

[7]

Lin T. Y., 1998, Rough sets in knowledge discovery

[8]

Lin TY, 2002, LECT NOTES ARTIF INT, V2475, P296

[9]

LIN TY, 2006, J NANCHANG I TECHNOL, V25, P22

[10]

LIU Q, 2001, ROUGH SETS ROUGH REA

← 1 2 →