.png){kind=icon}
.png){kind=icon}
Return
A Novel Clustering Algorithm Using Hypergraph-Based Granular Computing
.png){kind=icon}
PRE
AI
DOI：10.1002/int.20393.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.7
Papers:
3.0K
Citations:
8.1K