Indiscernibility and similarity in an incomplete information table

Authors:
Renpu Li;Yiyu Yao
Affiliations:
School of Information Science and Technology, Ludong University, Yantai, China and Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada;Department of Computer Science, University of Regina, Regina, Saskatchewan, Canada
Venue:
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Year:
2010

Citing 8
Cited 1

Rough set approach to incomplete information systems

Information Sciences: an International Journal
Rules in incomplete information systems

Information Sciences: an International Journal
On semantic issues connected with incomplete information databases

ACM Transactions on Database Systems (TODS)
A Comparison of Several Approaches to Missing Attribute Values in Data Mining

RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Maximal consistent block technique for rule acquisition in incomplete information systems

Information Sciences: an International Journal
Incomplete information system andits optimal selections

Computers & Mathematics with Applications
Generalized indiscernibility relations: applications for missing values and analysis of structural objects

Transactions on rough sets VIII
Set-valued information systems

Information Sciences: an International Journal

Decision making in incomplete information system based on decision-theoretic rough sets

RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology

Quantified Score

Hi-index	0.00

Visualization

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.