Blind Data Classification Using Hyper-Dimensional Convex Polytopes

Brent T. McBride and Gilbert L. Peterson

A blind classification algorithm is presented that uses hyperdimensional geometric algorithms to locate a hypothesis, in the form of a convex polytope or hyper-sphere. The convex polytope geometric model provides a well-fitted class representation that does not require training with instances of opposing classes. Further, the classification algorithm creates models for as many training classes of data as are available resulting in a hybrid anomaly/signature-based classifier. A method for handling non-numeric data types is explained. Classification accuracy is enhanced through the introduction of a tolerance metric, ß, which compensates for intra-class disjunctions, statistical outliers, and input noise in the training data. The convex polytope classification algorithm is successfully tested with the voting database from the UCI Machine Learning Repository (Blake and Merz 1998), and compared to a simpler geometric model using hyper-spheres derived from the k-means clustering algorithm. Testing results show the convex polytope model’s tighter fit in the attribute space provides superior blind data classification.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.