Sciweavers

98 search results - page 11 / 20
» Parallel Mining of Maximal Frequent Itemsets from Databases
Sort
View
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 8 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
CORR
2008
Springer
99views Education» more  CORR 2008»
13 years 7 months ago
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
Michael Hahsler
ADMA
2005
Springer
124views Data Mining» more  ADMA 2005»
13 years 9 months ago
Finding All Frequent Patterns Starting from the Closure
Efficient discovery of frequent patterns from large databases is an active research area in data mining with broad applications in industry and deep implications in many areas of d...
Mohammad El-Hajj, Osmar R. Zaïane
ICDE
2000
IEEE
118views Database» more  ICDE 2000»
14 years 9 months ago
Mining Recurrent Items in Multimedia with Progressive Resolution Refinement
Despite the overwhelming amounts of multimedia data recently generated and the significance of such data, very few people have systematically investigated multimedia data mining. ...
Hua Zhu, Jiawei Han, Osmar R. Zaïane