Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graduation Essay 2024

Mining High Utility Itemsets Using Genetic Algorithms

Improving speed and memory in the field of data mining — specifically mining high utility itemsets using genetic algorithms — to address the performance problems that classical algorithms commonly encounter.

Authors

Tech Stack

Python, bitarray, psutil, Typer, uv

Dataset Format

Each line represents a transaction with three colon-separated sections:

<items> : <transaction_utility> : <item_utilities>
  • Items: space-separated positive integers, sorted in ascending order, no duplicates
  • Transaction utility: sum of all item utilities in this transaction
  • Item utilities: utility of each item in the same order as the items

Example input file:

2 3 4:9:2 2 5
1 2 3 4 5:18:4 2 3 5 4
1 3 4:11:4 2 5
3 4 5:11:2 5 4
1 2 4 5:22:5 4 5 8
1 2 3 4:17:3 8 1 5
4 5:9:5 4

Output Format

Each line represents one high-utility itemset:

<items> #UTIL: <utility>

Example:

4 5 #UTIL: 40
1 2 4 #UTIL: 41

Algorithms

Genetic Algorithm (GA-HUI)

FHM Algorithm

GUI Application

Documentation

Final Report

Powerpoint

Reference Documents

Screenshots

image

License

HUFLIT

About

No description, website, or topics provided.

Resources

Stars

3 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages