Rough Set Model for Discovering Hybrid Association Rules

Details Rough Set Model for Discovering Hybrid Association Rules Rough Set Model for Discovering Hybrid Association Rules

2009-06-23

arxiv.org/abs/0906.4172v1

IJCSIS June 2009 Issue, Vol. 2

Computer Science

Databases

5 pages, International Journal of Computer Science and Information Security

Scientific paper

In this paper, the mining of hybrid association rules with rough set approach is investigated as the algorithm RSHAR.The RSHAR algorithm is constituted of two steps mainly. At first, to join the participant tables into a general table to generate the rules which is expressing the relationship between two or more domains that belong to several different tables in a database. Then we apply the mapping code on selected dimension, which can be added directly into the information system as one certain attribute. To find the association rules, frequent itemsets are generated in second step where candidate itemsets are generated through equivalence classes and also transforming the mapping code in to real dimensions. The searching method for candidate itemset is similar to apriori algorithm. The analysis of the performance of algorithm has been carried out.

Affiliated with

Also associated with

No associations

Rating

Rough Set Model for Discovering Hybrid Association Rules 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 Rough Set Model for Discovering Hybrid Association Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Rough Set Model for Discovering Hybrid Association Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708108