Network data capture social and economic behavior in a form that can be analyzed using computational tools. In this entry-level guide, algorithms for extracting information are derived in detail and summarized in pseudo-code. This book is intended primarily for computer scientists, engineers, statisticians, and physicists, but it is also accessible to social network scientists more broadly.
"Sinopsis" puede pertenecer a otra edición de este libro.
'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
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 4,90 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoGRATIS gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoLibrería: Grey Matter Books, Hadley, MA, Estados Unidos de America
Hardcover. Condición: As New. Like new, glossy illustrated boards, bright white pages, clean in and out, tight crisp binding. Nº de ref. del artículo: 003809
Cantidad disponible: 1 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781107125773
Cantidad disponible: 9 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FM-9781107125773
Cantidad disponible: 9 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Hardcover. Condición: Brand New. 1st edition. 520 pages. 10.25x7.25x1.50 inches. In Stock. Nº de ref. del artículo: __1107125774
Cantidad disponible: 1 disponibles
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Hardcover. Condición: new. Hardcover. 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: Network data capture social and economic behavior in a form that can be analyzed using computational tools. In this entry-level guide, algorithms for extracting information are derived in detail and summarized in pseudo-code. This book is intended primarily for computer scientists, engineers, statisticians, and physicists, but it is also accessible to social network scientists more broadly. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Nº de ref. del artículo: 9781107125773
Cantidad disponible: 1 disponibles
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Hardback. Condición: New. New copy - Usually dispatched within 4 working days. 1187. Nº de ref. del artículo: B9781107125773
Cantidad disponible: Más de 20 disponibles
Librería: CitiRetail, Stevenage, Reino Unido
Hardcover. Condición: new. Hardcover. 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: Network data capture social and economic behavior in a form that can be analyzed using computational tools. In this entry-level guide, algorithms for extracting information are derived in detail and summarized in pseudo-code. This book is intended primarily for computer scientists, engineers, statisticians, and physicists, but it is also accessible to social network scientists more broadly. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Nº de ref. del artículo: 9781107125773
Cantidad disponible: 1 disponibles
Librería: Mispah books, Redhill, SURRE, Reino Unido
Hardcover. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA77311071257746
Cantidad disponible: 1 disponibles
Librería: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condición: new. Hardcover. 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: Network data capture social and economic behavior in a form that can be analyzed using computational tools. In this entry-level guide, algorithms for extracting information are derived in detail and summarized in pseudo-code. This book is intended primarily for computer scientists, engineers, statisticians, and physicists, but it is also accessible to social network scientists more broadly. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Nº de ref. del artículo: 9781107125773
Cantidad disponible: 1 disponibles