Efficient data abstraction using weighted IB2 prototypes

Data reduction techniques improve the efficiency of k-Nearest Neighbour classification on large datasets since they accelerate the classification process and reduce storage requirements for the training data. IB2 is an effective prototype selection data reduction technique. It selects some items from the initial training dataset and uses them as representatives (prototypes). Contrary to many other techniques, IB2 is a very fast, one-pass method that builds its reduced (condensing) set in an incremental manner. New training data can update the condensing set without the need of the “old” removed items. This paper proposes a variation of IB2, that generates new prototypes instead of selecting them. The variation is called AIB2 and attempts to improve the efficiency of IB2 by positioning the prototypes in the center of the data areas they represent. The empirical experimental study conducted in the present work as well as the Wilcoxon signed ranks test show that AIB2 performs better than IB2.

• Publication year

  2014

• Venue

  Computer Science and Information Systems

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.2298/CSIS140212036O
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications

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

  2012cited by this paper
• Prototype Selection for Nearest Neighbor Classification: Taxonomy and Empirical Study

  2012influential reference
• Fast and Accurate k-Nearest Neighbor Classification Using Prototype Selection by Clustering

  2012cited by this paper
• KEEL Data-Mining Software Tool: Data Set Repository, Integration of Algorithms and Experimental Analysis Framework

  2011cited by this paper
• A review of instance selection methods

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

  2010cited by this paper
• A Novel Template Reduction Approach for the K -Nearest Neighbor Method

  2009cited by this paper
• A memetic algorithm for evolutionary prototype selection: A scaling up approach

  2008cited by this paper
• Data Streams - Models and Algorithms

  2007cited by this paper
• Fast Nearest Neighbor Condensation for Large Data Sets Classification

  2007cited by this paper
• Data Reduction Techniques in Classification Processes

  2007cited by this paper
• Efficient instance-based learning on data streams

  2007cited by this paper
• Statistical Comparisons of Classifiers over Multiple Data Sets

  2006cited by this paper
• Foundations of multidimensional and metric data structures

  2006cited by this paper
• Fast condensed nearest neighbor rule

  2005cited by this paper
• Comparison of Instance Selection Algorithms II. Results and Comments

  2004cited by this paper
• Comparison of Instances Seletion Algorithms I. Algorithms Survey

  2004cited by this paper
• The problem of concept drift: definitions and related work

  2004cited by this paper
• Instance-based learning algorithms

  2004cited by this paper
• Finding representative patterns with ordered projections

  2003cited by this paper
• Advances in Instance Selection for Instance-Based Learning Algorithms

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

  2002cited by this paper
• Data set Editing by Ordered Projection

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

  2000cited by this paper
• Nearest Neighbour Editing and Condensing Tools–Synergy Exploitation

  2000cited by this paper
• A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces

  1998cited by this paper
• Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms

  1992cited by this paper
• Nearest neighbor (NN) norms: NN pattern classification techniques

  1991cited by this paper
• Two Modifications of CNN

  1976cited by this paper
• An algorithm for a selective nearest neighbor decision rule (Corresp.)

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

  1972cited by this paper
• Nearest neighbor pattern classification

  1967cited by this paper
• The Condensed Nearest Neighbor Rule

  1967cited by this paper

• Real-Time Power System Event Detection: A Novel Instance Selection Approach

  2022cites this paper
• Instance-based classification using prototypes generated from large noisy and streaming datasets

  2020cites this paper
• Exploring the effect of data reduction on Neural Network and Support Vector Machine classification

  2017cites this paper
• Efficient Support Vector Machine Classification Using Prototype Selection and Generation

  2016cites this paper
• Applying Prototype Selection and Abstraction Algorithms for Efficient Time-Series Classification

  2015cites this paper
• Efficient Support Vector Machine Classification Using Prototype Selection and Generation

  year unknowncites this paper
• Efficient Support Vector Machine Classification using Prototype Selection and Generation

  year unknowncites this paper