Discovering maximal potentially useful association rules based on probability logic

Jitender Deogun, Liying Jiang, Vijay V. Raghavan

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


Apriori-like algorithms are widely used for mining support-based association rules. In such applications, the underlying assumption is that rules of frequent itemsets are useful or interesting to the users. However, in many applications, infrequent events may be of interest or frequency of events may have no relationship to their interestingness to the user. Apriori-like algorithms do not present efficient methods for discovering interesting infrequent itemsets. In this paper, We present a new model of Knowledge Discovery in Databases (KDD) based on probability logic and develop a new notion of Maximal Potentially UseFul (MaxPUF) patterns, leading to a new class of association rules called maximal potentially useful (MaxPUF) association rules, which is a set of high-confidence rules that are most informational and potentially useful. MaxPUF association rules are defined independent of support constraint, and therefore are suitable for applications in which both frequent and infrequent itemsets maybe of interest. We develop an efficient algorithm to discover MaxPUF association rules. The efficiency and effectiveness of our approach is validated by experimemts based on weather data collected at the Clay Center, Nebraska, USA from 1959 to 1999.

Original languageEnglish (US)
Pages (from-to)274-284
Number of pages11
JournalLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
StatePublished - 2004
Externally publishedYes
Event4th International Conference, RSCTC 2004 - Uppsala, Sweden
Duration: Jun 1 2004Jun 5 2004

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Discovering maximal potentially useful association rules based on probability logic'. Together they form a unique fingerprint.

Cite this