Social Networks with Rich Edge Semantics
Regular price
€210.80
14 days return policy
Shipping & Delivery
A01=David Skillicorn
A01=Quan Zheng
Adjacency Matrix
advanced edge semantics modeling
Area VIP
Author_David Skillicorn
Author_Quan Zheng
Category=GPH
Category=UXJ
Category=UYQ
community detection algorithms
Diagonal Degree Matrix
dynamic relationship modeling
Edge Weight
eq_bestseller
eq_computing
eq_isMigrated=1
eq_nobargain
eq_non-fiction
Florentine Families
Laplacian Matrix
Laplacian Normalizations
Lazy Random Walk
Negative Edge Weight
Negative Edges
Negative Relationships
network embedding methods
Normalized Edge Lengths
Original Social Network
Positive Edges
Random Walk Matrix
Rayleigh Quotient
Real World Dataset
semi-supervised learning graphs
signed networks
Spectral Embedding
Spectral Embedding Technique
spectral graph theory
SSL Approach
Transportation Networks
Undirected Graph
Unnormalized Laplacians
Vertical Edges
Von Luxburg
Product details
- ISBN 9781138032439
- Weight: 484g
- Dimensions: 156 x 234mm
- Publication Date: 01 Aug 2017
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Social Networks with Rich Edge Semantics introduces a new mechanism for representing social networks in which pairwise relationships can be drawn from a range of realistic possibilities, including different types of relationships, different strengths in the directions of a pair, positive and negative relationships, and relationships whose intensities change with time. For each possibility, the book shows how to model the social network using spectral embedding. It also shows how to compose the techniques so that multiple edge semantics can be modeled together, and the modeling techniques are then applied to a range of datasets.
Features
-
- Introduces the reader to difficulties with current social network analysis, and the need for richer representations of relationships among nodes, including accounting for intensity, direction, type, positive/negative, and changing intensities over time
-
- Presents a novel mechanism to allow social networks with qualitatively different kinds of relationships to be described and analyzed
-
- Includes extensions to the important technique of spectral embedding, shows that they are mathematically well motivated and proves that their results are appropriate
-
- Shows how to exploit embeddings to understand structures within social networks, including subgroups, positional significance, link or edge prediction, consistency of role in different contexts, and net flow of properties through a node
-
- Illustrates the use of the approach for real-world problems for online social networks, criminal and drug smuggling networks, and networks where the nodes are themselves groups
Suitable for researchers and students in social network research, data science, statistical learning, and related areas, this book will help to provide a deeper understanding of real-world social networks.
David Skillicorn is a professor in the School of Computing at Queen's University. His undergraduate degree is from the University of Sydney and his Ph.D. from the University of Manitoba. He has published extensively in the area of adversarial data analytics, including his recent books "Understanding High-Dimensional Spaces" and "Knowledge Discovery for Counterterrorism and Law Enforcement". He has also been involved in interdisciplinary research on radicalisation, terrorism, and financial fraud. He consults for the intelligence and security arms of government in several countries, and appears frequently in the media to comment on cybersecurity and terrorism.
Dr. Quan Zheng got his Ph.D. is in the School of Computing from Queen’s University in the year 2016.He has a Master’s degree in Applied Mathematics with a specialization in statistics from Indiana University of Pennsylvania, and a Master’s degree in Computer Science from the University of Ulm, and an undergraduate degree from Darmstadt University of Applied Science.
His research interests are in data mining and behavior analysis, particularly social network modeling and graph-based data analysis. He has proposed a few graph algorithms for identifying interested individuals and links, clustering and classification.
