Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2492517.2492558acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

sonLP: social network link prediction by principal component regression

Published: 25 August 2013 Publication History

Abstract

Social networks are driven by social interaction and therefore dynamic. When modeled as a graph, nodes and links are continually added and deleted, and there is considerable interest in social network analysis on predicting link formation. Current work has not adequately addressed three issues:
(1) Most link predictors start with using features from the link topology as input. How do features in other dimensions of the social network data affect link formation? (2) The dynamic nature of social networks implies the features driving link formation are constantly changing. How can a predictor automatically select the features that are important for link formation? (3) Node pairs that are not linked can outnumber links by orders of magnitude, but previous work do not address this imbalance. How can we design a predictor that is robust with respect to link imbalance?
This paper presents sonLP, a social network link predictor. It uses principal component analysis to identify features that are important to link prediction, its tradeoff between true and false positives is near optimal for a wide range of link imbalance, and it has optimal time complexity. Experiments with coauthorship prediction in the ACM researcher community also show the importance of using features outside the links' dimension.

References

[1]
L. A. Adamic and E. Adar. Friends and neighbors on the web. SOCIAL NETWORKS, 25: 211--230, 2001.
[2]
L. Backstrom and J. Leskovec. Supervised random walks: predicting and recommending links in social networks. In Proc. WSDM, pages 635--644, 2011.
[3]
J. R. Doppa, J. Yu, P. Tadepalli, and L. Getoor. Chance-constrained programs for link prediction. Proc. Workshop on Analyzing Networks and Learning with Graphs (NIPS-2009).
[4]
M. Fire, L. Tenenboim, O. Lesser, R. Puzis, L. Rokach, and Y. Elovici. Link prediction in social networks using computationally efficient topological features. In SocialCom/PASSAT, pages 73--80, 2011.
[5]
A. Halevy, P. Norvig, and F. Pereira. The unreasonable effectiveness of data. IEEE Intelligent Systems, 24: 8--12, 2009.
[6]
M. Hall, E. Frank, G. Holmes, et al. The weka data mining software: an update. SIGKDD Explor. Newsl., 11(1): 10--18, 2009.
[7]
M. A. Hasan, V. Chaoji, S. Salem, and M. Zaki. Link prediction using supervised learning. In Proc. of SDM 06 Workshop on Link Analysis, Counterterrorism and Security, 2006.
[8]
M. A. Hasan and M. J. Zaki. A survey of link prediction in social networks. In Social Network Data Analytics, pages 243--275. 2011.
[9]
J. Huang, Z. Zhuang, J. Li, and C. L. Giles. Collaboration over time: characterizing and modeling network evolution. In Proc. WSDM, pages 107--116, 2008.
[10]
D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. CIKM, pages 556--559, 2003.
[11]
R. N. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In Proc. KDD, pages 243--252, 2010.
[12]
Y. Lu, I. Cohen, X. S. Zhou, and Q. Tian. Feature selection using principal feature analysis. In MULTIMEDIA, pages 301--304, 2007.
[13]
Z. Lu, B. Savas, W. Tang, and I. S. Dhillon. Supervised link prediction using multiple sources. In Proc. ICDM, pages 923--928, 2010.
[14]
D. Pennock, G. Flake, S. Lawrence, E. Glover, and C. Giles. Winners don't take all: Characterizing the competition for links on the web. Proceedings of the National Academy of Sciences, 99(8), 2002.
[15]
R. Popescul and L. H. Ungar. Statistical relational learning for link prediction. In In Proc. Workshop on Learning Statistical Models from Relational Data at IJCAI-2003, 2003.
[16]
A. Potgieter, K. April, R. Cooke, and I. Osunmakinde. Temporality in link prediction: Understanding social complexity. Sprouts: Working Papers on Information Systems, 7(9), 2007.
[17]
M. J. Rattigan and D. Jensen. The case for anomalous link discovery. SIGKDD Explor. Newsl., 7(2): 41--47, Dec. 2005.
[18]
F. Reitz and O. Hoffmann. An analysis of the evolving coverage of computer science sub-fields in the DBLP digital library. In Proc. ECDL, pages 216--227, 2010.
[19]
P. Reuther, B. Walter, M. Ley, A. Weber, and S. Klink. Managing the quality of person names in DBLP. In Proc. European Conf. Research and Advanced Technology for Digital Libraries, pages 508--511, 2006.
[20]
G. Rossetti, M. Berlingerio, and F. Giannotti. Scalable link prediction on multidimensional networks. In Proc. ICDMW, pages 979--986, 2011.
[21]
A. Sharma and K. K. Paliwal. Fast principal component analysis using fixed-point algorithm. Pattern Recogn. Lett., 28(10): 1151--1155, 2007.
[22]
Y. Sun, R. Barber, M. Gupta, C. C. Aggarwal, and J. Han. Co-author relationship prediction in heterogeneous bibliographic networks. In Proc. ASONAM, pages 121--128, 2011.
[23]
T. Tylenda, R. Angelova, and S. Bedathur. Towards time-aware link prediction in evolving social networks. In Proc. SNA-KDD, pages 9:1--9:10, 2009.
[24]
C. Wang, V. Satuluri, and S. Parthasarathy. Local probabilistic models for link prediction. In Proc. ICDM, pages 322--331, 2007.
[25]
Z. Xu, V. Tresp, S. Yu, and K. Yu. Nonparametric relational learning for social network analysis. In Proc. SNA-KDD, 2008.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ASONAM '13: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
August 2013
1558 pages
ISBN:9781450322409
DOI:10.1145/2492517
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 August 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. imbalanced samples
  2. link prediction

