Abstract
Nowadays, machine learning and data mining approaches have been applied in huge volumes of data. In order to deal with this big data, techniques for prototype selection have been applied for reducing the data to a manageable volume and, consequently, for reducing the computational resources that are necessary to apply machine learning approaches. In this paper, we propose an efficient approach for prototype selection called PSSA. It adopts the notion of spatial partition for efficiently splitting the dataset in sets of similar instances. In a second step, the algorithm creates one prototype for each spatial partition and, finally, it selects the prototypes of the densest spatial partitions and that are far from other prototypes that were already selected. The approach was evaluated on 15 well-known datasets used in a classification task, and its performance was compared to those of 6 state-of-the-art algorithms, considering two measures: accuracy and reduction. All the obtained results show that, in general, the proposed approach provides a good trade-off between accuracy and reduction, with a significantly lower running time, when compared to other approaches.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Anwar, I.M., Salama, K.M., Abdelbar, A.M.: Instance selection with ant colony optimization. Procedia Comput. Sci. 53, 248–256 (2015)
Arnaiz-González, Á., Díez-Pastor, J.F., Rodríguez, J.J., García-Osorio, C.: Instance selection of linear complexity for big data. Knowl. Based Syst. 107, 83–95 (2016)
Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Min. Knowl. Discov. 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). IEEE (2017)
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
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, 2006, ICPR 2006, vol. 2, pp. 556–559. IEEE (2006)
Fan, W., Bifet, A.: Mining big data: current status, and forecast to the future. ACM sIGKDD Explor. Newsl. 14(2), 1–5 (2013)
García, S., Luengo, J., Herrera, F.: Data Preprocessing in Data Mining. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-10247-4
Gates, G.W.: Reduced nearest neighbor rule. IEEE Trans. Inf. Theory 18(3), 431–433 (1972)
Hamidzadeh, J., Monsefi, R., Yazdi, H.S.: IRAHC: Instance reduction algorithm using hyperrectangle clustering. Pattern Recogn. 48(5), 1878–1889 (2015)
Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theory 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)
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
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Carbonera, J.L., Abel, M. (2018). An Efficient Prototype Selection Algorithm Based on Spatial Abstraction. In: Ordonez, C., Bellatreche, L. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2018. Lecture Notes in Computer Science(), vol 11031. Springer, Cham. https://doi.org/10.1007/978-3-319-98539-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-98539-8_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98538-1
Online ISBN: 978-3-319-98539-8
eBook Packages: Computer ScienceComputer Science (R0)