Format:
1 Online-Ressource (xxv, 521 Seiten)
,
Illustrationen
ISBN:
9781316418321
Content:
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
Note:
Title from publisher's bibliographic system (viewed on 04 Jul 2016)
Additional Edition:
ISBN 9781107564817
Additional Edition:
ISBN 9781107125773
Additional Edition:
Erscheint auch als Druck-Ausgabe Fouss, François Algorithms and models for network data and link analysis Cambridge : Cambridge University Press, 2016 ISBN 9781107125773
Language:
English
Subjects:
Computer Science
Keywords:
Rechnernetz
;
Algorithmus
DOI:
10.1017/CBO9781316418321
URL:
Volltext
(URL des Erstveröffentlichers)
