Association against dissociation: some pragmatic considerations for frequent itemset generation under fixed and variable thresholds

@article{Pal2005AssociationAD,
  title={Association against dissociation: some pragmatic considerations for frequent itemset generation under fixed and variable thresholds},
  author={Sukomal Pal and Aditya Bagchi},
  journal={SIGKDD Explorations},
  year={2005},
  volume={7},
  pages={151-159}
}
Traditionally, support is considered to be the standard measure for frequent itemset generation in Association Rule mining. This paper provides a new measure called togetherness where dissociation among items is also considered as a parameter in the frequent itemset generation process. Results of performance analysis show that association against dissociation is a more pragmatic approach and discovers truly associated candidate itemsets. Second part of the paper extends this togetherness… CONTINUE READING
2
Twitter Mentions

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS

Discovering association rules partially devoid of dissociation by weighted confidence

  • 2015 IEEE 2nd International Conference on Recent Trends in Information Systems (ReTIS)
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Frequent pattern generation in association rule mining using weighted support

  • Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)
  • 2015
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Optimal usage of pessimistic association rules in cost effective decision making

  • 2017 4th International Conference on Opto-Electronics and Applied Optics (Optronix)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

Trust: A new objective measure for symmetric association rule mining in account of dissociation and null transaction

  • 2016 Eighth International Conference on Advanced Computing (ICoAC)
  • 2017
VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-3 OF 3 REFERENCES

Pushing Support Constraints Into Association Rules Mining

  • IEEE Trans. Knowl. Data Eng.
  • 2003
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Finding Interesting Associations without Support Pruning

  • IEEE Trans. Knowl. Data Eng.
  • 2001
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…