Triad-Based Role Discovery for Large Social Systems

Doran, Derek

doi:10.1007/978-3-319-15168-7_18

Cited by 8 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…7, in an input graph and finds application, among others, in social sciences e.g. to compare different graphs (Faust 2007; Wasserman and Faust 1994) or to extract distinct roles in networks (Doran 2014). The probably first algorithm to compute the triad census on a graph level is attributed to Moody (1998) with a running time of (Coppersmith and Winograd 1990).…”

Section: Triad Censusmentioning

confidence: 99%

“…the information flow, while the other is always in orbit 12. That is the reason why the orbit-aware subgraph census has been used to mine central role structures in graphs (Doran 2014), but restricted to triads. Direct applications of the orbit-aware quad census can for example be found in the context of graph clustering (Milenković and Pržulj 2008; Solava et al 2012).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient orbit-aware triad and quad census in directed and undirected graphs

Ortmann

Brandes

2017

Appl Netw Sci

View full text Add to dashboard Cite

The prevalence of select substructures is an indicator of network effects in applications such as social network analysis and systems biology. Moreover, subgraph statistics are pervasive in stochastic network models, and they need to be assessed repeatedly in MCMC sampling and estimation algorithms. We present a new approach to count all induced and non-induced four-node subgraphs (the quad census) on a per-node and per-edge basis, complete with a separation into their non-automorphic roles in these subgraphs. It is the first approach to do so in a unified manner, and is based on only a clique-listing subroutine. Computational experiments indicate that, despite its simplicity, the approach outperforms previous, less general approaches.By way of the more presentable triad census, we additionally show how to extend the quad census to directed graphs. As a byproduct we obtain the asymptotically fastest triad census algorithm to date.

show abstract

Section: Triad Censusmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Efficient orbit-aware triad and quad census in directed and undirected graphs

Ortmann

Brandes

2017

Appl Netw Sci

View full text Add to dashboard Cite

show abstract

“…The greater the average silhouette coefficient is, the more excellent the number of clusters k is. In this paper, the experimental results show that k is 2 or 3 outperforms [15,16] other values in the Fig.1 (a). When k is 2 in the Fig.1 (b), it has not been better separated to the high degree nodes which are significant and small in Table 2.…”

Section: Why Do the Algorithms Use K-means?mentioning

confidence: 57%

Enhancing Stratified Graph Sampling Algorithms Based on Approximate Degree Distribution

Zhu

Chen

et al. 2018

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

Sampling technique has become one of the recent research focuses in the graph-related fields. Most of the existing graph sampling algorithms tend to sample the high degree or low degree nodes in the complex networks because of the characteristic of scale-free. Scale-free means that degrees of different nodes are subject to a power law distribution. So, there is a significant difference in the degrees between the overall sampling nodes. In this paper, we propose a concept of approximate degree distribution and devise a stratified strategy using it in the complex networks. We also develop two graph sampling algorithms combining the node selection method with the stratified strategy. The experimental results show that our sampling algorithms preserve several properties of different graphs and behave more accurately than other algorithms. Further, we prove the proposed algorithms are superior to the off-the-shelf algorithms in terms of the unbiasedness of the degrees and more efficient than stateof-the-art FFS and ES-i algorithms.

show abstract

“…When a user is a part of a social network, her ties and the nature of those ties shape the user's social role. Doran [24] obtained two Wikipedia roles based on the k-means clustering of censuses of conditional triads in users' ego networks: Specialists and Generalist Attractors [19]. A directed link was added between two users if the first user does text editing, change reversion or vote for an action on the article made by the second user.…”

Section: User Roles Based On Network Structurementioning

confidence: 99%

Users roles identification on online crowdsourced Q&A platforms and encyclopedias: a survey

Saxena

Reddy

2021

J Comput Soc Sc

View full text Add to dashboard Cite

Online informal learning and knowledge-sharing platforms, such as Stack Exchange, Reddit, and Wikipedia have been a great source of learning. Millions of people access these websites to ask questions, answer the questions, view answers, or check facts. However, one interesting question that has always attracted the researchers is if all the users share equally on these portals, and if not then how the contribution varies across users, and how it is distributed? Do different users focus on different kinds of activities and play specific roles? In this work, we present a survey of users’ social roles that have been identified on online discussion and Q&A platforms including Usenet newsgroups, Reddit, Stack Exchange, and MOOC forums, as well as on crowdsourced encyclopedias, such as Wikipedia, and Baidu Baike, where users interact with each other through talk pages. We discuss the state of the art on capturing the variety of users roles through different methods including the construction of user network, analysis of content posted by users, temporal analysis of user activity, posting frequency, and so on. We also discuss the available datasets and APIs to collect the data from these platforms for further research. The survey is concluded with open research questions.

show abstract

Triad-Based Role Discovery for Large Social Systems

Cited by 8 publications

References 31 publications

Efficient orbit-aware triad and quad census in directed and undirected graphs

Efficient orbit-aware triad and quad census in directed and undirected graphs

Enhancing Stratified Graph Sampling Algorithms Based on Approximate Degree Distribution

Users roles identification on online crowdsourced Q&A platforms and encyclopedias: a survey

Contact Info

Product

Resources

About