Algorithms and models for network data and link analysis (Record no. 205098)

000 -LEADER
fixed length control field 02516cam a22002178i 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 160310s2016 enk b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781107125773
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.65
Item number F6A5
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Fouss, Francois
9 (RLIN) 338152
245 10 - TITLE STATEMENT
Title Algorithms and models for network data and link analysis
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Cambridge
Name of publisher, distributor, etc Cambridge University Press
Date of publication, distribution, etc 2016
300 ## - PHYSICAL DESCRIPTION
Extent xv, 521 p.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Table of Contents<br/><br/>1. Preliminaries and notation<br/>2. Similarity/proximity measures between nodes<br/>3. Families of dissimilarity between nodes<br/>4. Centrality measures on nodes and edges<br/>5. Identifying prestigious nodes<br/>6. Labeling nodes: within-network classification<br/>7. Clustering nodes<br/>8. Finding dense regions<br/>9. Bipartite graph analysis<br/>10. Graph embedding.<br/><br/>
520 ## - SUMMARY, ETC.
Summary, etc 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.<br/><br/>Unifies algorithms from diverse fields, including applied mathematics, computer science and physics<br/>The task-based approach focuses on what information needs to be extracted, then on how to do it<br/>Derives algorithms in detail and summarizes in pseudo-code to support implementation and adaptation.<br/><br/>http://admin.cambridge.org/hu/academic/subjects/computer-science/knowledge-management-databases-and-data-mining/algorithms-and-models-network-data-and-link-analysis?format=HB
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Network analysis
9 (RLIN) 338153
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Planning
9 (RLIN) 937
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics
9 (RLIN) 370
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Saerens, Marco
9 (RLIN) 338154
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Shimbo, Masashi
9 (RLIN) 338155
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Permanent location Current location Shelving location Date acquired Source of acquisition Cost, normal purchase price Total Checkouts Total Renewals Full call number Barcode Date last seen Date last borrowed Cost, replacement price Koha item type
          Non-fiction Vikram Sarabhai Library Vikram Sarabhai Library General Stacks 07/12/2016 12 3555.28 1 2 004.65 F6A5 193322 02/05/2019 09/05/2018 4444.11 Books

Powered by Koha