Sciweavers

45 search results - page 4 / 9
» Discovering Frequent Itemsets in the Presence of Highly Freq...
Sort
View
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
13 years 10 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
13 years 11 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 6 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 6 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig
DMIN
2006
138views Data Mining» more  DMIN 2006»
13 years 7 months ago
Mining Complete Hybrid Sequential Patterns
We discovered that the set of frequent hybrid sequential patterns obtained by previous researches is incomplete, due to the inapplicability of the Apriori principle. We design and ...
Chichang Jou