Using graph-based metrics with empirical risk minimization to speed up active learning on networked data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2009, Pages 597-605

  Macskassy, Sofus A ^a  

^a Fetch Technologies Inc   (United States)

Author keywords

Active learning; Betweenness centrality; Closeness centrality; Clustering; Community finding; Empirical risk minimization; Semisupervised learning; Social network analysis; Statistical relational learning; Within network learning

Indexed keywords

ACTIVE LEARNING; BETWEENNESS CENTRALITY; CLOSENESS CENTRALITY; CLUSTERING; COMMUNITY FINDING; EMPIRICAL RISK MINIMIZATION; SEMISUPERVISED LEARNING; SOCIAL NETWORK ANALYSIS; STATISTICAL RELATIONAL LEARNING; WITHIN-NETWORK LEARNING;

CLASSIFIERS; CLUSTER ANALYSIS; COMPUTATIONAL EFFICIENCY; EDUCATION; ELECTRIC NETWORK ANALYSIS; FOURIER SERIES; GRAPHIC METHODS; HARMONIC ANALYSIS; LABELING; OPTIMIZATION; RISK ANALYSIS; SUPERVISED LEARNING;

LEARNING ALGORITHMS;

EID: 70350635917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557019.1557087     Document Type: Conference Paper

References (38)

1. J. Anthonisse. The rush in a directed graph. Technical Report BN 9/71, Stichting Mathematish Centrum, 1971.
2. M. A. Beauchamp. An improved index of centrality. Behavioral Science, 10:161-163, 1965.
3. A. Bernstein, S. Clearwater, and F. Provost. The Relational Vector-space Model and Industry Classification. In Proceedings of the Learning Statistical Models from Relational Data Workshop (SRL) at the 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 8-18, 2003.
4. P. M. Blau. Inequality and Heterogeneity: A Primitive Theory of Social Structure. New York: Free Press, 1977.
5. A. Blum and S. Chawla. Learning from Labeled and Unlabeled Data using Graph Mincuts. In Proceedings of the International Conference on Machine Learning (ICML), pages 19-26, 2001.
6. A. Blum, J. Lafferty, R. Reddy, and M. R. Rwebangira. Semi-supervised learning using randomized mincuts. In Proceedings of the 21st International Conference on Machine Learning (ICML), 2004.
7. S. P. Borgatti and M. G. Everett. A graph-theoretic perspective on centrality. Social Networks, 28:466-484, 2006.
8. U. Brandes. On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30(2):136-145, May 2008.
9. S. Chakrabarti, B. Dom, and P. Indyk. Enhanced Hypertext Categorization Using Hyperlinks. In ACM SIGMOD International Conference on Management of Data, 1998.
10. K. Chaloner and I. Verdinelli. Bayesian experimental design: A review. Statistical Science, 10:237-304, 1995.
11. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70, 2004. 066111.
12. D. A. Cohn, Z. Ghahramani, and M. I. Jordan. Active learning with statistical models. Journal of Artificial Intelligence Research, 4:129-145, 1996.
13. M. Craven, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and C. Y. Quek. Learning to Extract Symbolic Knowledge from the World Wide Web. In 15th Conference of the American Association for Artificial Intelligence, 1998.
14. T. Fawcett and F. Provost. Activity monitoring: Noticing interesting changes in behavior. In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 1999.
15. L. C. Freeman. A set of measures of centrality based upon betweenness. Sociometry, 40:35-41, 1977.
16. Y. Freund, H. S. Seung, E. Shamir, and N. Tishby. Selective sampling using the query by committee algorithm. Machine Learning, 28:133-168, 1997.
17. D. Jensen and J. Neville. Linkage and Autocorrelation Cause Feature Selection Bias in Relational Learning. In Proceedings of the 19th International Conference on Machine Learning (ICML), 2002.
18. T. Joachims. Transductive Learning via Spectral Graph Partitioning. In Proceedings of the International Conference on Machine Learning (ICML), 2003.
19. Q. Lu and L. Getoor. Link-Based Classification. In Proceedings of the 20th International Conference on Machine Learning (ICML), 2003.
20. S. A. Macskassy and F. Provost. A Simple Relational Classifier. In Proceedings of the Multi-Relational Data Mining Workshop (MRDM) at the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
21. S. A. Macskassy and F. Provost. Classification in Networked Data: A toolkit and a univariate case study. Journal of Machine Learning Research (JMLR), 8(May):935-983, 2007.
22. A. McCallum and K. Nigam. Employing em in pool-based active learning for text classification. In Proceedings of the 15th International Conference on Machine Learning, pages 350-358, 1998.
23. A. McCallum, K. Nigam, J. Rennie, and K. Seymore. Automating the Construction of Internet Portals with Machine Learning. Information Retrieval, 3(2):127-163, 2000.
24. M. McPherson, L. Smith-Lovin, and J. M. Cook. Birds of a Feather: Homophily in Social Networks. Annual Review of Sociology, 27:415-444, 2001.
25. I. Muslea, S. Minton, and C. Knoblock. Active + semi-supervised learning = robust multi-view learning. In Proceedings of 19th International Conference on Machine Learning, pages 435-442, 2002.
26. J. Neville, D. Jensen, L. Friedland, and M. Hay. Learning Relational Probability Trees. In Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
27. M. E. J. Newman. Mixing patterns in networks. Physical Review E, 67, 2003. 026126.
28. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
29. N. Roy and A. McCallum. Toward optimal active learning through sampling estimation of error reduction. In Proceedings of the 18th International Conference on Machine Learning, pages 441-448, 2001.
30. G. Sabidussi. The centrality index of a graph. Psychometrika, 31:581-603, 1966.
31. B. Taskar, E. Segal, and D. Koller. Probabilistic Classification and Clustering in Relational Data. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pages 870-878, 2001.
32. S. Tong and D. Koller. Support vector machine active learning with applications to text classification. In Proceedings of the 17th International Conference on Machine Learning, pages 999-1006, 2000.
33. V. N. Vapnik. Statistical Learning Theory. John Wiley, NY, 1998.
34. F. Wang and C. Zhang. Label propagation through linear neighborhoods. In Proceedings of the 23rd International Conference on Machine Learning (ICML), pages 985-992, 2006.
35. S. Wasserman and K. Faust. Social Network Analysis. Cambridge: Cambridge University Press, 1994.
36. X. Zhu. Semi-supervised learning literature survey. Technical Report 1530, Department of Computer Sciences, University of Wisconsin, Madison, 2005.
37. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-Supervised Learning Using Gaussian Fields and Harmonic Functions. In Proceedings of the 12th International Conference on Machine Learning, 2003.
38. X. Zhu, J. Lafferty, and Z. Ghahramani. Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions. In ICML 2003 workshop on The Continuum from Labeled toUnlabeled Data in Machine Learning and Data Mining, 2003.