当前位置: X-MOL 学术Appl. Soft Comput. › 论文详情
Efficient construction of an approximate similarity graph for minimum spanning tree based clustering
Applied Soft Computing ( IF 5.472 ) Pub Date : 2020-09-15 , DOI: 10.1016/j.asoc.2020.106676
Gaurav Mishra; Sraban Kumar Mohanty

Minimum spanning tree (MST) based unsupervised learning techniques are popular due to their ability to identify intrinsic clusters of heterogeneous structures. One of the important factors which affects their effectiveness is how to construct a sparse similarity graph which can effectively capture the local neighborhood information in sub quadratic time. In this paper, we propose a technique which efficiently uses the local nearest neighbors of data points to construct a similarity graph. The proposed approach consists of two steps. In the first step, the dataset is divided into groups using the dispersion level of data points and then all pair intra-partition edges are computed. In the second step, the boundary data points across the neighboring partitions are considered to produce inter-partition edges for increasing the accuracy. The resulting graph is generated by considering all intra- and inter-partition edges. Approximate MST of the similarity graph is constructed to show its efficacy. Experimental analyses demonstrate that the similarity graph captures shorter edges and discards the longest edges, based on graph diameter, all pair shortest path and weight error of MST. Moreover, the quality of the approximate MST is also validated by applying clustering technique on various synthetic and real data sets of different characteristics and cluster quality analyses demonstrate that it has a satisfying performance over other competing approximate MST construction techniques.

更新日期:2020-09-15

 

全部期刊列表>>
物理学研究前沿热点精选期刊推荐
科研绘图
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
自然职场线上招聘会
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
张晓晨
田蕾蕾
李闯创
刘天飞
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
X-MOL
清华大学
廖矿标
陈永胜
试剂库存
down
wechat
bug