Comment
Author: Admin | 2025-04-28
Tag : --->This example explains how to run the Eclat / dEclat Algorithms using the SPMF open-source data mining library.How to run this example? If you are using the graphical interface, (1) choose the "Eclat" or "dEclat" algorithm, (2) select the input file "contextPasquier99.txt", (3) set the output file name (e.g. "output.txt") (4) set minsup to 40% and (5) click "Run algorithm". If you want to execute this example from the command line, then execute this command: java -jar spmf.jar run Eclat contextPasquier99.txt output.txt 40% in a folder containing spmf.jar and the example input file contextPasquier99.txt. If you are using the source code version of SPMF, to run respectively Eclat or dEclat, launch the file "MainTestEclat_saveToMemory.java" or "MainTestDEclat_bitset_saveToMemory.java"in the package ca.pfv.SPMF.tests. What is Eclat ?Eclat is an algorithm for discovering frequent itemsets in a transaction database. It was proposed by Zaki (2001). Contrarily to algorithms such as Apriori, Eclat uses a depth-first search for discovering frequent itemsets instead of a breath-first search. dEclat is a variation of the Eclat algorithm that is implemented using a structure called "diffsets" rather than "tidsets". What is the input of the Eclat algorithm? The input is a transaction database (aka binary context) and a threshold named minsup (a value between 0 and 100 %). A transaction database is a set of transactions. Each transaction is a set of items. For example, consider the following transaction database. It contains 5 transactions (t1, t2, ..., t5) and 5 items (1,2, 3, 4, 5). For example, the first transaction represents the set of items 1, 3 and 4. This database is provided as the file contextPasquier99.txt in the SPMF distribution. It is important to note that an item is not allowed to appear twice in the same transaction and that items are assumed to be sorted by lexicographical order in a transaction. Transaction id Items t1 {1, 3, 4} t2 {2, 3, 5} t3 {1, 2, 3, 5} t4 {2, 5} t5 {1, 2, 3, 5} What is the output of the Eclat algorithm? Eclat is an algorithm for discovering itemsets (group of items) occurring frequently in a transaction database (frequent itemsets). A frequent itemset is an itemset appearing in at least minsup transactions from the transaction database, where minsup is a parameter given by the user. For example, if Eclat is run on the previous transaction database with a minsup of 40 % (2 transactions), Eclat
Add Comment