Sciweavers

2463 search results - page 108 / 493
» Compressing Pattern Databases
Sort
View
PVLDB
2008
111views more  PVLDB 2008»
13 years 10 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 5 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
KDD
1998
ACM
123views Data Mining» more  KDD 1998»
14 years 3 months ago
Scaling Clustering Algorithms to Large Databases
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
Paul S. Bradley, Usama M. Fayyad, Cory Reina
KDD
2008
ACM
243views Data Mining» more  KDD 2008»
14 years 11 months ago
Permu-pattern: discovery of mutable permutation patterns with proximity constraint
Pattern discovery in sequences is an important problem in many applications, especially in computational biology and text mining. However, due to the noisy nature of data, the tra...
Meng Hu, Jiong Yang, Wei Su
ER
2007
Springer
128views Database» more  ER 2007»
14 years 5 months ago
Dynamic Modeling of Trajectory Patterns using Data Mining and Reverse Engineering
The constant increase of moving object data imposes the need for modeling, processing, and mining trajectories, in order to find and understand the patterns behind these data. Ex...
Luis Otávio Alvares, Vania Bogorny, Jos&eac...