.png){kind=icon}
Return
Initializing Partition-Optimization Algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TCBB.2007.70244.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Clustering data sets is a challenging problem needed in a wide array of applications. Partition-optimization approaches, such as k-means or expectation-maximization ( EM) algorithms, are suboptimal and find solutions in the vicinity of their initialization. This paper proposes a staged approach to specifying initial values by finding a large number of local modes and then obtaining representatives from the most separated ones. Results on test experiments are excellent. We also provide a detailed comparative assessment of the suggested algorithm with many commonly used initialization approaches in the literature. Finally, the methodology is applied to two data sets on diurnal microarray gene expressions and industrial releases of mercury.
Keywords:
Toxic Release Inventory
methylmercury
multi-Gaussian mixtures
protein localization
singular value decomposition
Journal
I
IF:
3.4
Papers:
3.3K
Citations:
6.4K
Organization
No organization information available
Cited Papers
ShareSaveShareSaveEffect of Ultrasound and High Hydrostatic Pressure Processing on Quality and Bioactive Compounds during the Shelf Life of a Broccoli and Carrot By-Products Beverage.png)
Foods
OAAI
FoodsIF0
OAAIShareSaveShareSaveShareSave
View more