Sciweavers

32 search results - page 4 / 7
» On data mining, compression, and Kolmogorov complexity
Sort
View
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
15 years 10 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
BMCBI
2007
128views more  BMCBI 2007»
14 years 9 months ago
Compression-based classification of biological sequences and structures via the Universal Similarity Metric: experimental assess
Background: Similarity of sequences is a key mathematical notion for Classification and Phylogenetic studies in Biology. It is currently primarily handled using alignments. Howeve...
Paolo Ferragina, Raffaele Giancarlo, Valentina Gre...
DAWAK
2005
Springer
15 years 3 months ago
Efficient Compression of Text Attributes of Data Warehouse Dimensions
This paper proposes the compression of data in Relational Database Management Systems (RDBMS) using existing text compression algorithms. Although the technique proposed is general...
Jorge Vieira, Jorge Bernardino, Henrique Madeira
102
Voted
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
14 years 7 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
KDD
2009
ACM
207views Data Mining» more  KDD 2009»
15 years 10 months ago
DynaMMo: mining and summarization of coevolving sequences with missing values
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
Lei Li, James McCann, Nancy S. Pollard, Christos F...