Sciweavers

807 search results - page 3 / 162
» Space Efficient Algorithms for Ordered Tree Comparison
Sort
View
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 10 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
Michaela Götz, Christoph Koch, Wim Martens
PR
2008
129views more  PR 2008»
13 years 6 months ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
ISAAC
2001
Springer
106views Algorithms» more  ISAAC 2001»
13 years 10 months ago
Suffix Vector: A Space-Efficient Suffix Tree Representation
Krisztián Monostori, Arkady B. Zaslavsky, I...
SDM
2010
SIAM
184views Data Mining» more  SDM 2010»
13 years 7 months ago
A Robust Decision Tree Algorithm for Imbalanced Data Sets
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to class distribution and generates rules which are st...
Wei Liu, Sanjay Chawla, David A. Cieslak, Nitesh V...
ICML
2006
IEEE
14 years 7 months ago
Fast and space efficient string kernels using suffix arrays
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
Choon Hui Teo, S. V. N. Vishwanathan