1 Granular Computing: Formal Theory & Applications Tsau Young (‘T. Y.’) Lin Computer Science Department, San Jose State University San Jose, CA 95192,

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Cognitive Systems, ICANN panel, Q1 What is machine intelligence, as beyond pattern matching, classification and prediction. What is machine intelligence,
The 20th International Conference on Software Engineering and Knowledge Engineering (SEKE2008) Department of Electrical and Computer Engineering
Principles of programming languages 1: Introduction (with a simple language) Isao Sasano Department of Information Science and Engineering.
Smart Shopper A Consumer Decision Support System Using Type-2 Fuzzy Logic Systems Ling Gu 2003 Fall CSc8810.
JingTao Yao A Ten-year Review of Granular Computing JingTao Yao Department of Computer Science University or Regina, Regina, CanadaRegina
Huge Raw Data Cleaning Data Condensation Dimensionality Reduction Data Wrapping/ Description Machine Learning Classification Clustering Rule Generation.
© Copyright CSAB 2013 Future Directions for the Computing Accreditation Criteria Report from CAC and CSAB Joint Criteria Committee Gayle Yaverbaum Barbara.
Finite Automata Section 1.1 CSC 4170 Theory of Computation.
A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation Nicolaie Popescu-Bodorin, IEEE Member, Artificial Intelligence.
1 Granular and Rough Computing: Incremental Development Tsau Young (T.Y.) Lin Computer Science Department, San Jose State University,
1 From Chinese Wall Security Policy Models to Granular Computing Tsau Young (T.Y.) Lin Computer Science Department,
1 Granular Computing: A New Problem Solving Paradigm Tsau Young (T.Y.) Lin Computer Science Department, San Jose.
From Discrete Mathematics to AI applications: A progression path for an undergraduate program in math Abdul Huq Middle East College of Information Technology,
MET CS 563 Software Development with C++ for Mathematical Finance Dr. Tanya Zlateva MET Computer Science Department 755 Commonwealth Ave., Room 103 Boston,
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
Granular Computing: A new problem Solving Paradigm Tsau Young (T.Y.) Lin Department of Computer Science San Jose State University San Jose, CA 95192
Outline Chapter 1 Hardware, Software, Programming, Web surfing, … Chapter Goals –Describe the layers of a computer system –Describe the concept.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Project Knowledge Based Intelligent Search Engine.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
CAREERS IN LINGUISTICS OUTSIDE OF ACADEMIA CAREERS IN INDUSTRY.
Intrusion Detection Jie Lin. Outline Introduction A Frame for Intrusion Detection System Intrusion Detection Techniques Ideas for Improving Intrusion.
More Theory of Computing
Granular Computing for Machine Learning JingTao Yao Department of Computer Science, University of Regina
1 Introduction to Automata Theory Reading: Chapter 1.
CS 257 Database Systems Dr. T Y Lin Ultimate Goal Data Science (Big Data)
Knowledge representation
©Brooks/Cole, 2003 Foundations of Computer Science from Data Manipulation to Theory of Computation Behrouz A. Forouzan, Brooks/Cole — Thomson Learning,
CS 390 Introduction to Theoretical Computer Science.
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
Semantic Learning Instructor: Professor Cercone Razieh Niazi.
updated CmpE 583 Fall 2008 Ontology Integration- 1 CmpE 583- Web Semantics: Theory and Practice ONTOLOGY INTEGRATION Atilla ELÇİ Computer.
Learning Automata based Approach to Model Dialogue Strategy in Spoken Dialogue System: A Performance Evaluation G.Kumaravelan Pondicherry University, Karaikal.
Plan for the Presentation Review our Algebra Problem Examine why it is such a hard problem Offer a content analysis of school algebra Argue why solving.
Department of Mathematics Computer and Information Science1 CS112: Survey of Computer Science Chapter One Review: Introduction, Chapter Two: Number Systems.
Page 1 Advanced Technology Center HCSS 03 – April 2003 vFaat: von Neumann Formal Analysis and Annotation Tool David Greve Dr. Matthew Wilding Rockwell.
Panel Discussion on Foundations of Data Mining at RSCTC2004 J. T. Yao University of Regina Web:
1 Granular Computing: Formal Theory & Applications Tsau Young (‘T. Y.’) Lin GrC Society and Computer Science Department, San Jose State University San.
Information Granulation and Granular Relationships JingTao Yao Department of Computer Science University of Regina
CS1Q Computer Systems Lecture 11 Simon Gay. Lecture 11CS1Q Computer Systems - Simon Gay 2 The D FlipFlop The RS flipflop stores one bit of information.
Enriched Knowledge Service Platform and Cross-Database Search September, 2015.
Time-Space Trust in Networks Shunan Ma, Jingsha He and Yuqiang Zhang 1 College of Computer Science and Technology 2 School of Software Engineering.
What is Artificial Intelligence?
Panel Discussion on Granular Computing at RSCTC2004 J. T. Yao University of Regina Web:
1 ME886.3 Topic 1: System and System Design (I). 2 What we design?
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 0 Introduction Some slides are in courtesy of Prof.
Realtime Financial Monitoring and Analysis System May 2010 Lietu Search Engine.
Data Mining Concepts and Techniques Course Presentation by Ali A. Ali Department of Information Technology Institute of Graduate Studies and Research Alexandria.
1 Project Overview Discovering Concepts Hidden in the Web This is incomplete set of slides that will explain the idea underlying the project For now, the.
We want to add here all the Eleven schools that are functional. Next slide shows how it would look when we click on School of Studies.
1 ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX ALGEBRAIC TOPOLOGY SIMPLICAL COMPLEX Tsau Young (‘T. Y.’) Lin Institute of Data Science and Computing and Computer.
1 Algebraic Topology in Data Science Algebraic Topology in Data Science GrC in Big Data Tsau Young (‘T. Y.’) Lin Institute of Data Science and Computing.
Welcome to Data Structures. Course Introduction Instructor : r 신 용 태 r 愼 鏞 台 r Yongtae Shin r 정보과학관 422 호 r r r Homepage.
Theory of Computation Automata Theory Dr. Ayman Srour.
Topic 3: Automata Theory 1. OutlineOutline Finite state machine, Regular expressions, DFA, NDFA, and their equivalence, Grammars and Chomsky hierarchy.
Artificial Intelligence
Information Science and Engineering
Dr. T Y Lin Ultimate Goal Data Science (Big Data)
Automata, Formal Grammars, and Consequences
Principles of Computing – UFCFA Lecture-1
Introduction Artificial Intelligent.
Artificial Intelligence introduction(2)
CS154 Formal Languages and Computability
Algebraic Topology Simplical Complex
Ildikó Perjési-Hámori Department of Mathematics
Principles of Computing – UFCFA Week 1
Granulating the Semantics Space of Web Documents
CSC 4170 Theory of Computation Finite Automata Section 1.1.
Sub: Theoretical Foundations of Computer Sciences
Presentation transcript:

