Spectral Clustering and Biclustering :Learning Large Graphs and Contingency Tables

Publication subTitle :Learning Large Graphs and Contingency Tables

Author: Marianna Bolla  

Publisher: John Wiley & Sons Inc‎

Publication year: 2013

E-ISBN: 9781118650707

P-ISBN(Hardback):  9781118344927

Subject: O212.4 Multivariate Analyses

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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, multivariate statistics, or applied graph theory; but by skipping the proofs, the algorithms can also be used by specialists who just want to retrieve information from their data when analysing communication, social, or biological networks.

Spectral Clustering and Biclustering:

  • Provides a unified treatment for edge-weighted graphs and contingency tables via methods of multivariate statistical analysis (factoring, clustering, and biclustering).
  • Uses spectral embedding and relaxation to estimate multiway cuts of edge-weighted graphs and bicuts of contingency tables.
  • Goes beyond the expanders by describing the structure of dense graphs with a small spectral gap via the structural eigenvalues and eigen-subspaces of the normalized modularity matrix.
  • Treats graphs like statistical data by combining methods of graph theory and statistics.
  • Establishes a common outline structure for the contents of each algorithm, applicable to networks and microarrays, with unified notions and principles.

Chapter

Contents

pp.:  1 – 9

Preface

pp.:  9 – 13

Acknowledgements

pp.:  13 – 15

List of abbreviations

pp.:  15 – 17

Introduction

pp.:  17 – 21

2 Multiway cuts and spectra

pp.:  27 – 70

3 Large networks, perturbation of block structures

pp.:  70 – 122

4 Testable graph and contingency table parameters

pp.:  122 – 187

5 Statistical learning of networks

pp.:  187 – 215

Appendix A: Linear algebra and some functional analysis

pp.:  215 – 233

Appendix B: Random vectors and matrices

pp.:  233 – 261

Appendix C: Multivariate statistical methods

pp.:  261 – 272

Index

pp.:  272 – 289

LastPages

pp.:  289 – 294

The users who browse this book also browse


No browse record.