Efficient Associate Rules Mining Based on Topology for Items of Transactional Data
A challenge in association rules’ mining is effectively reducing the time and space complexity in association rules mining with predefined minimum support and confidence thresholds from huge transaction databases. In this paper, we propose an efficient method based on the topology space of the items...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-01-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/2/401 |
| _version_ | 1797438999124508672 |
|---|---|
| author | Bo Li Zheng Pei Chao Zhang Fei Hao |
| author_facet | Bo Li Zheng Pei Chao Zhang Fei Hao |
| author_sort | Bo Li |
| collection | DOAJ |
| description | A challenge in association rules’ mining is effectively reducing the time and space complexity in association rules mining with predefined minimum support and confidence thresholds from huge transaction databases. In this paper, we propose an efficient method based on the topology space of the itemset for mining associate rules from transaction databases. To do so, we deduce a binary relation on itemset, and construct a topology space of itemset based on the binary relation and the quotient lattice of the topology according to transactions of itemsets. Furthermore, we prove that all closed itemsets are included in the quotient lattice of the topology, and generators or minimal generators of every closed itemset can be easily obtained from an element of the quotient lattice. Formally, the topology on itemset represents more general associative relationship among items of transaction databases, the quotient lattice of the topology displays the hierarchical structures on all itemsets, and provide us a method to approximate any template of the itemset. Accordingly, we provide efficient algorithms to generate Min-Max association rules or reduce generalized association rules based on the lower approximation and the upper approximation of a template, respectively. The experiment results demonstrate that the proposed method is an alternative and efficient method to generate or reduce association rules from transaction databases. |
| first_indexed | 2024-03-09T11:46:29Z |
| format | Article |
| id | doaj.art-6768216719954cd09644e74b627d3a3c |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-09T11:46:29Z |
| publishDate | 2023-01-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-6768216719954cd09644e74b627d3a3c2023-11-30T23:21:41ZengMDPI AGMathematics2227-73902023-01-0111240110.3390/math11020401Efficient Associate Rules Mining Based on Topology for Items of Transactional DataBo Li0Zheng Pei1Chao Zhang2Fei Hao3School of Computer and Software Engineering, Xihua University, Chengdu 610039, ChinaSchool of Science, Xihua University, Chengdu 610039, ChinaIntelligent Policing Key Laboratory of Sichuan Province, Sichuan Police College, Luzhou 646000, ChinaSchool of Computer Science, Shaanxi Normal University, Xi’an 710119, ChinaA challenge in association rules’ mining is effectively reducing the time and space complexity in association rules mining with predefined minimum support and confidence thresholds from huge transaction databases. In this paper, we propose an efficient method based on the topology space of the itemset for mining associate rules from transaction databases. To do so, we deduce a binary relation on itemset, and construct a topology space of itemset based on the binary relation and the quotient lattice of the topology according to transactions of itemsets. Furthermore, we prove that all closed itemsets are included in the quotient lattice of the topology, and generators or minimal generators of every closed itemset can be easily obtained from an element of the quotient lattice. Formally, the topology on itemset represents more general associative relationship among items of transaction databases, the quotient lattice of the topology displays the hierarchical structures on all itemsets, and provide us a method to approximate any template of the itemset. Accordingly, we provide efficient algorithms to generate Min-Max association rules or reduce generalized association rules based on the lower approximation and the upper approximation of a template, respectively. The experiment results demonstrate that the proposed method is an alternative and efficient method to generate or reduce association rules from transaction databases.https://www.mdpi.com/2227-7390/11/2/401knowledge discovery in database (KDD)frequent itemsetsclosed itemsetsassociation rulesthe topology for itemsets |
| spellingShingle | Bo Li Zheng Pei Chao Zhang Fei Hao Efficient Associate Rules Mining Based on Topology for Items of Transactional Data Mathematics knowledge discovery in database (KDD) frequent itemsets closed itemsets association rules the topology for itemsets |
| title | Efficient Associate Rules Mining Based on Topology for Items of Transactional Data |
| title_full | Efficient Associate Rules Mining Based on Topology for Items of Transactional Data |
| title_fullStr | Efficient Associate Rules Mining Based on Topology for Items of Transactional Data |
| title_full_unstemmed | Efficient Associate Rules Mining Based on Topology for Items of Transactional Data |
| title_short | Efficient Associate Rules Mining Based on Topology for Items of Transactional Data |
| title_sort | efficient associate rules mining based on topology for items of transactional data |
| topic | knowledge discovery in database (KDD) frequent itemsets closed itemsets association rules the topology for itemsets |
| url | https://www.mdpi.com/2227-7390/11/2/401 |
| work_keys_str_mv | AT boli efficientassociaterulesminingbasedontopologyforitemsoftransactionaldata AT zhengpei efficientassociaterulesminingbasedontopologyforitemsoftransactionaldata AT chaozhang efficientassociaterulesminingbasedontopologyforitemsoftransactionaldata AT feihao efficientassociaterulesminingbasedontopologyforitemsoftransactionaldata |