564 research outputs found
Topicality and Social Impact: Diverse Messages but Focused Messengers
Are users who comment on a variety of matters more likely to achieve high
influence than those who delve into one focused field? Do general Twitter
hashtags, such as #lol, tend to be more popular than novel ones, such as
#instantlyinlove? Questions like these demand a way to detect topics hidden
behind messages associated with an individual or a hashtag, and a gauge of
similarity among these topics. Here we develop such an approach to identify
clusters of similar hashtags by detecting communities in the hashtag
co-occurrence network. Then the topical diversity of a user's interests is
quantified by the entropy of her hashtags across different topic clusters. A
similar measure is applied to hashtags, based on co-occurring tags. We find
that high topical diversity of early adopters or co-occurring tags implies high
future popularity of hashtags. In contrast, low diversity helps an individual
accumulate social influence. In short, diverse messages and focused messengers
are more likely to gain impact.Comment: 9 pages, 7 figures, 6 table
Beautiful and damned. Combined effect of content quality and social ties on user engagement
User participation in online communities is driven by the intertwinement of
the social network structure with the crowd-generated content that flows along
its links. These aspects are rarely explored jointly and at scale. By looking
at how users generate and access pictures of varying beauty on Flickr, we
investigate how the production of quality impacts the dynamics of online social
systems. We develop a deep learning computer vision model to score images
according to their aesthetic value and we validate its output through
crowdsourcing. By applying it to over 15B Flickr photos, we study for the first
time how image beauty is distributed over a large-scale social system.
Beautiful images are evenly distributed in the network, although only a small
core of people get social recognition for them. To study the impact of exposure
to quality on user engagement, we set up matching experiments aimed at
detecting causality from observational data. Exposure to beauty is
double-edged: following people who produce high-quality content increases one's
probability of uploading better photos; however, an excessive imbalance between
the quality generated by a user and the user's neighbors leads to a decline in
engagement. Our analysis has practical implications for improving link
recommender systems.Comment: 13 pages, 12 figures, final version published in IEEE Transactions on
Knowledge and Data Engineering (Volume: PP, Issue: 99
Interactive and Iterative Discovery of Entity Network Subgraphs
Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective interestingness from a user's viewpoint. Furthermore, existing approaches to mine graphs are not interactive and cannot incorporate user feedbacks in any natural manner. In this paper, we address these gaps by proposing a graph maximum entropy model to discover surprising connected subgraph patterns from entity graphs. This model is embedded in an interactive visualization framework to enable human-in-the-loop, model-guided data exploration. Using case studies on real datasets, we demonstrate how interactions between users and the maximum entropy model lead to faster and explainable conclusions
Learning Concept Interestingness for Identifying Key Structures from Social Networks
This is the author accepted manuscript. The final version is available from IEEE via the DOI in this recordIdentifying key structures from social networks that aims to discover hidden patterns and extract valuable information is an essential task in the network analysis realm. These different structure detection tasks can be integrated naturally owing to the topological nature of key structures. However, identifying key network structures in most studies has been performed independently, leading to huge computational overheads. To address this challenge, this paper proposes a novel approach for handling key structures identification tasks simultaneously under the unified Formal Concept Analysis (FCA) framework. Specifically, we first implement the FCA-based representation of a social network and then generate the fine-grained knowledge representation, namely concept. Then, an efficient concept interestingness calculation algorithm suitable for social network scenarios is proposed. Next, we then leverage concept interestingness to quantify the hidden relations between concepts and network structures. Finally, an efficient algorithm for jointly key structures detection is developed based on constructed mapping relations. Extensive experiments conducted on real-world networks demonstrate that the efficiency and effectiveness of our proposed approach.Fundamental Research Funds for the Central Universitie
Calliope-Net: Automatic Generation of Graph Data Facts via Annotated Node-link Diagrams
Graph or network data are widely studied in both data mining and
visualization communities to review the relationship among different entities
and groups. The data facts derived from graph visual analysis are important to
help understand the social structures of complex data, especially for data
journalism. However, it is challenging for data journalists to discover graph
data facts and manually organize correlated facts around a meaningful topic due
to the complexity of graph data and the difficulty to interpret graph
narratives. Therefore, we present an automatic graph facts generation system,
Calliope-Net, which consists of a fact discovery module, a fact organization
module, and a visualization module. It creates annotated node-link diagrams
with facts automatically discovered and organized from network data. A novel
layout algorithm is designed to present meaningful and visually appealing
annotated graphs. We evaluate the proposed system with two case studies and an
in-lab user study. The results show that Calliope-Net can benefit users in
discovering and understanding graph data facts with visually pleasing annotated
visualizations
- …