Neighborhood Rough Set Model in Incomplete Information System

Ping Li ； Xin Lu ； Qi-Zong Wu

《管理科學與統計決策》 7卷1期 (2010/03) Pp. 79-83

https://doi.org/10.6704/JMSSD.2010.7.1.79

並列摘要

There is a large number of incomplete continuous data in real life and classical rough set theory is only available for discrete data. In such a case, a new neighborhood rough set model for incomplete information system is proposed to classify the objects by using the distance set of attribute value. It is proved that neighborhood relation is equivalent to the similarity relation when threshold value is zero, and neighborhood relation also has the same meaning with indiscernibility relation on the condition that the information system is complete and threshold value is zero. A heuristic knowledge reduct algorithm based on neighborhood relation is provided and an example of knowledge reduct to several different information systems confirms the effectiveness of neighborhood rough set model for incomplete information system.

並列關鍵字

Incomplete information system ； rough set ； neighborhood relation ； continuous value

參考文獻

Pawlak, Z.(2007).Rudiments of rough sets.Information Sciences.177,3-27.

Miao, D.、Wang, G.(2007)。Granular Computing: Past, Present and Prospects。Beijing:Science Press。

Jin, W.,Tung, Anthony K. H.,Han, J.(2006).Ranking outliers using symmetric neighborhood relationship.PAKDD.(PAKDD).

Shin, H.,Cho, S.(2005).Invariance of neighborhood relation under input space to feature space mapping.Pattern Recognition Letters.26,707-718.

Wang, H.(2006).Nearest neighbors by neighborhood counting.IEEE Transactions on PAMI.28,942-953.