抽象的

Algorithms for a minimum sum of squares clustering

Pierre Hansen

Cluster analysis aims at solving the following very general problem: given a set of entities, find subsets (also called clusters) which are homogeneous and well separated. Homogeneity means that similar entities should belong to the same cluster. Separation means that dissimilar entities should belong to different clusters. This concept can be expressed mathematically in many ways. 

免责声明: 此摘要通过人工智能工具翻译,尚未经过审核或验证

索引于

化学文摘社 (CAS)
谷歌学术
打开 J 门
学术钥匙
研究圣经
全球影响因子 (GIF)
引用因子
宇宙IF
电子期刊图书馆
参考搜索
哈姆达大学
世界科学期刊目录
印度科学网
学者指导
普布隆斯
国际创新期刊影响因子(IIJIF)
国际组织研究所 (I2OR)
宇宙

查看更多