An Enhanced Approach for Mining Association Rules with AMO

(1)

International Journal of Emerging Technology and Advanced Engineering

Website: www.ijetae.com (ISSN 2250-2459, ISO 9001:2008 Certified Journal, Volume 8, Issue 3, March 2018)

173

An Enhanced Approach for Mining Association Rules

with AMO

Vikram Rajpoot

1

, Dr. Akhilesh Tiwari

2

, Dr. Bharat Mishra

3

1_{Research Scholar, MGCGV Chitrakoot, SATNA, India} 2_{Professor, Dept. of CS&IT MITS Gwalior, Gwalior, India} 3

Associate Professor, Faculty of Physical Sciences MGCGV Chitrakoot SATNA, India

Abstract—Association rule mining mainly used for the prediction the behavior of customers in the analysis of the market. Strong rules are generated for taking decisions over the large number of itemsets in the database by getting frequent items together instead of randomly generated items. Apriori Algorithm is utilized for mining regular item set and some association rules from the database of transaction. Animal migration optimization had been applied as an optimization algorithm with positive results in recent areas which includes scheduling troubles, neural net training, face recognition and other NP- complete problems. Much research seeking to enhance the overall performance of AMO and solve the rules technology optimization problem is being going on. Till this date a few optimization algorithms have been implemented to find the rules, but, in this research paper, another calculation is proposed to optimize the rules. AMO focuses on the movement of the animals based on their adaptability which is their support for survival and the fitness function. The objective of this paper is to propose a new way of finding better rules by applying AMO in a better way so that we can improve the working of finding the patterns or rule generation process. AMO along with a new formulation of evaluating the fitness function has been proposed in this paper since association rule mining generates a large number of rules which is not very convenient method. Rules generation should be done in an effective approach to enhance the execution of the procedure.

Keywords- Data Mining, AR, AMO, Apriori Algorithm, Support, Confidence, PSO.

I. INTRODUCTION

Analysts are drowning in data, however ravenous for talents. Given that the daybreak of the Internet period in 1994, electronic exchange and e- data are creating at, such an astounding rate and the associations around the earth race to move their business on the web with the expectation to position them in the web overwhelmed overall exchanging [1]. This technology height results in retailer colossal volumes of data in learning repositories as XML archive, social database and data warehouses centers et cetera. The intriguing, valuable (conceivably precious and prior obscure guidelines and examples) learning can be removed from these giant data repositories. Data mining as the central method of Knowledge Discovery in Database (KDD) [2]. It’s known as data dredging, understanding collecting and industry insight and extraction of data.

Time-respected object set mining brings about the revelation of disclosure of associations and connections among things in giant transactional or social datasets [9]. The mining results uncovered which occupation [3], instructive foundation and wage, for example, the major elements of culture industry. Rely upon the outcomes; proposals were given to settle on decision support to recover the expectation for everyday solaces and instruction background of inhabitants to recuperate the interest in cultural events [4]. As of late, Evolutionary Algorithm has been for the most part accomplishing in a few precise districts and it determines components of biotic improvement and applies them in emergency settling [5].

A. Association Rule Mining

ARM is an outstanding to discover find intriguing thoughts and family relations between extensive amounts of devices in enormous databases. Open association rules for seeking regularities in the midst of things in extensive scale trade data recorded [7].

With the general case and presentation in last area, the formal revelation of ARM issue was expressed in [Agrawal et al. 1993] through Agrawal. Let I=I1, I2, •, I'm being a suite of m focused on characteristics, T be transacted that contains a gathering of articles to such a degree, to the point that T ⊆ I, D be a database with restrictive transaction documents Ts. An association rule is a recommendation in the king of X⇒Y, where X, Y⊂ I are units of things said to likeitemsets, and X ∩ Y = ø. X is alluded to as predecessor even as Y is known as resulting, the run way X implies Y [8].

Support: The help of the rule this is, the relative frequency of exchanges that contain X and Y [9].

