This volume was prepared to share with a larger audience the exciting ideas and work presented at an ICML 2006 workshop of the same title. Network models have a long history. Sociologists and statisticians made major advances in the 1970s and 1980s, culminating in part with a number of substantial databases and the class of exponential random graph models and related methods in the early 1990s. Physicists and computer scientists came to this domain cons- erably later, but they enriched the array of models and approaches and began to tackle much larger networks and more complex forms of data. Our goal in organ- ing the workshop was to encourage a dialog among people coming from di?erent disciplinary perspectives and with di?erent methods, models, and tools. Both the workshop and the editing of the proceedings was a truly colla- rative e?ort on behalf of all six editors, but three in particular deserve special recognition. Anna Goldenberg and Alice Zheng were the driving force behind the entire enterprise and Edo Airoldi assisted on a number of the more important arrangements.
Author(s): Aaron Clauset, Cristopher Moore, Mark E. J. Newman (auth.), Edoardo Airoldi, David M. Blei, Stephen E. Fienberg, Anna Goldenberg, Eric P. Xing, Alice X. Zheng (eds.)
Series: Lecture Notes in Computer Science 4503
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 200
City: Berlin; New York
Tags: Computer Communication Networks; Probability and Statistics in Computer Science; Information Systems Applications (incl.Internet); Information Storage and Retrieval; Algorithm Analysis and Problem Complexity
Front Matter....Pages -
Structural Inference of Hierarchies in Networks....Pages 1-13
Heider vs Simmel: Emergent Features in Dynamic Structures....Pages 14-27
Joint Group and Topic Discovery from Relations and Text....Pages 28-44
Statistical Models for Networks: A Brief Review of Some Recent Research....Pages 45-56
Combining Stochastic Block Models and Mixed Membership for Statistical Network Analysis....Pages 57-74
Exploratory Study of a New Model for Evolving Networks....Pages 75-89
A Latent Space Model for Rank Data....Pages 90-102
A Simple Model for Complex Networks with Arbitrary Degree Distribution and Clustering....Pages 103-114
Discrete Temporal Models of Social Networks....Pages 115-125
Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time....Pages 126-139
Discovering Functional Communities in Dynamical Networks....Pages 140-157
Empirical Analysis of a Dynamic Social Network Built from PGP Keyrings....Pages 158-171
A Brief Survey of Machine Learning Methods for Classification in Networked Data and an Application to Suspicion Scoring....Pages 172-175
Age and Geographic Inferences of the LiveJournal Social Network....Pages 176-178
Inferring Organizational Titles in Online Communication....Pages 179-181
Learning Approximate MRFs from Large Transactional Data....Pages 182-185
Panel Discussion....Pages 186-194
Back Matter....Pages -
