A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Efficient crawling through URL ordering
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Breadth-first crawling yields high-quality pages
Proceedings of the 10th international conference on World Wide Web
Introduction to algorithms
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
On the bias of traceroute sampling: or, power-law degree distributions in regular graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Analysis and comparison of P2P search methods
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Cost-effective outbreak detection in networks
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Sampling large Internet topologies for simulation purposes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Metropolis Algorithms for Representative Subgraph Sampling
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Statistical Analysis of Network Data: Methods and Models
Statistical Analysis of Network Data: Methods and Models
Fast shortest path distance estimation in large networks
Proceedings of the 18th ACM conference on Information and knowledge management
Proceedings of the 19th international conference on World wide web
OASNET: an optimal allocation approach to influence maximization in modular social networks
Proceedings of the 2010 ACM Symposium on Applied Computing
Manipulation-resistant reputations using hitting time
WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph
Time-based sampling of social network activity graphs
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
On the Vulnerability of Large Graphs
ICDM '10 Proceedings of the 2010 IEEE International Conference on Data Mining
Space-efficient sampling from social activity streams
Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
| Hi-index | 0.00 |
From social networks to P2P systems, network sampling arises in many settings. We present a detailed study on the nature of biases in network sampling strategies to shed light on how best to sample from networks. We investigate connections between specific biases and various measures of structural representativeness. We show that certain biases are, in fact, beneficial for many applications, as they "push" the sampling process towards inclusion of desired properties. Finally, we describe how these sampling biases can be exploited in several, real-world applications including disease outbreak detection and market research.