the edge from
Initially set the pheromone on every edge
Let the initial generation
Sets up the complete route for each artificial ant
by the following sub steps.a)
Selects the edges from start to end according to the state transaction rule.
Update the pheromone of the edges passed throughby
according to the local updating rule.
Evaluate the fitness value of the solution(membership functions) obtained by each artificial ant according to the following sub steps.
For each transaction datum
to n, transfer its quantitative value
into a fuzzy set
according to the membership functions obtained from the ant in (2).
is represented as
is the k -th fuzzy term of item
’s fuzzy membership value in the region, and
is thenumber of fuzzy membership functions.
The scalar cardinality of each region in thetransactions is calculated in (3):
is the fuzzy membership value of region
from the i-th datum.
Check for each
is larger than or equal to the minimum support threshold
satisfies the above condition, put it in the set of large 1
Calculate the fitness value of the solution from theant by dividing the number of large itemsets in
over the suitability.
That is Equation(4),
Once all the artificial ants find their entire routes,the one holding the highest fitness value will be used to updatethe pheromone according to the global updating rule.
If the generation g is equal to G, output the current best set of membership functions of item I
for fuzzy datamining; otherwise, g
1 and go to s 4.
If p ≠ m, set p
1 and go to Step 2 for another item; otherwise, stop the algorithm.
The final set of membership functions output in step 7 andthe 1-itemsets obtained are then used to mine fuzzy associationrules from the given database.IV.
We experimentally evaluated our approach to expose the performance of the proposed algorithm. The experiments wereimplemented in C/C++ on a computer with Intel Core(TM) 2Duo Processor 2.66GHz and 4 GB main memory, running theMicrosoft Windows 7 operating system. We used two datasetsto present results: Dataset  with a total of 64 items and10,000 transactions. In addition, a real dataset calledFOODMART from an anonymous chain store was used in theexperiments . The FOODMART dataset containedquantitative transactions about the products sold in the chainstore. There were totally 21,556 transactions with 1600 items inthe dataset Used in the experiments. The initial count of antswas set at 10. The parameters in the ACS algorithm were set asfollows: the initial ratio of pheromone was 0.05, the minimum pheromone of ants was 0.2, the evaporation ration was 0.9, thelocal updating ratio was 0.1 and the global updating ratio was0.9, minimum support for FOODMART dataset was set to0.0015 and for dataset  was set to 0.04. We considered thevalue of constant P, as mentioned in (1) for FOODMARTdataset equal to 0.05 and for dataset  equal to 0.02.The average fitness values of the artificial ants along withdifferent numbers of generations for two datasets are shown inFig. 2 and Fig. 3.
Figure 2. The average fitness values along with different numbers of generations with dataset 
It can be vividly seen from Fig. 2 and Fig. 3 that in our approach, the average fitness values increased by an offsetcompared with the previous one. Thus, became stable withinless number of generations. In addition, we used smaller numbers for generation with the aim of comparing thedifference between our model and the existing one that hasstatic constant minimum support in Fig. 4. It is obviouslyrepresents that our model achieved the best fitness at 300numbers of generations, whereas the existing one reached its best fitness at 500 numbers of generations.
A v r a g e f i t n e s s v a l u e s
ACS with constant minimum supportACS with multiple minimum supports
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 9, December 2010332http://sites.google.com/site/ijcsis/ISSN 1947-5500