Newtonian clustering: An approach based on molecular dynamics and global optimization

被引:18
作者
Blekas, K. [1 ]
Lagaris, I. E. [1 ]
机构
[1] Univ Ioannina, Dept Comp Sci, GR-45110 Ioannina, Greece
关键词
clustering; molecular dynamics; global optimization; order statistics;
D O I
10.1016/j.patcog.2006.07.012
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton's equations of motion are employed to concentrate the data points around their cluster centers, using an attractive potential, constructed specially for this purpose. During this process, important information is gathered concerning the spread of each cluster. In succession this information is used to create an objective function that maps each cluster to a local maximum. Global optimization is then used to retrieve the positions of the maxima that correspond to the locations of the cluster centers. Further refinement is achieved by applying the EM-algorithm to a Gaussian mixture model whose construction and initialization is based on the acquired information. To assess the effectiveness of our method, we have conducted experiments on a plethora of benchmark data sets. In addition we have compared its performance against four clustering techniques that are well established in the literature. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.
引用
收藏
页码:1734 / 1744
页数:11
相关论文
共 35 条
[1]
Akaike H., 1973, 2 INT S INFORM THEOR, P267, DOI [DOI 10.1007/978-1-4612-1694-0_15, 10.1007/978-1-4612-1694-0_15]
[2]
TOPOGRAPHICAL MULTILEVEL SINGLE LINKAGE [J].
ALI, MM ;
STOREY, C .
JOURNAL OF GLOBAL OPTIMIZATION, 1994, 5 (04) :349-358
[3]
Baldi P., 1998, Bioinformatics: The machine learning approach
[4]
Bishop CM., 1995, Neural networks for pattern recognition
[5]
A spatially constrained mixture model for image segmentation [J].
Blekas, K ;
Likas, A ;
Galatsanos, NP ;
Lagaris, IE .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 2005, 16 (02) :494-498
[6]
A STOCHASTIC METHOD FOR GLOBAL OPTIMIZATION [J].
BOENDER, CGE ;
KAN, AHGR ;
TIMMER, GT ;
STOUGIE, L .
MATHEMATICAL PROGRAMMING, 1982, 22 (02) :125-140
[7]
Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables [J].
Chickering, DM ;
Heckerman, D .
MACHINE LEARNING, 1997, 29 (2-3) :181-212
[8]
Chipman H., 2001, Model selection, P67, DOI DOI 10.1214/LNMS/1215540964.655
[9]
Corduneanu C. Bishop, 2001, Artif. Intell. Statist., V18, P27
[10]
MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38