Mining association rules with multiple minimum supports using maximum constraints

  title={Mining association rules with multiple minimum supports using maximum constraints},
  author={Yeong-Chyi Lee and Tzung-Pei Hong and Wen-Yang Lin},
  journal={Int. J. Approx. Reasoning},
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. The support requirements should then vary with different items. In this paper, we provide another point of view about defining the minimum supports of itemsets when items… CONTINUE READING
Highly Cited
This paper has 76 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 42 extracted citations

77 Citations

Citations per Year
Semantic Scholar estimates that this publication has 77 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 19 references

Finding association rules by granular computing: fast algorithms for finding association rules

  • T. Y. Lin, E. Louie
  • Data Mining, Rough Sets and Granular Computing…
  • 2002
1 Excerpt


  • K. Wang
  • H, J. Han, Mining frequent itemsets using support…
  • 2000
2 Excerpts


  • R. Agrawal, R. Srikant
  • Vu, Mining association rules with item…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…