2017 International Conference on Computer Science and Engineering (UBMK) 2017
DOI: 10.1109/ubmk.2017.8093450
|View full text |Cite
|
Sign up to set email alerts
|

Identification of association rules in buying patterns of customers based on modified apriori and Eclat algorithms by using R programming language

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…Both algorithms yield the same output, though the underlying data structure is different. The Eclat algorithm works really well with smaller datasets according to the researchers (Huseyinov and Aytac;.…”
Section: Association Rule Mining (Arm)mentioning
confidence: 97%
“…Both algorithms yield the same output, though the underlying data structure is different. The Eclat algorithm works really well with smaller datasets according to the researchers (Huseyinov and Aytac;.…”
Section: Association Rule Mining (Arm)mentioning
confidence: 97%
“…The frequent itemset mining algorithm (Apriori algorithm) [ 33 , 34 , 35 , 36 ] used for I = { , ,…, } is the set of all items in the data, while T = { , ,…, } is the set of all transactions. A collection of 0 or more items is called an itemset.…”
Section: Detailed Description Of the Schemementioning
confidence: 99%