1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 3 Sept 16, 2005 Nanjing University of Science & Technology.

Slides:



Advertisements
Similar presentations
Lecture # 11 Grammar Problems.
Advertisements

CS 3240 – Chapter 6.  6.1: Simplifying Grammars  Substitution  Removing useless variables  Removing λ  Removing unit productions  6.2: Normal Forms.
Languages, grammars, and regular expressions
1 Languages, grammars, and regular expressions LING 570 Fei Xia Week 2: 10/03/07 TexPoint fonts used in EMF. Read the TexPoint manual before you delete.
Topics Automata Theory Grammars and Languages Complexities
Syntactic Pattern Recognition Statistical PR:Find a feature vector x Train a system using a set of labeled patterns Classify unknown patterns Ignores relational.
02 -1 Lecture 02 Agent Technology Topics –Introduction –Agent Reasoning –Agent Learning –Ontology Engineering –User Modeling –Mobile Agents –Multi-Agent.
Counting Principles and Probability Digital Lesson.
Chapter 12: Context-Free Languages and Pushdown Automata
Qi Mi Computer Science Department University of Virginia 1.
嵌入式視覺 Pattern Recognition for Embedded Vision Template matching Statistical / Structural Pattern Recognition Neural networks.
Formal Grammars Denning, Sections 3.3 to 3.6. Formal Grammar, Defined A formal grammar G is a four-tuple G = (N,T,P,  ), where N is a finite nonempty.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 13 Oct 14, 2005 Nanjing University of Science & Technology.
Simple Mathematical Facts for Lecture 1. Conditional Probabilities Given an event has occurred, the conditional probability that another event occurs.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 20 Oct 26, 2005 Nanjing University of Science & Technology.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 21 Oct 28, 2005 Nanjing University of Science & Technology.
Languages, Grammars, and Regular Expressions Chuck Cusack Based partly on Chapter 11 of “Discrete Mathematics and its Applications,” 5 th edition, by Kenneth.
1 Computability Five lectures. Slides available from my web page There is some formality, but it is gentle,
Patterns How do patterns help us solve problems? 2.A.4.1/2.A.4.3 FCA 2
Discrete Structure Li Tak Sing( 李德成 ) Lectures
Introduction to Language Theory
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 14 Oct 14, 2005 Nanjing University of Science & Technology.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 24 Nov 2, 2005 Nanjing University of Science & Technology.
Phrase-structure grammar A phrase-structure grammar is a quadruple G = (V, T, P, S) where V is a finite set of symbols called nonterminals, T is a set.
Regular Grammars Chapter 7. Regular Grammars A regular grammar G is a quadruple (V, , R, S), where: ● V is the rule alphabet, which contains nonterminals.
Grammar G = (V N, V T, P, S) –V N : Nonterminal symbols –V T : Terminal symbols V N  V T = , V N ∪ V T = V – P : a finite set of production rules α 
Regular Grammars Chapter 7 1. Regular Grammars A regular grammar G is a quadruple (V, , R, S), where: ● V is the rule alphabet, which contains nonterminals.
Deep Pushdown Automata Alexander Meduna Brno University of Technology, Czech Republic  Based on Meduna, A.: Deep Pushdown Automata,
Section 12.4 Context-Free Language Topics
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 25 Nov 4, 2005 Nanjing University of Science & Technology.
EXAMPLE 1 Standardized Test Practice SOLUTION Let ( x 1, y 1 ) = ( –3, 5) and ( x 2, y 2 ) = ( 4, – 1 ). = (4 – (–3)) 2 + (– 1 – 5) 2 = = 85 (
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 12 Sept 30, 2005 Nanjing University of Science & Technology.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 8 Sept 23, 2005 Nanjing University of Science & Technology.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 29 Nov 11, 2005 Nanjing University of Science & Technology.
Deterministic Finite Automata (DFA) - 1 q0q0q0q0 q1q1q1q strings that do not end with "1". Build an automaton to identify strings that end with.
PART 10 Pattern Recognition 1. Fuzzy clustering 2. Fuzzy pattern recognition 3. Fuzzy image processing FUZZY SETS AND FUZZY LOGIC Theory and Applications.
1 Chapter 6 Simplification of CFGs and Normal Forms.
Context-Free Languages
CST229 Week 7 Questions or concerns? Hand back Test#1 & Homework #4 – Test1 Average (45/50) Reading: Chapters 12&13 Chapter 12 – Grammar – production rules.
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 28 Nov 9, 2005 Nanjing University of Science & Technology.
Lecture # Book Introduction to Theory of Computation by Anil Maheshwari Michiel Smid, 2014 “Introduction to computer theory” by Daniel I.A. Cohen.
Chapter 4: Syntax analysis Syntax analysis is done by the parser. –Detects whether the program is written following the grammar rules and reports syntax.
ECE 471/571 – Lecture 21 Syntactic Pattern Recognition 11/19/15.
Automata. ‘ ’
Pattern Recognition NTUEE 高奕豪 2005/4/14. Outline Introduction Definition, Examples, Related Fields, System, and Design Approaches Bayesian, Hidden Markov.
Unrestricted Grammars
1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 2 Nanjing University of Science & Technology.
20 G M aaba acba aaba.. What is it about? Models of Language Generation Models of Language Recognition.
PROGRAMMING LANGUAGES
Language and Grammar classes
Natural Language Processing - Formal Language -
The chomsky hierarchy Module 03.3 COP4020 – Programming Language Concepts Dr. Manuel E. Bermudez.
CS314 – Section 5 Recitation 3
تصنيف التفاعلات الكيميائية
Pattern Recognition: Statistical and Neural
Regular Grammar.
Chapter 7 Regular Grammars
شبکه عصبی تنظیم: بهروز نصرالهی-فریده امدادی استاد محترم: سرکار خانم کریمی دانشگاه آزاد اسلامی واحد شهرری.
How to test Whether Subschemes in BCNF??
Context–free Grammar CFG is also called BNF (Backus-Naur Form) grammar
The General Triangle C B A.
LING/C SC/PSYC 438/538 Lecture 22 Sandiway Fong.
Theory of Computation Lecture #
The General Triangle C B A.
Regular Grammars.
Regular Expression: Pattern Matching
Pattern Recognition: Statistical and Neural
Items and Itemsets An itemset is merely a set of items
Faculty of Computer Science and Information System
Parsing CSCI 432 Computer Science Theory
Presentation transcript:

1 Pattern Recognition: Statistical and Neural Lonnie C. Ludeman Lecture 3 Sept 16, 2005 Nanjing University of Science & Technology

2 Review 1 Basic Pattern Classification Approaches Statistical Syntactical Neural Networks Fuzzy System Ad Hoc Procedures

3 Review 2 Pattern Recognition Approaches K-Means Clustering Hierarical Clustering Fuzzy Clustering Adaptive Clustering

4 Review 3 DO NOT force the same Solution on all problems

5 Lecture 3 Topics 1. Classification Examples 2. Basic Pattern Classification Structure 3. Statistical Pattern Classification

6 Example 1 : Character Classification Consider the classification of Binary Images of letters a and b of different fonts Given a black and white letter Classify it as coming from Class “A” or Class “B”

7

8 Example 2 : String Classification Class 1: { ab n c : n=0, 1, 2, ……….} = { ac, abc, abbc, abbbc, ………} Class 2: { a n bc : n=0, 1, 2, ……….} = { bc, abc, aabc, aaabc, ………} Given a string of symbols from the set S={a,b,c} determine whether the string comes from class 1 or class 2 or neither class abbbbbbc -> Class 1 aaaabc -> Class 2 aabbcc -> neither class Use Syntactical Approach

9 Grammar A grammar G is a four tuple G: (S,T, N, P ) S a start symbol T a set of terminals N a set of nonterminals P a set of production rules For our example: {ab n c : n=0, 1, 2, ……. } S={s} T = {c} N = {a,b} P ={ s->a, a->ab, b->bb, b ->bc }

10 Use Neural Networks

11 Example 4: Statistical Method

12 Basic Pattern Classification Structure

13

14

15

16

17 Decision Rule for Deciding a “0” or a “1” If y 1 > T decide “0” y 1 < T decide “1” y 1 = T flip an honest coin decide “0”if it comes up heads decide “1” if it comes up tails

18 Lecture 3 Summary 1. Classification Examples 2. Basic Pattern Classification Structure 3. Statistical Pattern Classification