Sciweavers

153 search results - page 2 / 31
» On the Optimal Compression of Sets in PSPACE
Sort
View
FOCI
2007
IEEE
13 years 8 months ago
An Investigation on the Compression Quality of aiNet
AiNet is an immune-inspired algorithm for data compression, i.e. the reduction of redundancy in data sets. In this paper we investigate the compression quality of aiNet. Therefore,...
Thomas Stibor, Jonathan Timmis
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
14 years 2 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
CIKM
2006
Springer
13 years 8 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li
DATE
2005
IEEE
172views Hardware» more  DATE 2005»
13 years 10 months ago
Evolutionary Optimization in Code-Based Test Compression
We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In c...
Ilia Polian, Alejandro Czutro, Bernd Becker
SDM
2009
SIAM
170views Data Mining» more  SDM 2009»
14 years 2 months ago
Optimal Distance Bounds on Time-Series Data.
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
Michail Vlachos, Philip S. Yu, Suleyman S. Kozat