Sciweavers

1217 search results - page 3 / 244
» On compressing frequent patterns
Sort
View
JISE
2008
108views more  JISE 2008»
13 years 5 months ago
Efficient Discovery of Frequent Continuities by Projected Window List Technology
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
Kuo-Yu Huang, Chia-Hui Chang, Kuo-Zui Lin
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
13 years 12 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
13 years 10 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
DCC
2008
IEEE
14 years 4 months ago
An Approach to Graph and Netlist Compression
We introduce an EDIF netlist graph algorithm which is lossy with respect to the original byte stream but lossless in terms of the circuit information it contains based on a graph ...
Jeehong Yang, Serap A. Savari, Oskar Mencer