FCNN-MR: A Parallel Instance Selection Method Based on Fast Condensed Nearest Neighbor Rule

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Journal of information and communication convergence engineering

• Publication date

  2017-06-01

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Voting-based instance selection from large data sets with MapReduce and random weight networks

  2016cited by this paper
• A fuzzy-rough nearest neighbor classifier combined with consistency-based subset evaluation and instance selection for automated diagnosis of breast cancer

  2015cited by this paper
• MRPR: A MapReduce solution for prototype reduction in big data classification

  2015influential reference
• IRAHC: Instance Reduction Algorithm using Hyperrectangle Clustering

  2015cited by this paper
• Learning to detect representative data for large scale instance selection

  2015cited by this paper
• Data Preprocessing in Data Mining

  2014cited by this paper
• A Taxonomy and Experimental Study on Prototype Generation for Nearest Neighbor Classification

  2012cited by this paper
• A new fast prototype selection method based on clustering

  2010cited by this paper
• A divide-and-conquer recursive approach for scaling up instance selection algorithms

  2009influential reference
• MapReduce: simplified data processing on large clusters

  2008influential reference
• Fast Nearest Neighbor Condensation for Large Data Sets Classification

  2007cited by this paper
• The Generalized Condensed Nearest Neighbor Rule as A Data Reduction Method

  2006cited by this paper
• Fast condensed nearest neighbor rule

  2005cited by this paper
• Stratification for scaling up evolutionary prototype selection

  2005influential reference
• Using evolutionary algorithms as instance selection for data reduction in KDD: an experimental study

  2003cited by this paper
• On Issues of Instance Selection

  2002cited by this paper
• An incremental prototype set building technique

  2002cited by this paper
• M: Cluster Analysis

  2001cited by this paper
• Reduction Techniques for Instance-Based Learning Algorithms

  2000cited by this paper
• Comparison of algorithms that select features for pattern classifiers

  2000cited by this paper
• The Reduced Nearest Neighbor Rule

  1998cited by this paper
• Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms

  1994cited by this paper
• Asymptotic Properties of Nearest Neighbor Rules Using Edited Data

  1972cited by this paper
• The Condensed Nearest Neighbor Rule

  1967cited by this paper
• Nearest neighbor pattern classification

  1967cited by this paper

• SpIS: A stochastic approximation approach to minimal subset instance selection

  2025cites this paper
• Practical big data techniques for end-to-end machine learning deployment: a comprehensive review

  2025cites this paper
• A stochastic approximation approach to fixed instance selection

  2023cites this paper