.png){kind=icon}
返回
An optimization algorithm for clustering using weighted dissimilarity measures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2003.11.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
One of the main problems in cluster analysis is the weighting of attributes so as to discover structures that may be present. By using weighted dissimilarity measures for objects, a new approach is developed, which allows the use of the k-means-type paradigm to efficiently cluster large data sets. The optimization algorithm is presented and the effectiveness of the algorithm is demonstrated with both synthetic and real data sets. (C) 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
Keyword:
clustering
data mining
optimization
attributes weights
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Potential Negative Consequences of Adding Phosphorus‐Based Fertilizers to Immobilize Lead in Soil
PREAI
分享收藏Separation by dielectrophoresis of dormant and nondormant bacterial cells of Mycobacterium smegmatis
OAAI
OAAI分享收藏 没有更多内容
没有更多内容