Earticle

초록

영어

To investigate the association of data with other data in reality, the research begins with data sets which are divided into different partitions. Because each partition consists of granules and owns a level, all the partitions constitute a granulation set whose elements are the granules. As a hierarchy system, the granulation set together with the inclusion relation gives rise to a structure called a granulation tree. The research on the data association establishes a method to describe the associations of the data in a granulation tree with the data in another granulation tree. The method involves a necessary and sufficient condition used to check the data associations. Because the necessary and sufficient condition is bound up with the upper approximation, the study also develops a way of investigation into rough sets. As an example, a practical problem is modeled by granulation trees, and the associations of the data in a granulation tree with the data in another granulation tree can be examined by use of the necessary and sufficient condition. Meanwhile, because the study is closely linked to granules and alterations of granularity, the process can be viewed as an approach to research on granular computing

목차

Abstract
 1. Introduction
 2. Fundamentals
 3. Granulation Tree Based on Data Set
 4. Data Association Based on Granulation Trees
  4.1. Data Association
  4.2. Research on Data Association
  4.3. Comparison between Data Associations
 5. Description of an Actual Problem
 6. Conclusion
 Acknowledgments
 References

키워드

저자

• Yan Shuo [ School of Computer and Information Technology, Beijing Jiao Tong University, Beijing, China ]
• Yan Lin [ College of Computer and Information Engineering, Henan Normal University, Xinxiang, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Database Theory and Application

• 간기

  격월간

• pISSN

  2005-4270

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605