Skip to main content

Unsupervised Modified Adaptive Floating Search Feature Selection

  • Conference paper
Advances in Computing and Communications (ACC 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 191))

Included in the following conference series:

  • 1397 Accesses

Abstract

In feature selection, a search problem of finding a subset of features from a given set of measurements has been of interest for a long time. An unsupervised criterion, based on SVD-entropy (Singular Value Decomposition), selects a feature according to its contribution to the entropy (CE) calculated on a leave-one-out basis. Based on this criterion, this paper proposes a Modified Adaptive Floating Search feature selection method (MAFS) with flexible backtracking capabilities. Experimental results show that the proposed method performs better in selecting an optimal set of the relevant features. Features thus selected are evaluated using K-Means clustering algorithm. The clusters are validated by comparing the clustering results with the known classification. It is found that the clusters formed with selected features are as good as clusters formed with all features.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Handl, J., Knowles, J.: Feature Subset Selection in Unsupervised Learning via Multiobjective Optimization. International Journal of Computational Intelligence Research 2(3), 217–238 (2006)

    Article  MathSciNet  Google Scholar 

  2. Guyon, I., Elisseeff, A.: An Introduction to Variable and Feature Selection. Journal of Machine Learning Research 3, 1157–1182 (2003)

    MATH  Google Scholar 

  3. Liu, H., Li, J., Wong, L.: A Comparative Study on Feature Selection and Classification Methods Using Gene Expression Profiles and Proteomic Patterns. In: Lathrop, R., Miyano, K.N.S., Takagi, T., Kanehisa, M. (eds.) 13th International Conference on Genome Informatics, pp. 51–60. Universal Academy Press, Tokyo (2002)

    Google Scholar 

  4. Herrero, J., Diaz-Uriarte, R., Dopazo, J.: Gene expression data preprocessing. Bioinformatics 19, 655–656 (2003)

    Article  Google Scholar 

  5. Ding, C.H.Q.: Unsupervised Feature Selection Via Two-way Ordering in Gene Expression Analysis. Bioinformatics 19, 1259–1266 (2003)

    Article  Google Scholar 

  6. Hastie, T., Tibshirani, R., Eisen, M., Alizadeh, A., Levy, R., Staudt, L., Chan, W., Botstein, D., Brown, P.: Gene Shaving as a method for identifying distinct sets of genes with similar expression patterns. Genome Biology (2000)

    Google Scholar 

  7. Varshavsky, R., Gottlieb, A., Linial, M., Horn, D.: Novel Unsupervised Feature Filtering of Biological Data. Bioinformatics 283, 1–5 (2005)

    Google Scholar 

  8. Liu, H., Yu, L.: Towards Integrating Feature Selection Algorithms for Classification and Clustering. IEEE Transactions on Knowledge and Data Engineering 17, 491–502 (2005)

    Article  Google Scholar 

  9. Dy, J.G., Brodley, C.E.: Feature selection for unsupervised learning. Journal of Machine Learning Research 889, 845 (2004)

    MathSciNet  MATH  Google Scholar 

  10. Mitra, P., Murthy, C.A., Pal, S.K.: Unsupervised feature selection using feature similarity. IEEE Transactions on Pattern Analysis and Machine intelligence 312, 301 (2002)

    Article  Google Scholar 

  11. Sondberg-Madsen, N., Thomsen, C., Pena, J.M.: Unsupervised feature subset selection. In: Proceedings of the Workshop on Probabilistic Graphical Models for Classification, vol. 82, p. 71 (2003)

    Google Scholar 

  12. Guo, D., Gahegan, M., Peuquet, D., MacEachren, A.: Breaking down dimensionality: An effective feature selection method for high-dimensional clustering. In: Proceedings of the Third SIAM International Conference on Data Mining, vol. 42, p. 29 (2003)

    Google Scholar 

  13. Dash, M., Liu, H.: Handling large unsupervised data via dimensionality reduction. In: Proceedings of the ACM SIGMOD Workshop on Research Numbers in Data Mining and Knowledge Discovery (1999)

    Google Scholar 

  14. Alter, O., Brown, P.O., Botstein, D.: Singular value decomposition for genome-wide expression data processing and modeling. PNAS 97, 10101–10106 (2000)

    Article  Google Scholar 

  15. Somol, P., Pudil, P., Novovicova, J., Paclik, P.: Adaptive Floating Search Methods in Feature Selection. Pattern Recognition Letters 20, 1157–1163 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Devakumari, D., Thangavel, K. (2011). Unsupervised Modified Adaptive Floating Search Feature Selection. In: Abraham, A., Lloret Mauri, J., Buford, J.F., Suzuki, J., Thampi, S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22714-1_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22714-1_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22713-4

  • Online ISBN: 978-3-642-22714-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics