Random graphs for statistical pattern recognition
Random Graphs for Statistical Pattern Recognition describes several classes of random graphs used in pattern recognition. It covers the neighborhood graphs introduced by Toussaint, as well as the various generalizations and specific cases. These graphs have been widely used for clustering.
Saved in:
Main Authors: | |
---|---|
Published: |
|
Literature type: | Electronic eBook |
Language: | English |
Series: |
Wiley series in probability and statistics
|
Subjects: | |
Online Access: |
http://onlinelibrary.wiley.com/book/10.1002/047172209X |
Summary: |
Random Graphs for Statistical Pattern Recognition describes several classes of random graphs used in pattern recognition. It covers the neighborhood graphs introduced by Toussaint, as well as the various generalizations and specific cases. These graphs have been widely used for clustering. |
Carrier Form: | 1 online resource (xiii, 237 pages) : illustrations. |
Bibliography: | Includes bibliographical references (pages 213-227) and indexes. |
ISBN: |
0471722081 9780471722083 0471221767 9780471221760 047172209X 9780471722090 |
Index Number: | QA166 |
CLC: | O157.5 |
Contents: | Random Graphs for Statistical Pattern Recognition Contents Preface Acknowledgments 1 Preliminaries 2 Computational Geometry 3 Neighborhood Graphs 4 Class Cover Catch Digraphs 5 Cluster Catch Digraphs. |