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

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,
Outline Administrative issues Course overview What are Intelligent Systems? A brief history State of the art Intelligent agents.
Principles of programming languages 1: Introduction (with a simple language) Isao Sasano Department of Information Science and Engineering.
JingTao Yao A Ten-year Review of Granular Computing JingTao Yao Department of Computer Science University or Regina, Regina, CanadaRegina
Building an Intelligent Web: Theory and Practice Pawan Lingras Saint Mary’s University Rajendra Akerkar American University of Armenia and SIBER, India.
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
1 Granular and Rough Computing: Incremental Development Tsau Young (T.Y.) Lin Computer Science Department, San Jose State University,
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
1 From Chinese Wall Security Policy Models to Granular Computing Tsau Young (T.Y.) Lin Computer Science Department,
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,
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.
Project Knowledge Based Intelligent Search Engine.
Computational Thinking Related Efforts. CS Principles – Big Ideas  Computing is a creative human activity that engenders innovation and promotes exploration.
Do we need theoretical computer science in software engineering curriculum: an experience from Uni Novi Sad Bansko, August 28, 2013.
Skills of GEOMETRIC THINKING in undergraduate level Arash Rastegar Assistant Professor Sharif University of Technology.
Introduction to Computer and Programming CS-101 Lecture 6 By : Lecturer : Omer Salih Dawood Department of Computer Science College of Arts and Science.
Intrusion Detection Jie Lin. Outline Introduction A Frame for Intrusion Detection System Intrusion Detection Techniques Ideas for Improving Intrusion.
More Theory of Computing
1 Introduction to Automata Theory Reading: Chapter 1.
Introduction: Chapter 1
CS 257 Database Systems Dr. T Y Lin Ultimate Goal Data Science (Big Data)
10/6/2015 1Intelligent Systems and Soft Computing Lecture 0 What is Soft Computing.
©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.
Establishing the Equivalence between Recurrent Neural Networks and Turing Machines. Ritesh Kumar Sinha(02d05005) Kumar Gaurav Bijay( )
1 Granular Computing: Formal Theory & Applications Tsau Young (‘T. Y.’) Lin Computer Science Department, San Jose State University San Jose, CA 95192,
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
WebMining Web Mining By- Pawan Singh Piyush Arora Pooja Mansharamani Pramod Singh Praveen Kumar 1.
Models in Geoscience Education Cathy Manduca Director, Science Education Resource Center Carleton College, Minnesota.
Qualitative Data Analysis: An introduction Carol Grbich Chapter 13: Structuralism and post structuralism.
ICDM 2003 Review Data Analysis - with comparison between 02 and 03 - Xindong Wu and Alex Tuzhilin Analyzed by Shusaku Tsumoto.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
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.
Sergey Gromov Yulia Krasilnikova Vladimir Polyakov (NRTU MISIS, Moscow) KNOWLEDGE BASE CREATION FOR NATIONAL NANOTECHNOLOGY NETWORKS «CONSTRUCTIONAL NANOMATERIALS»
Theory of Programming Languages Introduction. What is a Programming Language? John von Neumann (1940’s) –Stored program concept –CPU actions determined.
Information Granulation and Granular Relationships JingTao Yao Department of Computer Science University of Regina
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:
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Realtime Financial Monitoring and Analysis System May 2010 Lietu Search Engine.
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.
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.
Introduction to Automata Theory
Sub-fields of computer science. Sub-fields of computer science.
CSE202: Introduction to Formal Languages and Automata Theory
Computing and Informatics Courses
Institute for Cyber Security
Institute for Cyber Security
Information Science and Engineering
Dr. T Y Lin Ultimate Goal Data Science (Big Data)
1.#.
Introduction Artificial Intelligent.
Artificial Intelligence introduction(2)
Introduction to Fuzzy Theory
Cross-library API Recommendation Using Web Search Engines
Intelligent Systems and
On Kripke’s Alleged Proof of Church-Turing Thesis
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
Sub: Theoretical Foundations of Computer Sciences
Theoretical Foundations of Computer Sciences
Presentation transcript:

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

2 Outline 1.Introduction 2.GrC on the web 3.Formal Theory 4. Applications 5. Conclusions Scope of GrC

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 GrC on the Web W eb Page is a linearly ordered Text. 5 th GrC Model

5 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.

6 Granular Structure(GrS) Wall Street InformationSecurity FinanceIndustry 2-tuples are generalized equivalence classes of size 2

7 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.

8 Granular Structure(GrS) 4-tuples are generalized equivalence classes securitypolicyChinawall WallStreetFinanceIndustry

9 GrC model for the Web GrC model for the Web U = a set of keywords GrS= a collection of 1-ary relation: frequent keywords 2-ary relation: freq keyword pairs...

10 Geometric View tuples  Simplexes GrS  Simplicial Complex an amazing fact!

11 It is derived from Data Mining: Apriori principle = geometry: Closed condition Is it God’s will?

12 Concept Analysis Simplex, as an ordered keyword set, represents a Concept in the web

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

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

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

16 Concept Analysis The Concepts on the web forms a simplicial complex So we can use geometry to analyze the knowledge structure of the web

17 Knowledge Structure Simplicial Complex Knowledge Structure Simplicial Complex a b c d x z y w h f g e Open tetrahedron 1 Open tetrahedron 2

18 Knowledge Structure Indexing the Concepts by indexing the concepts... we are building Knowledge Based Search Engine

19 Google and etc index only the keyword, which is 0-dimensional subcomplex of the simplicial complex!

20 The output will be clustered by primitive concepts T. Y. LIN  – Tung Yen Lin –Tsau Young Lin...

21 Formal Theory

22 Formal Theory Use Category Theory to formalize the universe of discourse

23 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

24 Non Commutative Granules: Category of Sets (5th GrC): the Web Functions (6th GrC) Turing machines(7th GrC)

25 Other Applications

26 Other Applications 2. Information Flow Security Solve 30 years outstanding Problem; IEEE SMC rd GrC Model

27 Other Applications 3. In the category of Turing machines Expressing DNA sequences by finite automata 7 th GrC Model

28 Other Applications 3. In the category of Turing machines Identify authorship by expressing the stops words by finite automata 7 th GrC Model

29 Other Applications 4. In the category of Functions Patterns in numerical sequences (1999) 6 th GrC Model

30 Conclusions

31 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.

32 John von Neumann (1941): ” organisms... made up of parts ” (granulation)  Axiomatic Method 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

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

34 Scope of GrC Rough set /computing (RS) has been a guide for GrC, but 2. GrC  beyond RS

35 Scope of GrC The time for “BS” theory has gone Please Read the Fallacies in GrC2008

36 Thanks !

37 Thanks !

38 Thanks !

39 Key Components (skip) 1.GrC Model (U, β): 2.Two Operations: (skip) Granulation Integration (Important in DB) (IBM Almaden Project)

40 Key Components 3. Three Semantic Views on β Knowledge Engineering (This talk) Uncertainty Theory Zadeh and Lin’s initial idea How-to-solve/compute-it Polya 1945

41 Key Components 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

42 Two Important Structures Quotient Structure (QS) Each granule  a point Interactions are axiomatized

43 Knowledge Structure Each point  a concept Concept interactions  QS Concepts are attribute values in Rough Set Theory (RS)