Interestingness Measures for Rare Association Rules and Periodic-Frequent Patterns

نویسندگان

  • Akshat Surana
  • Krishna Reddy
  • Uday Kiran
  • Mohak Sharma
  • Abhishek Sainani
چکیده

Data mining is the process of discovering significant and potentially useful knowledge in the form of patterns from the data. As a result, the notion of interestingness is very important for extracting useful knowledge patterns. Numerous interestingness measures have been discussed in the literature to assess the interestingness of a knowledge pattern. In this thesis, we focus on selecting a right interestingness measure for mining association rules, in particular rare association rules. Association rule mining is an important knowledge discovery technique in the field of data mining. It involves finding interesting associations between the sets of objects in a transactional database. A rare association rule is an association rule with items having low support. In many real-world applications, rare association rules can provide useful information to the users. Typically, association rules are extracted with support and con f idence measures. Several other interestingness measures, such as li f t and all-con f idence, have also been used to extract association rules. Each interestingness measure has its own selection bias that justifies the significance of an association rule over others. Thus, there exists no single interestingness measure which is better than others in all application domains. Each interestingness measure has a set of properties. A framework exists in the literature which suggests to select a measure based on the properties of interest to the user. However, it is unclear which properties a user should consider for mining rare association rules. In this thesis, we have analyzed the properties of different interestingness measures and suggest the properties which the user should consider for extracting rare association rules. The experimental results from real-world datasets show that the measures satisfying the prescribed properties can efficiently extract rare association rules.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selecting a Right Interestingness Measure for Rare Association Rules

In the literature, the properties of several interestingness measures have been analyzed and a framework has been proposed for selecting a right interestingness measure for extracting association rules. As rare association rules contain useful knowledge, researchers are making efforts to investigate efficient approaches to extract the same. In this paper, we make an effort to analyze the proper...

متن کامل

Defining Interestingness for Association Rules

Interestingness in Association Rules has been a major topic of research in the past decade. The reason is that the strength of association rules, i.e. its ability to discover ALL patterns given some thresholds on support and confidence, is also its weakness. Indeed, a typical association rules analysis on real data often results in hundreds or thousands of patterns creating a data mining proble...

متن کامل

Interestingness measures for association rules: Combination between lattice and hash tables

There are many methods which have been developed for improving the time of mining frequent itemsets. However, the time for generating association rules were not put in deep research. In reality, if a database contains many frequent itemsets (from thousands up to millions), the time for generating association rules is more longer than the time for mining frequent itemsets. In this paper, we pres...

متن کامل

Numeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm

Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...

متن کامل

An Efficient Algorithm for Mining Sequential Rules with Interestingness Measures

Mining sequential rules are an important problem in data mining research. It is commonly used for market decisions, management and behaviour analysis. In traditional association-rule mining, rule interestingness measures such as confidence are used for determining relevant knowledge. They can reduce the size of the search space and select useful or interesting rules from the set of the discover...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011