Selection of Satisfied Association Rules via Aggregation of Linguistic Satisfied Degrees
Many association rule mining algorithms have been well-established, such as Apriori, Eclat, FP-Growth, or LCM algorithms. However, the challenge is that the huge size of association rules is extracted by using these algorithms, and it is difficult for users to select satisfied association rules from...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8755825/ |