Pages that link to "Item:Q1568531"

The following pages link to Reduction techniques for instance-based learning algorithms (Q1568531):

Displaying 47 items.

• Efficient editing and data abstraction by finding homogeneous clusters (Q287759) (← links)
• A disk-aware algorithm for time series motif discovery (Q408596) (← links)
• A class boundary preserving algorithm for data condensation (Q622019) (← links)
• Missing-values adjustment for mixed-type data (Q642434) (← links)
• A method of learning weighted similarity function to improve the performance of nearest neighbor (Q730907) (← links)
• Prototype selection for interpretable classification (Q765979) (← links)
• FRPS: a fuzzy rough prototype selection method (Q888570) (← links)
• A concept drift-tolerant case-base editing technique (Q901035) (← links)
• A memetic algorithm for evolutionary prototype selection: A scaling up approach (Q931710) (← links)
• IFS-CoCo: instance and feature selection based on cooperative coevolution with nearest neighbor rule (Q962801) (← links)
• Prototype selection algorithms for distributed learning (Q962819) (← links)
• Mining competent case bases for case-based reasoning (Q1028971) (← links)
• Learning good prototypes for classification using filtering and abstraction of instances (Q1601566) (← links)
• IRAHC: instance reduction algorithm using hyperrectangle clustering (Q1677859) (← links)
• A new nearest neighbor classification algorithm based on local probability centers (Q1718136) (← links)
• Improved extension neural network and its applications (Q1718742) (← links)
• An efficient prototype merging strategy for the condensed 1-NN rule through class-conditional hierarchical clustering (Q1856699) (← links)
• A fast nearest neighbor classifier based on self-organizing incremental neural network (Q1932126) (← links)
• Ordered hypothesis machines (Q1932942) (← links)
• A cooperative coevolutionary algorithm for instance selection for instance-based learning (Q1959558) (← links)
• Bayesian instance selection for the nearest neighbor rule (Q1959627) (← links)
• Incremental exemplar learning schemes for classification on embedded devices (Q2036259) (← links)
• A new parallel data geometry analysis algorithm to select training data for support vector machine (Q2142956) (← links)
• Discovery of time series motifs on Intel many-core systems (Q2206993) (← links)
• Classification with label noise: a Markov chain sampling framework (Q2218376) (← links)
• Enhancing techniques for learning decision trees from imbalanced data (Q2228292) (← links)
• An approach to data reduction and integrated machine classification (Q2269084) (← links)
• Rough-fuzzy weighted \(k\)-nearest leader classifier for large data sets (Q2270790) (← links)
• Using pre \& post-processing methods to improve binding site predictions (Q2270825) (← links)
• An improved oversampling algorithm based on the samples' selection strategy for classifying imbalanced data (Q2298314) (← links)
• Comparison of prototype selection algorithms used in construction of neural networks learned by SVD (Q2316470) (← links)
• Design of nearest neighbor classifiers: Multi-objective approach (Q2386123) (← links)
• Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces (Q2498675) (← links)
• A novel gray-based reduced NN classification method (Q2507060) (← links)
• Prototype selection for dissimilarity-based classifiers (Q2575824) (← links)
• A discriminant analysis using composite features for classification problems (Q2643879) (← links)
• Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN) (Q2654256) (← links)
• An information-theoretic instance-based classifier (Q2666796) (← links)
• Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem (Q3016271) (← links)
• From Supervised Instance and Feature Selection Algorithms to Dual Selection: A Review (Q3297373) (← links)
• Statistical inference and data mining: false discoveries control (Q3298620) (← links)
• A Hybrid Approach of Boosting Against Noisy Data (Q3627899) (← links)
• A method to enrich experimental datasets by means of numerical simulations in view of classification tasks (Q5034812) (← links)
• NP-hardness of some data cleaning problem (Q5100127) (← links)
• GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING (Q5311630) (← links)
• Enhancing Density-Based Data Reduction Using Entropy (Q5473194) (← links)
• An algorithm for reducing the dimension and size of a sample for data exploration procedures (Q5494417) (← links)