Skip to main content

2015 | OriginalPaper | Buchkapitel

Prototype Selection on Large and Streaming Data

verfasst von : Lakhpat Meena, V. Susheela Devi

Erschienen in: Neural Information Processing

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. (IT) 13, 21–27 (1967)CrossRefMATH Cover, T.M., Hart, P.E.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theor. (IT) 13, 21–27 (1967)CrossRefMATH
2.
Zurück zum Zitat Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. (IT) 14(3), 515–516 (1968)CrossRef Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Inf. Theor. (IT) 14(3), 515–516 (1968)CrossRef
3.
Zurück zum Zitat Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inf. Theor. (IT) 18(3), 431–433 (1972)CrossRef Gates, G.W.: The reduced nearest neighbour rule. IEEE Trans. Inf. Theor. (IT) 18(3), 431–433 (1972)CrossRef
4.
Zurück zum Zitat Devi, V.S., Murty, M.N.: An incremental prototype set building technique. Pattern Recogn. 35, 505–513 (2002)CrossRefMATH Devi, V.S., Murty, M.N.: An incremental prototype set building technique. Pattern Recogn. 35, 505–513 (2002)CrossRefMATH
5.
Zurück zum Zitat Angiulli, F.: Fast condensed nearest neighbor rule. In: Proceedings of 22nd International Conference on Machine Learning (ICML 2005) (2005) Angiulli, F.: Fast condensed nearest neighbor rule. In: Proceedings of 22nd International Conference on Machine Learning (ICML 2005) (2005)
6.
Zurück zum Zitat Karacali, B., Krim, H.: Fast minimization of structural risk by nearest neighbor rule. IEEE Trans. Neural Netw. 14(1), 127–134 (2003)CrossRef Karacali, B., Krim, H.: Fast minimization of structural risk by nearest neighbor rule. IEEE Trans. Neural Netw. 14(1), 127–134 (2003)CrossRef
7.
Zurück zum Zitat 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) CrossRef 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) CrossRef
8.
Zurück zum Zitat Beringer, J., Hüllermeier, E.: Efficient instance-based learning on data streams. Intell. Data Anal. 11(6), 627–650 (2007) Beringer, J., Hüllermeier, E.: Efficient instance-based learning on data streams. Intell. Data Anal. 11(6), 627–650 (2007)
9.
Zurück zum Zitat Tabata, K., Sato, M., Kudo, M.: Data compression by volume prototypes for streaming data. Pattern Recogn. 43, 3162–3176 (2010)CrossRefMATH Tabata, K., Sato, M., Kudo, M.: Data compression by volume prototypes for streaming data. Pattern Recogn. 43, 3162–3176 (2010)CrossRefMATH
10.
Zurück zum Zitat Garcia, S., Derrac, J.: Prototype selection for nearest neighbor classification : taxonomy and empirical study. IEEE Trans. PAMI 34, 417–435 (2012)CrossRef Garcia, S., Derrac, J.: Prototype selection for nearest neighbor classification : taxonomy and empirical study. IEEE Trans. PAMI 34, 417–435 (2012)CrossRef
11.
Zurück zum Zitat 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) 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)
12.
13.
Zurück zum Zitat 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) 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)
14.
Zurück zum Zitat Verbiest, N., Cornelis, C., Herrera, F.: FRPS : a fuzzy rough prototype selection method. Pattern Recogn. 46(10), 2770–2782 (2013)CrossRefMATH Verbiest, N., Cornelis, C., Herrera, F.: FRPS : a fuzzy rough prototype selection method. Pattern Recogn. 46(10), 2770–2782 (2013)CrossRefMATH
15.
Zurück zum Zitat 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 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
Metadaten
Titel
Prototype Selection on Large and Streaming Data
verfasst von
Lakhpat Meena
V. Susheela Devi
Copyright-Jahr
2015
DOI
https://doi.org/10.1007/978-3-319-26532-2_74