# Predicting User Roles in Social Networks Using Transfer Learning with Feature Transformation

@article{Sun2016PredictingUR, title={Predicting User Roles in Social Networks Using Transfer Learning with Feature Transformation}, author={Jun Sun and J{\'e}r{\^o}me Kunegis and Steffen Staab}, journal={2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW)}, year={2016}, pages={128-135} }

How can we recognise social roles of people, given a completely unlabelled social network? We may train a role classification algorithm on another dataset, but then that dataset may have largely different values of its features, for instance, the degrees in the other network may be distributed in a completely different way than in the first network. Thus, a way to transfer the features of different networks to each other or to a common feature space is needed. This type of setting is called… Expand

#### 14 Citations

Enriching the feature space of transfer learning in user analysis in online social networks

- Computer Science
- 2018

Characteristics of the three different roles of Wikipedia users are analysed in order to learn how they function in one language network of Wikipedia and apply them to another Wikipedia network to identify bots. Expand

Network Similarity Prediction in Time-Evolving Graphs: A Machine Learning Approach

- Computer Science
- 2018 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
- 2018

This paper proposes a new approach, namely incremental approximation of similarity measures in time-evolving graphs where the correspondence between the nodes of the two graphs is known, and uses machine learning to build a model to predict the graph similarity by considering only the changes in the graphs. Expand

Understanding Social Networks Using Transfer Learning

- Computer Science, Mathematics
- Computer
- 2018

This work systematically investigates how this concept of transfer learning might be applied to the study of users on emerging Web platforms, proposing a transfer learning–based approach, TraNet. Expand

Evaluation of the accuracy of transfer learning on sentiment analysis for Indonesian tweets

- Computer Science
- 2017 1st International Conference on Informatics and Computational Sciences (ICICoS)
- 2017

This paper evaluates the accuracy of the transfer learning on sentiment analysis for Indonesian tweets and shows that the accuracy is still lower than that of the supervised learning, but the bi-gram features can improve the accuracy. Expand

Constant state of change: engagement inequality in temporal dynamic networks

- Computer Science
- Appl. Netw. Sci.
- 2019

This work quantifies the level of engagement in dynamic complex systems of interactions, modeled as networks, for which the dynamics of the interactions are coupled with that of the topology, such as online messaging, forums, and emails. Expand

Learning Stochastic Equivalence based on Discrete Ricci Curvature

- Computer Science
- IJCAI
- 2021

This work constructs a framework called Curvature-based Network Embedding with Stochastic Equivalence (CNESE) to embed stochastic equivalence and estimates the role distribution of nodes based on discrete Ricci curvature for its excellent ability to concisely representing local topology. Expand

Fast Generating A Large Number of Gumbel-Max Variables

- Computer Science, Mathematics
- WWW
- 2020

A novel algorithm, FastGM, is proposed that reduces the time complexity from O(kn+) to O(kln k + n+), where n+ is the number of positive elements in the vector of interest. Expand

Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams

- Computer Science
- ACM Trans. Knowl. Discov. Data
- 2020

This work proposes ThinkD, which accurately estimates the counts of global triangles and local triangles associated with each node in a fully dynamic graph stream with additions and deletions of edges, and shows its advantages over state-of-the-art methods. Expand

An Index for Single Source All Destinations Distance Queries in Temporal Graphs

- Computer Science
- ArXiv
- 2021

A greedy approximation that constructs an index at most k/δ times larger than an optimal index where δ, with 1 ≤ δ ≤ k, depends on the temporal and spatial structure of the graph is provided. Expand

A Quotient Space Formulation for Statistical Analysis of Graphical Data

- Computer Science, Mathematics
- ArXiv
- 2019

A quotient structure is utilizes to develop efficient algorithms for computing these quantities, leading to useful statistical tools, including principal component analysis, linear dimension reduction, and analytical statistical modeling. Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

It's who you know: graph mining using recursive structural features

- Computer Science
- KDD
- 2011

ReFeX (Recursive Feature eXtraction), a novel algorithm, that recursively combines local features with neighborhood features; and outputs regional features -- capturing "behavioral" information in large graphs, is proposed. Expand

RolX: structural role extraction & mining in large graphs

- Computer Science
- KDD
- 2012

This paper proposes RolX (Role eXtraction), a scalable (linear in the number of edges), unsupervised learning approach for automatically extracting structural roles from general network data, and compares network role discovery with network community discovery. Expand

A Survey on Transfer Learning

- Computer Science
- IEEE Transactions on Knowledge and Data Engineering
- 2010

The relationship between transfer learning and other related machine learning techniques such as domain adaptation, multitask learning and sample selection bias, as well as covariate shift are discussed. Expand

A Comparative Study of Methods for Transductive Transfer Learning

- Computer Science
- Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007)
- 2007

A novel maximum entropy based technique, iterative feature transformation (IFT), is introduced and it is shown how simple relaxations, such as providing additional information like the proportion of positive examples in the test data, can significantly improve the performance of some of the transductive transfer learners. Expand

Correlation-based Feature Selection for Machine Learning

- Computer Science
- 2003

This thesis addresses the problem of feature selection for machine learning through a correlation based approach with CFS (Correlation based Feature Selection), an algorithm that couples this evaluation formula with an appropriate correlation measure and a heuristic search strategy. Expand

Classification and Regression by randomForest

- Computer Science
- 2007

random forests are proposed, which add an additional layer of randomness to bagging and are robust against overfitting, and the randomForest package provides an R interface to the Fortran programs by Breiman and Cutler. Expand

Wiki-talk Datasets

- Computer Science
- 2016

The Wiki-talk datasets are introduced, which consist of the user interaction networks of all user talk pages in Wikipedia, in 28 languages, and are shown how to use the parser provided by us to keep the data up-to-date and how to customize the datasets. Expand

Collective dynamics of ‘small-world’ networks

- Computer Science, Medicine
- Nature
- 1998

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs. Expand

How Many Trees in a Random Forest?

- Mathematics, Computer Science
- MLDM
- 2012

Analysis of whether there is an optimal number of trees within a Random Forest finds an experimental relationship for the AUC gain when doubling the number of Trees in any forest and states there is a threshold beyond which there is no significant gain, unless a huge computational environment is available. Expand

Clustering and preferential attachment in growing networks.

- Physics, Medicine
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2001

It is shown that the probability of a pair of scientists collaborating increases with the number of other collaborators they have in common, and that the probabilities of a particular scientist acquiring new collaborators increases withThe number of his or her past collaborators. Expand