%0 Journal Article
%T Cartesian Product Rough Model of Approximation Spaces and Decomposability<br>近似空间的笛卡尔积粗集模型及其可分解性
%A WU Ming-fen
%A CAO Cun-gen
%A <br>吴明芬
%A 曹存根
%J 计算机科学
%D 2011
%I 
%X Pawlak proposed the rough set model, in order to processing data and knowledge which are imprecise or uncertainty in artificial intelligence. Then, the rough set model has been extended and many new rough set models have been put forward. Inhere are two main methods of extension, one method is to weaken the dependence of equivalence relation, the other is to expand the domain from one to two, and Y. Y. Yao ever proposed a rough set model of two-do-main. In this paper, we made some research for Cartesian product rough models based on two(finite) approximation spaces, and gave the concept of product approximation space. Afterwards, we described the upper(lower) approximation of decomposable subsets of a Cartesian product, and the approximate precision and roughness of decomposable subsets.Finally, we studied the decomposable problem of Cartesian product rough models, and obtained the sufficient and necessary conditions of decomposition of a product approximation space.
%K Cartesian product
%K Product approximation space
%K Decomposable sunset
%K Roughness
%K Decomposable approximation space<br>笛卡尔积，积近似空间，可分解子集，粗糙度，可分解的近似空间
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=05EEFA92D41DE48F9C0A6E5D16DB39B1&yid=9377ED8094509821&vid=16D8618C6164A3ED&iid=CA4FD0336C81A37A&sid=4966445AEEBA9556&eid=CA5852BD1A173B3A&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=14