Algorithms and Models for Network Data and Link Analysis
Autor François Fouss, Marco Saerens, Masashi Shimboen Limba Engleză Hardback – 11 iul 2016
Preț: 515.73 lei
Preț vechi: 688.13 lei
-25% Nou
Puncte Express: 774
Preț estimativ în valută:
98.74€ • 101.29$ • 83.14£
98.74€ • 101.29$ • 83.14£
Carte indisponibilă temporar
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781107125773
ISBN-10: 1107125774
Pagini: 543
Ilustrații: 14 b/w illus. 7 tables
Dimensiuni: 184 x 261 x 33 mm
Greutate: 1.13 kg
Ediția:Nouă
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
ISBN-10: 1107125774
Pagini: 543
Ilustrații: 14 b/w illus. 7 tables
Dimensiuni: 184 x 261 x 33 mm
Greutate: 1.13 kg
Ediția:Nouă
Editura: Cambridge University Press
Colecția Cambridge University Press
Locul publicării:New York, United States
Cuprins
1. Preliminaries and notation; 2. Similarity/proximity measures between nodes; 3. Families of dissimilarity between nodes; 4. Centrality measures on nodes and edges; 5. Identifying prestigious nodes; 6. Labeling nodes: within-network classification; 7. Clustering nodes; 8. Finding dense regions; 9. Bipartite graph analysis; 10. Graph embedding.
Recenzii
'This is a remarkable book that contains a coherent and unified presentation of many recent network data analysis concepts and algorithms. Rich with details and references, this is a book from which faculty and students alike will learn a lot!' Vincent Blondel, Université Catholique de Louvain, Belgium
'An impressive compilation of motivation, derivations, and algorithms for a wealth of methods relevant to assessing distance and (dis)similarity, importance, labeling, and clustering of network nodes and links - tasks fundamental to network analysis in practice. The gathering of diverse elements from random walks, kernels, and other interrelated topics is particularly welcome.' Eric D. Kolaczyk, Boston University
'This is a reader-friendly up-to-date book covering all the major topics in static network data analysis. It both exposes the reader to the most advanced ideas in the field and provides the researcher with a toolbox of techniques to explore various structures: models involving the graph Laplacian, regularization methods, and Markov interpretations feature in this toolbox, among others.' Pavel Chebotarev, Institute of Control Sciences, Russian Academy of Sciences
'An impressive compilation of motivation, derivations, and algorithms for a wealth of methods relevant to assessing distance and (dis)similarity, importance, labeling, and clustering of network nodes and links - tasks fundamental to network analysis in practice. The gathering of diverse elements from random walks, kernels, and other interrelated topics is particularly welcome.' Eric D. Kolaczyk, Boston University
'This is a reader-friendly up-to-date book covering all the major topics in static network data analysis. It both exposes the reader to the most advanced ideas in the field and provides the researcher with a toolbox of techniques to explore various structures: models involving the graph Laplacian, regularization methods, and Markov interpretations feature in this toolbox, among others.' Pavel Chebotarev, Institute of Control Sciences, Russian Academy of Sciences
Notă biografică
Descriere
A hands-on, entry-level guide to algorithms for extracting information about social and economic behavior from network data.