Earticle

초록

영어

Recently network data domain knowledge updates quickly, but with the growth of the large amount of information, the stability of the information itself decreases dramatically. So, one of the key research directions is that how to dig out the valuable information from the unstable and chaotic huge information. The research on rules getting incomplete information is helpful for getting more useful information. When the incomplete information turns into complete, it will cause a certain degree of information distortion. For this problem, the paper proposes the decomposition method of incomplete information system. This method, without completion process of incomplete information, selects a template through a template function. The template function is based on the rough set theory, and when ensuring the template, it can extract subset from incomplete information through decreasing step by step. Incomplete information system need to use an intermediate variable based on rough set theory when it is broken down by simplified rule sets.

목차

Abstract
 1. Introduction
 2. The Data Mining Research Background
  2.1 Incomplete Information System Research Situation
  2.2. The Basic Concept of Rough Set Theory
 3. Decomposition Algorithm
  3.1. Proposing the Evaluation Function
  3.2. Building the Intermediate Variable
  3.3. The Process of Database Decomposition
 4. The Example Verification of Decomposition Algorithm
 5. Conclusion
 References

키워드

저자

• Tu Pin [ Hunan Vocational College for Nationalities, Yueyang City, Hunan Province, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605