Node classification in social networks is an important problem that has been widely studied in recent years. Several existing node classification methods mainly focus on identifying node classes by exploiting structural and attribute information. However, the information in an emerging information network is usually limited. For example, an emerging social networking service usually has very few registered users (referred to as active users) and a significant amount of new comers (referred to as non-active users) resulting in very sparse interactions among active users. Under this circumstances, distinguishing the users that is likely to be an active user in the future from large-scale new comers becomes challenging. In this paper, we propose a hybrid classification model, which can distinguish whether a non-active user will become an active user in the future by incorporating multiple relations through a unified ranking measure. More specifically, given a friendship network and a mobile communication network, we aim to discover a ranked list of users, who are likely to become active users in the future, from a massive amount of non-active users. We reported several empirical observations from real data sets and conducted extensive experiments to demonstrate the effectiveness of our hybrid classification model and ranking strategy.
[1]
Philip S. Yu,et al.
Collective prediction with latent graphs
,
2011,
CIKM '11.
[2]
Martin Ester,et al.
TrustWalker: a random walk model for combining trust-based and item-based recommendation
,
2009,
KDD.
[3]
Jure Leskovec,et al.
Inferring networks of diffusion and influence
,
2010,
KDD.
[4]
Mao Ye,et al.
Exploring Social Influence for Recommendation - A Probabilistic Generative Model Approach
,
2011,
ArXiv.
[5]
Jure Leskovec,et al.
Inferring Networks of Diffusion and Influence
,
2012,
ACM Trans. Knowl. Discov. Data.
[6]
M. Maloof.
Learning When Data Sets are Imbalanced and When Costs are Unequal and Unknown
,
2003
.
[7]
Aristides Gionis,et al.
Sparsification of influence networks
,
2011,
KDD.
[8]
Cheng Long,et al.
Minimizing Seed Set for Viral Marketing
,
2011,
2011 IEEE 11th International Conference on Data Mining.
[9]
Yang Wang,et al.
Cost-sensitive boosting for classification of imbalanced data
,
2007,
Pattern Recognit..
[10]
Masahiro Kimura,et al.
Prediction of Information Diffusion Probabilities for Independent Cascade Model
,
2008,
KES.