Sciweavers

1420 search results - page 120 / 284
» Cluster Ensemble Selection
Sort
View
103
Voted
ICML
1994
IEEE
15 years 4 months ago
Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
David B. Skalak
104
Voted
SBBD
2000
168views Database» more  SBBD 2000»
15 years 2 months ago
Fast Feature Selection Using Fractal Dimension
Dimensionalitycurse and dimensionalityreduction are two issues that have retained highinterest for data mining, machine learning, multimedia indexing, and clustering. We present a...
Caetano Traina Jr., Agma J. M. Traina, Leejay Wu, ...
DIS
2008
Springer
15 years 1 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel
107
Voted
EWSN
2008
Springer
16 years 10 days ago
Efficient Clustering for Improving Network Performance in Wireless Sensor Networks
Clustering is an important mechanism in large multi-hop wireless sensor networks for obtaining scalability, reducing energy consumption and achieving better network performance. Mo...
Tal Anker, Danny Bickson, Danny Dolev, Bracha Hod
124
Voted
PAMI
2006
134views more  PAMI 2006»
15 years 20 days ago
A Genetic Algorithm Using Hyper-Quadtrees for Low-Dimensional K-means Clustering
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
Michael Laszlo, Sumitra Mukherjee