Article

Bayes net graphs to understand co-authorship networks?

Authors:

Anna Goldenberg,

Andrew W. MooreAuthors Info & Claims

LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery

Pages 1 - 8

https://doi.org/10.1145/1134271.1134272

Published: 21 August 2005 Publication History

Abstract

Improvements in data collection and the birth of online communities made it possible to obtain very large social networks (graphs). Several communities have been involved in modeling and analyzing these graphs. Usage of graphical models, such as Bayesian Networks (BN), to analyze massive data has become increasingly popular, due to their scalability and robustness to noise. In the literature BNs are primarily used for compact representation of joint distributions and to perform inference, i.e. answer queries about the data. In this work we learn Bayes Nets using the previously proposed SBNS algorithm [14]. We look at the learned networks for the purpose of analyzing the graph structure itself. We also point out a few improvements over the SBNS algorithm. The usefulness of Bayes Net structures to understand social networks is an open area. We discuss possible interpretations using a small subgraph of the Medline publications and hope to provoke some discussion and interest in further analysis.

References

[1]

R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD 12, pages 207--216, 26--28 1993.

Digital Library

[2]

R. Agrawal and R. Srikant, Fast algorithms for mining association rules. In VLDB 20, pages 487--499, 12--15 1994.

Digital Library

[3]

R. Albert and A.-L. Barabasi. Statistical mechanics of social networks. Reviews of Modern Physics, 74, 2002.

Digital Library

[4]

A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509--512, 1999.

[5]

A.-L. Barabasi, R. Albert, and H. Jeong. Mean-field theory for scale-free random networks. Physica A, 272(1-2)173--187, 1999.

[6]

Y. Bishop, S. Fienberg, and P. Holland. Discrete Multivariate Analysis: Theory and Practice. MIT Press, 1977.

[7]

R. Breiger. Emergent themes in social network analysis: Results, challenges, opportunities. In Dynamic Social Network Modeling and Analysis: Workshop Summary and Papers, 2003.

[8]

W. Buntine. Theory refinement on Bayesian networks. In UAI 7, pages 52--60, 1991.

Digital Library

[9]

C. Butts. Network inference, error, and informant (in)accuracy: a Bayesian approach. Social Networks, 2003.

[10]

G. Cooper and E. Herskovits. A Bayesian method for constructing Bayesian belief network from databases. In UAI 7, pages 86--94, 1991.

Digital Library

[11]

P. Erdos and A. Reny. On random graphs. Publications Mathematicae, 6:290--297, 1959.

[12]

N. Friedman. Inferring cellular networks using probabilistic graphical models. Science, 2004.

[13]

N. Friedman, I. Nachman, and D. Pe'er. Learning bayes network structure from massive datasets: The "sparse candidate" algorithm. In UAI 15, page 206:215, 1999.

Digital Library

[14]

A. Goldenberg and A. Moore. Tractable learning of large bayes net structures from sparse data. In 21stInternational Conference on Machine Learning, 2004.

Digital Library

[15]

J. Han and M. Kamber. Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, August 2000.

Digital Library

[16]

M. Handcock. Assessing degeneracy in statistical models of social networks. Working Paper 39, University of Washington, 2003.

[17]

D. Heckerman, D. Geiger, and D. Chickering. Learning Bayesian Networks: The combination of knowledge and statistical data. JMLR, 20:197--243, 1995.

Digital Library

[18]

P. Hoff. Random effects models for network data. Proceedings of the National Academy of Sciences, 2003.

[19]

P. Hoff, A. Raftery, and M. Handcock. Latent space approaches to social network analysis. Journal of the American Statistical Association, 97:1090--1098, 2002.

[20]

J. Hollmen, J. Seppanen, and H. Mannila. Mixture models and frequent sets: combining global and local methods for 0-1 data. In SIAM ICDM, May 2003.

[21]

G. Hulten and P. Domingos. Mining complex models from arbitrarily large databases in constant time. In ACM SIGKDD 8, pages 525--531, 2002.

[22]

M. Meila. An accelerated Chow and Liu algorithm: fitting tree distributions to high dimensional sparse data. Technical Report AIM-1652, MIT, 1999.

Digital Library

[23]

J. Moreno and H. Jennings. Statistics of social configuration. Sociometry. (1):342--374, 1938.

[24]

M. Newman. The structure of scientific collaboration networks. In Proceedings of the National Academy of Sciences USA, volume 98, pages 404--409, 2001.

[25]

D. Pavlov, H. Mannila, and P. Smyth. Beyond independence: probabilistic models for query approximation on binary transaction data. In IEEE Transactions on Knowledge and Data Engineering, September 2003.

