Sciweavers

2463 search results - page 80 / 493
» Compressing Pattern Databases
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
14 years 11 months ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
BNCOD
2004
85views Database» more  BNCOD 2004»
13 years 11 months ago
Database Support for Path Query Functions
Extending relational database functionality to include data mining primitives is one step towards the greater goal of more closely integrated database and mining systems. This pape...
Rachel Hamill, Nigel J. Martin
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
14 years 2 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
DAWAK
2006
Springer
14 years 11 days ago
COBRA: Closed Sequential Pattern Mining Using Bi-phase Reduction Approach
Sequential pattern mining aims to find frequent patterns (guarded by a minimum support) in a database of sequences. As the support decreases the number of sequential patterns will...
Kuo-Yu Huang, Chia-Hui Chang, Jiun-Hung Tung, Chen...
ICIP
2000
IEEE
14 years 12 months ago
Integrated Compression and Linear Feature Detection in the Wavelet Domain
In many Earth observation missions, a large amount of data is collected by the on-board sensors, and must be transmitted to ground through a channel with limited capacity; in this...
Enrico Magli, Gabriella Olmo