DocumentCode
598676
Title
Uncertainty and knowledge theories new era in Granular Computing
Author
Lin, Tsau Young
fYear
2012
fDate
11-13 Aug. 2012
Firstpage
8
Lastpage
11
Abstract
LNS is a generalization of topological neighborhood system(TNS) by simply dropping all axioms of topology but the superset axiom. The goal of this paper is to show that LNS is the “correct” granule for granular computing (GrC) and Granular Mathematics (GrM). Here are some high lights 1) Zadeh(1996)suggested that if classical mathematics is viewed as Math(point), GrM is Math(granule). The axiomatization of LNS in GrC2011 shows that GrM = Math(granule), point free. 2) Crisp LNS = Fuzzy LNS (when in terms of alpha-cuts). item TNS, a special LNS, models the uncertainty of “nearness” 3) Infinitesimals can be defined by TNS in hyperreals. 4) LNS includes all generalized rough sets and fuzzy sets (when rough degree/fuzzy are ignored.) 5) GrC/GrM provide the infrastructure for probability, possibility and belief measures.
Keywords
Context; Finite element methods; central knowledge; granular computing; largest neighborhood system; uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location
Hangzhou, China
Print_ISBN
978-1-4673-2310-9
Type
conf
DOI
10.1109/GrC.2012.6468707
Filename
6468707
Link To Document