Reduction techniques for instance-based learning algorithms
From MaRDI portal
Publication:1568531
DOI10.1023/A:1007626913721zbMath0954.68126OpenAlexW2122496402MaRDI QIDQ1568531
D. Randall Wilson, Tony R. Martinez
Publication date: 21 June 2000
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007626913721
Related Items (47)
A method to enrich experimental datasets by means of numerical simulations in view of classification tasks ⋮ Efficient editing and data abstraction by finding homogeneous clusters ⋮ A new parallel data geometry analysis algorithm to select training data for support vector machine ⋮ Design of nearest neighbor classifiers: Multi-objective approach ⋮ A discriminant analysis using composite features for classification problems ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) ⋮ An information-theoretic instance-based classifier ⋮ IRAHC: instance reduction algorithm using hyperrectangle clustering ⋮ FRPS: a fuzzy rough prototype selection method ⋮ A fast nearest neighbor classifier based on self-organizing incremental neural network ⋮ NP-hardness of some data cleaning problem ⋮ Ordered hypothesis machines ⋮ A class boundary preserving algorithm for data condensation ⋮ A disk-aware algorithm for time series motif discovery ⋮ A concept drift-tolerant case-base editing technique ⋮ Discovery of time series motifs on Intel many-core systems ⋮ Missing-values adjustment for mixed-type data ⋮ A cooperative coevolutionary algorithm for instance selection for instance-based learning ⋮ Bayesian instance selection for the nearest neighbor rule ⋮ A new nearest neighbor classification algorithm based on local probability centers ⋮ Improved extension neural network and its applications ⋮ Classification with label noise: a Markov chain sampling framework ⋮ A memetic algorithm for evolutionary prototype selection: A scaling up approach ⋮ From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review ⋮ Enhancing techniques for learning decision trees from imbalanced data ⋮ Statistical inference and data mining: false discoveries control ⋮ Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem ⋮ IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule ⋮ Prototype selection algorithms for distributed learning ⋮ An approach to data reduction and integrated machine classification ⋮ Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets ⋮ Using pre \& post-processing methods to improve binding site predictions ⋮ Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces ⋮ A novel gray-based reduced NN classification method ⋮ A method of learning weighted similarity function to improve the performance of nearest neighbor ⋮ Incremental exemplar learning schemes for classification on embedded devices ⋮ An improved oversampling algorithm based on the samples' selection strategy for classifying imbalanced data ⋮ A Hybrid Approach of Boosting Against Noisy Data ⋮ Enhancing Density-Based Data Reduction Using Entropy ⋮ Mining competent case bases for case-based reasoning ⋮ Comparison of prototype selection algorithms used in construction of neural networks learned by SVD ⋮ Prototype selection for interpretable classification ⋮ An algorithm for reducing the dimension and size of a sample for data exploration procedures ⋮ Prototype selection for dissimilarity-based classifiers ⋮ An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering ⋮ Learning good prototypes for classification using filtering and abstraction of instances
This page was built for publication: Reduction techniques for instance-based learning algorithms