1 Granular Computing: Formal Theory & Applications Tsau Young (‘T. Y.’) Lin Computer Science Department, San Jose State University San Jose, CA 95192, USA ;

2 Outline 1.A Bit History 2.Scope of GrC 3. GrC on the Web(2/16;tokenizer; Index; TFIDF) 4. Formal GrC Theory 5. Conclusions-Applications

3 A Bit History Zadeh’s GrM granular mathematics T.Y. Lin  GrC Granular Computing (Zadeh, L.A. (1998) Some reflections on soft computing, granular computing and their roles in the conception, design and utilization of information/intelligent systems, Soft Computing, 2, )

4 John von Neumann (1941): ” organisms... made up of parts ” (granulation) Method: Axiomatic 1. von Neumann J(1941): The General and Logical Theory of Automata in: Cerebral Mechanisms in Behavior, pp. 1-41, Wiley, The World of Mathematics (ed J Newman) , 1956

5 Lotfi Zadeh : Partitioning... into granules. A granule is a clump of bjects, which are drawn together by... functionality

6 Scope of GrC Scope of GrC Ltofi Zadeh: “ TFIG... 1.mathematical in nature 1.Zadeh, L.A. (1997) ‘Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic’, Fuzzy Sets and Systems, Vol. 90, pp.111–127. Neumann: A xiomatic (math)..

7 Scope of GrC Mathematically o incorrect o un-substantiated opinions are not considered (verbally add...

8 Scope of GrC Rough set /computing (RS) is GrC has served as guides, but focus is beyond RS

9 Scope of GrC Please Read the Fallacies in GrC2008

10 GrC on the Web GrC on the Web W eb Page is a linearly ordered Text. 5 th GrC Model

11 1. Wall Street is a symbol for American financial industry. Most of the computer systems for those financial institute have employed information flow security policy. 2. Wall Street is a shorthand for US financial industry. Its E-security has applied security policy that was based on the ancient intent of Chinese wall. 3. Wall Street represents an abstract concept of financial industry. Its information security policy is Chinese wall.

12 Granule: 2-ary Relation Wall Street InformationSecurity FinanceIndustry 3 generalized equivalence classes (of size 2)

13 1. Wall Street is a symbol for American finance industry. Most of the computer systems for those financial institute have employed information flow security policy. that was based on the ancient intent of 2. Wall Street is a shorthand for US finance industry. Its E-security has applied security policy that was based on the ancient intent of Chinese wall. is 3. Wall Street represents an abstract concept of finance industry. Its information security policy is Chinese wall.

14 Granule: 4-nary Relation securitypolicyChinawall One Generalized Equivalence Class of size 4

15 GrC on the Web GrC on the Web The Universe is: U = the set of keywords in the web pages (use TFIDF or... to find them).

16 2. Granular Structure β Granules are tuples in U  U ... organized into subsets (=relations) of U  U ...

17 Model in Category Theory Model in Category Theory GrC Model (U, β) U = a set of objects U i i=1, 2, … in abstract category β=a set of relation objects

18 Formal GrC Theory 1.GrC Model (U, β): GrC on the Web 2.Two Operations: (skip) Granulation and Integration 3. Three Semantic Views on β Knowledge Engineering (considering) Uncertainty Theory How-to-solve/compute-it Four Structures

19 Formal GrC Theory 4. Four Structures Granular structure/variable (Zadeh) Quotient Structure (QS - Zhang) Knowledge Structure (KS - Pawlak) Linguistic Structure/variable(Zadeh) (From TY Lin’s home page  granular computing conference 2009  GrC Information Center  Click here for a formal theory in First paragraph.) Click here for a formal theory

20 Formal GrC Theory Quotient Structure (QS) Each granule  a point Interactions are axiomatized

21 Formal GrC Theory 3. QS=KS: each point  a concept Concept interactions from QS In RS, concepts are labeled by attribute values; No interactions

22 Formal GrC Theory Linguistic Structure: granule  words from the precisitated natural language.

23 QS= KS in the Web QS= KS in the Web QS: a tuple (a simplex) is a point in an ordered simplicial complex KS: Each simplex represents a concept in the web defined by the ordered keyword set (tuple)

24 Concept: 1-simplex Wall    Street Wall Street is a simplex represents the concept of financial industry

25 Concept: 1-simplex Finance    Industry Finance Industry (Stemming)

26 4-nary Relation securitypolicyChinawall Represent the Concept: Chinese Wall Security Policy

27 Concept: 3-simplex Concept: 3-simplex Wall China Security Policy

28 Knowledge Structure of the Web is a Simplicial Complex of Concepts

29 QS= KS in the Web QS= KS in the Web a b c d x z y w h f g e Open tetrahedron 1 Open tetrahedron 2

30 Applications By indexing the concepts in simplicial complex, we are building 1. Knowledge Based Search Engine

31 The output will be clustered by primitive concepts... Next Generation Search Engine -

32 TYLIN has over millions items It will be group into Tung Yen Lin Tsau Young Lin

33 The output will be clustered by primitive concepts... TYLIN will be group into Tung Yen Lin Tsau Young Lin And many others

34 Other Applications 2. Information Flow Security 3 rd GrC model Solve 30 years outstanding Problem; IEEE SMC 2009

35 Applications 3. Approximation Theory in the category of Turing machines 7 th GrC Model 3a. Expressing DNA sequences by finite automata 2009

36 3b. Identify authorships of books: Harry Potter c. Intrusion Detection System 2005 (authorships of programs)

37 4. Approximation Theory in the category of Functions 6 th GrC Model Patterns in numerical sequences (1999)

38 Thanks !