.png){kind=icon}
返回
Accelerating k-medoid-based algorithms through metric access methods
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2007.06.019.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Scalable data mining algorithms have become crucial to efficiently support KDD processes on large databases. In this paper, we address the task of scaling up k-medoid-based algorithms through the utilization of metric access methods, allowing clustering algorithms to be executed by database management systems in a fraction of the time usually required by the traditional approaches. We also present an optimization strategy that can be applied as an additional step of the proposed algorithm in order to achieve better clustering solutions. Experimental results based on several datasets, including synthetic and real ones, show that the proposed algorithm can reduce the number of distance calculations by a factor of more than three thousand times when compared to existing algorithms, while producing clusters of equivalent quality. (C) 2007 Elsevier Inc. All rights reserved.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
引用论文
Diseases of the tooth: the genetic and molecular basis of inherited anomalies affecting the dentition牙齿疾病: 影响牙列的遗传异常的遗传和分子基础
.png){kind=icon}
PREAI
分享收藏
分享收藏 没有更多内容
没有更多内容