Mondadori Store

Trova Mondadori Store

Benvenuto
Accedi o registrati

lista preferiti

Per utilizzare la funzione prodotti desiderati devi accedere o registrarti

Vai al carrello
 prodotti nel carrello

Totale  articoli

0,00 € IVA Inclusa

Algorithms and Models for Network Data and Link Analysis

François Fouss - Marco Saerens - Masashi Shimbo
pubblicato da Cambridge University Press

Prezzo online:
85,69
100,73
-15 %
100,73

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.

Dettagli down

Generi Informatica e Web » Linguaggi e Applicazioni » Database » Programmazione e sviluppo del software » Scienza dei calcolatori

Editore Cambridge University Press

Formato Ebook con Adobe DRM

Pubblicato 12/07/2016

Lingua Inglese

EAN-13 9781316711941

0 recensioni dei lettori  media voto 0  su  5

Scrivi una recensione per "Algorithms and Models for Network Data and Link Analysis"

Algorithms and Models for Network Data and Link Analysis
 

Accedi o Registrati  per aggiungere una recensione

usa questo box per dare una valutazione all'articolo: leggi le linee guida
torna su Torna in cima