Sciweavers

499 search results - page 44 / 100
» PRICES: An Efficient Algorithm for Mining Association Rules
Sort
View
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
14 years 8 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
AUSDM
2006
Springer
118views Data Mining» more  AUSDM 2006»
13 years 11 months ago
Efficiently Identifying Exploratory Rules' Significance
How to efficiently discard potentially uninteresting rules in exploratory rule discovery is one of the important research foci in data mining. Many researchers have presented algor...
Shiying Huang, Geoffrey I. Webb
SAC
2011
ACM
12 years 10 months ago
RuleGrowth: mining sequential rules common to several sequences by pattern-growth
Mining sequential rules from large databases is an important topic in data mining fields with wide applications. Most of the relevant studies focused on finding sequential rules a...
Philippe Fournier-Viger, Roger Nkambou, Vincent Sh...
NGC
2008
Springer
165views Communications» more  NGC 2008»
13 years 6 months ago
Hyperlink Recommendation Based on Positive and Negative Association Rules
The new HRS method for hyperlink recommendation based on positive and confined negative association rules is presented in the paper. Discovered with the new PANAMA algorithm rules ...
Przemyslaw Kazienko, Marcin Pilarczyk
RCIS
2010
13 years 6 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu