282 search results - page 11 / 57 » Generating non-redundant association rules |
63
Voted
IDA
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few m...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
AIED
2007
Springer
15 years 3 months ago
2007
Springer
Rules have been showed to be appropriate representations to model tutoring and can be easily applied to intelligent tutoring systems. We applied a machine learning technique, Class...
102
click to vote
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
: In this paper, we propose a framework, called XAR-Miner, for mining ARs from XML documents efficiently and effectively. In XAR-Miner, raw XML data are first transformed to either...
FLAIRS
2003
14 years 11 months ago
2003
Almost all the approaches in association rule mining suggested the use of a single minimum support, technique that either rules out all infrequent itemsets or suffers from the bot...