Recognition of Patterns: Using the Frequencies of Occurrence of Binary Words
Autor Peter W. Beckeren Limba Engleză Paperback – 11 oct 1978
Preț: 618.89 lei
Preț vechi: 728.11 lei
-15% Nou
Puncte Express: 928
Preț estimativ în valută:
118.45€ • 123.46$ • 98.61£
118.45€ • 123.46$ • 98.61£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783211815069
ISBN-10: 3211815066
Pagini: 240
Ilustrații: XIV, 222 p.
Dimensiuni: 152 x 229 x 13 mm
Greutate: 0.33 kg
Ediția:Softcover reprint of the original 3rd ed. 1978
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
ISBN-10: 3211815066
Pagini: 240
Ilustrații: XIV, 222 p.
Dimensiuni: 152 x 229 x 13 mm
Greutate: 0.33 kg
Ediția:Softcover reprint of the original 3rd ed. 1978
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
Public țintă
ResearchCuprins
1. Problems in the Design of Pattern Recognizers.- 1.1 Introduction.- 1.2 Three Areas of Application.- 1.3 The Configuration of a PR.- 1.4 Factors which Influence the Design of a PR.- 1.5 The Selection of the Attributes.- 1.6 Decision Procedures and Indices of Performance.- 1.7 Categorizer Design.- 1.8 Hardware Implementation.- 2. Design of a Pattern Recognizer Using the Frequency of Occurrence of Binary Words Method.- 2.1 Introduction.- 2.2 A Step by Step Description of the FOBW Design Procedure.- 2.3 The Ordered Array of Attributes.- 2.4 The Generation of New Sets of NH Attributes.- 2.5 Detection of Effective Attributes.- 3. Computational Rules for Binary Word Frequencies of Occurrence.- 3.1 Binary Word Probabilities, Frequencies of Occurrence and Sequence Length.- 3.2 Redundant Information in N-Gram Frequencies.- 3.3 Other Sets of 2N?1 Pieces of Information.- 3.4 Bounds on the Binary Word Frequencies of Occurrence.- 3.5 Redundancy in Delayed N-Gram Frequencies.- 3.6 Eight Delayed Trigram Frequencies contain Five Pieces of Information.- 3.7 A Special Relationship between Delayed Digrams and Delayed Trigrams.- 3.8 The Frequencies of Symmetrical and Unsymmetrical Binary Words.- 4. S, A Measure of Separability.- 4.1 Four Statistics.- 4.2 Some Features of the S-Measure.- 4.3 A Conjecture Later Proven by Chernoff.- 5. Modeling of Pattern Generating Stochastic Processes.- 5.1 The Importance of a Model.- 5.2 The Transition Matrix Model.- 5.3 The Gaussian Process Model.- 5.4 Processes Related to the Gaussian Process.- 5.5 The ?0 and ?m Concepts.- 6. The Heuristic Search Procedure.- 6.1 The Search Rule.- 6.2 First Example of the FOBW Search Procedure.- 6.3 A Case Study.- 6.4 Second Example of the FOBW Search Procedure.- 7. Hardware Implementation.- 7.1 Two Applications.-7.2 Simple Hardware.- 7.3 The Sonic Analysis Demonstrator.- 7.4 The Word Recognizer.- 8. Summary.- Appendix 1. Some Recent Books.- Appendix 2. The ?-Transformation.