Sciweavers

7 search results - page 1 / 2
» Efficient Partial Multiple Periodic Patterns Mining without ...
Sort
View
COMPSAC
2004
IEEE
13 years 6 months ago
Efficient Partial Multiple Periodic Patterns Mining without Redundant Rules
Partial periodic patterns mining is a very interesting domain in data mining problem. In the previous studies, full and partial multiple periodic patterns mining problems are cons...
Wenpo Yang, Guanling Lee
ICDE
1999
IEEE
148views Database» more  ICDE 1999»
14 years 4 months ago
Efficient Mining of Partial Periodic Patterns in Time Series Database
Partial periodicity search, i.e., search for partial periodic patterns in time-series databases, is an interesting data mining problem. Previous studies on periodicity search main...
Jiawei Han, Guozhu Dong, Yiwen Yin
JCST
2008
119views more  JCST 2008»
13 years 2 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman
GIS
2004
ACM
14 years 3 months ago
A partial join approach for mining co-location patterns
Spatial co-location patterns represent the subsets of events whose instances are frequently located together in geographic space. We identified the computational bottleneck in the...
Jin Soung Yoo, Shashi Shekhar
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 3 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das