Improving binary classification using filtering based on k-NN proximity graphs
Abstract One of the ways of increasing recognition ability in classification problem is removing outlier entries as well as redundant and unnecessary features from training set. Filtering and feature selection can have large impact on classifier accuracy and area under the curve (AUC), as noisy data...
Main Authors: | Maher Ala’raj, Munir Majdalawieh, Maysam F. Abbod |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2020-03-01
|
Series: | Journal of Big Data |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1186/s40537-020-00297-7 |
Similar Items
-
Radial velocity and light curves analysis of the eclipsing binary NN Vir
by: R. Pazhouhesh, et al.
Published: (2017-03-01) -
Graph-Indexed <i>k</i>NN Query Optimization on Road Network
by: Wei Jiang, et al.
Published: (2023-11-01) -
Graph Filtering for Recommendation on Heterogeneous Information Networks
by: Chuanyan Zhang, et al.
Published: (2020-01-01) -
Survey on Exact kNN Queries over High-Dimensional Data Space
by: Nimish Ukey, et al.
Published: (2023-01-01) -
Semi-invariants of binary forms and symmetrized graph-monomials
by: Shashikant Mulay
Published: (2021-03-01)