Support(X->Y) = support(X+Y) …(1)

Confidence: The confidence of the rule

(2)

174 Certainty demonstrates the conditions sum the if/by then declarations observed to be considerable [11]. Various business enterprises gather huge quantities of data from their normal operations. E.g., acquiring data are accumulated day by methods for day at the market checkout counters [12].

B. Animal Migration Optimization

In animal habits ecology, migration is a typical phenomenon inside the arrangement of all animals has been considered seriously. The migration is control and straightened out development overpowered by the creature's have locomotory efforts conveying them to new living spaces. It in light of certain station keeping reactions transitority hindrance however ensuing their last repeat and disinhibition [13]. Inside the migration procedure, the least complex numerical units of animal aggregations most generally took after the fundamental tenets with these three standards:

(1) Transfer inside the comparable path way as your neighbors;

(2) Stay for all intents and purposes your neighbors; and (3) Prevent impacts with your neighbors.

Latest reports of starling flocks have shown that each winged animal changes its ability including the six or seven creatures quickly around it, paying little regard to how close or how far away these cattle are [14]. Communications in the midst of flocking starlings are for which aim focused on a topological administer as opposed to a metric rule.

a. Procedure of Animal Migration

The calculation of animal migration separated into two sections.

1)AM Process:

The possibility of local neighborhood of an individual is portrayed through the topological ring use. For ease, set the area length to be five for every separate measurement. In this count the nearest topology is static and is portray on the gathering of vectors records.

In the event that the creature record is j, at that point its nearest comprises the animal having records j − 2, j − 1, j, j + 1, j + 2, if the animal list is 1, the nearest contains of dairy cattle having files 𝑁𝑃 − 1,, 1, 2, 3, et cetera. Once the topology of nearest has been manufactured, choose one nearest randomly and furthermore area refresh of the person as per this nearest, as can be found in the accompanying equation:

)....(3) Where, is the neighborhood exhibit position, 𝛿 is generate thru exploiting an random number generator controlled through a Gaussian distribution, is the current location of the 𝑖th separate, and is the originallocation of 𝑖th person.

2)People Updating Process:

The algorithm simulates how certain animals leave the set and certain include the novel people. Individuals will be supplanted by some new animals with a probability 𝑃𝑎. The probability is used by the idea of the fitness.

Sort fitness in descending order, so the probability of the individual with pleasant health is 1/𝑁𝑃 and the man or woman with most observably most exceedingly worst fitness, by separate, is 1, and the approach may in like manner be exhibited in Algorithm 1.

In Algorithm 1, 𝑟1, 𝑟2∈ [1, . . . ,] are haphazardly select numbers, 𝑟1 𝑟2 𝑖. In the wake of creating the new answer, it's going to be evaluated and equated with and pick the person with a greater objective fitness:

…(4)

The rest of the paper is structured in such a manner that we can introduce the literature survey in section 2 which demonstrate the related work of this paper. Then mention the problem statement of the existing work in section 3 which will be overcome by the proposed technique. In section four, discuss the proposed approach with proposed algorithm and its description that offered. In section 5, state the simulation and the result of the proposed strategy by contrasting it and the current procedure and finally in section 6 conclude the full paper with short discussion.

II. LITERATURE SURVEY

U. M. Fayyad et al. [1] The article notices exact real-world applications, particular data-mining strategies, challenges associated with genuine utilizations of skill discovery, and present and future examinations directions inside the subject.

Dewang Rupesh, et al [2] in this paper authors modify Correlation coefficient (CRC) condition, so all produce comes about are very promising. To start with we apply Apriori Algorithm for visit itemset time and that is moreover deliver fine arrangements, after on regular itemset we take after NRGA calculation for every single negative govern age and optimize generated rules utilizing GA.

Pradnya A. Shirsath et al., [4]In this paper, they represent the survey of various methods for incremental as well as temporal ARM.

(3)

175 Ballerini M, et al. [10] In this paper, they demonstrate that the association does now not rely on the metric separation, as most outrageous current models and theories rely on, yet as an option on the topological separation. In fact, they found that each bird interacts collaborates interfaces all things considered with a settled measure of neighbors (six to seven), instead of with all neighbors inside an immovable metric separation. Creators battle that a topological transaction is crucial to hold a flock’s union against the substantial density changes in light of outer irritations, typically predation. They definitely this theory by using numerical simulations, exhibiting that a topological collaboration permits radically higher union of the total as contrasted and a well known metric one.

Vivek Badheet et al. [11] In this paper watch idea of ill defined set theory and related properties for income examples and its p software to the business administration to address Business basic leadership issue. Agrawal et al. [14] In this paper think about the bother of discovering ARs among items in a huge database of sales transactions. They display two new algorithms for settling this issue is fundamentally outstanding from the regarded algorithms. Experimental evaluation proposes that those algorithms beat the recognized algorithms with the guide of variables beginning from three for small troubles to additional than a request of centrality for colossal issues. They likewise demonstrate how the phenomenal capacities of the two proposed algorithms can be blended directly into a hybrid algorithm, alluded to as Apriori Hybrid. Scale-up tests demonstrate that Apriori Hybrid scales directly with the assortment of transactions. Apriori Hybrid likewise has outstanding scale-up living arrangements with perceive to the transaction estimate and the amount of items inside the database.

Russel Pears and Yun Sing Koh [15] define WARM was displayed to show an idea of significance to isolate items. In past work these kind of procedures anticipate that users to assign weights for each challenge. That is infeasible when there are a huge number of items in a dataset advocate a novel strategy, WARM ARM.

R.J. Kuoet. al. [16] characterized a method which is illustrated through approach of applying the Food Mart 2000 database of Microsoft SQL Server 2000 and when put ensuing with a GA. The results demonstrate which the PSO calculation really can recommend appropriate limit esteems and acquire quality rules. Moreover, a actual-world inventory market database is utilized to mine AR to measure investment behavior and stock category obtaining. The computational results additionally are very promising.

R. O. Oladele, J. S. Sadiku [17] proposed a relative investigation of GA perform in explaining multi- objective n/w design problematic (MONDP) misusing disparate parent election approaches.

Three concern cases have been clear and results show that on the normal competition determination is the best and most proficient for 10-hub network issue, while Ranking and Scaling is the smallest compelling and least beneficial.

Takeshi Fukuda et.al [18] the data mining rely upon association objects for one Boolean quality and 2 numeric property. They remember two courses of locales, rectangles and permissible (i.e. Associated and x-monotone) ranges they'd executed algorithms for suitable territories, and built a procedure for visualizing the principles.

David Martens et.al [19] overviews two prevalent spaces: data mining and swarm intelligence. Data mining has been a general academic topic for a considerable length of time; subfield of artificial intelligence, which might be found in like ant colonies flocks of birds, nature, fish schools sand bee hives. System that classifies the swarm knowledge depend data mining algorithms into two methodologies: effective hunt and data organizing.

Smruti Rekha Das et al. [20] discussed SVM which has transformed into a continuously more predominant gadget for machine learning undertakings involving relapse or novelty detection and order. SVM is set up to determine the maximum margin (isolating hyper-plane) between data with and without the last result of enthusiasm in case they're directly divisible. To propel the speculation profitability of SVM classifier optimization way is used. As per the creators Optimization suggests back to the assurance of a high-quality component from some course of action of available decisions.

The conduct was detailed as Ant System (AS) by Dorigo et al. [21] in ACO algorithm, the advancement matter is figured as an issue G = (C; L), where C is the situated of parts of the issue, and L is the situated of viable association or moves most of the components of C. The association is communicated as some distance as realistic methods at the diagram G, concerning a hard and fast of given needs. In spite of the fact that each floor dwelling insect is match for discovering a (presumably bad) arrangement, great quality arrangements can upward thrust as a matter of aggregate association among ants. Pheromone trails encode an extended haul memory in regards to the whole floor living insect inquiry approach. Its quality relies on upon the issue representation and the streamlining target.

III. PROPOSED METHODOLOGY

A. Problem Statement

(4)

176 There are many rules obtained out of which some rules generally not of any use, discovered huge number of frequent rules which makes it more complex when dealing with excessive amount of data. In this method they also have to specify minimum support and confidence of the itemsets for each transaction. All these drawbacks of association rule mining algorithm degrads its performance and make it non feasible for finding itemset easily. Thereby association rule mining algorithm can be used with optimization for upgrading its performance.

B. Proposed Work

AMO is the technique to perform the optimization on the basis of animal behavior for the movement of one location to another location. The proposed algorithm work, initially find the rules by using Apriori algorithm in which candidate itemset are generated for all transactions.

Support and confidence value of every itemsets are calculated for finding frequent itemsets.Now on the idea of deriving the rules, the optimization method performed which is animal migration optimization. Mainly support value are taken into consideration for the formation of the rules so the rules which are not of high support and are not necessary are delete from the data. Only frequent rules are kept in the database for further procedure and displayed in the form of table. The proposed process has been explained with the help of flowchart and pseudo-code. Flowchart explains the whole technique of applying of ARM for locating the optimized results.

C. Proposed Algorithm:

Step:1 Initially get the itemsets from the database

Step:2 For finding the rules to generate the accurate results Apriori Algorithm are used on the itemsets after getting it from the database Put the itemset of size k in the form of table Ck

Then compare Ck with min-support value and

put in Lk for size k which is considered as

frequent itemset

Set L1 = {frequent items};

For(k = 1; Lk != ∅; k++) do start Ck+1 = candidates generated from Lk;

for all transaction t in database do

increment the remember of every candidates in Ck+1 which are contained in t

Lk+1 = applicants in Ck+1 with min_support

stop

return the fee of ∪kLk;

Step:3 For the Calculation of support and confidence value, there formulas are being used. Firstly, calculate support count of each itemset then finf the confidence value by using the support count

Support value (item) = Support number of item/Total number of every items

Confidence value (A|B) = Support value(AB)/Support value(A)

Step:4 Rule Fitness evaluation for animal migration: For calculating the fitness value of each animal,

performed this

methodFitness_overall(j)=absolute(log(Confide nce(j)+log(α*Support(j))/(len(Support)+len(Con fidence);

=sum(Fitness_overall)/len(data)

=abs( *(len(Support)/(

min Support *min Confidence*threshold)));

Step:5 Calculating fitness of AMO()

Get the fitness value by using benchmark function

Fit = benchmark_func ()

benchmark_func () = sum(x.*x, 2) popsize=length(dataset),D=2;lu= [1*ones(1,D);10000*ones(1,D)]

Searching for neighbors lseq = [popsize-1 popsize i i+1 i+2];

updating the velocity of the animals: newV(i,d) = p(i,d)+FF.*(p(f(d),d)-p(i,d));

checking fit_VV(i,:) <= fit(i,:), then p(i,:) = newVV(i,:);

fit(i,:) = fit_VV(i,:);

Calculating global minima again and then compare it

Step:6 Remove the rules which are having high fitness value as equated to net_fitness value. Rest of the rules are now the more optimized better rules.

D. Description:

1.In steps one the rules are determined by means of the apriori algorithm.It generate candidate item set and from candidate item set generates frequent item set in every iteration. It mainly depends on the idea of joining and pruning.

2.In the second step support and confidence for the rules are calculated by using the above formulae. 3.In the third step fitness function for the animal

migration is calculated.

4.In the forth step fitness function of rules and velocity of particles are updated iteratively until global optimum solution is reached.

(5)

177

E. Flowchart:

Fig.1 Flow Graph of ARMAMO Algorithm

The ARM is the basic field in data mining that is depend on support and confidence. The rules that are derived from the ARM approach have a particular support value and confidence value. For the animal migration to be applied on the rules, the fitness is compute for the rules depend on the formula mentioned above.

The above indicated flowchart gives a more extensive view about the proposed algorithm. The exploit of animal movement in ARM is a novel idea. Optimization in the field of rule mining is imperative. The confidence and support are first calculated utilizing ARM approach. With the help of these two parts, fitness work is surveyed. Evaluating the rules which are beneath fitness function as these principles will be less fit guidelines and should be migrated.

The prospect of animal migration is currently connected on to the standards underneath fitness esteem by figuring their migrating probability. For each case, probability is refreshed and next position for the development is assessed. In this technique, those rules which were less fit at first will move to a superior place and will survive. This will build their survival probability and accordingly, better standards can be mined.

F. Working example of AMO application

The proposed algorithm comprises of two parts, rules calculation and rule optimization. The first part comprises of rule calculation which has been explained above.

1) Data type transformation

Fig2. Data type transformation

2)Net_fitness evaluation

The fitness value is assessed in light of the support and certainty that have been resulting about the Apriori algorithm once in the past in the proposed methodology. Likewise, a net fitness value is is to be assessed for the thought of overall fitness. The fitness examination is utilized to pick the guidelines that are to be changed utilizing AMO strategy. The less proper tenets are looking out by differentiating their fitness value

with .

Begin

Get data from DB

Evaluate support and confidence value

Evaluating Fitness Function for animal migration

Perform Rule fitness updation

Find nearest neighbor by applying animal migrationand evaluating the probability of rule

Rules translation into Binary form If (Fitness Value>Rules)

Stop

No

Yes

Rules produced Apply Apriori Algorithm

While iterations=100

Applying AMO for evaluating rules

High migration probability rules removed rules

(6)

178 If On the off chance that it is less, at that point they are weaker rules. The equation determined for for fitness evaluation is:

Where, minsupport and minconfidence are predefined.

a. AMO

D

efining population size= length (rules) D=2;

Defining lower and upper bounds: lu= [1*ones (1,D);10000*ones(1,D)]

i. Initializing main population as [x,y]

ii. Evaluating the fitness of individual using fit= benchmark_func(x,problem)

iii. Assigning least fitness value as global_min iv. while iteration <100

a. for i=1:1:popsize

i. lseq=[popsize-1 popsize i i+1 i+2];

ii. j=randperm(5); iii. f(d)=lseq(j(2)); v. end.

i-2 i-1 I i+1 i+2

Where, i is the current rule and is to be moved towards the rule having better fitness on either side.

a. Let x contains only 1 value say 10. b. D=2, problem=1

c. P = [x y] d. p=10 8

e. fit= benchmark_func(10,1)

f. benchmark_func De Jong’s function

De Jong’s functions: The best of De Jong's functions is the so-known as circle work

f(x) = , -5.12 ≤ ≤ 5.12

Whose global minimum is clearly

g. it is calculated as 100 based on de jong’s function.

h. Global_min = least(fit) = 100 i. GlobalParams = 10 8 j. Update p(low, high) = 10 10 k. FF = normrnd(0,1) = 0.1656 l. at d=1

m. lseq=[popsize-1 popsize i i+1 i+2] n. f(d)=lseq(j(2))

o. will give f = 3 1

p. newV = p(i,d)+FF.*(p(f(d),d)-p(i,d)) newV = 25.1720

q. velocity of each particle gets updated and is bounded within range.

r. Position update based on newV.

s. New fitness values are assigned to the particles. New_fit = 2.3025

4. To entire particle evolution, the plan of a termination situation is wanted. In this idea, the evolution terminates while the amount of iterations attain 100. Finally, after the first-class particle is located, its confidence and support are recommended due to the fact the fee of minimal assist and minimal confidence. These parameters are employed for ARM to extract valuable facts.

3)Key Features of ARMAMO algorithm

The association rule mining is modified using animal migration optimization which has been best optimization approach amongst few. The weaker rules are migrated to have better fitness value so that the rules derived can be better.

IV. RESULT SIMULATION

This study’s test was conducted inside the surroundings of Microsoft Windows 7 using 1.60GHz difficult disk and 512MB RAM. The algorithm turned into coded in MATLAB.

[image:6.595.62.282.331.570.2]

In regard to the experimental checking out database, its source becomes a popular database file which has been taken from UCI repository with the database named as “spellman.csv”. The amounts of rules which can be derived above fitness value are shown below. The outcomes produce rules which are derived later applying AMO:

Table 1: Simulation Parameters

Parameter Value

Tool used MATLAB

RAM size 512 MB

Hard Disk 1.60 GHz

Dataset Spellman.csv

Algorithm Apriori Algorithm

(7)

179 Support is a sign of how frequently the item-set appears in the confidence and database. Confidence is a sign of how often the rule has been originate to be correct. So in the simulation work, change in confidence and support value for find out better rules by algorithms.

A. Comparative Analysis

1)Support 0.3, Confidence 0.5

240 ->180 (41.2235%, 68.4091%)

40 -> 50,60 (40.1735%, 73.8565%) 50 -> 40,60 (40.1735%, 75.4393%) 40,50 -> 60 (40.1735%, 85.0242%) 40,60 -> 50 (40.1735%, 95.1351%) 90 ->70 (39.443%, 76.0563%) 130 ->170 (38.3702%, 62.3285%) 150 ->60 (37.6855%, 57.8284%) 240 ->100 (37.6855%, 62.5379%) 40 ->130 (37.4572%, 68.8628%) 130 ->40 (37.4572%, 60.8454%) 40 ->150 (37.4344%, 68.8208%) 150 ->40 (37.4344%, 57.4431%) 130 ->210 (37.2746%, 60.5488%) 210 ->130 (37.2746%, 73.9583%) And so on…

[image:7.595.339.519.368.519.2]

Number of Rules 142

Fig 3. Compare Generate Rules

Time of execution of algorithms: How much time taken by both algorithms to get better result.

Fig.4. Time comparison between PSO and AMO

Above graph shows that AMO perform better compare to PSO algorithm by seeing above graph it can say that by using AMO the optimize result generated and time of execution enhance for this confidence and support value. AMO generates rules in less time as compared to PSO technique which makes them quite improves method from the existing one.

2)Support = 0.2 confidence = 0.4

[image:7.595.81.246.443.597.2]

40,130 ->150,170 (20.0183%, 53.443%) 40,150 ->130,170 (20.0183%, 53.4756%) 40,170 ->130,150 (20.0183%, 59.2167%) 130,150 ->40,170 (20.0183%, 43.4373%) 130,170 ->40,150 (20.0183%, 52.1713%) 150,170 ->40,130 (20.0183%, 44.5857%) 40,130,150 ->170 (20.0183%, 70.7829%) 40,130,170 ->150 (20.0183%, 83.6832%) 40,150,170 ->130 (20.0183%, 76.0624%) 130,150,170 ->40 (20.0183%, 62.2427%) Rules generated = 560

Fig.5. Compare between generated rules above fitness

[image:7.595.349.513.556.691.2]

Time of execution of algorithm: How much time taken by both algorithms to get better result.

Figure 6. Time comparison between PSO and AMO

[image:7.595.92.235.629.754.2]

(8)

180 Animal Migration optimization technique performs all the process after and generate the better results as compared to particle swarm optimization.

3)Support = 0.1 confidence = 0.5

130,220,240 ->120 (10.0205%, 60.6354%) 130,210,240 ->250 (10.0205%, 68.2737%) 130,240,250 ->210 (10.0205%, 57.4607%) 210,240,250 ->130 (10.0205%, 76.2153%) 140,170 ->150,240 (10.0205%, 51.285%) 140,150,170 ->240 (10.0205%, 67.1254%) 140,150,240 ->170 (10.0205%, 62.1813%) 140,170,240 ->150 (10.0205%, 72.562%) 160,170,200 ->240 (10.0205%, 78.2531%) 160,170,240 ->200 (10.0205%, 61.1421%) 170,200,240 ->160 (10.0205%, 57.6115%

[image:8.595.48.272.185.456.2]

Rules generated = 5406

Fig.7. Compare between generated rules above fitness

The above graph shows that the fitness value of proposed work is much better than the existing techniques which mean that we can get the much fitted values from the database for getting more efficient results.

[image:8.595.319.544.236.465.2]

Time of execution: How much time taken by both algorithms to get better result.

Fig. 8 Time comparison between PSO and AMO

Above graph shows that AMO perform better compare to PSO algorithm by seeing above graph it can say that by using AMO optimize result generated and time of execution enhance for this support and confidence value.

AMO is much better process in term of execution time for the movement of an individual from one place to another.

Time comparison between base PSO and proposed AMO in table form. Time of comparisons between base and proposed optimization method in below table shows time comparisons between different value of support and confidence value.

Table 2: Time Comparison

Support Confidence ARMPSO time(ms)

ARMAMO time(ms)

0.3 0.5 6.370296 2.238881

0.2 0.4 81.893388 78.909760

0.1 0.5 244.296550 473.162843

Table 3:

Rules generated by different algorithms

Support Confidence ARMPSO ARMAMO

0.3 0.5 91 142

0.2 0.4 559 560

0.1 0.5 5405 5406

Above tables shows comparison between associate rule generated by base and proposed optimization method and time taken by both algorithm by seeing result. We are able to say that the proposed algorithm work better as compare to current one.

V. CONCLUSION

Many problems which might be considered hard may be expected or even optimized with accurate outcomes by using AMO, hence its popularity. Choosing the exploit of AMO and alteration it to fit your complex that can be a difficult venture in itself. Decisions encompass populace size, genome representation and the amount of generations to migrate, adaptability component. The conclusion from this is that change of AMO to a selected difficult may be hard and will probably consist of loads of trials and errors but while all parameters are set correctly you have a well-functioning, well optimizing algorithm in order to probably produce a optimized approach to your trouble or at least a very good estimate.

[image:8.595.90.239.556.701.2]

(9)

181 Rules are used for the decision of the procedure which are generated by usng animal migration optimization which is efficient and reliable technique for the formation of rules. As of these days it's far but to discover an algorithm that plays ideal on all issues, the versions in seek space topology is one principal motive for this. Before solving a difficult there was no information approximately the search space. In the future work, we can generate rules with other optimized techniques also which can enhanced the performance of the process. We can generate more optimum rules for taking the better decisions and we can also implement the method to reduce the complexity of the work.

REFERENCES

[1] U. M. Fayyad, G. P. Shapiro and P. Smyth, From Data Mining to

KnowledgeDiscovery in Databases. 0738-4602-1996, AI

Magazine (Fall 1996).pp: 37–53.

[2] J. Han and M. Kamber , “Data Mining: Concepts and

Techniques”, 2nd ed.,The Morgan Kaufmann Series in Data Management Systems, Jim Gray, Series Editor 2006.

[3] DewangRupesh, AgarwalJitendra. “A New Method for

Generating All Positive and Negative association

Rules”:International Journal on Computer Science and Engineering,(2011) ,Vol. 3, pp:1649-1657

[4] Pradnya A. Shirsath, Vijay Kumar Verma, “A Recent Survey on

Incremental Temporal Association Rule Mining”, International Journal of Innovative Technology and Exploring Engineering (IJITEE) ISSN: 2278-3075, Volume-3, Issue-1, June 2013.

[5] RakeshAgrawal, SaktiGhosh, Tomasz Imielinski, BalaIyer, and

Arun Swami, An Interval Classier for Database Mining Applications", VLDB-92 , Vancouver, British Columbia, 1992, 560-573.

[6] Dixit et al.,” A Survey of Various Association Rule Mining

Approaches” International Journal of Advanced Research in Computer Science and Software Engineering 4(3), March - 2014, pp. 651-655.

[7] Dyer JRG, Ioanno CC, Morrell LJ, Croft DP, Couzin ID, Waters

DA, Krause J (2008) Consensus decision making in human crowds. AnimBehav 75(2): 461–470.

[8] Braha D (2012) Global civil unrest: contagion, self-organization,

and prediction. PLoSONE 7(10):e48596.

doi:10.1371/journal.pone.0048596

[9] Ballerini M, Cabibbo N, Candelier R, Cavagna A, Cisbani E,

Giardina I, Lecomte V, Orlandi A, Parisi G, Procaccini A, VialeM, Zdravkovic V (2008) Interaction ruling animal collective

behavior depends on topological rather than metric

distance105(4):1232–1237arXiv:0709.1916.Bibcode.

2008PNAS.105.1232B.doi:10.1073/pnas.0711437105.PMC22341 21.PMID18227508.//www.ncbi.nlm.nih.gov/pmc/articles/PMC22 34121/: evidence from a field study. ProcNatlAcadSci USA.

[10] Vivek Badheet. al., “Vague Set Theory for Profit Pattern and

Decision Making in Uncertain Data”, (IJACSA) International

Journal of Advanced Computer Science and Applications, Vol. 6, No. 6, 2015.

[11] Omari et.al. new temporal measure for association rule mining. Second International Conference on Knowledge Discovery and Data Mining,1997.

[12] Chen Chu-xiang, Shen Jiang-jing, Chen Bing, et al., “An

Improvement Apriori Arithmetic Based on Rough Set Theory”, In proceeding of the 2011 Third Pacific-Asia Conference on Circuits, Communications and System (PACCS). pp.1-3, 2011.

[13] Christian Hidber. Online Association rule mining. SIGMOD ’99

Philadelphia PA. ACM 1-58113-084-8/99/05, 1999.

[14] Agrawal, R. and Srikant, R. Fast Algorithms for Mining

Association rules. Proc. 20th VLDB conference, Santiago, Chile, 1994.

[15] Russel Pears and Yun Sing Koh, “Weighted Association Rule

Mining Using Particle Swarm Optimization”, PAKDD 2011 Workshops, LNAI 7104, pp. 327–338, 2012.

[16] R.J. Kuoet. al., ” Application of particle swarm optimization to association rule mining”, Applied Soft Computing 11 (2011) 326– 336.

[17] R. O. Oladele, J. S. Sadiku,Genetic Algorithm Performance with

Different Selection Methods in Solving Multi-Objective Network Design Problem, International Journal of Computer Applications (0975 – 8887) Volume 70– No.12, May 2013.

[18] Mohammed J. Zaki, “Parallel and Distributed Association

Mining: A Survey”, Concurrency IEEE, ISSN: 1092-3063, Volume 7, Issue 4, pp 14-25, December 1999.

[19] Takeshi Fukuda, Yasuhiko Morimoto, Shinichi Morishita and

Takeshi Tokuyama, “Data Mining Using Two-Dimensional Optimized Association Rules: Scheme, Algorithms, and Visualization”, ACM SIGMOD international conference on Management of data, Volume 25 Issue 2, pp 13-23, June 1996.

[20] SmrutiRekha Das, Pradeepta Kumar Panigrahi, Kaberi Das and

Debahuti Mishra, “Improving RBF Kernel Function of Support

Vector Machine using Particle Swarm Optimization”,

International Journal of Advanced Computer Research (IJACR) Volume-2, Number-4, Issue-7, December-2012.

[21] M. Dorigo and G. Di Caro.New Ideas in Optimisation.McGraw