Indiscernibility and similarity in an incomplete information table

作者: Renpu Li , Yiyu Yao

DOI: 10.1007/978-3-642-16248-0_20

关键词: Complete informationTable (database)Relation (database)IntersectionSimilarity (network science)MathematicsSemantic interpretationSimilarity relationDiscrete mathematicsTheoretical computer science

摘要: A new method is proposed for interpreting and constructing relationships between objects in an incomplete information table. An table expressed as a family of complete tables. One can define indiscernibility relation each then get relations all pair similarity constructed by the intersection union this relation. It provides clear semantic interpretation relationship In fact, it bounds actual if values were known.

参考文章(15)
Wen-Xiu Zhang, Ju-Sheng Mi, Incomplete information system andits optimal selections Computers & Mathematics With Applications. ,vol. 48, pp. 691- 698 ,(2004) , 10.1016/J.CAMWA.2004.06.028
Witold Lipski, On semantic issues connected with incomplete information databases ACM Transactions on Database Systems. ,vol. 4, pp. 262- 296 ,(1979) , 10.1145/320083.320088
Y GUAN, H WANG, Set-valued information systems Information Sciences. ,vol. 176, pp. 2507- 2525 ,(2006) , 10.1016/J.INS.2005.12.007
Z. Pawlak, INFORMATION SYSTEMS THEORETICAL FOUNDATIONS Information Systems. ,vol. 6, pp. 205- 218 ,(1981) , 10.1016/0306-4379(81)90023-5
Akira Nakamura, A rough logic based on incomplete information and its application International Journal of Approximate Reasoning. ,vol. 15, pp. 367- 378 ,(1996) , 10.1016/S0888-613X(96)00075-8
M Kryszkiewicz, Rough set approach to incomplete information systems Information Sciences. ,vol. 112, pp. 39- 49 ,(1998) , 10.1016/S0020-0255(98)10019-1