A threshold free implication rule mining

  • Sim A
  • Indrawan M
  • Srinivasan B
N/ACitations
Citations of this article
4Readers
Mendeley users who have this article in their library.

Abstract

Typically, before association rules are mined, a user needs to determine a support threshold in order to obtain only the frequent item sets. Having users to determine a support threshold attracts a number of issues. We propose an association rule mining framework that does not require a pre-set support threshold. The framework is developed based on implication of propositional logic. The experiments show that our approach is able to identify meaningful association rules within an acceptable execution time.

Cite

CITATION STYLE

APA

Sim, A. T. H., Indrawan, M., & Srinivasan, B. (2008). A threshold free implication rule mining. Imecs 2008: International Multiconference of Engineers and Computer Scientists, Vols I and Ii, 578–583. Retrieved from <Go to ISI>://WOS:000256665700108

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free