Finding Communities In Social Networks Using Graph Embeddings
Download Finding Communities In Social Networks Using Graph Embeddings PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Finding Communities In Social Networks Using Graph Embeddings 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.
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.
Knowledge Science, Engineering and Management
Author: Christos Douligeris
language: en
Publisher: Springer Nature
Release Date: 2019-08-20
This two-volume set of LNAI 11775 and LNAI 11776 constitutes the refereed proceedings of the 12th International Conference on Knowledge Science, Engineering and Management, KSEM 2019, held in Athens, Greece, in August 2019. The 77 revised full papers and 23 short papers presented together with 10 poster papers were carefully reviewed and selected from 240 submissions. The papers of the first volume are organized in the following topical sections: Formal Reasoning and Ontologies; Recommendation Algorithms and Systems; Social Knowledge Analysis and Management ; Data Processing and Data Mining; Image and Video Data Analysis; Deep Learning; Knowledge Graph and Knowledge Management; Machine Learning; and Knowledge Engineering Applications. The papers of the second volume are organized in the following topical sections: Probabilistic Models and Applications; Text Mining and Document Analysis; Knowledge Theories and Models; and Network Knowledge Representation and Learning.
Graph Databases in Action
Graph Databases in Action introduces you to graph database concepts by comparing them with relational database constructs. You'll learn just enough theory to get started, then progress to hands-on development. Discover use cases involving social networking, recommendation engines, and personalization. Summary Relationships in data often look far more like a web than an orderly set of rows and columns. Graph databases shine when it comes to revealing valuable insights within complex, interconnected data such as demographics, financial records, or computer networks. In Graph Databases in Action, experts Dave Bechberger and Josh Perryman illuminate the design and implementation of graph databases in real-world applications. You'll learn how to choose the right database solutions for your tasks, and how to use your new knowledge to build agile, flexible, and high-performing graph-powered applications! Purchase of the print book includes a free eBook in PDF, Kindle, and ePub formats from Manning Publications. About the technology Isolated data is a thing of the past! Now, data is connected, and graph databases—like Amazon Neptune, Microsoft Cosmos DB, and Neo4j—are the essential tools of this new reality. Graph databases represent relationships naturally, speeding the discovery of insights and driving business value. About the book Graph Databases in Action introduces you to graph database concepts by comparing them with relational database constructs. You'll learn just enough theory to get started, then progress to hands-on development. Discover use cases involving social networking, recommendation engines, and personalization. What's inside Graph databases vs. relational databases Systematic graph data modeling Querying and navigating a graph Graph patterns Pitfalls and antipatterns About the reader For software developers. No experience with graph databases required. About the author Dave Bechberger and Josh Perryman have decades of experience building complex data-driven systems and have worked with graph databases since 2014. Table of Contents PART 1 - GETTING STARTED WITH GRAPH DATABASES 1 Introduction to graphs 2 Graph data modeling 3 Running basic and recursive traversals 4 Pathfinding traversals and mutating graphs 5 Formatting results 6 Developing an application PART 2 - BUILDING ON GRAPH DATABASES 7 Advanced data modeling techniques 8 Building traversals using known walks 9 Working with subgraphs PART 3 - MOVING BEYOND THE BASICS 10 Performance, pitfalls, and anti-patterns 11 What's next: Graph analytics, machine learning, and resources