한국인터넷방송통신학회논문지 (The Journal of the Institute of Internet, Broadcasting and Communication)

  • 제15권5호
  • /
  • Pages.69-74
  • /
  • 2015
  • /
  • 2289-0238(pISSN)
  • /
  • 2289-0246(eISSN)
한국인터넷방송통신학회 (The Institute of Internet, Broadcasting and Communication)
권호 표지
DOI QR코드

DOI QR Code

사후확률에 기반한 근사 규칙의 생성

Creation of Approximate Rules based on Posterior Probability

  • 투고 : 2015.07.10
  • 심사 : 2015.10.09
  • 발행 : 2015.10.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 데이터베이스의 정보시스템을 구성하는 속성을 감축하여 빠른 검색을 보장하는 제어규칙의 생성에 관한 연구이다. 일반적으로 정보시스템에는 불필요한 많은 속성들이 존재하고 있다. 이때 정보시스템의 객체들이 비일관적일 경우에는 응답의 정확성을 기대하기 어렵게 된다. 그러므로 본 논문에서는 러프엔트로피의 개념과 베이지언 사후확률을 적용하여 불필요한 속성을 제거하여 정보시스템을 간결화 하는데 주안점을 두었다. 제안된 알고리즘에서는 러프이론에 기반한 최적의 리덕트를 생성하는 과정에서 사후확률을 적용하여 결정속성에 대한 조건속성의 함의를 러프엔트로피의 척도로 비교하여 영향력이 약한 속성을 제거하여 제어규칙을 간결하게 표현할 수 있다. 제안된 알고리즘을 신입사원의 채용에 적용하여 지식감축의 효용성을 보인다.

In this paper the patterns of information system is reduced so that control rules can guarantee fast response of queries in database. Generally an information system includes many kinds of necessary and unnecessary attribute. In particular, inconsistent information system is less likely to acquire the accuracy of response. Hence we are interested in the simple and understandable rules that can represent useful patterns by means of rough entropy and Bayesian posterior probability. We propose an algorithm which can reduce control rules to a minimum without inadequate patterns such that the implication between condition attributes and decision attributes is measured through the framework of rough entropy. Subsequently the validation of the proposed algorithm is showed through test information system of new employees appointment.

키워드

참고문헌

  1. Williams, Grahm J. and Simoff, Simeon J. "Data Mining Theory, Methodology, Techniques and Applications(Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence)", Springer, 2007
  2. Ramakrishnan., Naren and Grama, Ananth Y,, "Data Mining: From Serendipity to Science", IEEE Computer August Vol. 34-37, 1999
  3. Han, Jiawei, Kamber, Micheline, "Data Mining: Concepts and Techniques", San Franciso CA, USA, Morgan, Kaufmann, Publishers, 2001.
  4. Hand, D.J., Mannila, H., & Smyth, P. "Principles of Data Mining", Cambridge, MA:MIT Press, 2001
  5. Beaubouef, T., Petry, F. E. and Arora, G., Information-theoretic measures of uncertainty for rough sets and rough relational databases, Information Science, Vol. 109, No. 1-4, pp. 185-195, 1998. https://doi.org/10.1016/S0020-0255(98)00019-X
  6. Pawlak, Z., "Rough sets", International Journal of Information Sciences, 11, pp. 341-356, 1982 https://doi.org/10.1007/BF01001956
  7. Pawlak, Z., "Using Variable Precision Rough Set for Selection and Classification of Biological Knowledge Integrated in DNA Gene Expression", Jouranl of Integrative Bioinformatics, Vol. 9, No. 3, pp.1-17, 2012
  8. Pal S.K., Skowron, "Rough Fuzzy Hybridization: A new trend in decision making", Springer Verlag, Berlin, 1999
  9. R. Vashist, M.L. Garg, "Rule Generation based on Reduct and Core: A Rough Set Approach", International Journal of Computer Applications, Vol. 29, No. 9, pp. 0975-8887, Sept. 2011
  10. Lin S., Jiucheng X., Zhan'ao X. and Lingjun Z., "Rough Entropy-based Feature Selection and Its Application", Journal of International Computational Science, Vol. 8, No. 9, pp. 1525-1532, 2011
  11. Inkyoo P., "The generation of Control Rules for Data Mining", The Journal of Digital Policy and Management, Vol. 11, No. 11, pp. 343-349, 2013