國立高雄大學圖資館 |

Language: English

Back

Algorithms and models for network da...

Fouss, Francois.

Algorithms and models for network data and link analysis

Record Type:	Electronic resources : Monograph/item
Title/Author:	Algorithms and models for network data and link analysisFrancois Fouss, Marco Saerens, Masashi Shimbo.
Author:	Fouss, Francois.
other author:	Saerens, Marco.
Published:	New York :Cambridge University Press,2016.
Description:	xxv, 521 p. :ill., digital ;24 cm.
Subject:	Network analysis (Planning)Mathematics.
Online resource:	https://doi.org/10.1017/CBO9781316418321
ISBN:	9781316418321$q(electronic bk.)

Algorithms and models for network data and link analysis
Fouss, Francois.

Algorithms and models for network data and link analysis[electronic resource] /Francois Fouss, Marco Saerens, Masashi Shimbo. - New York :Cambridge University Press,2016. - xxv, 521 p. :ill., digital ;24 cm.

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.

ISBN: 9781316418321$q(electronic bk.)Subjects--Topical Terms:

265412
Network analysis (Planning)
--Mathematics.

LC Class. No.: T57.85 / .F68 2016

Dewey Class. No.: 004.65

Algorithms and models for network data and link analysis
LDR:01814nmm a2200241 a 4500 001 557787
003 UkCbUP
005 20160711102433.0
006 m d
007 cr nn 008maaau
008 191205s2016 nyu o 1 0 eng d
020 $a 9781316418321$q(electronic bk.)
020 $a 9781107125773$q(paper)
035 $a CR9781316418321
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a T57.85 $b .F68 2016
082 0 4 $a 004.65 $2 23
090 $a T57.85 $b .F781 2016
100 1 $a Fouss, Francois. $3 840383
245 1 0 $a Algorithms and models for network data and link analysis $h [electronic resource] / $c Francois Fouss, Marco Saerens, Masashi Shimbo.
260 $a New York : $b Cambridge University Press, $c 2016.
300 $a xxv, 521 p. : $b ill., digital ; $c 24 cm.
520 $a 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.
650 0 $a Network analysis (Planning) $x Mathematics. $3 265412
700 1 $a Saerens, Marco. $3 840384
700 1 $a Shimbo, Masashi. $3 840385
856 4 0 $u https://doi.org/10.1017/CBO9781316418321