Academic
Publications
Unsupervised Feature Selection Using Feature Similarity

Unsupervised Feature Selection Using Feature Similarity,10.1109/34.990133,IEEE Transactions on Pattern Analysis and Machine Intelligence,Pabitra Mitra

Unsupervised Feature Selection Using Feature Similarity   (Citations: 266)
BibTex | RIS | RefWorks Download
In this article, we describe an unsupervised feature selection algorithm suitable for data sets, large in both dimension and size. The method is based on measuring similarity between features whereby redundancy therein is removed. This does not need any search and, therefore, is fast. A new feature similarity measure, called maximum information compression index, is introduced. The algorithm is generic in nature and has the capability of multiscale representation of data sets. The superiority of the algorithm, in terms of speed and performance, is established extensively over various real-life data sets of different sizes and dimensions. It is also demonstrated how redundancy and information loss in feature selection can be quantified with an entropy measure
Journal: IEEE Transactions on Pattern Analysis and Machine Intelligence - PAMI , vol. 24, no. 3, pp. 301-312, 2002
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: