Sciweavers

88 search results - page 1 / 18
» Further Pruning for Efficient Association Rule Discovery
Sort
View
AUSAI
2001
Springer
13 years 8 months ago
Further Pruning for Efficient Association Rule Discovery
The Apriori algorithm's frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent item...
Songmao Zhang, Geoffrey I. Webb
ICDE
2001
IEEE
141views Database» more  ICDE 2001»
14 years 5 months ago
TAR: Temporal Association Rules on Evolving Numerical Attributes
Data mining has been an area of increasing interests during recent years. The association rule discovery problem in particular has been widely studied. However, there are still so...
Wei Wang 0010, Jiong Yang, Richard R. Muntz
JSW
2008
203views more  JSW 2008»
13 years 4 months ago
Automatic Discovery of Semantic Relations Based on Association Rule
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
Xiangfeng Luo, Kai Yan, Xue Chen
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 8 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
13 years 9 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
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...
Ying Liu, Wei-keng Liao, Alok N. Choudhary