Arbeitspapier
Weighted k-nearest-neighbor techniques and ordinal classification
In the field of statistical discrimination k-nearest neighbor classification is a well-known, easy and successful method. In this paper we present an extended version of this technique, where the distance of the nearest neighbors can be taken into account. In this sense there is a close connection to LOESS, a local regression technique. In addition we show possibilities to use nearest neighbor for classification in the case of an ordinal class structure. Empirical studies show the advantages of the new technique.
- Sprache
-
Englisch
- Erschienen in
-
Series: Discussion Paper ; No. 399
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Hechenbichler, Klaus
Schliep, Klaus
- Ereignis
-
Veröffentlichung
- (wer)
-
Ludwig-Maximilians-Universität München, Sonderforschungsbereich 386 - Statistische Analyse diskreter Strukturen
- (wo)
-
München
- (wann)
-
2004
- DOI
-
doi:10.5282/ubm/epub.1769
- Handle
- URN
-
urn:nbn:de:bvb:19-epub-1769-9
- Letzte Aktualisierung
-
10.03.2025, 11:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Arbeitspapier
Beteiligte
- Hechenbichler, Klaus
- Schliep, Klaus
- Ludwig-Maximilians-Universität München, Sonderforschungsbereich 386 - Statistische Analyse diskreter Strukturen
Entstanden
- 2004
Ähnliche Objekte (12)
Föderierte Nearest-Neighbor-Queries
Exact rate convergence of k-nearest-neighbor classification rule
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
On the risk of nearest neighbor rules
Optimized Nearest-Neighbor Classifiers Using Generated Instances
On the risk of the nearest neighbor rules
Jump-robust volatility estimation using nearest neighbor truncation
Efficient nearest neighbor search on metric time series
Fast Nearest Neighbor Search in High-Dimensional Spaces
Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice
A Graphics Hardware Accelerated Algorithm for Nearest Neighbor Search
Föderierte Nearest-Neighbor-Queries
Exact rate convergence of k-nearest-neighbor classification rule
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
On the risk of nearest neighbor rules
Optimized Nearest-Neighbor Classifiers Using Generated Instances
On the risk of the nearest neighbor rules
Jump-robust volatility estimation using nearest neighbor truncation
Efficient nearest neighbor search on metric time series
Fast Nearest Neighbor Search in High-Dimensional Spaces
Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice
A Graphics Hardware Accelerated Algorithm for Nearest Neighbor Search
Föderierte Nearest-Neighbor-Queries
Exact rate convergence of k-nearest-neighbor classification rule
Bias in nearest-neighbor hazard estimation
Bias in nearest-neighbor hazard estimation
On the risk of nearest neighbor rules
Optimized Nearest-Neighbor Classifiers Using Generated Instances
On the risk of the nearest neighbor rules
Jump-robust volatility estimation using nearest neighbor truncation
Efficient nearest neighbor search on metric time series
Fast Nearest Neighbor Search in High-Dimensional Spaces
Green functions for nearest- and next-nearest-neighbor hopping on the Bethe lattice