High Utility Itemset Mining Using Genetic Approach
| dc.contributor.author | Almeida, Tracy | |
| dc.contributor.author | Khan, Salman | |
| dc.date.accessioned | 2025-08-03T12:47:58Z | |
| dc.date.available | 2025-08-03T12:47:58Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | Frequent Itemset Mining(FIM) aims to generate itemsets having their frequency of occurrence not lesser than minimum support specified by the user. FIM does not consider the itemset utility which is the it’s profit value. High-utility itemset mining(HUIM) mines high-utility itemsets(HUI) from data. HUIM is a combinatorial optimization. With HUIM algorithms, the time required to search increases exponentially with an increasing number of transactions and database items. To address this issue an efficient algorithm to mine HUIs is proposed. The proposed algorithm uses a compact form of chromosome encoding by eliminating the itemsets with low transactional utilities. The algorithm employs methodology of self mutation to reduce generation of unwanted chromosomes. Experimental results have shown that the proposed algorithm finds HUIs for a given threshold value. The proposed algorithm consumes less time as compared to another HUIM algorithm HUIM-IGA. | |
| dc.identifier.uri | http://rcca.ndl.gov.in/handle/123456789/388 | |
| dc.language.iso | en | |
| dc.publisher | Advanced Informatics for Computing Research pp 143–150 | |
| dc.title | High Utility Itemset Mining Using Genetic Approach | |
| dc.type | Article |
Files
Original bundle
1 - 1 of 1