C4.5: programs for machine learning
C4.5: programs for machine learning
A worldwide flock of Condors: load sharing among workstation clusters
Future Generation Computer Systems - Special issue: resource management in distributed systems
Finding Frequent Items in Data Streams
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
IDA '01 Proceedings of the 4th International Conference on Advances in Intelligent Data Analysis
Stable distributions, pseudorandom generators, embeddings and data stream computation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Sketch-based change detection: methods, evaluation, and applications
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The link prediction problem for social networks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
An improved data stream summary: the count-min sketch and its applications
Journal of Algorithms
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Measuring and extracting proximity in networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
SybilGuard: defending against sybil attacks via social networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
The link-prediction problem for social networks
Journal of the American Society for Information Science and Technology
Dynamic personalized pagerank in entity-relation graphs
Proceedings of the 16th international conference on World Wide Web
Analysis of topological characteristics of huge online social networking services
Proceedings of the 16th international conference on World Wide Web
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Fast direction-aware proximity for graph mining
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Efficient search ranking in social networks
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Link Prediction of Social Networks Based on Weighted Proximity Measures
WI '07 Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence
Fast incremental proximity search in large graphs
Proceedings of the 25th international conference on Machine learning
Growth of the flickr social network
Proceedings of the first workshop on Online social networks
Proceedings of the 1st ACM international workshop on Connected multimedia
A Socratic method for validation of measurement-based networking research
Computer Communications
EPSP: Enhancing Network Protocol with Social-Aware Plane
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Estimating sizes of social networks via biased sampling
Proceedings of the 20th international conference on World wide web
R2DF framework for ranked path queries over weighted RDF graphs
Proceedings of the International Conference on Web Intelligence, Mining and Semantics
A link prediction approach to recommendations in large-scale user-generated content systems
ECIR'11 Proceedings of the 33rd European conference on Advances in information retrieval
Modeling data flow in socio-information networks: a risk estimation approach
Proceedings of the 16th ACM symposium on Access control models and technologies
PrIter: a distributed framework for prioritized iterative computations
Proceedings of the 2nd ACM Symposium on Cloud Computing
Exploring interest correlation for peer-to-peer socialized video sharing
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Clustered embedding of massive social networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Accelerate large-scale iterative computation through asynchronous accumulative updates
Proceedings of the 3rd workshop on Scientific Cloud Computing Date
Fine-grained access control of personal data
Proceedings of the 17th ACM symposium on Access Control Models and Technologies
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 21st ACM international conference on Information and knowledge management
Impact neighborhood indexing (INI) in diffusion graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
A survey on proximity measures for social networks
Search Computing
Sparkler: supporting large-scale matrix factorization
Proceedings of the 16th International Conference on Extending Database Technology
LR-PPR: locality-sensitive, re-use promoting, approximate personalized pagerank computation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Computationally efficient link prediction in a variety of social networks
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
On the embeddability of random walk distances
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information technology, computer networks, and cyber security. It is challenging to estimate proximity measures in online social networks due to their massive scale (with millions of users) and dynamic nature (with hundreds of thousands of new nodes and millions of edges added daily). To address this challenge, we develop two novel methods to efficiently and accurately approximate a large family of proximity measures. We also propose a novel incremental update algorithm to enable near real-time proximity estimation in highly dynamic social networks. Evaluation based on a large amount of real data collected in five popular online social networks shows that our methods are accurate and can easily scale to networks with millions of nodes. To demonstrate the practical values of our techniques, we consider a significant application of proximity estimation: link prediction, i.e., predicting which new edges will be added in the near future based on past snapshots of a social network. Our results reveal that (i) the effectiveness of different proximity measures for link prediction varies significantly across different online social networks and depends heavily on the fraction of edges contributed by the highest degree nodes, and (ii) combining multiple proximity measures consistently yields the best link prediction accuracy.