Abstract
Recently, the Rival Penalized Expectation-Maximization (RPEM) algorithm has demonstrated its powerful capability to perform the model selection automatically in the context of mixture model. However, the performance may be degraded when irrelevant variables are included. To overcome this drawback, we adopt the concept of feature salience as the feature weight to measure the relevance to the clusters in the subspace, and integrate it into the RPEM algorithm. The proposed algorithm distinguishes the probably redundant features and estimate the number of clusters automatically and simultaneously in a single learning paradigm. Experiments conducted on both synthetic and benchmark real data set have shown the efficacy of the proposed algorithm.
Original language | English |
---|---|
Title of host publication | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
Publisher | IEEE Computer Society |
Pages | 633-638 |
Number of pages | 6 |
ISBN (Print) | 1424406056, 9781424406050 |
DOIs | |
Publication status | Published - 3 Nov 2006 |
Event | 2006 International Conference on Computational Intelligence and Security, CIS 2006 - Guangzhou, China Duration: 3 Oct 2006 → 6 Oct 2006 https://ieeexplore.ieee.org/xpl/conhome/4072023/proceeding https://link.springer.com/book/10.1007/978-3-540-74377-4 |
Publication series
Name | 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006 |
---|---|
Volume | 1 |
Conference
Conference | 2006 International Conference on Computational Intelligence and Security, CIS 2006 |
---|---|
Country/Territory | China |
City | Guangzhou |
Period | 3/10/06 → 6/10/06 |
Internet address |
Scopus Subject Areas
- Computer Science(all)
- Control and Systems Engineering