Spectral clustering and biclustering : learning large graphs and contingency tables /
"Offering a timely and novel treatment of spectral clustering and biclustering of networks, this book bridges the gap between graph theory and statistics by giving answers to the demanding questions that arise when statisticians are confronted with large weighted graphs or rectangular arrays. T...
| Κύριος συγγραφέας: | |
|---|---|
| Μορφή: | Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Chichester, West Sussex, United Kingdom :
Wiley,
2013.
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
| Περίληψη: | "Offering a timely and novel treatment of spectral clustering and biclustering of networks, this book bridges the gap between graph theory and statistics by giving answers to the demanding questions that arise when statisticians are confronted with large weighted graphs or rectangular arrays. The author presents a wide range of classical and modern statistical methods adapted to weighted graphs and contingency tables. In addition, practical examples from social and biological networks are included, and a teacher's guide is provided on a supporting website"-- "Provides a timely, novel and unified treatment of many important problems surrounding the spectral and classification properties of networks"-- |
|---|---|
| Φυσική περιγραφή: | 1 online resource. |
| Βιβλιογραφία: | Includes bibliographical references and index. |
| ISBN: | 9781118650714 1118650719 9781118650592 111865059X 9781118650707 1118650700 9781118650684 1118650689 1118344928 9781118344927 |
| DOI: | 10.1002/9781118650684 |
