Characterizing the scale dimension of a high-dimensional classification problem

DOI10.1016/S0031-3203(02)00042-0zbMath1027.68690MaRDI QIDQ1856632

David J. Marchette, Carey E. Priebe

Publication date: 11 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)

zbMATH Keywords

classification; random graph; high-dimensional data; exploratory data analysis; interpoint distance; class cover; artificial nose; reduced kernel estimator; scale dimension

Mathematics Subject Classification ID

68T10: Pattern recognition, speech recognition

68U99: Computing methodologies and applications

Related Items

A new family of random graphs for testing spatial segregation, A general SLLN for the one-dimensional class cover problem, Class cover catch digraphs for latent class discovery in gene expression monitoring by DNA microarrays, Relative density of the random \(R\)-factor proximity catch digraph for testing spatial patterns of segregation and association, The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data, A CLT for a one-dimensional class cover problem, A new family of proximity graphs: class cover catch digraphs, The use of domination number of a random proximity catch digraph for testing spatial patterns of segregation and association

Cites Work

• Unnamed Item
• Unnamed Item
• On the distribution of the domination number for random class cover catch digraphs
• Analysis of a greedy heuristic for finding small dominating sets in graphs
• Graph theory applications
• Approximation algorithms for the class cover problem
• Classification by pairwise coupling
• Reducing multidimensional two-sample data to one-dimensional interpoint comparisons
• A digraph represented by a family of boxes or spheres
• Printer graphics for clustering