Sciweavers

732 search results - page 94 / 147
» Efficient Frequent Pattern Mining in Relational Databases
Sort
View
FIMI
2004
123views Data Mining» more  FIMI 2004»
13 years 9 months ago
Surprising Results of Trie-based FIM Algorithms
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related tec...
Ferenc Bodon
SDM
2010
SIAM
283views Data Mining» more  SDM 2010»
13 years 9 months ago
Cascading Spatio-temporal Pattern Discovery: A Summary of Results
Given a collection of Boolean spatio-temporal(ST) event types, the cascading spatio-temporal pattern (CSTP) discovery process finds partially ordered subsets of event-types whose ...
Pradeep Mohan, Shashi Shekhar, James A. Shine, Jam...
ICDE
2000
IEEE
112views Database» more  ICDE 2000»
14 years 9 months ago
DEMON: Mining and Monitoring Evolving Data
Data mining algorithms have been the focus of much research recently. In practice, the input data to a data mining process resides in a large data warehouse whose data is kept up-...
Venkatesh Ganti, Johannes Gehrke, Raghu Ramakrishn...
ICCS
2003
Springer
14 years 29 days ago
A Compress-Based Association Mining Algorithm for Large Dataset
The association mining is one of the primary sub-areas in the field of data mining. This technique had been used in numerous practical applications, including consumer market baske...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
13 years 9 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara