Computer Science – Databases
Scientific paper
2012-02-22
http://www.airccj.org/ijdkp/ijdkp2011.html
Computer Science
Databases
15 pages
Scientific paper
In this paper a new mining algorithm is defined based on frequent item set. Apriori Algorithm scans the database every time when it finds the frequent item set so it is very time consuming and at each step it generates candidate item set. So for large databases it takes lots of space to store candidate item set .In undirected item set graph, it is improvement on apriori but it takes time and space for tree generation. The defined algorithm scans the database at the start only once and then from that scanned data base it generates the Trade List. It contains the information of whole database. By considering minimum support it finds the frequent item set and by considering the minimum confidence it generates the association rule. If database and minimum support is changed, the new algorithm finds the new frequent items by scanning Trade List. That is why it's executing efficiency is improved distinctly compared to traditional algorithm.
rao Madhuri
Shaikh Sanober
No associations
LandOfFree
Association Rule Mining Based On Trade List does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Association Rule Mining Based On Trade List, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Association Rule Mining Based On Trade List will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-414658