.png){kind=icon}
返回
OClustR: A new graph-based algorithm for overlapping clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.04.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering is a Data Mining technique, which has been widely used in many practical applications. From these applications, there are some, like social network analysis, topic detection and tracking, information retrieval, categorization of digital libraries, among others, where objects may belong to more than one cluster; however, most clustering algorithms build disjoint clusters. In this work, we introduce OClustR, a new graph-based clustering algorithm for building overlapping clusters. The proposed algorithm introduces a new graph-covering strategy and a new filtering strategy, which together allow to build overlapping clusterings more accurately than those built by previous algorithms. The experimental evaluation, conducted over several standard collections, showed that our proposed algorithm builds less clusters than those built by the previous related algorithms. Additionally, OClustR builds clusters with overlapping closer to the real overlapping in the collections than the overlapping generated by other clustering algorithms. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Data mining
Overlapping clustering
Graph-based algorithms
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏Synthesis of {CB11} Monocarborane Sulfonamides by B2‐Selective Rhodium‐Catalyzed B−H Activation
PREAI
分享收藏A review on Advanced approaches and polymers used in gastroretentive drug delivery systems关于胃滞留药物递送系统中先进方法与所用聚合物的综述
OAAI
OAAI分享收藏Sparse kernel spectral clustering models for large-scale data analysis面向大规模数据分析的稀疏核谱聚类模型.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容