Algorithms And Models For Network Data And Link Analysis

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.

A hands-on, entry-level guide to algorithms for extracting information about social and economic behavior from network data.

This book offers detailed surveys and systematic discussion of models, algorithms and applications for link mining, focusing on theory and technique, and related applications: text mining, social network analysis, collaborative filtering and bioinformatics.

This proceedings presents the result of the 8th International Conference in Network Analysis, held at the Higher School of Economics, Moscow, in May 2018. The conference brought together scientists, engineers, and researchers from academia, industry, and government. Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, computer science, and engineering find this collection a valuable resource filled with the latest research in network analysis. Computational aspects and applications of large-scale networks in market models, neural networks, social networks, power transmission grids, maximum clique problem, telecommunication networks, and complexity graphs are included with new tools for efficient network analysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, and biclustering algorithms are presented with applications to social network analysis.

This book offers detailed surveys and systematic discussion of models, algorithms and applications for link mining, focusing on theory and technique, and related applications: text mining, social network analysis, collaborative filtering and bioinformatics.

This book constitutes the thoroughly refereed post-proceedings of the International Workshop on Statistical Network Analysis: Models, Issues, and New Directions held in Pittsburgh, PA, USA in June 2006 as associated event of the 23rd International Conference on Machine Learning, ICML 2006. It covers probabilistic methods for network analysis, paying special attention to model design and computational issues of learning and inference.

This accessible, alphabetical guide provides concise insights into a variety of digital research methods, incorporating introductory knowledge with practical application and further research implications. A-Z of Digital Research Methods provides a pathway through the often-confusing digital research landscape, while also addressing theoretical, ethical and legal issues that may accompany each methodology. Dawson outlines 60 chapters on a wide range of qualitative and quantitative digital research methods, including textual, numerical, geographical and audio-visual methods. This book includes reflection questions, useful resources and key texts to encourage readers to fully engage with the methods and build a competent understanding of the benefits, disadvantages and appropriate usages of each method. A-Z of Digital Research Methods is the perfect introduction for any student or researcher interested in digital research methods for social and computer sciences.

Graph data is powerful, thanks to its ability to model arbitrary relationship between objects and is encountered in a range of real-world applications in fields such as bioinformatics, traffic network, scientific collaboration, world wide web and social networks. Graph data mining is used to discover useful information and knowledge from graph data. The complications of nodes, links and the semi-structure form present challenges in terms of the computation tasks, e.g., node classification, link prediction, and graph classification. In this context, various advanced techniques, including graph embedding and graph neural networks, have recently been proposed to improve the performance of graph data mining. This book provides a state-of-the-art review of graph data mining methods. It addresses a current hot topic – the security of graph data mining – and proposes a series of detection methods to identify adversarial samples in graph data. In addition, it introduces readers to graph augmentation and subgraph networks to further enhance the models, i.e., improve their accuracy and robustness. Lastly, the book describes the applications of these advanced techniques in various scenarios, such as traffic networks, social and technical networks, and blockchains.