Sinossi
Doctoral Thesis / Dissertation from the year 2018 in the subject Engineering - Computer Engineering, Jawaharlal Nehru University , language: English, abstract: The tremendous growth of data due to the Internet and electronic commerce has created serious challenges to the researches in pattern recognition. There is a need of processing and analysing data. Advances in data mining and knowledge discovery provide the requirement of new approaches to reduce the data. In this work, methods are proposed to overcome the computational requirements of the nearest neighbor classifiers. The work shows some of the possible remedies to overcome problems with nearest neighbor based classifiers. The work proposes a new method of reducing the data set size. The author reduces the data set size in terms of number of samples and also in terms of number of features. Therefore, the holistic goal of the work is to reduce the time and space requirements and at the same time not to degrade the performance of the nearest neighbor classifier. The nearest neighbor classifier is a popular non-parametric classifier used in many fields since the 1950s. It is conceptually a simple classifier and shows good performance.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Reducing the Computational Requirements of the Nearest...
Foto dell'editore
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. Codice articolo I-9783346003942
Compra nuovo
EUR 62,83
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Print on DemandDa: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Doctoral Thesis / Dissertation from the year 2018 in the subject Engineering - Computer Engineering, Jawaharlal Nehru University , language: English, abstract: The tremendous growth of data due to the Internet and electronic commerce has created serious challenges to the researches in pattern recognition. There is a need of processing and analysing data. Advances in data mining and knowledge discovery provide the requirement of new approaches to reduce the data.In this work, methods are proposed to overcome the computational requirements of the nearest neighbor classifiers. The work shows some of the possible remedies to overcome problems with nearest neighbor based classifiers. The work proposes a new method of reducing the data set size. The author reduces the data set size in terms of number of samples and also in terms of number of features. Therefore, the holistic goal of the work is to reduce the time and space requirements and at the same time not to degrade the performance of the nearest neighbor classifier.The nearest neighbor classifier is a popular non-parametric classifier used in many fields since the 1950s. It is conceptually a simple classifier and shows good performance. 144 pp. Englisch. Codice articolo 9783346003942
Compra nuovo
EUR 47,95
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Editore:
GRIN Verlag, GRIN Verlag Okt 2019, 2019
ISBN 10: 3346003949
ISBN 13: 9783346003942
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Doctoral Thesis / Dissertation from the year 2018 in the subject Engineering - Computer Engineering, Jawaharlal Nehru University , language: English, abstract: The tremendous growth of data due to the Internet and electronic commerce has created serious challenges to the researches in pattern recognition. There is a need of processing and analysing data. Advances in data mining and knowledge discovery provide the requirement of new approaches to reduce the data. In this work, methods are proposed to overcome the computational requirements of the nearest neighbor classifiers. The work shows some of the possible remedies to overcome problems with nearest neighbor based classifiers. The work proposes a new method of reducing the data set size. The author reduces the data set size in terms of number of samples and also in terms of number of features. Therefore, the holistic goal of the work is to reduce the time and space requirements and at the same time not to degrade the performance of the nearest neighbor classifier. The nearest neighbor classifier is a popular non-parametric classifier used in many fields since the 1950s. It is conceptually a simple classifier and shows good performance.GRIN Publishing GmbH, Waltherstraße 23, 80337 München 144 pp. Englisch. Codice articolo 9783346003942
Compra nuovo
EUR 47,95
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Doctoral Thesis / Dissertation from the year 2018 in the subject Engineering - Computer Engineering, Jawaharlal Nehru University , language: English, abstract: The tremendous growth of data due to the Internet and electronic commerce has created serious challenges to the researches in pattern recognition. There is a need of processing and analysing data. Advances in data mining and knowledge discovery provide the requirement of new approaches to reduce the data.In this work, methods are proposed to overcome the computational requirements of the nearest neighbor classifiers. The work shows some of the possible remedies to overcome problems with nearest neighbor based classifiers. The work proposes a new method of reducing the data set size. The author reduces the data set size in terms of number of samples and also in terms of number of features. Therefore, the holistic goal of the work is to reduce the time and space requirements and at the same time not to degrade the performance of the nearest neighbor classifier.The nearest neighbor classifier is a popular non-parametric classifier used in many fields since the 1950s. It is conceptually a simple classifier and shows good performance. Codice articolo 9783346003942
Compra nuovo
EUR 47,95
Spedizione EUR 61,10
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Reducing the Computational Requirements of the Nearest Neighbor Classifier | Raja Kumar | Taschenbuch | 144 S. | Englisch | 2019 | GRIN Verlag | EAN 9783346003942 | Verantwortliche Person für die EU: GRIN Publishing GmbH, Waltherstr. 23, 80337 München, info[at]grin[dot]com | Anbieter: preigu. Codice articolo 117541640
Compra nuovo
EUR 47,95
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili