Sciweavers

587 search results - page 33 / 118
» New Algorithms for Text Fingerprinting
Sort
View
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
14 years 11 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...
Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter
ERCIMDL
2005
Springer
114views Education» more  ERCIMDL 2005»
15 years 3 months ago
Compressing Dynamic Text Collections via Phrase-Based Coding
We present a new statistical compression method, which we call Phrase Based Dense Code (PBDC), aimed at compressing large digital libraries. PBDC compresses the text collection to ...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
KDD
2010
ACM
246views Data Mining» more  KDD 2010»
14 years 8 months ago
Latent aspect rating analysis on review text data: a rating regression approach
In this paper, we define and study a new opinionated text data analysis problem called Latent Aspect Rating Analysis (LARA), which aims at analyzing opinions expressed about an e...
Hongning Wang, Yue Lu, Chengxiang Zhai
KDD
2002
ACM
179views Data Mining» more  KDD 2002»
15 years 10 months ago
Combining clustering and co-training to enhance text classification using unlabelled data
In this paper, we present a new co-training strategy that makes use of unlabelled data. It trains two predictors in parallel, with each predictor labelling the unlabelled data for...
Bhavani Raskutti, Herman L. Ferrá, Adam Kow...
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
15 years 9 months ago
Querying Structured Text in an XML Database
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
Shurug Al-Khalifa, Cong Yu, H. V. Jagadish