Synopsis
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Reducing the Computational Requirements of the Nearest...
Stock Image
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Seller: California Books, Miami, FL, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # I-9783346003942
Seller Image
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Print on DemandSeller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783346003942
Buy New
US$ 56.68
US$ 26.39 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Published by
GRIN Verlag, GRIN Verlag Okt 2019, 2019
ISBN 10: 3346003949
ISBN 13: 9783346003942
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783346003942
Buy New
US$ 56.68
US$ 68.85 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783346003942
Buy New
US$ 56.68
US$ 70.11 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Reducing the Computational Requirements of the Nearest Neighbor Classifier
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 117541640
Buy New
US$ 56.68
US$ 80.33 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available