Characterizing the scale dimension of a high-dimensional classification problem

✍ Scribed by David J. Marchette; Carey E. Priebe

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 452 KB
• Volume: 36
• Category: Article
• ISSN: 0031-3203
• DOI: 10.1016/s0031-3203(02)00042-0

✦ Synopsis

Classiÿcation of high-dimensional data is inherently di cult. We present an exploratory data analysis methodology for characterizing the scale dimension of a classiÿcation problem. The idea is to characterize the support of one distinguished target class as a collection of balls covering the class, with each ball centered at an observation in that class such that the radius is maximal without containing observations from the other classes. The scale dimension is deÿned to be the number of distinct radii (ball sizes) required to cover the class without covering observations from the other class. A greedy algorithm is used to ÿt the balls. The balls then provide a description of the support of the target class, with information about the complexity of the classiÿcation problem implicit in the number, radii, adjacency and position of the balls. Clustering the balls by radius and pruning the cluster tree yields an estimate of the scale dimension for the problem. We illustrate the methodology with pedagogical simulations and a chemical sensor data analysis application. Published by Elsevier Science Ltd on behalf of Pattern Recognition Society.