Abstract
There is a growing amount of observational data describing networks– examples include social networks, communication networks, and biological networks. As the amount of available data increases, so has our interest in analyzing these networks in order to uncover (1) general laws that govern their structure and evolution, and (2) patterns and predictive models to develop better policies and practices. However, a fundamental challenge in dealing with this newly available observational data describing networks is that the data is often of dubious quality–it is noisy and incomplete–and before any analysis method can be applied, the data must be cleaned, missing information inferred and mistakes corrected. Skipping this cleaning step can lead to flawed conclusions for things as simple as degree distribution and centrality measures; for more complex analytic queries, the results are even more likely to be inaccurate and misleading.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benjelloun, O., Garcia-Molina, H., Su, Q., Widom, J.: Swoosh: A generic approach to entity resolution. Technical report, Stanford University (2005)
Bhattacharya, I., Getoor, L.: Collective entity resolution in relational data. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)
Bhattacharya, I., Godbole, S., Joshi, S.: Structured entity identification and document categorization: two tasks with one joint model. In: KDD (2008)
Liben-Nowell, D., Kleinberg, J.: The link prediction problem for social networks. In: CIKM (2003)
Lu, Q., Getoor, L.: Link-based classification. In: ICML (2003)
McDowell, L., Gupta, K.M., Aha, D.W.: Cautious inference in collective classification. In: AAAI (2007)
Neville, J., Jensen, D.: Iterative classification in relational data. In: AAAI Workshop on Learning Statistical Models from Relational Data (2000)
O’Madadhain, J., Hutchins, J., Smyth, P.: Prediction and ranking algorithms for event-based network data. SIGKDD Explorations Newsletter 7(2), 23–30 (2005)
Poon, H., Domingos, P.: Joint unsupervised coreference resolution with Markov logic. In: EMNLP (2008)
Popescul, A., Ungar, L.H.: Statistical relational learning for link prediction. In: IJCAI 2003 Workshop on Learning Statistical Models from Relational Data (2003)
Roth, D., Yih, W.-T.: A linear programming formulation for global inference in natural language tasks. In: CoNLL (2004)
Sarawagi, S.: Information extraction. Foundations and Trends in Databases 1(3) (2008)
Sen, P., Namata, G.M., Bilgic, M., Getoor, L., Gallagher, B., Eliassi-Rad, T.: Collective classification in network data. AI Magazine 29(3), 93–106 (2008)
Singla, P., Domingos, P.: Entity resolution with Markov logic. In: ICDM (2006)
Taskar, B., Wong, M.-F., Abbeel, P., Koller, D.: Link prediction in relational data. In: NIPS (December 2003)
Wick, M.L., Rohanimanesh, K., Schultz, K., McCallum, A.: A unified approach for schema matching, coreference and canonicalization. In: KDD (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Getoor, L. (2010). Graph Identification. In: Cohen, P.R., Adams, N.M., Berthold, M.R. (eds) Advances in Intelligent Data Analysis IX. IDA 2010. Lecture Notes in Computer Science, vol 6065. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13062-5_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13062-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13061-8
Online ISBN: 978-3-642-13062-5
eBook Packages: Computer ScienceComputer Science (R0)