Spectral clustering and biclustering of networks : large graphs and contingency tables /
Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular a...
Saved in:
| Online Access: |
Full text (MCPHS users only) |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Chichester :
Wiley-Blackwell,
2013
|
| Subjects: | |
| Local Note: | ProQuest Ebook Central |
| Summary: | Explores regular structures in graphs and contingency tables by spectral theory and statistical methods This book bridges the gap between graph theory and statistics by giving answers to the demanding questions which arise when statisticians are confronted with large weighted graphs or rectangular arrays. Classical and modern statistical methods applicable to biological, social, communication networks, or microarrays are presented together with the theoretical background and proofs. This book is suitable for a one-semester course for graduate students in data mining, mult. |
|---|---|
| Physical Description: | 1 online resource (1 volume) |
| ISBN: | 1118650700 9781118650707 |
