Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
We introduce a semi-supervised learning estimator which tends to the first kernel principal component as the number of labeled points vanishes. We show application of the proposed...
Leonardo Angelini, Daniele Marinazzo, Mario Pellic...
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...
A software package developed for the purpose of feature selection in statistical pattern recognition is presented. The software tool includes both several classical and new method...
A new method for classification is proposed. This is based on kernel orthonormalized partial least squares (PLS) dimensionality reduction of the original data space followed by a ...