ACM Computing Surveys (CSUR)
Feature selection in unsupervised learning via evolutionary search
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Introduction to Algorithms
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Data Mining and Knowledge Discovery
Feature Subset Selection Using a Genetic Algorithm
IEEE Intelligent Systems
Clustering in massive data sets
Handbook of massive data sets
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
The Journal of Machine Learning Research
Evolutionary model selection in unsupervised learning
Intelligent Data Analysis
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Dimensionality reduction using genetic algorithms
IEEE Transactions on Evolutionary Computation
YALE: rapid prototyping for complex data mining tasks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Hybridization of Evolutionary Mechanisms for Feature Subset Selection in Unsupervised Learning
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
Multi-agent learning by distributed feature extraction
ALAMAS'05/ALAMAS'06/ALAMAS'07 Proceedings of the 5th , 6th and 7th European conference on Adaptive and learning agents and multi-agent systems: adaptation and multi-agent learning
Typical testors generation based on an evolutionary algorithm
IDEAL'11 Proceedings of the 12th international conference on Intelligent data engineering and automated learning
An eye-hand data fusion framework for pervasive sensing of surgical activities
Pattern Recognition
International Journal of Hybrid Intelligent Systems
Hi-index | 0.00 |
In this work we propose a novel, sound framework for evolutionary feature selection in unsupervised machine learning problems. We show that unsupervised feature selection is inherently multi-objective and behaves differently from supervised feature selection in that the number of features must be maximized instead of being minimized. Although this might sound surprising from a supervised learning point of view, we exemplify this relationship on the problem of data clustering and show that existing approaches do not pose the optimization problem in an appropriate way. Another important consequence of this paradigm change is a method which segments the Pareto sets produced by our approach. Inspecting only prototypical points from these segments drastically reduces the amount of work for selecting a final solution. We compare our methods against existing approaches on eight data sets.