granular computing: a new problem solving paradigm
DESCRIPTION
Granular Computing: A new problem Solving Paradigm. Tsau Young (T.Y.) Lin Department of Computer Science San Jose State University San Jose, CA 95192 [email protected]. Outline. 1. Summary Rough Computing Equivalence Relation Neighborhood Concept Binary Relation 2. Details. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/1.jpg)
Granular Computing: A new problem Solving Paradigm
Tsau Young (T.Y.) Lin
Department of Computer Science
San Jose State University
San Jose, CA 95192
![Page 2: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/2.jpg)
Outline
1. SummaryRough Computing
Equivalence Relation
Neighborhood Concept
Binary Relation
2. Details
![Page 3: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/3.jpg)
Rough Computing
A partition is a set of (1) disjoint subsets,
(2) a cover
Class A
Class B
f, g, h i, j, k
Class Cl, m, n
![Page 4: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/4.jpg)
Rough Computing
• X Y (equivalence)
if and only if
• both belong to the same class
![Page 5: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/5.jpg)
Rough Computing
An Equivalence Relation
Class A
Class B
f g h i j k
Class Cl m n
![Page 6: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/6.jpg)
Equivalence Relation
• X X (Reflexive)
• X Y implies Y X (Symmetric)
• X Y, Y Z implies X Z (Transitive)
![Page 7: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/7.jpg)
Neighborhood Concept
• i j k Class B
i j k Class B In spite of a technical error,
• the idea was, and still is, fascinating
![Page 8: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/8.jpg)
Introduction
• An aggressive model (ACWSP) was proposed by Lin the same year (1989) that keeps the same spirit and corrects the error
• Lost some Strength
![Page 9: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/9.jpg)
Introduction
• Lost Interests until
• A practical way of construction ACWSP was introduced 2000
![Page 10: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/10.jpg)
Brewer and Nash Requirements
• A set of impenetrable Chinese Great Walls
• No corporate data that are in conflict can be stored in the same side of Walls
![Page 11: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/11.jpg)
Brewer and Nash -Theory
• Corporate data are decomposed into
Conflict of Interest Classes(CIR-classes)
• Walls are built around the CIR-classes
• Corporate data is called an object (tradition)
![Page 12: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/12.jpg)
BN -Theory
All objects
Class A
Class B
f, g, h i, j, k
Class Cl, m, n
![Page 13: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/13.jpg)
Is CIR Transitive?
• US (conflict) Russia
• UK Russia
• UK ? US
![Page 14: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/14.jpg)
Is CIR Reflexive?
• US (conflict) US ?
• Is CIR self conflicting?
![Page 15: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/15.jpg)
Is CIR Symmetric?
• US (conflict) USSR
implies
• USSR (conflict) US ?
• YES
![Page 16: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/16.jpg)
BN -Theory• Can they be partitioned?
BN -Theory
CUS, Russia
UK?
France, German
![Page 17: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/17.jpg)
CIR-classes
• CIR classes do overlap (Conflict of Interests)
US, UK, Iraq, . . .
USSR
![Page 18: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/18.jpg)
CIR & IAR
• Complement of CIR: an equivalence relation
Iraq, . . .US, UK, . . .
German, . . .
![Page 19: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/19.jpg)
ACWSP
• CIR: Anti-reflexive, symmetric, anti-transitive
CIR-class IJAR-classes
IJAR-classes
![Page 20: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/20.jpg)
ACWSP
• CIR: Anti-reflexive, symmetric, anti-transitive
CIR-class IJAR-classes
IJAR-classes
![Page 21: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/21.jpg)
ACWSP
• CIR: Anti-reflexive, symmetric, anti-transitive
CIR-class IJAR-classes
IJAR-classes
![Page 22: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/22.jpg)
Trojan Horses
Direct Information flow(DIF)
Professor
Grader
StudentsCIF
DIF Trojan horse(DIF)
![Page 23: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/23.jpg)
![Page 24: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/24.jpg)
ACWSP
• CIR (with three conditions) only allows information sharing within one IJAR-class
• An IJAR-class is an equivalence class; so there is no danger the information will spill to outside.
• No Trojan horses could occur
![Page 25: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/25.jpg)
SCWSP
• Simple CWSP (SVWSP)
No DIF: x y (direct information flow)(x, y) CIR
![Page 26: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/26.jpg)
ACWSP
• Strong CWSP(ACSWP)
No CIF: x . . . y ((composite) information flow)
(x, y) CIR
![Page 27: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/27.jpg)
ACWSP
• Theorem If CIR is anti-reflexive, symmetric and anti-transitive, then
• Simple CWSP Strong CWSP
![Page 28: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/28.jpg)
ACWSP
CIF =a sequence of DIFs
CIF: X=X0 X1 . . . Xn=Y
YCIRX
• To derive a contradiction
![Page 29: Granular Computing: A new problem Solving Paradigm](https://reader035.vdocument.in/reader035/viewer/2022070417/5681542e550346895dc2301d/html5/thumbnails/29.jpg)
ACWSP
• X=X0 X1 implies
X1 [X] CIRX = CIRX1
. . .
Y=Xn [X] CIRX = CIRXn = CIRY
Y CIRX Contradiction