Computer Science ›› 2017, Vol. 44 ›› Issue (1): 283-288, 299.doi: 10.11896/j.issn.1002-137X.2017.01.052

Previous Articles     Next Articles

Description of Data Association Occurring in Related Sets and Specific Example

YAN Lin, RUAN Ning, YAN Shuo and GAO Wei   

  • Online:2018-11-13 Published:2018-11-13

Abstract: In order to discuss the problem on the data association,a data set was divided into granules according to different levels,and each granule was assigned related set.This gives rise to a hierarchy structure called granulation tree which is associated with classes of related sets.Then,supported by two granulation trees based on the same data set,a definition of the data association was introduced,demonstrating a numerical representation of the data association occurring in related sets,and leading to a way of numerical description on it.The research on the topic brings about a condition that is equivalent to the definition.Also by using the condition and based on a specific example,some properties were investigated,which focuses on numerical analyses of some issues,such as the close degree of the data association,the granulation identity between data,the numerical comparison of data associations,and so on.Accordingly,the discussion on the specific example provides the basis of algorithm programming and shows the practical significance of the research.

Key words: Partition,Granulation tree,Data association,Granule,Related set

[1] ZHANG Jun-bo,LI Tian-rui,RUAN Da.Neighborhood Rough Sets for Dynamic Data Mining[J].International Journal of Intelligent Systems,2012,27(4):317-342.
[2] HONKO P.Association Discovery from Relational Data viaGranular Computing[J].Information Sciences,2013,234(11):136-149.
[3] TAGARELLI A.Exploring Dictionary-based Semantic Relatedness in Labeled Tree Data[J].Information Sciences An International Journal,2013,220(1):244-268.
[4] COZMAN F G.Independence for Full Conditional Probabilities:Structure,Factorization,Non-uniqueness,and Bayesian Networks[J].International Journal of Approximate Reasoning,2013,54(9):1261-1278.
[5] SHE Yan-hong.On the Rough Consistency Measures of LogicTheories and Approximate Reasoning in Rough Logic[J].International Journal of Approximate Reasoning,2014,55(1):486-499.
[6] YAN Lin,YAN Shuo.Granular Reasoning and Decision System’sDecomposition[J].Journal of Software,2012,7(3):683-690.
[7] YAN Lin,LIU Qing.Researches on Granular Reasoning Based on Granular Space[C]∥ Proceedings of 2008 IEEE Internatio-nal Conference on Granular Computing.Hangzhou,China:706-711.
[8] JIA Xiu-yi,LIAO Wen-he,TANG Zhen-min.Minimum Cost Attribute Reduction in Decision-theoretic Rough Set Models[J].Information Sciences,2013,219:151-167.
[9] MCALLISTER R A,ANGRYK R A.Abstracting for Dimensionality Reduction in Text Classification[J].International Journal of Intelligent Systems,2013,28(2):115-138.
[10] YAN Lin,SONG Jin-peng.Granular Trees Based on DifferentData Sets and Their Modeling Applications[J].Computer Scien-ce,2014,41(3):258-262.(in Chinese) 闫林,宋金鹏.数据集的粒化树及其建模应用[J].计算机科学,2014,41(3):258-262.
[11] YAN Shuo,YAN Lin.Descriptive Method on Data Association Based on Granulation Trees[J].Pattern Recognition and Artificial Intelligence,2015,28(12):1057-1066.(in Chinese) 闫硕,闫林.数据关联的粒化树描述方法[J].模式识别与人工智能,2015,28(12):1057-1066.
[12] YAN Lin.Fundamentals of Mathematical Logic and Granular Com-puting[M].Beijing:Science Press,2007.(in Chinese) 闫林.数理逻辑基础与粒计算[M].北京:科学出版社,2007.
[13] PEDRYCZ W.Granular Computing:Analysis and Design of Intelligent Systems[M].Boca Raton:CRC Press/ Francis Taylor,2013.
[14] KOLMAN B,BUSBY R C,ROSS S C.Discrete MathematicalStructures(fourth edition)[M].New Jersey:Prentice-Hall,2001.

No related articles found!
Full text



[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75, 88 .
[2] XIA Qing-xun and ZHUANG Yi. Remote Attestation Mechanism Based on Locality Principle[J]. Computer Science, 2018, 45(4): 148 -151, 162 .
[3] LI Bai-shen, LI Ling-zhi, SUN Yong and ZHU Yan-qin. Intranet Defense Algorithm Based on Pseudo Boosting Decision Tree[J]. Computer Science, 2018, 45(4): 157 -162 .
[4] WANG Huan, ZHANG Yun-feng and ZHANG Yan. Rapid Decision Method for Repairing Sequence Based on CFDs[J]. Computer Science, 2018, 45(3): 311 -316 .
[5] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[6] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[7] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[8] LIU Qin. Study on Data Quality Based on Constraint in Computer Forensics[J]. Computer Science, 2018, 45(4): 169 -172 .
[9] ZHONG Fei and YANG Bin. License Plate Detection Based on Principal Component Analysis Network[J]. Computer Science, 2018, 45(3): 268 -273 .
[10] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99, 116 .