earticle

논문검색

Mining Least Association Rules of Degree Level Programs Selected by Students

초록

영어

One of the most popular and important studies in data mining is association rules mining. Generally, association rules can be divided into two categories called frequent and least. However, finding the least association rules is more complex and time consuming as compared to the frequent one. These rules are very useful in certain application domain such as determining the exceptional association between university’s programs being selected by students. Therefore in this paper, we apply our novel measure called Definite Factors (DF) to determine the significant least association rules from undergraduate’s program selection database. The dataset of computer science student for July 2008/2009 intake from Universiti Malaysia Terengganu was employed in the experiment. The result shows that our measurement can mine these rules and it is at par with the existing benchmarked Relative Support Apriori (RSA) measurement.

목차

Abstract
 1. Introduction
 2. Related Works
 3. Proposed Method
  3.1. Definition
  3.2. Construct Definite Least Association Rules
 4. Experimental Results
 5. Conclusion
 References

저자정보

  • Zailani Abdullah Department of Computer Science, Universiti Malaysia Terengganu 21030 Kuala Terengganu, Terengganu, Malaysia
  • Tutut Herawan Department of Mathematics Education, Universitas Ahmad Dahlan Jalan 55166, Yogyakarta, Indonesia
  • A. Noraziah Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang Lebuhraya Tun Razak, 26300 Kuantan Pahang, Malaysia
  • Mustafa Mat Deris Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia, Parit Raja, Batu Pahat 86400, Johor,

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.