@inproceedings{Chang09textNetwork,
  abstract = {Network data is ubiquitous, encoding collections of relationships between entities such as people, places, genes, or corporations. While many resources for networks of interesting entities are emerging, most of these can only annotate connections in a limited fashion. Although relationships between entities are rich, it is impractical to manually devise complete characterizations of these relationships for every pair of entities on large, real-world corpora. In this paper we present a novel probabilistic topic model to analyze text corpora and infer descriptions of its entities and of relationships between those entities. We develop variational methods for performing approximate inference on our model and demonstrate that our model can be practically deployed on large corpora such as Wikipedia. We show qualitatively and quantitatively that our model can construct and annotate graphs of relationships and make useful predictions.},
  added-at = {2010-01-14T19:59:52.000+0100},
  address = {New York, NY, USA},
  author = {Chang, Jonathan and Boyd-Graber, Jordan and Blei, David M.},
  biburl = {http://www.bibsonomy.org/bibtex/25ddcf06e18cb1e3ba0232be987ecd953/lee_peck},
  booktitle = {KDD '09: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining},
  description = {Connections between the lines},
  doi = {http://doi.acm.org/10.1145/1557019.1557044},
  interhash = {91c2d0e9a6625bc92333180b41b9c579},
  intrahash = {5ddcf06e18cb1e3ba0232be987ecd953},
  isbn = {978-1-60558-495-9},
  keywords = {09 Chang extraction network social text},
  location = {Paris, France},
  pages = {169--178},
  publisher = {ACM},
  timestamp = {2010-01-14T19:59:52.000+0100},
  title = {Connections between the lines: augmenting social networks with text},
  url = {http://portal.acm.org/citation.cfm?id=1557044},
  year = 2009
}

@inproceedings{Liu04networkFlow,
  abstract = {Detecting outliers is an important topic in data mining. Sometimes the outliers are more interesting than the rest of the data. Outlier identification has lots of applications, such as intrusion detection, and unusual usage of credit cards or telecommunication services. In this paper, we propose a novel method for outlier identification which is based on network flow. We use the well known Maximum Flow Minimum Cut theorem from graph theory to find the outliers and strong outlier groups. Especially, it works on high dimensional data. This outlier detection occurs in a novel setting: to repair poor quality clusters generated by a clustering algorithm.},
  added-at = {2008-11-12T20:41:32.000+0100},
  address = {New York, NY, USA},
  author = {Liu, Ying and Sprague, Alan P. and Lefkowitz, Elliot},
  biburl = {http://www.bibsonomy.org/bibtex/2047cb1091a67b592ebcdc60449a5fba3/lee_peck},
  booktitle = {ACM-SE 42: Proceedings of the 42nd annual Southeast regional conference},
  description = {Network flow for outlier detection},
  doi = {http://doi.acm.org/10.1145/986537.986634},
  interhash = {514f4e731d6fee28ba0956662d897310},
  intrahash = {047cb1091a67b592ebcdc60449a5fba3},
  isbn = {1-58113-870-9},
  keywords = {04 Liu community discovery flow network outlier toread},
  location = {Huntsville, Alabama},
  pages = {402--103},
  publisher = {ACM},
  timestamp = {2008-11-12T20:41:32.000+0100},
  title = {Network flow for outlier detection},
  url = {http://portal.acm.org/citation.cfm?id=986634&dl=GUIDE&coll=GUIDE&CFID=64167610&CFTOKEN=59359426},
  year = 2004
}