Evaluating Usefulness for Dynamic Classification

This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as measured by error rate), as well to reduce their storage (or their derivation). We also indicate how usefulness can be applied in a dynamic setting, in which the distribution of at least one class is changing with time. Three algorithms are used to exemplify our proposals. We first review a dynamic nearest neighbour classifier, and then develop dynamic versions of Learning Vector Quantization and a Radial Basis Function network. All the algorithms are adapted to capture dynamic aspects of real-world data sets by keeping a record of usefulness as well as considering the age of the observations. These methods are tried out on real data from the credit industry.1

• Type: Conference
• Year: 1998
• Where: KDD
• Authors: Gholamreza Nakhaeizadeh, Charles Taylor, Carsten Lanquillon
• Keywords: Data Mining, Dynamic Nearest Neighbour, Dynamic Setting, KDD 1998, Radial Basis Function Network