374 search results - page 3 / 75 » New Algorithms for Fast Discovery of Association Rules |
AUSAI
2001
Springer
15 years 1 months ago
2001
Springer
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
86
Voted
ICEIS
2009
IEEE
15 years 4 months ago
2009
IEEE
Traditional approaches for mining generalized association rules are based only on database contents, and focus on exact matches among items. However, in many applications, the use ...
74
Voted
PAKDD
2005
ACM
15 years 3 months ago
2005
ACM
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
DATAMINE
1998
14 years 9 months ago
1998
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
GRD is an algorithm for k-most interesting rule discovery. In contrast to association rule discovery, GRD does not require the use of a minimum support constraint. Rather, the user...