Digital Library

[26]

D. Pelleg and A. Moore. Using tarjan's red rule for fast dependency tree construction. In NIPS 15, 2002.

[27]

G. Robins, P. Pattison, and S. Wasserman. Logit models and logistic regressions for social networks iii. valued relations. Psychometrika, 64(3):371--394, 1999.

[28]

P. Smyth. Statistical modeling of graph and network data. In IJCAI Workshop on Learning Statistical Models from Relational Data, 2003.

[29]

T. Snijders. Markov chain monte carlo estimation of exponential random graph models. Journal of Social Structure, 3(2), 2002.

[30]

T. Snijders, P. Pattison, G. Robins, and M. Handcock. New specifications for exponential random graph models. Submitted for publication, 2004.

[31]

Y. Wang and G. Wong. Stochastic blockmodels for directed graphs. Journal American Statistical Association, 82:8--19, 1987.

Cited By

Mena-Chalco JDigiampietri LLopes FCesar R(2014)Brazilian bibliometric coauthorship networksJournal of the Association for Information Science and Technology10.1002/asi.2301065:7(1424-1445)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1002/asi.23010
Tang LBiuk-Aghai RFong SAguiar ABernstein M(2008)A method for measuring co-authorship relationships in MediaWikiProceedings of the 4th International Symposium on Wikis10.1145/1822258.1822280(1-10)Online publication date: 8-Sep-2008
https://dl.acm.org/doi/10.1145/1822258.1822280
Lappas G(2008)An overview of web mining in societal benefit areasOnline Information Review10.1108/1468452081087981832:2(179-195)Online publication date: 11-Apr-2008
https://doi.org/10.1108/14684520810879818
Show More Cited By

Bayes net graphs to understand co-authorship networks?
1. Computing methodologies

Recommendations

Approximate structure learning for large Bayesian networks

We present approximate structure learning algorithms for Bayesian networks. We discuss the two main phases of the task: the preparation of the cache of the scores and structure optimization, both with bounded and unbounded treewidth. We improve on state-...
Learning the Structure of Bayesian Networks Representing Influence Relations among Genes
CIMCA '08: Proceedings of the 2008 International Conference on Computational Intelligence for Modelling Control & Automation

A Bayesian network is a graph-based model of joint multivariateprobability distributions that captures propertiesof conditional independence between variables. Such modelsare an effective way to characterize probabilistic andcausal relations among ...
Constraint-Based Learning Bayesian Networks Using Bayes Factor
Advanced Methodologies for Bayesian Networks
Abstract
A score-based learning Bayesian networks, which seeks the best structure with a score function, incurs heavy computational costs. However, a constraint-based (CB) approach relaxes this problem and extends the available learning network size. A ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

LinkKDD '05: Proceedings of the 3rd international workshop on Link discovery

August 2005

101 pages

ISBN:1595932151

DOI:10.1145/1134271

Program Chairs:
Jafar Adibi
University of Southern California, Marina del Rey, CA
,
Marko Grobelnik
J.Stefan Institute, Ljubljana, Slovenia
,
Dunja Mladenic
J.Stefan Institute, Ljubljana, Slovenia.
,
Patrick Pantel
University of Southern California, Marina del Rey, CA

Copyright © 2005 ACM.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 August 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

KDD05

KDD05: The Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 21 - 25, 2005

Illinois, Chicago

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
699
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mena-Chalco JDigiampietri LLopes FCesar R(2014)Brazilian bibliometric coauthorship networksJournal of the Association for Information Science and Technology10.1002/asi.2301065:7(1424-1445)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1002/asi.23010
Tang LBiuk-Aghai RFong SAguiar ABernstein M(2008)A method for measuring co-authorship relationships in MediaWikiProceedings of the 4th International Symposium on Wikis10.1145/1822258.1822280(1-10)Online publication date: 8-Sep-2008
https://dl.acm.org/doi/10.1145/1822258.1822280
Lappas G(2008)An overview of web mining in societal benefit areasOnline Information Review10.1108/1468452081087981832:2(179-195)Online publication date: 11-Apr-2008
https://doi.org/10.1108/14684520810879818
Lappas G(2007)An Overview of Web Mining in Societal Benefit AreasThe 9th IEEE International Conference on E-Commerce Technology and The 4th IEEE International Conference on Enterprise Computing, E-Commerce and E-Services (CEC-EEE 2007)10.1109/CEC-EEE.2007.22(683-690)Online publication date: Jul-2007
https://doi.org/10.1109/CEC-EEE.2007.22

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten