Sciweavers

329 search results - page 32 / 66
» Robustness Analysis of the Neural Gas Learning Algorithm
Sort
View
87
Voted
ICANN
2003
Springer
15 years 5 months ago
Expectation-MiniMax Approach to Clustering Analysis
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
Yiu-ming Cheung
118
Voted
IJCNN
2007
IEEE
15 years 6 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
BIBE
2009
IEEE
131views Bioinformatics» more  BIBE 2009»
15 years 3 months ago
Learning Scaling Coefficient in Possibilistic Latent Variable Algorithm from Complex Diagnosis Data
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
Zong-Xian Yin
JMLR
2008
188views more  JMLR 2008»
14 years 12 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
SIGIR
2002
ACM
15 years 3 days ago
A new family of online algorithms for category ranking
We describe a new family of topic-ranking algorithms for multi-labeled documents. The motivation for the algorithms stems from recent advances in online learning algorithms. The a...
Koby Crammer, Yoram Singer