Clustering of High Dimensional Handwritten Data by an Improved Hypergraph Partition Method | |
Wang, Tian1; Lu, Yonggang1; Han, Yuxuan2 | |
2017 | |
关键词 | Clustering High dimensional data Hypergraph Hypergraph partition |
卷号 | 10363 |
DOI | 10.1007/978-3-319-63315-2_28 |
页码 | 323-334 |
英文摘要 | High dimensional data clustering is a difficult task due to the curse of dimensionality. Traditional clustering methods usually fail to produce meaningful results for high dimensional data. Hypergraph partition is believed to be a promising method for dealing with this challenge. In this work, a new high dimensional clustering method called Merging Dense SubGraphs (MDSG) is proposed. A graph G is first constructed from the data by defining an adjacency relationship between the data points using Shared k Nearest Neighbors (SNN). Then a hypergraph is created from the graph G by defining the hyperedges to be all the maximal cliques in the graph. After the hypergraph is produced, an improved hypergraph partitioning method is used to produce the final clustering results. The proposed MDSG method is evaluated on several real high dimensional handwritten datasets, and the experimental results show that the proposed method is superior to the traditional clustering method and other hypergraph partition methods for high dimensional handwritten data clustering. |
会议录 | INTELLIGENT COMPUTING METHODOLOGIES, ICIC 2017, PT III |
会议录出版者 | SPRINGER INTERNATIONAL PUBLISHING AG |
会议录出版地 | GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND |
语种 | 英语 |
资助项目 | Fundamental Research Funds for the Central Universities[lzujbky-2016-k07] |
WOS研究方向 | Computer Science |
WOS记录号 | WOS:000432092800028 |
内容类型 | 会议论文 |
源URL | [http://119.78.100.223/handle/2XXMBERH/36292] |
专题 | 兰州理工大学 |
通讯作者 | Lu, Yonggang |
作者单位 | 1.Lanzhou Univ, Sch Informat Sci & Engn, Lanzhou 730000, Gansu, Peoples R China 2.Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China |
推荐引用方式 GB/T 7714 | Wang, Tian,Lu, Yonggang,Han, Yuxuan. Clustering of High Dimensional Handwritten Data by an Improved Hypergraph Partition Method[C]. 见:. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论