Skip to main content

Prototype Selection with Compact Sets and Extended Rough Sets

  • Conference paper
  • 1834 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7637))

Abstract

In this paper, we propose a generalization of classical Rough Sets, the Nearest Neighborhood Rough Sets, by modifying the indiscernible relation without using any similarity threshold. We also combine these Rough Sets with Compact Sets, to obtain a prototype selection algorithm for Nearest Prototype Classification of mixed and incomplete data as well as arbitrarily dissimilarity functions. We introduce a set of rules to a priori predict the performance of the proposed prototype selection algorithm. Numerical experiments over repository databases show the high quality performance of the method proposed in this paper according to classifier accuracy and object reduction.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. García-Osorio, C., Haro-García, A., Gaecía-Pedrajas, N.: Democratic Instance Selection A Linear Complexity Instance Selection Algorithm Based on Classifier Ensemble Concepts. Artificial Intelligence 174(5-6), 410–441 (2010)

    Article  MathSciNet  Google Scholar 

  2. Nikolaidis, K., Goulemas, J.Y., Wu, Q.H.: A Class Boundary Preserving Algorithm for Data Condensation. Pattern Recognition 44(3), 704–715 (2011)

    Article  MATH  Google Scholar 

  3. Zafra, A., Gibaja, E.L., Ventura, S.: Multiple Instance Learning with Multiple Objective Genetic Programming for Web Mining. Applied Soft Computing 11(1), 93–102 (2011)

    Article  Google Scholar 

  4. Triguero, I., Derrac, J., García, S., Herrera, F.: A Taxonomy and Experimental Study on Prototype Generation for Nearest Neighbor Classification. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 42(1), 86–100 (2012)

    Article  Google Scholar 

  5. Caballero, Y., Bello, R., Salgado, Y., García, M.M.: A Method to Edit Training Set Based on Rough Sets. Intl. Journal of Computational Intelligence Research 3(3), 219–229 (2007)

    Google Scholar 

  6. Hu, Q., Yu, D., Liu, J., Wu, C.: Neighborhood Rough Sets Based Heterogeneous Feature Selection. Information Sciences 178(18), 3577–3594 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Pawlak, Z.: Rough Sets. Intl. Journal of Parallel Programming 11(5), 341–356 (1982)

    MATH  Google Scholar 

  8. Slowinski, R., Vanderpooten, D.: A Generalized Definition of Rough Approximations Based on Similarity. IEEE Trans. on Knowledge and Data Eng. 12(2), 331–336 (2000)

    Article  Google Scholar 

  9. Ruiz-Shulcloper, J., Guzmán-Arenas, A., Martinez Trinidad, J.F.: Logical Combinatorial Approach to Pattern Recognition Feature Selection and Supervised Classification. Editorial Politécnica, Mexico (2000)

    Google Scholar 

  10. Martínez Trinidad, J.F., Guzmán-Arenas, A.: The Logical Combinatorial Approach to Pattern Recognition An Overview through Selected Works. Pattern Recognition 34(4), 741–751 (2001)

    Article  MATH  Google Scholar 

  11. Ruiz-Shulcloper, J., Abidi, M.A.: Logical Combinatorial Pattern Recognition A Review. In: Pandalai, S.G. (ed.) Recent Research Developments in Pattern Recognition, pp. 133–176. Transword Research Networks, USA (2002)

    Google Scholar 

  12. García-Borroto, M., Villuendas-Rey, Y., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F.: Using Maximum Similarity Graphs to Edit Nearest Neighbor Classifiers. In: Bayro-Corrochano, E., Eklundh, J.-O. (eds.) CIARP 2009. LNCS, vol. 5856, pp. 489–496. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Wolpert, D.H., MacReady, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1(1), 67–82 (1997)

    Article  Google Scholar 

  14. Dasarathy, B.V., Sanchez, J.S., Townsend, S.: Nearest Neighbour Editing and Condensing Tools Synergy Exploitation. Pattern Analysis & Applications 3(1), 19–30 (2000)

    Article  Google Scholar 

  15. Merz, C.J., Murphy, P.M.: UCI Repository of Machine Learning Databases. Dept. of Information and Computer Science. University of California at Irvine, Irvine (1998)

    Google Scholar 

  16. Chou, C.H., Kuo, B.A., Cheng, F.: The Generalized Condensed Nearest Neighbor Rule as a Data Reduction Technique. In: 18th International Conference on Pattern Recognition (ICPR 2006), vol. 2, pp. 556–559. IEEE (2006)

    Google Scholar 

  17. García-Borroto, M., Villuendas-Rey, Y., Carrasco-Ochoa, J.A., Martínez-Trinidad, J.F.: Finding Small Consistent Subset for the Nearest Neighbor Classifier Based on Support Graphs. In: Bayro-Corrochano, E., Eklundh, J.-O. (eds.) CIARP 2009. LNCS, vol. 5856, pp. 465–472. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Wilson, R.D., Martinez, T.R.: Improved Heterogeneous Distance Functions. Journal of Artificial Intelligence Research 6, 1–34 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Villuendas-Rey, Y., Caballero-Mota, Y., García-Lorenzo, M.M. (2012). Prototype Selection with Compact Sets and Extended Rough Sets. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34654-5_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34653-8

  • Online ISBN: 978-3-642-34654-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics