Skip to main content

Triclustering and association rule mining using Suffix Forest and Frequent Closed Itemset based algorithm.

Project description

triclustering-using-suffix_forest

We introduce a novel data structure called a suffix-forest to design a tri-clustering algorithm. Tri-clustering is a method of data analysis used to find patterns of interest in three-dimensional data.

This is a new approach for association rule mining and bi-clustering using formal concept analysis. The approach is called FIST and is based on the frequent closed itemsets framework, requiring a unique scan of the database. FIST uses a new suffix tree-based data structure to reduce memory usage and improve extraction efficiency. Experiments show that FIST's memory requirements and execution times are in most cases equivalent to frequent closed itemsets-based algorithms and lower than frequent itemsets-based algorithms.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

triclustering-2023.5.31.2.tar.gz (9.4 kB view hashes)

Uploaded Source

Built Distribution

triclustering-2023.5.31.2-py3-none-any.whl (13.4 kB view hashes)

Uploaded Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page