首页 | 本学科首页   官方微博 | 高级检索  
     


Finding the number of clusters in ordered dissimilarities
Authors:Isaac J. Sledge  Timothy C. Havens  Jacalyn M. Huband  James C. Bezdek  James M. Keller
Affiliation:(1) Electrical and Computer Engineering Department, University of Missouri, Columbia, MO, USA;(2) Computer Science Department, University of West Florida, Pensacola, FL, USA
Abstract:As humans, we have innate faculties that allow us to efficiently segment groups of objects. Computers, to some degree, can be programmed with similar categorical capabilities, which stem from exploratory data analysis. Out of the various subsets of data reasoning, clustering provides insight into the structure and relationships of input samples situated in a number of distributions. To determine these relationships, many clustering methods rely on one or more human inputs; the most important being the number of distributions, c, to seek. This work investigates a technique for estimating the number of clusters from a general type of data called relational data. Several numerical examples are presented to illustrate the effectiveness of the proposed method.
Keywords:Data analysis  Pattern recognition  Clustering  Cluster tendency  Cluster count extraction
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号