원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.7 No.3
2014.05
pp.155-166
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
In this paper, we propose a new version of FP-Growth algorithm to find association rules. In this version, we vary the minsup value from one level to another. This variation is made in two cases: increasing and decreasing the minsup value. We performed a set of experiments to validate the usefulness of our proposition in the generation of association rules process.
목차
Abstract
1. Introduction
2. Related works
3. Background
4. Proposed Approach
5. Experimental results
5.1 Increasing minsup variant
5.2 Decreasing minsup variant
6. Conclusion
Acknowledgements
References
1. Introduction
2. Related works
3. Background
4. Proposed Approach
5. Experimental results
5.1 Increasing minsup variant
5.2 Decreasing minsup variant
6. Conclusion
Acknowledgements
References
저자정보
참고문헌
자료제공 : 네이버학술정보