Sciweavers

221 search results - page 6 / 45
» Random Convolution Ensembles
Sort
View
MCS
2007
Springer
14 years 4 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 11 months ago
Cluster Ensemble Selection
This paper studies the ensemble selection problem for unsupervised learning. Given a large library of different clustering solutions, our goal is to select a subset of solutions t...
Xiaoli Z. Fern, Wei Lin
AAAI
1998
13 years 11 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
TCOM
2010
98views more  TCOM 2010»
13 years 4 months ago
Convolutionally Coded Transmission over Markov-Gaussian Channels: Analysis and Decoding Metrics
It has been widely acknowledged that the aggregate interference at the receiver for various practical communication channels can often deviate markedly from the classical additive ...
Jeebak Mitra, Lutz H.-J. Lampe
ICDM
2009
IEEE
199views Data Mining» more  ICDM 2009»
14 years 4 months ago
Active Learning with Adaptive Heterogeneous Ensembles
—One common approach to active learning is to iteratively train a single classifier by choosing data points based on its uncertainty, but it is nontrivial to design uncertainty ...
Zhenyu Lu, Xindong Wu, Josh Bongard