Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Modeling the Shape of the Scene: A Holistic Representation of the Spatial Envelope
International Journal of Computer Vision
Approximate clustering in very large relational data: Research Articles
International Journal of Intelligent Systems
A Hybrid Feature Extraction Selection Approach for High-Dimensional Non-Gaussian Data Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
Histogram features-based fisher linear discriminant for face detection
ACCV'06 Proceedings of the 7th Asian conference on Computer Vision - Volume Part II
Hi-index | 0.00 |
Feature selection has been explored extensively for several real-world applications. In this paper, we address a new solution of selecting a subset of original features for unlabeled data. The concept of our feature selection method is referred to a basic characteristic of clustering in that a data instance usually belongs in the same cluster with its geometrically nearest neighbors and belongs to different clusters with its geometrically farthest neighbors. In particular, our method uses instance-based learning for quantifying features in the context of the nearest and the farthest neighbors of every instance, such that using salient features can raise this characteristic. Experiments on several datasets demonstrated the effectiveness of our presented feature selection method.