Sciweavers

1768 search results - page 19 / 354
» Mining Very Large Databases
Sort
View
IDEAL
2004
Springer
14 years 3 months ago
PRICES: An Efficient Algorithm for Mining Association Rules
In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach ...
Chuan Wang, Christos Tjortjis
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 10 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
VLDB
1998
ACM
127views Database» more  VLDB 1998»
14 years 2 months ago
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...
Yasuhiko Morimoto, Takeshi Fukuda, Hirofumi Matsuz...
JCIT
2010
174views more  JCIT 2010»
13 years 4 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
ICDE
1998
IEEE
154views Database» more  ICDE 1998»
14 years 11 months ago
Mining for Strong Negative Associations in a Large Database of Customer Transactions
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...