Social Networks With Rich Edge Semantics
Download Social Networks With Rich Edge Semantics PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Social Networks With Rich Edge Semantics book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Social Networks with Rich Edge Semantics
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.
Social Networks with Rich Edge Semantics
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.
Finding Communities in Social Networks Using Graph Embeddings
Community detection in social networks is an important but challenging problem. This book develops a new technique for finding communities that uses both structural similarity and attribute similarity simultaneously, weighting them in a principled way. The results outperform existing techniques across a wide range of measures, and so advance the state of the art in community detection. Many existing community detection techniques base similarity on either the structural connections among social-network users, or on the overlap among the attributes of each user. Either way loses useful information. There have been some attempts to use both structure and attribute similarity but success has been limited. We first build a large real-world dataset by crawling Instagram, producing a large set of user profiles. We then compute the similarity between pairs of users based on four qualitatively different profile properties: similarity of language used in posts, similarity of hashtags used (which requires extraction of content from them), similarity of images displayed (which requires extraction of what each image is 'about'), and the explicit connections when one user follows another. These single modality similarities are converted into graphs. These graphs have a common node set (the users) but different sets a weighted edges. These graphs are then connected into a single larger graph by connecting the multiple nodes representing the same user by a clique, with edge weights derived from a lazy random walk view of the single graphs. This larger graph can then be embedded in a geometry using spectral techniques. In the embedding, distance corresponds to dissimilarity so geometric clustering techniques can be used to find communities. The resulting communities are evaluated using the entire range of current techniques, outperforming all of them. Topic modelling is also applied to clusters to show that they genuinely represent users with similar interests. This can form the basis for applications such as online marketing, or key influence selection.