Learn More
Many lazy learning algorithms are derivatives of the k-nearest neighbor (k-NN) classiier, which uses a distance function to generate predictions from stored instances. Several studies have shown that k-NN's performance is highly sensitive to the dee-nition of its distance function. Many k-NN variants have been proposed to reduce this sensitivity by(More)
Indexing of cases is an important topic for Memory-Based Reasoning(MBR). One key problem is how assign weights to attributes of cases. Although several weighting methods have been proposed, some methods cannot handle numeric attributes directly, so it is necessary to discretize numeric values by classification. Furthermore, existing methods have no(More)
  • 1