A novel clustering algorithm using hypergraph‐based granular computing | Zendy

Liu Qun | Zendy; Liao XiaoFeng | Zendy; Wu Yu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A novel clustering algorithm using hypergraph‐based granular computing

Author(s) -

Liu Qun,

Liao XiaoFeng,

Wu Yu

Publication year - 2010

Publication title -

international journal of intelligent systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.291

H-Index - 87

eISSN - 1098-111X

pISSN - 0884-8173

DOI - 10.1002/int.20393

Subject(s) - hypergraph , cluster analysis , granular computing , computer science , algorithm , data mining , canopy clustering algorithm , correlation clustering , theoretical computer science , artificial intelligence , rough set , mathematics , combinatorics

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. © 2009 Wiley Periodicals, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research