全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

An Attribute Clustering Algorithm Based on Minimum Spanning Tree
一种基于最小张树的属性聚类算法

Keywords: minimum spanning tree,attribute cluster,similarity,contact degree
最小张树
,属性聚类,相似度,接触度

Full-Text   Cite this paper   Add to My Lib

Abstract:

Combining with the method of minimum spanning tree in Graph theory, we present two concepts of similarity and contact degree in this paper, and build a new attribute clustering algorithm based on them. We compare the approach with some other methods such as FCM and AKM, in several problems for analyzing it's effectiveness. It is obvious that the approach we introduced here makes up a loss of other methods and could pactically solve problems in a certain extent.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133