Qualifiers

  • Research-article

Funding Sources

Conference

ASONAM '13
Sponsor:
ASONAM '13: Advances in Social Networks Analysis and Mining 2013
August 25 - 28, 2013
Ontario, Niagara, Canada

Acceptance Rates

Overall Acceptance Rate 116 of 549 submissions, 21%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)1
Reflects downloads up to 30 Aug 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Link Prediction in Complex NetworksCognitive Analytics10.4018/978-1-7998-2460-2.ch061(1196-1236)Online publication date: 2020
  • (2018)A link prediction algorithm based on low-rank matrix completionApplied Intelligence10.1007/s10489-018-1220-448:12(4531-4550)Online publication date: 1-Dec-2018
  • (2018)Multi-kernel one class link prediction in heterogeneous complex networksApplied Intelligence10.1007/s10489-018-1157-748:10(3411-3428)Online publication date: 1-Oct-2018
  • (2017)Survival analysis for modeling critical events that communities may undergo in dynamic social networksProceedings of the Symposium on Applied Computing10.1145/3019612.3019817(1068-1075)Online publication date: 3-Apr-2017
  • (2017)Link prediction in multi-relational networks based on relational similarityInformation Sciences: an International Journal10.1016/j.ins.2017.02.003394:C(198-216)Online publication date: 1-Jul-2017
  • (2017)Projection-based link prediction in a bipartite networkInformation Sciences: an International Journal10.1016/j.ins.2016.10.015376:C(158-171)Online publication date: 10-Jan-2017
  • (2017)Link prediction based on sampling in complex networksApplied Intelligence10.1007/s10489-016-0872-147:1(1-12)Online publication date: 1-Jul-2017
  • (2017)Link prediction in complex network based on modularitySoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-016-2030-421:15(4197-4214)Online publication date: 1-Aug-2017
  • (2016)Link Prediction in Complex NetworksAdvanced Methods for Complex Network Analysis10.4018/978-1-4666-9964-9.ch003(58-97)Online publication date: 2016
  • (2016)Sampling-based algorithm for link prediction in temporal networksInformation Sciences: an International Journal10.1016/j.ins.2016.09.029374:C(1-14)Online publication date: 20-Dec-2016
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media