Sciweavers

116 search results - page 5 / 24
» On Computing Condensed Frequent Pattern Bases
Sort
View
IPPS
2007
IEEE
14 years 1 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
EUROCAST
2005
Springer
133views Hardware» more  EUROCAST 2005»
14 years 1 months ago
An Iterative Method for Mining Frequent Temporal Patterns
The incorporation of temporal semantic into the traditional data mining techniques has caused the creation of a new area called Temporal Data Mining. This incorporation is especial...
Francisco Guil, Antonio B. Bailón, Alfonso ...
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
14 years 1 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...
AUSDM
2007
Springer
193views Data Mining» more  AUSDM 2007»
14 years 1 months ago
Are Zero-suppressed Binary Decision Diagrams Good for Mining Frequent Patterns in High Dimensional Datasets?
Mining frequent patterns such as frequent itemsets is a core operation in many important data mining tasks, such as in association rule mining. Mining frequent itemsets in high-di...
Elsa Loekito, James Bailey