2023
DOI: 10.1016/j.procir.2023.06.098
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Eclat Algorithm based Association Rules Mining Method for Failure Status Information and Remanufacturing Machining Schemes of Retired Products

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…However, because Eclat algorithm takes a long time to find the intersection when there is a large amount of data, Zhang et al [ 12 ] used minwise hashing and estimator to quickly calculate the intersection size of multiple item sets, thus improving its efficiency. Based on the fact that Eclat consumes a large amount of memory space and computation time in data reading and computation under a large amount of data, and generates a large amount of redundant data in the process, Wang et al [ 13 ] improved the pruning strategy of Eclat, which reduced the generation of redundant frequent items, and improved the efficiency of the algorithm. In recent years, many researchers have improved on the basis of the above two algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…However, because Eclat algorithm takes a long time to find the intersection when there is a large amount of data, Zhang et al [ 12 ] used minwise hashing and estimator to quickly calculate the intersection size of multiple item sets, thus improving its efficiency. Based on the fact that Eclat consumes a large amount of memory space and computation time in data reading and computation under a large amount of data, and generates a large amount of redundant data in the process, Wang et al [ 13 ] improved the pruning strategy of Eclat, which reduced the generation of redundant frequent items, and improved the efficiency of the algorithm. In recent years, many researchers have improved on the basis of the above two algorithms.…”
Section: Introductionmentioning
confidence: 99%