Abstract
Nowadays, the volume of data that is produced challenges our capabilities of converting it in useful knowledge. Due to this, data mining approaches have been applied for extracting useful knowledge from this big data. In order to deal with the increasing size of datasets, techniques for instance selection have been applied for reducing the data to a manageable volume and, consequently, to reduce the computational resources that are necessary to apply data mining approaches. However, most of the proposed approaches for instance selection have a high time complexity and, due to this, they cannot be applied for dealing with big data. In this paper, we propose a novel approach for instance selection called XLDIS. This approach adopts the notion of local density for selecting the most representative instances of each class of the dataset, providing a reasonably low time complexity. The approach was evaluated on 20 well-known datasets used in a classification task, and its performance was compared to those of 6 state-of-the-art algorithms, considering three measures: accuracy, reduction, and effectiveness. All the obtained results show that, in general, the XLDIS algorithm provides the best trade-off between accuracy and reduction.
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/317040648_XLDIS_eXtended_Local_Density-based_Instance_Selection.
- 2.
This dataset combines the large soybean dataset and its corresponding test dataset.
- 3.
References
Brighton, H., Mellish, C.: Advances in instance selection for instance-based learning algorithms. Data Min. Knowl. Disc. 6(2), 153–172 (2002)
Caises, Y., González, A., Leyva, E., Pérez, R.: Combining instance selection methods based on data characterization: an approach to increase their effectiveness. Inf. Sci. 181(20), 4780–4798 (2011)
Carbonera, J.L., Abel, M.: A cognition-inspired knowledge representation approach for knowledge-based interpretation systems. In: Proceedings of 17th ICEIS, pp. 644–649 (2015)
Carbonera, J.L., Abel, M.: A cognitively inspired approach for knowledge representation and reasoning in knowledge-based systems. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015) (2015)
Carbonera, J.L., Abel, M.: Extended ontologies: a cognitively inspired approach. In: Proceedings of the 7th Ontology Research Seminar in Brazil (Ontobras) (2015)
Carbonera, J.L., Abel, M.: Categorical data clustering: a correlation-based approach for unsupervised attribute weighting. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 259–263. IEEE (2014)
Carbonera, J.L., Abel, M.: An entropy-based subspace clustering algorithm for categorical data. In: 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 272–277. IEEE (2014)
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)
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)
Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21–27 (1967)
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)
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)
Liu, H., Motoda, H.: On issues of instance selection. Data Min. Knowl. Disc. 6(2), 115–130 (2002)
Nikolaidis, K., Goulermas, J.Y., Wu, Q.: A class boundary preserving algorithm for data condensation. Pattern Recogn. 44(3), 704–715 (2011)
Slaney, M., Casey, M.: Locality-sensitive hashing for finding nearest neighbors [lecture notes]. IEEE Signal Process. Mag. 25(2), 128–131 (2008)
Tomek, I.: An experiment with the edited nearest-neighbor rule. IEEE Trans. Syst. Man. Cybern. SMC–6(6), 448–452 (1976)
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)
Acknowledgment
The author would like to thank IBM Research for the support to this work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Carbonera, J.L. (2017). An Efficient Approach for Instance Selection. In: Bellatreche, L., Chakravarthy, S. (eds) Big Data Analytics and Knowledge Discovery. DaWaK 2017. Lecture Notes in Computer Science(), vol 10440. Springer, Cham. https://doi.org/10.1007/978-3-319-64283-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-64283-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64282-6
Online ISBN: 978-3-319-64283-3
eBook Packages: Computer ScienceComputer Science (R0)