National Science Library of Georgia

Image from Google Jackets

Algorithms and models for network data and link analysis / François Fouss, Marco Saerens, Masashi Shimbo.

By: Contributor(s): Material type: TextTextPublisher: New York : Cambridge University Press, 2016Description: 1 online resource (xxv, 521 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781316418321 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 004.6/5 23
LOC classification:
  • T57.85 .F68 2016
Online resources: Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 04 Jul 2016).

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.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.