A Deep Non-linear Feature Mapping for Large-Margin kNN Classification
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
KNN is one of the most popular data mining methods for classification, but it often fails to work well with inappropriate choice of distance metric or due to the presence of numerous class-irrelevant features. Linear feature transformation methods have been widely applied to extract class-relevant information to improve kNN classification, which is very limited in many applications. Kernels have also been used to learn powerful non-linear feature transformations, but these methods fail to scale to large datasets. In this paper, we present a scalable non-linear feature mapping method based on a deep neural network pretrained with Restricted Boltzmann Machines for improving kNN classification in a large-margin framework, which we call DNet-kNN. DNet-kNN can be used for both classification and for supervised dimensionality reduction. The experimental results on two benchmark handwritten digit datasets and one newsgroup text dataset show that DNet-kNN has much better performance than large-margin kNN using a linear mapping and kNN based on a deep autoencoder pretrained with Restricted Boltzmann Machines.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Training Products of Experts by Minimizing Contrastive Divergence
Hinton, G. E. (2002) · Neural Computation · doi:10.1162/089976602760128018 · Cited by 4,879 · cited 1×
“In practice, we do not have to sample from the equilibrium distribution of the model, and even one-step reconstruction samples work very well [9].”
Greedy layer-wise training of deep networks
Bengio, Y., Lamblin, P., Popovici, D., & Larochelle, H. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0024 · Cited by 4,841
Cited by
Learning Deep Representation for Imbalanced Classification
Huang, C., Li, Y., Loy, C. C., & Tang, X. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.580 · Cited by 988
A Survey of Handwritten Character Recognition with MNIST and EMNIST
Baldominos, A., Saez, Y., & Isasi, P. (2019) · Applied Sciences · doi:10.3390/app9153169 · Cited by 279
Mehdiyev, N., & Fettke, P. (2021) · Studies in Computational Intelligence · doi:10.1007/978-3-030-64949-4_1 · Cited by 78
Recognition of Fetal Facial Ultrasound Standard Plane Based on Texture Feature Fusion
Wang, X., Liu, Z., Du, Y., Diao, Y., Liu, P., Lv, G., & Zhang, H. (2021) · Computational and Mathematical Methods in Medicine · doi:10.1155/2021/6656942 · Cited by 23
“In this stage, we introduce the K -nearest neighbor classi fi er (KNN) [45] and naive Bayes classi fi er (NB) [46].”
MethodInfluentialRapid On-Site AI-Assisted Grading for Lung Surgery Based on Optical Coherence Tomography
Liu, H.-C., Lin, M.-H., Chang, W.-C., Zeng, R.-C., Wang, Y.-M., & Sun, C.-W. (2023) · Cancers · doi:10.3390/cancers15225388 · Cited by 9
Metadata
- Authors
- Min, R., Stanley, D. A., Yuan, Z., Bonner, A., & Zhang, Z.
- Venue
- 2009 Ninth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2009-12
- Pages
- 357-366
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2135624716
- Cited by
- 83
- References
- 2
- FWCI
- 2.35
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Deep Non-linear Feature Mapping for Large-Margin kNN Classification. https://app.cochat.ai/papers/10.1109/icdm.2009.27
- The paper
- Min, R., Stanley, D. A., Yuan, Z., Bonner, A., & Zhang, Z. (2009). A Deep Non-linear Feature Mapping for Large-Margin kNN Classification. 2009 Ninth IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2009.27
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.