Hit miss networks with applications to instance selection

MaRDI QIDQ3096143zbMATH OpenFDO

Authors Elena Marchiori

Publication date 8 November 2011

Full work available at URL http://www.jmlr.org/papers/v9/marchiori08a.html

zbMATH Keywords

graph-based training set representationinstance selection for instance-based learningnearest neighbor

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Advances in instance selection for instance-based learning algorithms
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Reduction techniques for instance-based learning algorithms
• Artificial Intelligence and Soft Computing - ICAISC 2004
• Bayesian instance selection for the nearest neighbor rule

Cited in

(8)

• Advances in instance selection for instance-based learning algorithms
• IRAHC: instance reduction algorithm using hyperrectangle clustering
• Evidential instance selection for \(K\)-nearest neighbor classification of big data
• Comparison of prototype selection algorithms used in construction of neural networks learned by SVD
• A method to enrich experimental datasets by means of numerical simulations in view of classification tasks
• A class boundary preserving algorithm for data condensation
• FRPS: a fuzzy rough prototype selection method
• IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule

This page was built for publication: Hit miss networks with applications to instance selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096143)