readme.txt

关联规则的频繁项集算法bomo的源代码

//////////////////////////
README for BOMO algorithm
//////////////////////////
A. File Description
===================
bomo.c          -- The program file for mining N-most interesting itemsets using BOMO algorithm.
Makefile        -- Makefile to compile bomo.c.
configSample    -- A sample config. file storing the input parameter for bomo.c.
dataSample.dat  -- A sample data file.
B. Compilation
==============
Type:   make bomo
or
Type:   gcc -Wall -o bomo bomo.c
C. Execution
============
Type:   bomo <config file name> <item header table starting scanning position>
You can also type "bomo" for details.
D. Data File Format
===================
Each line of the data file consists of one transaction information.
The first value of the line is the number of items in this transaction.
Following the first value are the IDs of items in the transaction.
The IDs of the items are numeric, and is ranged from zero to (M - 1)
where M is the number of items in the database.
Note:  Items in the same row of the data file should not have the same ID.
       I.e. each item should appear at most once in each transaction.
E. Config. File Format
======================
Content of config. file:
Line 1. N
Line 2. k (expected maximal size of itemsets to be found)
Line 3. Threshold (dummy, NO USE for BOMO)
Line 4. Number of different items in the dataset
Line 5. Number of transactions (rows) in the dataset
Line 6. Threshold descrease rate (dummy, NO USE for BOMO)
Line 7. Path of the input dataset
Line 8. Path of the output file storing the resulting FP-tree (dummy, NO USE for BOMO)
Line 9. Output of the resulting interesting itemsets
F. Resulting File Format
========================
Output a line showing realK and then for each itemset size k, output
a line containing numLarge[k]
(i.e. number of k-itemset considered interesting during the mining process),
this numLarge[k] is for statistical use;
a line for each k-itemset with its support (enclosed by []) at the end.