Network completion and survey sampling

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 209-215

  Hanneke, Steve ^a   Xing, Eric P ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK MODELS; CONFIDENCE BOUNDS; FIXED NUMBERS; UNDIRECTED NETWORK;

TOPOLOGY;

ARTIFICIAL INTELLIGENCE;

EID: 84862281737     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (4)

1. Blum, A., & Langford, J. (2003). PAC-MDL bounds. 16th Annual Conference on Learning Theory.
2. Frank, O. (2005). Network sampling and model fitting. Models and Methods in Social Network Analysis (pp. 31-56). Cambridge University Press.
3. Leskovec, J., Chakrabarti, D., Kleinberg, J., & Faloutsos, C. (2005). Realistic, mathematically tractable graph generation and evolution, using kronecker multiplication. European Conference on Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD).
4. Wasserman, S., & Robins, G. (2005). An introduction to random graphs, dependence graphs, and p*. Models and Methods in Social Network Analysis (pp. 148-161). Cambridge University Press.