Set-based granular computing: A lattice model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set-based granular computing: A lattice model

Article history: Received 15 January 2013 Received in revised form 12 October 2013 Accepted 8 November 2013 Available online 22 November 2013

متن کامل

Multi-Value Attribute Concept Lattice Reduction Based on Granular Computing

Concept lattice essentially describes the relationship between objects and attributes. The reduction of multi-value attribute concept lattice is a hot topic in the fields of information retrieval, knowledge discovery and data mining etc., while the granular computing emphasizes observing and analyzing the same problem from different granular worlds. It makes the complex problems around us be ma...

متن کامل

Dominance-Based Rough Set Approach to Granular Computing

Dominance-based Rough Set Approach (DRSA) was introduced as a generalization of the rough set approach for reasoning about preferences. While data describing preferences are ordinal by the nature of decision problems they concern, the ordering of data is also important in many other problems of data analysis. Even when the ordering seems irrelevant, the presence or the absence of a property (po...

متن کامل

INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS

Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...

متن کامل

Application of Set-theoretic Granular Computing

Uncertain knowledge management is a key issue in the expert system. By analysis of the reasons for knowledge’s uncertainty in complete universe and uncompleted universe, two methods based on set-theoretic granular computing are presented to deal with the uncertainty knowledge which is the rough observable method and rough inclusion method respectively. The rough set can be approximately express...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 2014

ISSN: 0888-613X

DOI: 10.1016/j.ijar.2013.11.001