LiNearN: a new approach to nearest neighbour density estimator
From MaRDI portal
Publication:2629871
DOI10.1016/j.patcog.2014.01.013zbMath1339.68239MaRDI QIDQ2629871
Jonathan R. Wells, Kai Ming Ting, Takashi Washio
Publication date: 7 July 2016
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.01.013
62H12: Estimation in multivariate analysis
62H30: Classification and discrimination; cluster analysis (statistical aspects)
68Q25: Analysis of algorithms and problem complexity
68T10: Pattern recognition, speech recognition
Related Items
Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms, Defying the gravity of learning curve: a characteristic of nearest neighbour anomaly detectors
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Bagging predictors
- Improved \(k\)-nearest neighbor classification
- A law of large numbers for nearest neighbour statistics
- Asymptotic moments of near–neighbour distance distributions
- A Nonparametric Estimate of a Multivariate Density Function
- An incremental prototype set building technique