Algorithms and Models for Network Data and Link Analysis
$67.00 ( ) USD
- Authors:
- François Fouss, Université Catholique de Louvain, Belgium
- Marco Saerens, Université Catholique de Louvain, Belgium
- Masashi Shimbo, Nara Institute of Science and Technology, Japan
- Date Published: December 2016
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
- format: Adobe eBook Reader
- isbn: 9781316713273
Find out more about Cambridge eBooks
$
67.00 USD
( )
Adobe eBook Reader
Other available formats:
Hardback
Looking for an examination copy?
This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.
-
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.
Read more- Unifies algorithms from diverse fields, including applied mathematics, computer science and physics
- The task-based approach focuses on what information needs to be extracted, then on how to do it
- Derives algorithms in detail and summarizes in pseudo-code to support implementation and adaptation
Reviews & endorsements
"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 LouvainSee more reviews"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 SciencesCustomer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: December 2016
- format: Adobe eBook Reader
- isbn: 9781316713273
- contains: 14 b/w illus. 7 tables
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
1. Preliminaries and notation
2. Similarity/proximity measures between nodes
3. Families of dissimilarity between nodes
4. Centrality measures on nodes and edges
5. Identifying prestigious nodes
6. Labeling nodes: within-network classification
7. Clustering nodes
8. Finding dense regions
9. Bipartite graph analysis
10. Graph embedding.-
Resources for
Algorithms and Models for Network Data and Link Analysis
François Fouss, Marco Saerens, Masashi Shimbo
General Resources
Welcome to the resources site
Here you will find free-of-charge online materials to accompany this book. The range of materials we provide across our academic and higher education titles are an integral part of the book package whether you are a student, instructor, researcher or professional.
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
*This title has one or more locked files and access is given only to instructors adopting the textbook for their class. We need to enforce this strictly so that solutions are not made available to students. To gain access to locked resources you either need first to sign in or register for an account.
These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.
If you are having problems accessing these resources please email lecturers@cambridge.org
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed