Sciweavers

8486 search results - page 7 / 1698
» Ordered Enumeration Method
Sort
View
ISCC
2002
IEEE
147views Communications» more  ISCC 2002»
14 years 11 days ago
A new method for finding generalized frequent itemsets in generalized association rule mining
Generalized association rule mining is an extension of traditional association rule mining to discover more informative rules, given a taxonomy. In this paper, we describe a forma...
Kritsada Sriphaew, Thanaruk Theeramunkong
JSAT
2008
89views more  JSAT 2008»
13 years 7 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening
PC
1998
89views Management» more  PC 1998»
13 years 7 months ago
Analysis of Local Enumeration and Storage Schemes in HPF
In this paper, we analyze the efficiency of three local enumeration and three storage compression schemes for cyclic(m) data distributions in High Performance Fortran (HPF). We sh...
Henk J. Sips, Will Denissen, Kees van Reeuwijk
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 7 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...
COMBINATORICS
2002
87views more  COMBINATORICS 2002»
13 years 7 months ago
Kasteleyn Cokernels
We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is ...
Greg Kuperberg