2004
DOI: 10.1007/978-3-540-28651-6_52
|View full text |Cite
|
Sign up to set email alerts
|

PRICES: An Efficient Algorithm for Mining Association Rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2006
2006
2021
2021

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 22 publications
(15 citation statements)
references
References 4 publications
0
15
0
Order By: Relevance
“…161-176, © 2013 INFORMS find all the frequent itemsets (i.e., sets of itemsets whose support is sufficiently high), and the second stage is to derive association rules from the frequent itemsets (confidence is often used as the measurement to select significant association rules). Some of the most popular association rule mining techniques include Apriori (Agrawal and Srikant 1994), Eclat (Zaki 2000), FP-growth , tree projection (Agarwal et al 2001), and PRICES (Wang and Tjortjis 2004) (see Kotsiantis and Kanellopoulos 2006 for more details on these algorithms). Our definition of OS-pattern is very different from that of an association rule, and the traditional association rule mining techniques cannot discover the type of online shopping patterns we are interested in.…”
Section: Related Workmentioning
confidence: 99%
“…161-176, © 2013 INFORMS find all the frequent itemsets (i.e., sets of itemsets whose support is sufficiently high), and the second stage is to derive association rules from the frequent itemsets (confidence is often used as the measurement to select significant association rules). Some of the most popular association rule mining techniques include Apriori (Agrawal and Srikant 1994), Eclat (Zaki 2000), FP-growth , tree projection (Agarwal et al 2001), and PRICES (Wang and Tjortjis 2004) (see Kotsiantis and Kanellopoulos 2006 for more details on these algorithms). Our definition of OS-pattern is very different from that of an association rule, and the traditional association rule mining techniques cannot discover the type of online shopping patterns we are interested in.…”
Section: Related Workmentioning
confidence: 99%
“…PRICES: a skilled algorithm developed by Chuan Wang [29] in 2004, which first recognizes all large itemsets used to construct association rules. This algorithm decreased the time of large itemset generation by scanning the database just once and by logical operations in the process.…”
Section: Dsm-fi: Data Stream Mining For Frequent Itemsets Is a Novel mentioning
confidence: 99%
“…Chuan Wang and Christos Tjortjis [18] have proposed an efficient algorithm for mining association rules, which first identifies all large itemsets and then generates association rules. Their approach has reduced 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.…”
Section: Related Workmentioning
confidence: 99%
“…Even though several algorithms are available in the literature for association rule mining, [12][13][14][15][16][17][18][19][20] a good number of them deal with efficient implementations rather than the production of effective rules [11,16,18]. The techniques that aid in the extraction of suitable and genuine association patterns are mostly quantitative in nature [10,12,13,17].…”
Section: Introductionmentioning
confidence: 99%