Sciweavers

922 search results - page 5 / 185
» A data mining approach to database compression
Sort
View
PKDD
2007
Springer
147views Data Mining» more  PKDD 2007»
14 years 1 months ago
MINI: Mining Informative Non-redundant Itemsets
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
Arianna Gallo, Tijl De Bie, Nello Cristianini
ADC
2008
Springer
110views Database» more  ADC 2008»
14 years 1 months ago
Graph Mining based on a Data Partitioning Approach
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
Son N. Nguyen, Maria E. Orlowska, Xue Li
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 7 months ago
Mining quantitative correlated patterns using an information-theoretic approach
Existing research on mining quantitative databases mainly focuses on mining associations. However, mining associations is too expensive to be practical in many cases. In this pape...
Yiping Ke, James Cheng, Wilfred Ng
VLDB
2001
ACM
139views Database» more  VLDB 2001»
13 years 11 months ago
NetCube: A Scalable Tool for Fast Data Mining and Compression
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
Dimitris Margaritis, Christos Faloutsos, Sebastian...
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
14 years 7 months ago
Query Optimization In Compressed Database Systems
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
Zhiyuan Chen, Johannes Gehrke, Flip Korn