TITLE

Interestingness Measures for Multi-Level Association Rules

AUTHOR(S)
Prakash, R. Vijaya; Govardhan, A.; Sarma, S. S. V. N.
PUB. DATE
August 2012
SOURCE
Information & Knowledge Management (2224-896X);2012, Vol. 2 Issue 6, p20
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Association rule mining is one technique that is widely used to obtain useful associations rules among sets of items. Much work has been done focusing on efficiency, effectiveness and redundancy. There has also been a focusing on the quality of rules from single level datasets with many interestingness measures proposed. However, there is a lack of interestingness measures developed for multi-level and cross-level Association rules. Single level measures do not take into account the hierarchy found in a multi-level dataset. This leaves the Support-Confidence approach, which does not consider for the hierarchy. In this paper we propose two approaches which measure multi-level association rules to help and evaluate their interestingness. These measures of diversity and peculiarity can be used to identify those rules from multi-level datasets that are potentially useful.
ACCESSION #
85208076

 

Related Articles

  • Finding Association Rules through Efficient Knowledge Management Technique. Anwar, M. A. // International Journal of Advanced Computer Science & Application;Dec2012, Vol. 3 Issue 12, p131 

    One of the recent research topics in databases is Data Mining, to find, extract and mine the useful information from databases. In case of updating transactions in the database the already discovered knowledge may become invalid. So we need efficient knowledge management techniques for finding...

  • INCREMENTAL DISTANCE ASSOCIATION RULES MINING. Emam, Ahmed Z.; Al-Zaben, Lama A. // Science International;Jun2013, Vol. 25 Issue 2, p249 

    Association Rules Mining (ARM) is simply mining a given dataset for some kind of data that appear together frequently to form rules, while Distance-Based Association Rule Mining (DARM) is an enhanced Apriori algorithm that takes a distance between each pair of items within an item set into...

  • Integrated Web Recommendation Model with Improved Weighted Association Rule Mining. Mary, S. A. Sahaaya Arul; Malarvizhi, M. // International Journal of Data Mining & Knowledge Management Proc;Mar2013, Vol. 3 Issue 2, p87 

    World Wide Web plays a significant role in human life. It requires a technological improvement to satisfy the user needs. Web log data is essential for improving the performance of the web. It contains large, heterogeneous and diverse data. Analyzing g the web log data is a tedious process for...

  • A SURVEY ON PRIVACY PRESERVING ASSOCIATION RULE MINING. Sathiyapriya, K.; Sadasivam, G. Sudha // International Journal of Data Mining & Knowledge Management Proc;Mar2013, Vol. 3 Issue 2, p119 

    Businesses share data, outsourcing for specific business problems. Large companies stake a large part of their business on analysis of private data. Consulting firms often handle sensitive third party data as part of client projects. Organizations face great risks while sharing their data. Most...

  • Fast Algorithms For Mining Association Rules In Datamining. Usharani, P. // International Journal of Scientific & Technology Research;Dec2013, Vol. 2 Issue 12, p13 

    We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algo-rithms. Empirical evaluation shows that these algorithms outperform the...

  • Association Rule Mining Considering Local Frequent Patterns with Temporal Intervals. Kuo-Cheng Yin; Yu-Lung Hsieh; Don-Lin Yang; Ming-Chuan Hung // Applied Mathematics & Information Sciences;2014, Vol. 8 Issue 4, p1879 

    In traditional association rule mining algorithms, if the minimum support is set too high, many valuable rules will be lost. However, if the value is set too low, then numerous trivial rules will be generated. To overcome the difficulty of setting minimum support values, global and local...

  • An Algorithm of Association Rules Mining in Large Databases Based on Sampling. Zhi Liu; Tianhong Sun; Guoming Sang // International Journal of Database Theory & Application;Dec2013, Vol. 6 Issue 6, p95 

    In recent years, the amount of data into a geometric growth puts forward higher requirements on data mining algorithm. In the process of frequent itemsets of traditional Apriori algorithm produced, frequent itemsets' generation and storage are quite a waste of time and space. In this paper, we...

  • New Approach to Optimize the Time of Association Rules Extraction. Slimani, Thabet // International Journal of Computer Science Issues (IJCSI);Sep2013, Vol. 10 Issue 5, p234 

    The knowledge discovery algorithms have become ineffective at the abundance of data and the need for fast algorithms or optimizing methods is required. To address this limitation, the objective of this work is to adapt a new method for optimizing the time of association rules extractions from...

  • A Hybrid GeneticMax Algorithm for Improving the Traditional Genetic Based Approach for Mining Maximal Frequent Item Sets. Kabir, Mir Md. Jahangir; Shuxiang Xu; Byeong Ho Kang; Zongyuan Zhao // International Journal of Computer Science & Network Security;Oct2014, Vol. 14 Issue 10, p27 

    Mining Frequent item sets is one of the most useful data mining methods which discovers important relationships among attributes of data sets. Initially it was developed for market basket analysis, but these days it is used to solve any task where discovering hidden relationships among different...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics