Sciweavers

125 search results - page 3 / 25
» A learning algorithm for string assembly
Sort
View
ACL
1997
13 years 11 months ago
String Transformation Learning
String transformation systems have been introduced in (Brill, 1995) and have several applications in natural language processing. In this work we consider the computational proble...
Giorgio Satta, John C. Henderson
ICML
2006
IEEE
14 years 10 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
JIPS
2008
130views more  JIPS 2008»
13 years 9 months ago
Inverted Index based Modified Version of KNN for Text Categorization
: This research proposes a new strategy where documents are encoded into string vectors and modified version of KNN to be adaptable to string vectors for text categorization. Tradi...
Taeho Jo
IFIP
2004
Springer
14 years 3 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
14 years 10 months ago
Exploiting unlabeled data in ensemble methods
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
Kristin P. Bennett, Ayhan Demiriz, Richard Maclin