Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IDEAL
2004
Springer

favoriteEmaildiscussreport

180views Intelligent Agents» more IDEAL 2004»

PRICES: An Efficient Algorithm for Mining Association Rules

13 years 10 months ago

PRICES: An Efficient Algorithm for Mining Association Rules

Download personalpages.manchester.ac.uk

In this paper, we present PRICES, an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Our approach reduces large itemset generation time, known to be the most time-consuming step, by scanning the database only once and using logical operations in the process. Experimental results and comparisons with the state of the art algorithm Apriori shows that PRICES very efficient and in some cases up to ten times as fast as Apriori.

Chuan Wang, Christos Tjortjis

Real-time Traffic

Association Rules | Efficient Algorithm | IDEAL 2004 | Large Itemset |

claim paper

Related Content

» Efficient Algorithms for Discovering Association Rules

» An Efficient Algorithm for Mining Association Rules in Large Databases

» An efficient algorithm for incremental mining of temporal association rules

» PROWL An Efficient Frequent continuity Mining Algorithm on Event Sequences

» MetaruleGuided Mining of MultiDimensional Association Rules Using Data Cubes

» On Efficient and Effective Association Rule Mining from XML Data

» An Efficient Algorithm for the Incremental Updation of Association Rules in Large Database...

» Efficient AdaptiveSupport Association Rule Mining for Recommender Systems

» Integrating Classification and Association Rule Mining

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	IDEAL
Authors	Chuan Wang, Christos Tjortjis

Comments (0)