Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Books
  3. Algorithms and Models for Network Data and Link Analysis
  • Cited by 59
Publisher:
Cambridge University Press
Online publication date:
July 2016
Print publication year:
2016
Online ISBN:
9781316418321
DOI:
https://doi.org/10.1017/CBO9781316418321
Subjects:
Knowledge Management, Databases and Data Mining, Computer Science, Computational Statistics, Machine Learning and Information Science, Statistics and Probability
Information

Book description

Network data are produced automatically by everyday interactions - social networks, power grids, and links between data sets are a few examples. Such data capture social and economic behavior in a form that can be analyzed using powerful computational tools. This book is a guide to both basic and advanced techniques and algorithms for extracting useful information from network data. The content is organized around 'tasks', grouping the algorithms needed to gather specific types of information and thus answer specific types of questions. Examples include similarity between nodes in a network, prestige or centrality of individual nodes, and dense regions or communities in a network. Algorithms are derived in detail and summarized in pseudo-code. The book is intended primarily for computer scientists, engineers, statisticians and physicists, but it is also accessible to network scientists based in the social sciences. MATLAB®/Octave code illustrating some of the algorithms will be available at: http://www.cambridge.org/9781107125773.

Reviews

‘This is a remarkable book that contains a coherent and unified presentation of many recent network data analysis concepts and algorithms. Rich with details and references, this is a book from which faculty and students alike will learn a lot!’

Vincent Blondel - Université Catholique de Louvain, Belgium

‘An impressive compilation of motivation, derivations, and algorithms for a wealth of methods relevant to assessing distance and (dis)similarity, importance, labeling, and clustering of network nodes and links - tasks fundamental to network analysis in practice. The gathering of diverse elements from random walks, kernels, and other interrelated topics is particularly welcome.’

Eric D. Kolaczyk - Boston University

‘This is a reader-friendly up-to-date book covering all the major topics in static network data analysis. It both exposes the reader to the most advanced ideas in the field and provides the researcher with a toolbox of techniques to explore various structures: models involving the graph Laplacian, regularization methods, and Markov interpretations feature in this toolbox, among others.’

Pavel Chebotarev - Institute of Control Sciences, Russian Academy of Sciences

Refine List

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

Contents

Contents

Metrics

Altmetric attention score

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Book summary page views

Total views: 0 *
Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.