Granular Computing based cognitive computing

2009 ◽  
Author(s):  
Guoyin Wang ◽  
Qinghua Zhang
Keyword(s):  
Granular Computing ◽  
Cognitive Computing

On Foundations and Applications of the Paradigm of Granular Rough Computing

2011 ◽  
pp. 350-367
Author(s):  
Lech Polkowski ◽  
Maria Semeniuk-Polkowska
Keyword(s):  
Formal Methods ◽  
Granular Computing ◽  
Approximate Reasoning ◽  
Data Sets ◽  
Cognitive Computing ◽  
Primitive Notion

Granular computing, initiated by Lotfi A. Zadeh, has acquired wide popularity as a tool for approximate reasoning, fusion of knowledge, cognitive computing. The need for formal methods of granulation, and means for computing with granules, has been addressed in this work by applying methods of rough mereology. Rough mereology is an extension of mereology taking as the primitive notion the notion of a part to a degree. Granules are formed as classes of objects which are a part to a given degree of a given object. In addition to an exposition of this mechanism of granulation, we point also to some applications like granular logics for approximate reasoning and classifiers built from granulated data sets.

Conversion-based aggregation algorithms for linear ordinal rankings combined with granular computing

2021 ◽  
Vol 219 ◽  
pp. 106880
Author(s):  
Nana Liu ◽  
Zeshui Xu ◽  
Hangyao Wu ◽  
Peijia Ren
Keyword(s):  
Granular Computing

Certain models of granular computing based on rough fuzzy approximations

2020 ◽  
Vol 39 (3) ◽  
pp. 2797-2816
Author(s):  
Muhammad Akram ◽  
Anam Luqman ◽  
Ahmad N. Al-Kenani
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Problem Solving ◽  
Granular Computing ◽  
Research Study ◽  
Network Models ◽  
Mathematical Framework ◽  
Human Reasoning ◽  
Accuracy Measures ◽  
Lower And Upper Approximations

An extraction of granular structures using graphs is a powerful mathematical framework in human reasoning and problem solving. The visual representation of a graph and the merits of multilevel or multiview of granular structures suggest the more effective and advantageous techniques of problem solving. In this research study, we apply the combinative theories of rough fuzzy sets and rough fuzzy digraphs to extract granular structures. We discuss the accuracy measures of rough fuzzy approximations and measure the distance between lower and upper approximations. Moreover, we consider the adjacency matrix of a rough fuzzy digraph as an information table and determine certain indiscernible relations. We also discuss some general geometric properties of these indiscernible relations. Further, we discuss the granulation of certain social network models using rough fuzzy digraphs. Finally, we develop and implement some algorithms of our proposed models to granulate these social networks.

Sign in / Sign up

Export Citation Format

Share Document