Improvements in data collection and the birth of online com-
munities made it possible to obtain very large social net-
works (graphs). Several communities have been involved
in modeling and analyzing these graphs. Usage of graph-
ical 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 distribu-
tions and to perform inference, i.e. answer queries about
the data. In this work we learn Bayes Nets using the previ-
ously 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 under-
stand social networks is an open area. We discuss possible
interpretations using a small subgraph of the Medline pub-
lications and hope to provoke some discussion and interest
in further analysis.
%0 Conference Paper
%1 citeulike:580811
%A Goldenberg, Anna
%A Moore, Andrew W.
%B Link KDD'05
%D 2005
%K community
%T Bayes Net Graphs to Understand Coauthorship
Networks?
%U http://www.autonlab.org/autonweb/16289/version/1/part/5/data/link-kdd05.pdf?branch=main&language=en
%X Improvements in data collection and the birth of online com-
munities made it possible to obtain very large social net-
works (graphs). Several communities have been involved
in modeling and analyzing these graphs. Usage of graph-
ical 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 distribu-
tions and to perform inference, i.e. answer queries about
the data. In this work we learn Bayes Nets using the previ-
ously 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 under-
stand social networks is an open area. We discuss possible
interpretations using a small subgraph of the Medline pub-
lications and hope to provoke some discussion and interest
in further analysis.
@inproceedings{citeulike:580811,
abstract = {Improvements in data collection and the birth of online com-
munities made it possible to obtain very large social net-
works (graphs). Several communities have been involved
in modeling and analyzing these graphs. Usage of graph-
ical 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 distribu-
tions and to perform inference, i.e. answer queries about
the data. In this work we learn Bayes Nets using the previ-
ously 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 under-
stand social networks is an open area. We discuss possible
interpretations using a small subgraph of the Medline pub-
lications and hope to provoke some discussion and interest
in further analysis.},
added-at = {2006-09-25T12:54:00.000+0200},
author = {Goldenberg, Anna and Moore, Andrew W.},
biburl = {https://www.bibsonomy.org/bibtex/2eeacf3e051e1c55ad40c406c84da2945/grahl},
booktitle = {Link KDD'05},
citeulike-article-id = {580811},
interhash = {58a00c378e019cd18af5ec9f74531472},
intrahash = {eeacf3e051e1c55ad40c406c84da2945},
keywords = {community},
priority = {2},
timestamp = {2006-09-25T12:54:00.000+0200},
title = {Bayes Net Graphs to Understand Coauthorship
Networks?},
url = {http://www.autonlab.org/autonweb/16289/version/1/part/5/data/link-kdd05.pdf?branch=main\&language=en},
year = 2005
}