원문정보
보안공학연구지원센터(IJSEIA)
International Journal of Software Engineering and Its Applications
Vol.8 No.1
2014.01
pp.167-180
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Mining least association rules has received a great attention from the past decades. However, no current research has been specifically performed for visualizing these types of rules. In this paper, a model for visualizing critical least association rules is presented. The proposed model contains five main steps, including scanning dataset, constructing Least Pattern Tree (LP-Tree), applying Critical Relative Support (CRS), capturing Critical Least Association Rules and finally visualizing the respective rules.
목차
Abstract
1. Introduction
2. Related Works
3. Proposed Method
3.1. Association Rules
3.2. Definition
3.3. Model
3.4. Algorithm Development
4. Experimental Results
4.1. A Dataset from [7]
4.2. Student Examination Dataset
5. Conclusion
References
1. Introduction
2. Related Works
3. Proposed Method
3.1. Association Rules
3.2. Definition
3.3. Model
3.4. Algorithm Development
4. Experimental Results
4.1. A Dataset from [7]
4.2. Student Examination Dataset
5. Conclusion
References
저자정보
참고문헌
자료제공 : 네이버학술정보