Effective supra-classifiers for knowledge base construction

Abstract We explore the use of the supra-classifier framework in the construction of a classifier knowledge base. Previously, we introduced this framework within which labels produced by old classifiers are used to improve the generalization performance of a new classifier for a different but related classification task ( Bollacker and Ghosh, 1998 ). We showed empirically that a simple Hamming nearest neighbor is superior to other techniques (e.g., multilayer perception (MLP), decision trees, Naive Bayes, Combiners) as a supra-classifier. Here, we describe theoretically how the probability that the Hamming nearest neighbor supra-classifier will predict the true target class approaches certainty at an exponential rate as more classifiers are reused. The scalability of the Hamming nearest neighbor with large numbers of previously created classifiers makes it a good choice as a supra-classifier in the application of building a repository of domain knowledge organized as a classifier knowledge base .

[1]  Joydeep Ghosh,et al.  A Supra-Classifier Architecture for Scalable Knowledge Reuse , 1998, ICML.

[2]  Philippe Flajolet,et al.  Analysis of algorithms , 2000, Random Struct. Algorithms.

[3]  Joydeep Ghosh,et al.  On the design of supra-classifiers for knowledge reuse , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[4]  Marko Balabanovic,et al.  An adaptive Web page recommendation service , 1997, AGENTS '97.

[5]  Filippo Menczer,et al.  ARACHNID: Adaptive Retrieval Agents Choosing Heuristic Neighborhoods for Information Discovery , 1997, ICML 1997.

[6]  David A. Landgrebe,et al.  Supervised classification in high-dimensional space: geometrical, statistical, and asymptotical properties of multivariate data , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[7]  Joydeep Ghosh,et al.  Knowledge reuse in multiple classifier systems , 1997, Pattern Recognit. Lett..