10 search results - page 2 / 2 » Constructing Word-Based Text Compression Algorithms |
JMLR
2006
13 years 5 months ago
2006
Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade fi...
AAAI
2008
13 years 7 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
DCC
2010
IEEE
13 years 8 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
CCP
2011
12 years 5 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
SIGIR
2008
ACM
2008
ACM
Multi-document summarization via sentence-level semantic analysis and symmetric matrix factorization
13 years 5 months ago
Multi-document summarization aims to create a compressed summary while retaining the main characteristics of the original set of documents. Many approaches use statistics and mach...