Indiscernibility and similarity in an incomplete information table

5Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Li, R., & Yao, Y. (2010). Indiscernibility and similarity in an incomplete information table. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 110–117). https://doi.org/10.1007/978-3-642-16248-0_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free