A Review and Empirical Evaluation of Feature Weighting Methods for a Class of Lazy Learning Algorithms

• Published in: The Artificial intelligence review Vol. 11; no. 1-5; pp. 273 - 314
• Main Authors: Wettschereck, Dietrich, Aha, David W., Mohri, Takao
• Format: Journal Article
• Language: English
• Published: Dordrecht Springer Nature B.V 01.02.1997
• Subjects: Algorithms; Artificial intelligence; Classification; Empirical analysis; Feedback; Lazy learning; Machine learning; Parameter sensitivity; Queries; Teaching methods; Trends; Weighting; Weighting methods
• ISSN: 0269-2821; 1573-7462
• DOI: 10.1023/A:1006593614256

Many lazy learning algorithms are derivatives of the k-nearest neighbor (k-NN) classifier, 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 definition of its distance function. Many k-NN variants have been proposed to reduce this sensitivity by parameterizing the distance function with feature weights. However, these variants have not been categorized nor empirically compared. This paper reviews a class of weight-setting methods for lazy learning algorithms. We introduce a framework for distinguishing these methods and empirically compare them. We observed four trends from our experiments and conducted further studies to highlight them. Our results suggest that methods which use performance feedback to assign weight settings demonstrated three advantages over other methods: they require less pre-processing, perform better in the presence of interacting features, and generally require less training data to learn good settings. We also found that continuous weighting methods tend to outperform feature selection algorithms for tasks where some features are useful but less important than others.