Learning algorithms for link prediction based on chance constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6321 LNAI, Issue PART 1, 2010, Pages 344-360

  Doppa, Janardhan Rao ^a   Yu, Jun ^a   Tadepalli, Prasad ^a   Getoor, Lise ^b  

^a Oregon State University   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL NETWORKS; CHANCE CONSTRAINT; CHANCE-CONSTRAINED; CITATION NETWORKS; CLASS SKEW; COAUTHORSHIP; FUTURE DIRECTIONS; LARGE NETWORKS; LINK PREDICTION; PERFORMANCE IMPROVEMENTS; PREDICTION METHODS; REAL WORLD DOMAIN;

FORECASTING; LEARNING SYSTEMS;

LEARNING ALGORITHMS;

EID: 78049322989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15880-3_28     Document Type: Conference Paper

References (27)

1. Adamic, L., Adar, E.: Friends and neighbors on the web. Social Networks 25, 211-230 (2001)
2. Bennett, K. P., Bredensteiner, E. J.: Duality and geometry in svm classifiers. In: International Conf. on Machine Learning (ICML), pp. 57-64 (2000)
3. Bhattacharyya, C.: Second order cone programming formulations for feature selection. Journal of Machine Learning Research (JMLR) 5, 1417-1433 (2004)
4. Bilgic, M., Namata, G. M., Getoor, L.: Combining collective classification and link prediction. In: Workshop on Mining Graphs and Complex Structures at the IEEE International Conference on Data Mining (ICDM) (2007)
5. Calafiore, G., Campi, M.: Uncertain convex programs: Randomized solutions and confidence levels. Mathematical Programming 102, 25-46 (2005)
6. Farias, D. P. D., Roy, B. V.: On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research 29(3), 462-478 (2001)
7. Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of relational structure. In: International Conference on Machine Learning (ICML) (2001)
8. Getoor, L., Friedman, N., Koller, D., Taskar, B.: Learning probabilistic models of link structure. Journal of Machine Learning Research 3, 679-707 (2002)
9. Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: SDM Workshop on Link Analysis Counter-terrorism and Security (2006)
10. Jagarlapudi, S. N.: Learning Algorithms using Chance-Constrained Programming. Ph.d dissertation, Computer Science and Automation, IISc Bangalore (2007)
11. Kashima, H., Abe, N.: A parameterized probabilistic model of network evolution for supervised link prediction. In: International Conference on Data Mining (ICDM) (2006)
12. Lanckriet, G., Ghaoui, L. E., Bhattacharya, C., Jordan, M.: Minimax probability machine. In: Annual Conference on Neural Information Processing Systems (NIPS) (2001)
13. Li, Y., Zaragoza, H., Herbrich, R., Shawe-Taylor, J., Kandola, J. S.: The perceptron algorithm with uneven margins. In: International Conference on Machine Learning (ICML), pp. 379-386 (2002)
14. Libennowell, D., Kleinberg, J.: The link prediction problem for social networks. In: International Conference on Knowledge Management (CIKM) (2003)
15. Lobo, M. S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra and its Applications 238, 193-228 (1998)
16. Marshall, A., Olkin, I.: Multivariate chebyshev inequalities. Annals of Mathematical Statistics 31, 1001-1014 (1960)
17. Nath, J. S., Bhattacharyya, C.: Maximum margin classifiers with specified false positive and false negative error rates. In: SIAM International Conference on Data Mining (SDM) (2007)
18. Nath, J. S., Bhattacharyya, C., Murty, M. N.: Clustering based large margin classification: a scalable approach using socp formulation. In: International Conference on Knowledge Discovery and Data Mining (KDD) (2006)
19. Newman, M.: Clustering and preferential attachment in growing networks. Physical Review Letters, 64 (2001)
20. Popescul, A., Popescul, R., Ungar, L.: Statistical relational learning for link prediction. In: IJCAI workshop on Learning Statistical Models for Relational Data (2003)
21. Rattngon, M., Jensen, D.: The case for anomalous link discovery. SIGKDD Explorations 7(2), 41-47 (2005)
22. Sarkar, P., Chakrabarti, D., Moore, A.: Theoretical justification of popular link prediction heuristics. In: International Conference on Learning Theory (COLT), pp. 295-307 (2010)
23. Shivaswamy, P. K., Bhattacharyya, C., Smola, A. J.: Second order cone programming approaches for handling missing and uncertain data. Journal of Machine Learning Research (JMLR) 7, 1283-1314 (2006)
24. Taskar, B., Fai Wong, M., Abbeel, P., Koller, D.: Link prediction in relational data. In: Annual Conference on Neural Information Processing Systems (NIPS) (2003)
25. Wang, C., Satuluri, V., Parthasarathy, S.: Local probabilistic models for link prediction. In: International Conference on Data Mining (ICDM) (2007)
26. Wick, M., Rohanimanesh, K., Culotta, A., McCallum, A.: Samplerank: Learning preferences from atomic gradients. In: Neural Information Processing Systems (NIPS) Workshop on Advances in Ranking (2009)
27. Zheleva, E., Getoor, L., Golbeck, J., Kuter, U.: Using friendship ties and family circles for link prediction. In: 2nd ACM SIGKDD Workshop on Social Network Mining and Analysis (SNA-KDD) (2008)