A New Variant of the Optimum-Path Forest Classifier

We have shown a supervised approach for pattern classification, which interprets the training samples as nodes of a complete arc-weighted graph and computes an optimum-path forest rooted at some of the closest samples between distinct classes. A new sample is classified by the label of the root which offers to it the optimum path. We propose a variant, in which the training samples are the nodes of a graph, whose the arcs are the k -nearest neighbors in the feature space. The graph is weighted on the nodes by their probability density values (pdf) and the optimum-path forest is rooted at the maxima of the pdf. The best value of k is computed by the maximum accuracy of classification in the training set. A test sample is assigned to the class of the maximum, which offers to it the optimum path. Preliminary results have shown that the proposed approach can outperform the previous one and the SVM classifier in some datasets.

[1]  Dominic Mazzoni,et al.  Multiclass reduced-set support vector machines , 2006, ICML.

[2]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[3]  João Paulo Papa,et al.  A Discrete Approach for Supervised Pattern Recognition , 2008, IWCIA.

[4]  João Paulo Papa,et al.  Learning How to Extract Rotation-Invariant and Scale-Invariant Features from Texture Images , 2008, EURASIP J. Adv. Signal Process..

[5]  S. Sathiya Keerthi,et al.  Which Is the Best Multiclass SVM Method? An Empirical Study , 2005, Multiple Classifier Systems.

[6]  Robert E. Schapire,et al.  How boosting the margin can also boost classifier complexity , 2006, ICML.

[7]  Douglas A. Reynolds,et al.  Robust text-independent speaker identification using Gaussian mixture speaker models , 1995, IEEE Trans. Speech Audio Process..

[8]  Alexandre X. Falcão,et al.  Clustering by optimum path forest and its application to automatic GM/WM classification in MR-T1 images of the brain , 2008, 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.

[9]  Ludmila I. Kuncheva,et al.  Combining Pattern Classifiers: Methods and Algorithms , 2004 .

[10]  Edward Y. Chang,et al.  Concept boundary detection for speeding up SVMs , 2006, ICML '06.

[11]  Pat Langley,et al.  Editorial: On Machine Learning , 1986, Machine Learning.

[12]  Montse Pardàs,et al.  Deleted DOI: Audiovisual Head Orientation Estimation with Particle Filtering in Multisensor Scenarios , 2008 .

[13]  Subhash C. Bagui,et al.  Combining Pattern Classifiers: Methods and Algorithms , 2005, Technometrics.

[14]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004 .

[15]  Keinosuke Fukunaga,et al.  A Branch and Bound Algorithm for Computing k-Nearest Neighbors , 1975, IEEE Transactions on Computers.

[16]  Samy Bengio,et al.  Links between perceptrons, MLPs and SVMs , 2004, ICML.

[17]  Bernhard E. Boser,et al.  A training algorithm for optimal margin classifiers , 1992, COLT '92.