Abstract
Due to the increasing size of the datasets, prototype selection techniques have been applied for reducing the computational resources involved in data mining and machine learning tasks. In this paper, we propose a density-based approach for selecting prototypes. Firstly, it finds the density peaks in each dimension of the dataset. After that, it builds clusters of objects around these peaks. Finally, it extracts a prototype that represents each cluster and selects the most representative prototypes for including in the final reduced dataset. The proposed algorithm can deal with some crucial weak points of approaches that were previously proposed regarding the setting of parameters and the capability of dealing with high-dimensional datasets. Our method was evaluated on 14 well-known datasets used in a classification task. The performance of the proposed algorithm was compared to the performances of 8 prototype selection algorithms in terms of accuracy and reduction rate. The experimental results show that, in general, the proposed algorithm provides a good trade-off between reduction rate and the accuracy with reasonable time complexity.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The source code of the algorithm is available in https://www.researchgate.net/publication/339883322_Density-based_prototype_selection_DPS_algorithm.
- 2.
All algorithms were implemented by the authors.
- 3.
- 4.
Available in https://github.com/haifengl/smile.
References
Anwar, I.M., Salama, K.M., Abdelbar, A.M.: Instance selection with ant colony optimization. Procedia Comput. Sci. 53, 248–256 (2015)
Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Min. Knowl. Disc. 6(2), 153–172 (2002)
Carbonera, J.L.: An efficient approach for instance selection. In: Bellatreche, L., Chakravarthy, S. (eds.) DaWaK 2017. LNCS, vol. 10440, pp. 228–243. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64283-3_17
Carbonera, J.L., Abel, M.: A density-based approach for instance selection. In: 2015 IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 768–774. IEEE (2015)
Carbonera, J.L., Abel, M.: A novel density-based approach for instance selection. In: 2016 IEEE 28th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 549–556. IEEE (2016)
Carbonera, J.L., Abel, M.: Efficient prototype selection supported by subspace partitions. In: 2017 IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 921–928. IEEE (2017)
Carbonera, J.L., Abel, M.: Efficient instance selection based on spatial abstraction. In: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 286–292. IEEE (2018)
Carbonera, J.L., Abel, M.: An efficient prototype selection algorithm based on dense spatial partitions. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds.) ICAISC 2018. LNCS (LNAI), vol. 10842, pp. 288–300. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91262-2_26
Carbonera, J.L., Abel, M.: An efficient prototype selection algorithm based on spatial abstraction. In: Ordonez, C., Bellatreche, L. (eds.) DaWaK 2018. LNCS, vol. 11031, pp. 177–192. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98539-8_14
Chou, C.H., Kuo, B.H., Chang, F.: The generalized condensed nearest neighbor rule as a data reduction method. In: 18th International Conference on Pattern Recognition. ICPR 2006, vol. 2, pp. 556–559. IEEE (2006)
García, S., Luengo, J., Herrera, F.: Data Preprocessing in Data Mining. Springer, New York (2015). https://doi.org/10.1007/978-3-319-10247-4
Gates, G.W.: Reduced nearest neighbor rule. IEEE Trans. Inf. Theor. 18(3), 431–433 (1972)
Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. 14, 515–516 (1968)
Leyva, E., González, A., Pérez, R.: Three new instance selection methods based on local sets: a comparative study with several approaches from a bi-objective perspective. Pattern Recogn. 48(4), 1523–1537 (2015)
Lin, W.C., Tsai, C.F., Ke, S.W., Hung, C.W., Eberle, W.: Learning to detect representative data for large scale instance selection. J. Syst. Softw. 106, 1–8 (2015)
Nikolaidis, K., Goulermas, J.Y., Wu, Q.: A class boundary preserving algorithm for data condensation. Pattern Recogn. 44(3), 704–715 (2011)
Silverman, B.W.: Density Estimation for Statistics and Data Analysis. Routledge, London (2018)
Wilson, D.R., Martinez, T.R.: Reduction techniques for instance-based learning algorithms. Mach. Learn. 38(3), 257–286 (2000)
Wilson, D.L.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. Syst. Man Cybern. SMC 2(3), 408–421 (1972)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Carbonera, J.L., Abel, M. (2020). A Density-Based Prototype Selection Approach. In: Rutkowski, L., Scherer, R., Korytkowski, M., Pedrycz, W., Tadeusiewicz, R., Zurada, J.M. (eds) Artificial Intelligence and Soft Computing. ICAISC 2020. Lecture Notes in Computer Science(), vol 12416. Springer, Cham. https://doi.org/10.1007/978-3-030-61534-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-61534-5_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-61533-8
Online ISBN: 978-3-030-61534-5
eBook Packages: Computer ScienceComputer Science (R0)