Abstract
Since streaming data keeps coming continuously as an ordered sequence, massive amounts of data is created. A big challenge in handling data streams is the limitation of time and space. Prototype selection on streaming data requires the prototypes to be updated in an incremental manner as new data comes in. We propose an incremental algorithm for prototype selection. This algorithm can also be used to handle very large datasets. Results have been presented on a number of large datasets and our method is compared to an existing algorithm for streaming data. Our algorithm saves time and the prototypes selected gives good classification accuracy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. (IT) 13, 21–27 (1967)
Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. (IT) 14(3), 515–516 (1968)
Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inf. Theor. (IT) 18(3), 431–433 (1972)
Devi, V.S., Murty, M.N.: An incremental prototype set building technique. Pattern Recogn. 35, 505–513 (2002)
Angiulli, F.: Fast condensed nearest neighbor rule. In: Proceedings of 22nd International Conference on Machine Learning (ICML 2005) (2005)
Karacali, B., Krim, H.: Fast minimization of structural risk by nearest neighbor rule. IEEE Trans. Neural Netw. 14(1), 127–134 (2003)
Law, Y.-N., Zaniolo, C.: An adaptive nearest neighbor classification algorithm for data streams. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, pp. 108–120. Springer, Heidelberg (2005)
Beringer, J., Hüllermeier, E.: Efficient instance-based learning on data streams. Intell. Data Anal. 11(6), 627–650 (2007)
Tabata, K., Sato, M., Kudo, M.: Data compression by volume prototypes for streaming data. Pattern Recogn. 43, 3162–3176 (2010)
Garcia, S., Derrac, J.: Prototype selection for nearest neighbor classification : taxonomy and empirical study. IEEE Trans. PAMI 34, 417–435 (2012)
Czarnowski, I., Jedrzejowicz, P.: Ensemble classifier for mining data streams. In: 18th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems(KES 2014), Procedia Computer Science, vol. 35, pp. 397–406 (2014)
Bien, J., Tibshirani, R.: Prototype selection for interpretable classification. Ann. Appl. Stat. 5(4), 2403–2424 (2011)
Gadodiya, S.V., Chandak, M.B.: Prototype selection algorithms for kNN classifier: a survey. Int. J. Adv. Res. Comput. Commun. Eng. (IJARCCE) 2(12) (2013)
Verbiest, N., Cornelis, C., Herrera, F.: FRPS : a fuzzy rough prototype selection method. Pattern Recogn. 46(10), 2770–2782 (2013)
Li, J., Wang, Y.: A nearest prototype selection algorithm using multi-objective optimization and partition. In: 9th International Conference on Computational Intelligence and Security, pp. 264–268, December 2013
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Meena, L., Devi, V.S. (2015). Prototype Selection on Large and Streaming Data. In: Arik, S., Huang, T., Lai, W., Liu, Q. (eds) Neural Information Processing. ICONIP 2015. Lecture Notes in Computer Science(), vol 9489. Springer, Cham. https://doi.org/10.1007/978-3-319-26532-2_74
Download citation
DOI: https://doi.org/10.1007/978-3-319-26532-2_74
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26531-5
Online ISBN: 978-3-319-26532-2
eBook Packages: Computer ScienceComputer Science (R0)