Intelligent Selection of Instances for Prediction Functions in LazyLearning Algorithms

  • Authors:
  • Jianping Zhang;Yee-Sat Yim;Jumming Yang

  • Affiliations:
  • jianping@zhang.cs.usu.edu;Computer Science Department, Utah State University, Logan, UT 84322-4205;slw8p@cc.usu.edu

  • Venue:
  • Artificial Intelligence Review - Special issue on lazy learning
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Lazy learning methods for function prediction use different predictionfunctions. Given a set of stored instances, a similarity measure, and a novelinstance, a prediction function determines the value of the novel instance.A prediction function consists of three components: a positive integer kspecifying the number of instances to be selected, a method for selectingthe k instances, and a method for calculating the value of the novelinstance given the k selected instances. This paper introduces a novelmethod called k surrounding neighbor (k-SN) for intelligentlyselecting instances and describes a simple k-SN algorithm. Unlike k nearestneighbor (k-NN), k-SN selects k instancesthat surround the novel instance. We empirically compared k-SN withk-NN using the linearly weighted average and local weightedregression methods. The experimental results show that k-SNoutperforms k-NN with linearly weighted average and performs slightlybetter than k-NN with local weighted regression for the selecteddatasets.