Transforming graph data for statistical relational learning

Journal of Artificial Intelligence Research

Volumn 45, Issue , 2012, Pages 363-441

  Rossi, Ryan A ^a   McDowell, Luke K ^b   Aha, David W ^c   Neville, Jennifer ^a  

^a Purdue University   (United States)

^b UNITED STATES NAVAL ACADEMY   (United States)

^c Navy Center for Applied Research in Artificial Intelligence   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA REPRESENTATIONS; GRAPH DATA; GRAPH-BASED; INFORMATION NETWORKS; NODES AND LINKS; RELATIONAL DATA; RELEVANT FEATURES; STATISTICAL RELATIONAL LEARNING;

ALGORITHMS; INFORMATION SERVICES; TAXONOMIES;

METADATA;

EID: 84875176128     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3659     Document Type: Article

References (289)

1. Adamic, L. A., & Adar, E. (2001). Friends and neighbors on the web. Social Networks, 25 (3), 211-230.
2. Adibi, J., Chalupsky, H., Melz, E., Valente, A., et al. (2004). The KOJAK group under: Connecting the dots via integrated knowledge-based and statistical reasoning. In Proceedings of the 16th Conference on Innovative Applications of Artifical Intelligence, pp. 800-807.
3. Adomavicius, G., & Tuzhilin, A. (2005). Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering, 17 (5), 734-749.
4. Ahmed, N., Neville, J., & Kompella, R. (2012a). Network sampling designs for relational classification. In Proceedings of the 6th International AAAI Conference on Weblogs and Social Media.
5. Ahmed, N., Neville, J., & Kompella, R. (2012b). Space-e-cient sampling from social activity streams. In BigMine, pp. 1-8.
6. Ahmed, N., Berchmans, F., Neville, J., & Kompella, R. (2010). Time-based sampling of social network activity graphs. In Proceedings of the 8th Workshop on Mining and Learning with Graphs, pp. 1-9.
7. Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2008). Mixed membership stochastic blockmodels. Journal of Machine Learning Research, 9, 1981-2014.
8. Akaike, H. (1974). A new look at the statistical model identification. IEEE Transactions on Automatic Control, 19 (6), 716-723.
9. Albert, R., Jeong, H., & Barabási, A. (1999). Internet: Diameter of the world-wide web. Nature, 401 (6749), 130-131.
10. Amarel, S. (1968). On representations of problems of reasoning about actions. Machine Intelligence, 3, 131-171.
11. Anthony, A., & desJardins, M. (2007). Data clustering with a relational push-pull model. In Proceedings of the Seventh IEEE International Conference on Data Mining Work- shops, ICDMW '07, pp. 189-194.
12. Aral, S., & Walker, D. (2010). Creating Social Contagion through Viral Product Design: A Randomized Trial of Peer Inuence in Networks. In Proceedings of the 31st Interna- tional Conference on Information Systems.
13. Backstrom, L., & Leskovec, J. (2011). Supervised random walks: predicting and recommending links in social networks. In Proceedings of the 4th International Conference on Web Search and Data Mining, pp. 635-644.
14. Backstrom, L., Dwork, C., & Kleinberg, J. M. (2007). Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography. In Pro- ceedings of the 16th International World Wide Web Conference, pp. 181-190.
15. Balasubramanyan, R., & Cohen, W. (2011). Block-LDA: Jointly modeling entity-annotated text and entity-entity links. In Proceedings of the 7th SIAM International Conference on Data Mining.
16. Barabási, A., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286 (5439), 509-512.
17. Barabási, A., & Crandall, R. (2003). Linked: The new science of networks. American journal of Physics, 71 (4), 409-410.
18. Basilico, J. B., & Hofmann, T. (2004). Unifying collaborative and content-based filtering. In Proceedings of the 21st International Conference on Machine Learning, pp. 65-72.
19. Ben-Hur, A., & Noble, W. (2005). Kernel methods for predicting protein-protein interactions. Bioinformatics, 21 (Suppl. 1), 38-46.
20. Benczúr, A., Csalogány, K., Sarlós, T., & Uher, M. (2005). Spamrank-fully automatic link spam detection. In Adversarial Information Retrieval on the Web, pp. 25-38.
21. Berkhin, P. (2006). Survey of clustering data mining techniques. Grouping Multidimensional Data: Recent Advances in Clustering, 10, 25-71.
22. Bharat, K., & Henzinger, M. (1998). Improved algorithms for topic distillation in a hyperlinked environment. In Proceedings of the 21st International SIGIR Conference on Research and Development in Information Retrieval, pp. 104-111.
23. Bhattacharya, I., & Getoor, L. (2005). Relational clustering for multi-type entity resolution. In Proceedings of the 4th International workshop on Multi-relational Mining, pp. 3-12.
24. Bhattacharya, I., & Getoor, L. (2007). Collective entity resolution in relational data. Transactions on Knowledge Discovery from Data, 1 (1), 1-36.
25. Biba, M., Ferilli, S., & Esposito, F. (2008). Discriminative structure learning of Markov logic networks. Inductive Logic Programming, 5194, 59-76.
26. Bilgic, M., Mihalkova, L., & Getoor, L. (2010). Active learning for networked data. In Proceedings of the 27th International Conference on Machine Learning.
27. Bilgic, M., Namata, G. M., & Getoor, L. (2007). Combining collective classification and link prediction. In Proceedings of the 7th IEEE International Conference on Data Mining Workshops, pp. 381-386.
28. Blei, D., Ng, A., & Jordan, M. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993-1022.
29. Blei, D., & Lafferty, J. (2007). A correlated topic model of science. The Annals of Applied Statistics, 1 (1), 17-35.
30. Bonacich, P., & Lloyd, P. (2001). Eigenvector-like measures of centrality for asymmetric relations. Social Networks, 23 (3), 191-201.
31. Borgman, C., & Furner, J. (2002). Scholarly communication and bibliometrics. Annual Review of Information Science and Technology, 36, 3-72.
32. Brightwell, G., & Winkler, P. (1990). Maximum hitting time for random walks on graphs. Random Structures & Algorithms, 1 (3), 263-276.
33. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., & Wiener, J. (2000). Graph structure in the web. Computer networks, 33 (1-6), 309-320.
34. Burges, C. (1998). A tutorial on support vector machines for pattern recognition. Data mining and knowledge discovery, 2 (2), 121-167.
35. Cafarella, M. J., Wu, E., Halevy, A., Zhang, Y., &Wang, D. Z. (2008). Webtables: Exploring the power of tables on the web. In Proceedings of VLDB, pp. 538-549.
36. Camacho, J., Guimera, R., & Nunes Amaral, L. (2002). Robust patterns in food web structure. Physical Review Letters, 88 (22), 228102: 1-4.
37. Chakrabarti, S., Dom, B., & Indyk, P. (1998). Enhanced hypertext categorization using hyperlinks. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 307-318.
38. Chakrabarti, S., Dom, B., Raghavan, P., Rajagopalan, S., Gibson, D., & Kleinberg, J. (1998). Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems, 30 (1-7), 65-74.
39. Chang, J., & Blei, D. (2009). Relational topic models for document networks. In The 9th International Conference on Artificial Intelligence and Statistics (AISTATS), pp. 81-88.
40. Chang, J., Boyd-Graber, J., & Blei, D. (2009). Connections between the lines: augmenting social networks with text. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 169-178.
41. Clauset, A., Moore, C., & Newman, M. (2008). Hierarchical structure and the prediction of missing links in networks. Nature, 453 (7191), 98-101.
42. Cohn, D., & Chang, H. (2000). Learning to probabilistically identify authoritative documents. In Proceedings of the 17th International Conference on Machine Learning, pp. 167-174.
43. Cohn, D., & Hofmann, T. (2001). The missing link-a probabilistic model of document content and hypertext connectivity. Advances in Neural Information Processing Systems, 13, 430-436.
44. Crane, R., & McDowell, L. K. (2011). Evaluating markov logic networks for collective classification. In Proceedings of the 9th MLG Workshop at the 17th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.
45. Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., & Slattery, S. (2000). Learning to construct knowledge bases from theWorld WideWeb. Artificial Intelligence, 118 (1-2), 69-113.
46. Cristianini, N., & Shawe-Taylor, J. (2000). An Introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press.
47. Dash, M., & Liu, H. (1997). Feature selection for classification. Intelligent data analysis, 1 (3), 131-156.
48. Davis, J., Burnside, E., Castro Dutra, I., Page, D., & Costa, V. (2005). An integrated approach to learning Bayesian networks of rules. In Proceedings of the European Conference on Machine Learning, pp. 84-95.
49. Davis, J., Ong, I., Struyf, J., Burnside, E., Page, D., & Costa, V. S. (2007). Change of representation for statistical relational learning. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2719-2725.
50. De Raedt, L. (2008). Logical and relational learning. Springer.
51. De Raedt, L., & Kersting, K. (2008). Probabilistic inductive logic programming. Springer- Verlag.
52. De Raedt, L., & Thon, I. (2010). Probabilistic rule learning. Inductive Logic Programming, 6489, 47-58.
53. Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990). Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41, 391-407.
54. Deshpande, M., Kuramochi, M., Wale, N., & Karypis, G. (2005). Frequent substructurebased approaches for classifying chemical compounds. IEEE Transactions on Knowledge and Data Engineering, 13, 1036-1050.
55. Dhillon, I. (2001). Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 269-274.
56. Dietz, L., Bickel, S., & Scheffer, T. (2007). Unsupervised prediction of citation inuences. In Proceedings of the 24th International Conference on Machine Learning, pp. 233-240.
57. Domingos, P., & Richardson, M. (2004). Markov logic: A unifying framework for statistical relational learning. In Proceedings of the ICML Workshop on Statistical Relational Learning, pp. 49-54.
58. DuBois, C., & Smyth, P. (2010). Modeling Relational Events via Latent Classes. In Pro- ceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 803-812.
59. Dunne, J., Williams, R., & Martinez, N. (2002). Food-web structure and network theory: the role of connectance and size. Proceedings of the National Academy of Sciences of the United States of America, 99 (20), 12917.
60. Easley, D., & Kleinberg, J. (2010). Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press.
61. Eckart, C., & Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1 (3), 211-218.
62. Egghe, L., & Rousseau, R. (1990). Introduction to informetrics. Elsevier Science Publishers.
63. Erosheva, E., Fienberg, S., & Lafferty, J. (2004). Mixed-membership models of scientific publications. Proceedings of the National Academy of Sciences of the United States of America, 101 (Suppl 1), 5220.
64. Essen, U., & Steinbiss, V. (1992). Cooccurrence smoothing for stochastic language modeling. In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, pp. 161-164.
65. Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999). On power-law relationships of the internet topology. In Proceedings of the ACM SIGCOMM International Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pp. 251-262.
66. Fast, A., & Jensen, D. (2008). Why stacked models perform effective collective classification. In Proceedings of the IEEE International Conference on Data Mining, pp. 785-790.
67. Fodor, I. (2002). A Survey of Dimension Reduction Techniques. US DOE Office of Scientific and Technical Information, 18.
68. Frank, R., Moser, F., & Ester, M. (2007). A method for multi-relational classi-cation using single and multi-feature aggregation functions. Proceedings of the Principles and Practice of Knowledge Discovery in Databases, 1, 430-437.
69. Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40, 35-41.
70. Friedman, J. (2001). Greedy function approximation: A gradient boosting machine.. The Annals of Statistics, 29 (5), 1189-1232.
71. Friedman, N., Getoor, L., Koller, D., & Pfeffer, A. (1999). Learning probabilistic relational models. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, pp. 1300-1309. Springer-Verlag.
72. Gallagher, B., Tong, H., Eliassi-Rad, T., & Faloutsos, C. (2t008). Using ghost edges for classification in sparsely labeled networks. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 256-264.
73. Gärtner, T. (2003). A survey of kernels for structured data. ACM SIGKDD Explorations Newsletter, 5 (1), 49-58.
74. George, E., & McCulloch, R. (1993). Variable selection via Gibbs sampling. Journal of the American Statistical Association, 88, 881-889.
75. Getoor, L., Friedman, N., Koller, D., & Taskar, B. (2003). Learning probabilistic models of link structure. Journal of Machine Learning Research, 3, 679-707.
76. Getoor, L., & Taskar, B. (Eds.). (2007). Introduction to Statistical Relational Learning. MIT Press.
77. Getoor, L., & Diehl, C. P. (2005). Link mining. SIGKDD Explorations, 7, 3-12.
78. Getoor, L., Friedman, N., Koller, D., & Taskar, B. (2001). Learning probabilistic models of relational structure. In Proceedings of International Conference on Machine Learning, pp. 170-177.
79. Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Inferring web communities from link topology. In Proceedings of the 9th ACM Conference on Hypertext and Hypermedia, pp. 225-234.
80. Gilbert, E. & Karahalios, K. (2009). Predicting tie strength with social media. In Proceedings of the 27th CHI International Conference on Human Factors in Computing Systems, 211-220.
81. Girvan, M., & Newman, E. J. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99 (12), 7821-7826.
82. Goadrich, M., & Shavlik, J. (2007). Combining clauses with various precisions and recalls to produce accurate probabilistic estimates. In Proceedings of the 17th International Conference on Inductive Logic Programming, pp. 122-131.
83. Göbel, F., & Jagers, A. (1974). Random walks on graphs. Stochastic processes and their applications, 2 (4), 311-336.
84. Godbole, N., Srinivasaiah, M., & Skiena, S. (2007). Large-scale sentiment analysis for news and blogs. In Proceedings of the International Conference on Weblogs and Social Media.
85. Golub, G., & Reinsch, C. (1970). Singular value decomposition and least squares solutions. Numerische Mathematik, 14 (5), 403-420.
86. Green, J. (1972). Latitudinal variation in associations of planktonic Rotifera. Journal of zoology, 167 (1), 31-39.
87. Gruber, A., Rosen-Zvi, M., & Weiss, Y. (2008). Latent topic models for hypertext. In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence, pp. 230- 239.
88. Guyon, I., & Elissee, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3, 1157-1182.
89. Gyongyi, Z., Garcia-Molina, H., & Pedersen, J. (2004). Combating web spam with trustrank. In Proceedings of VLDB, pp. 576-587.
90. Hannan, E., & Quinn, B. (1979). The determination of the order of an autoregression. Journal of the Royal Statistical Society. Series B (Methodological), 41, 190-195.
91. Harshman, R. (1970). Foundations of the PARAFAC procedure: Models and conditions for an explanatory multi-modal factor analysis. UCLA Working Papers in Phonetics, 16 (1), 84.
92. Hartigan, J., & Wong, M. (1979). A k-means clustering algorithm. Journal of the Royal Statistical Society. Series C, Applied statistics, 28, 100-108.
93. Hasan, M. A., Chaoji, V., Salem, S., & Zaki, M. (2006). Link prediction using supervised learning. In Proceedings of the SDM Workshop on Link Analysis, Counterterrorism and Security.
94. Haveliwala, T. (2003). Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE transactions on knowledge and data engineering, 15, 784-796.
95. Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008). Resisting structural reidentification in anonymized social networks. In Proceedings of VLDB, pp. 102-114.
96. He, D., & Parker, D. (2010). Topic Dynamics: an alternative model of 'Bursts' in Streams of Topics. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 443-452.
97. Henderson, K., Gallagher, B., Li, L., Akoglu, L., Eliassi-Rad, T., Tong, H., & Faloutsos, C. (2011). It's Who You Know: Graph Mining Using Recursive Structural Features. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1-10.
98. Hill, S., Agarwal, D., Bell, R., & Volinsky, C. (2006). Building an effective representation for dynamic networks. Journal of Computational and Graphical Statistics, 15 (3), 584-608.
99. Hoff, P., Raftery, A., & Handcock, M. (2002). Latent space approaches to social network analysis. Journal of the American Statistical Association, 97 (460), 1090-1098.
100. Hofmann, T. (1999). Probabilistic latent semantic analysis. In Proceedings of Uncertainty in Artificial Intelligence, pp. 289-296.
101. Huh, S., & Fienberg, S. (2010). Discriminative Topic Modeling based on Manifold Learning. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 653-661.
102. Huynh, T., & Mooney, R. (2008). Discriminative structure and parameter learning for markov logic networks. In Proceedings of the 25th International Conference on Machine Learning.
103. Inokuchi, A., Washio, T., & Motoda, H. (2000). An apriori-based algorithm for mining frequent substructures from graph data. In Principles of Data Mining and Knowledge Discovery, pp. 13-23.
104. Jaccard, P. (1901). Etude comparative de la distribution orale dans une portion des Alpes et du Jura. Impr. Corbaz.
105. Jackson, M. (2008). Social and economic networks. Princeton Univ Press.
106. Jain, A., & Zongker, D. (1997). Feature selection: Evaluation, application, and small sample performance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19 (2), 153-158.
107. Jeh, G., & Widom, J. (2002). SimRank: A measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538-543.
108. Jensen, D., & Neville, J. (2002). Linkage and autocorrelation cause feature selection bias in relational learning. In Proceedings of the 19th International Conference on Machine Learning, pp. 259-266.
109. Jensen, D., Neville, J., & Gallagher, B. (2004). Why collective inference improves relational classification. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 593-598.
110. Jensen, D., Neville, J., & Hay, M. (2003). Avoiding bias when aggregating relational data with degree disparity. In Proceedings of the 20th International Conference on Machine Learning, pp. 274-281.
111. Jensen, D., Fast, A., Taylor, B., & Maier, M. (2008). Automatic identification of quasiexperimental designs for discovering causal knowledge. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 372-380.
112. Jeong, H., Mason, S., Barabási, A., & Oltvai, Z. (2001). Lethality and centrality in protein networks. Nature, 411 (6833), 41-42.
113. Jeong, H., Tombor, B., Albert, R., Oltvai, Z., & Barabási, A. (2000). The large-scale organization of metabolic networks. Nature, 407 (6804), 651-654.
114. Joachims, T. (1998). Text categorization with support vector machines: Learning with many relevant features. In Proceedings of the European Conference on Machine Learning, pp. 137-142.
115. Johnson, S. (1967). Hierarchical clustering schemes. Psychometrika, 32 (3), 241-254.
116. Kahanda, I., & Neville, J. (2009). Using transactional information to predict link strength in online social networks. In Proceedings of the 4th International Conference on Weblogs and Social Media, pp. 106-113.
117. Kamvar, S., Klein, D., & Manning, C. (2003). Spectral learning. In Proceedings of the 18th International Joint Conference On Artificial Intelligence, pp. 561-566.
118. Kashima, H., & Abe, N. (2006). A parameterized probabilistic model of network evolution for supervised link prediction. In Proceedings of the IEEE International Conference on Data Mining, pp. 340-349.
119. Katz, L. (1953). A new status index derived from sociometric analysis. Psychometrika, 18 (1), 39-43.
120. Kavurucu, Y., Senkul, P., & Toroslu, I. (2008). Aggregation in confidence-based concept discovery for multi-relational data mining. In Proceedings of IADIS European Conference on Data Mining, pp. 43-52.
121. Kersting, K., & De Raedt, L. (2002). Basic principles of learning Bayesian logic programs. Tech. rep. 174, Institute for Computer Science, University of Freiburg.
122. Kersting, K., De Raedt, L., Gutmann, B., Karwath, A., & Landwehr, N. (2008). Relational sequence learning. Probabilistic inductive logic programming, 4911, 28-55.
123. Khosravi, H., Tong Man, O., Xu, X., & Bina, B. (2010). Structure learning for markov logic networks with many descriptive attributes. In Proceedings of the 24th Conference on Artificial Intelligence, pp. 487-493.
124. Khot, T., Natarajan, S., Kersting, K., & Shavlik, J. (2011). Learning markov logic networks via functional gradient boosting. In Data Mining (ICDM), 2011 IEEE 11th International Conference on, pp. 320-329. IEEE.
125. Kim, M., & Leskovec, J. (2011). The network completion problem: Inferring missing nodes and edges in networks. In Proceedings of the SIAM International Conference on Data Mining.
126. Kleczkowski, A., & Grenfell, B. (1999). Mean-field-type equations for spread of epidemics: the small world'model. Physica A: Statistical Mechanics and its Applications, 274 (1- 2), 355-360.
127. Kleinberg, J. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM, 46 (5), 604-632.
128. Knobbe, A., Siebes, A., & Marseille, B. (2002). Involving aggregate functions in multirelational search. In Principles of Data Mining and Knowledge Discovery, pp. 145- 168.
129. Kohavi, R., & John, G. (1997). Wrappers for feature subset selection. Artificial intelligence, 97 (1-2), 273-324.
130. Kohonen, T. (1990). The self-organizing map. Proceedings of the IEEE, 78 (9), 1464-1480.
131. Kok, S., & Domingos, P. (2005). Learning the structure of Markov logic networks. In Proceedings of the 22nd International Conference on Machine Learning, pp. 441-448.
132. Kok, S., & Domingos, P. (2007). Statistical predicate invention. In Proceedings of the 24th International Conference on Machine Learning, pp. 433-440.
133. Kok, S., & Domingos, P. (2008). Extracting semantic networks from text via relational clustering. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 624-639.
134. Kok, S., & Domingos, P. (2009). Learning markov logic network structure via hypergraph lifting. In Proceedings of the 26th International Conference on Machine Learning, pp. 505-512.
135. Kok, S., & Domingos, P. (2010). Learning markov logic networks using structural motifs. In Proceedings of the 27th International Conference on Machine Learning.
136. Kolda, T. G., Bader, B. W., & Kenny, J. P. (2005). Higher-order web link analysis using multilinear algebra. In Proceedings of the IEEE International Conference on Data Mining, pp. 242-249.
137. Kolda, T., & Bader, B. (2006). The TopHITS model for higher-order web link analysis. In Proceedings of the SIAM Data Mining Conference Workshop on Link Analysis, Counterterrorism and Security, pp. 26-29.
138. Koller, D., & Sahami, M. (1996). Toward optimal feature selection. In Proceedings of the 13th International Conference on Machine Learning, pp. 284-292.
139. Kondor, R., & Lafferty, J. (2002). Diffusion kernels on graphs and other discrete structures. In Proceedings of the 19th International Conference on Machine Learning, pp. 315- 322.
140. Kong, X., & Yu, P. (2010). Semi-supervised feature selection for graph classification. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 793-802.
141. Koren, Y., North, S., & Volinsky, C. (2007). Measuring and extracting proximity graphs in networks. Transactions on Knowledge Discovery from Data (TKDD), 1 (3), 12:1- 12:30.
142. Kosala, R., & Blockeel, H. (2000). Web Mining Research: A Survey. ACM SIGKDD Explorations Newsletter, 2 (1), 1-15.
143. Kossinets, G., Kleinberg, J., &Watts, D. (2008). The structure of information pathways in a social communication network. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 435-443.
144. Kou, Z., & Cohen, W. (2007). Stacked graphical models for efficient inference in markov random fields. In Proceedings of the 7th SIAM International Conference on Data Mining, pp. 533-538.
145. Krebs, V. (2002). Mapping networks of terrorist cells. Connections, 24 (3), 43-52.
146. Krogel, M., & Wrobel, S. (2001). Transformation-based learning using multirelational aggregation. Inductive logic programming, 2157, 142-155.
147. Kubica, J., Moore, A., Schneider, J., & Yang, Y. (2002). Stochastic link and group detection. In Proceedings of the 18th AAAI Conference on Artificial Intelligence, pp. 798-806.
148. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proceedings of the 18th International Conference on Machine Learning, pp. 282-289.
149. Landwehr, N., Kersting, K., & De Raedt, L. (2005). nFOIL: Integrating native bayes and FOIL. In Proceedings of the 20th AAAI Conference on Artificial Intelligence, pp. 275-282.
150. Landwehr, N., Passerini, A., De Raedt, L., & Frasconi, P. (2010). Fast learning of relational kernels. Machine learning, 78 (3), 305-342.
151. Langville, A., & Meyer, C. (2005). A Survey of Eigenvector Methods for Web Information Retrieval. SIAM Review, 47 (1), 135-161.
152. Lassez, J.-L., Rossi, R., & Jeev, K. (2008). Ranking links on the web: Search and surf engines. In IEA/AIE, pp. 199-208.
153. Lee, L. (1999). Measures of distributional similarity. In Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics, pp. 25-32.
154. Leicht, E., Holme, P., & Newman, M. (2006). Vertex similarity in networks. Physical Review E, 73 (2), 026120.
155. Leiva, H. A., Gadia, S., & Dobbs, D. (2002). Mrdtl: A multi-relational decision tree learning algorithm. In Proceedings of the 13th International Conference on Inductive Logic Programming, pp. 38-56.
156. Lempel, R., & Moran, S. (2000). The stochastic approach for link-structure analysis (SALSA) and the TKC effect. Computer Networks, 33 (1-6), 387-401.
157. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., & Ghahramani, Z. (2010). Kronecker graphs: An approach to modeling networks. Journal of Machine Learning Research, 11, 985-1042.
158. Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010). Predicting positive and negative links in online social networks. In Proceedings of the 19th International World Wide Web Conference, pp. 641-650.
159. Letovsky, S., & Kasif, S. (2003). Predicting protein function from protein/protein interaction data: a probabilistic approach. Bioinformatics, 19 (Suppl 1), i197.
160. Li, W., & McCallum, A. (2006). Pachinko allocation: DAG-structured mixture models of topic correlations. In Proceedings of the 23rd International Conference on Machine Learning, pp. 577-584.
161. Liben-Nowell, D., & Kleinberg, J. (2007). The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58 (7), 1019- 1031.
162. Lichtenwalter, R., Lussier, J., & Chawla, N. (2010). New Perspectives and Methods in Link Prediction. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 243-252.
163. Lim, T., Loh, W., & Shih, Y. (2000). A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Machine Learning, 40 (3), 203-228.
164. Lin, D. (1998). An information-theoretic de-nition of similarity. In Proceedings of the 15th International Conference on Machine Learning, pp. 296-304.
165. Lin, F., & Cohen, W. W. (2010). Semi-supervised classification of network data using very few labels. In Proceedings of the International Conference on Advances in Social Network Analysis and Mining.
166. Lippi, M., Jaeger, M., Frasconi, P., & Passerini, A. (2009). Relational information gain. Machine Learning, 83 (2), 1-21.
167. Liu, K., & Terzi, E. (2008). Towards identity anonymization on graphs. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 93-106.
168. Liu, W., & Lü, L. (2010). Link prediction based on local random walk. Europhysics Letters, 89, 58007.
169. Liu, Y., Niculescu-Mizil, A., & Gryc, W. (2009). Topic-link LDA: joint models of topic and author community. In Proceedings of the 26th International Conference on Machine Learning, pp. 665-672.
170. Long, B., Zhang, Z., & Yu, P. (2007). A probabilistic framework for relational clustering. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 470-479.
171. Long, B., Zhang, Z., Wu, X., & Yu, P. S. (2006). Spectral clustering for multi-type relational data. In Proceedings of the 23rd International Conference on Machine Learning, pp. 585-592.
172. Lu, C., Hu, X., Chen, X., & ran Park, J. (2010). The Topic-Perspective Model for Social Tagging Systems. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 683-692.
173. Lu, Q., & Getoor, L. (2003). Link-based classification. In Proceedings of the 20th International Conference on Machine Learning, pp. 496-503.
174. MacSkassy, S., & Provost, F. (2003). A simple relational classifier. In Proceedings of the SIGKDD 2nd Workshop on Multi-Relational Data Mining, pp. 64-76.
175. Macskassy, S., & Provost, F. (2007). Classification in networked data: A toolkit and a univariate case study. Journal of Machine Learning Research, 8, 935-983.
176. Macskassy, S. A. (2007). Improving learning in networked data by combining explicit and mined links. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence, pp. 590-595.
177. Maes, F., Peters, S., Denoyer, L., & Gallinari, P. (2009). Simulated iterative classification a new learning procedure for graph labeling. Machine Learning and Knowledge Discovery in Databases, 5782, 47-62.
178. Mallows, C. (1973). Some comments on Cp. Technometrics, 42 (1), 87-94.
179. Maslov, S., & Sneppen, K. (2002). Specificity and stability in topology of protein networks. Science, 296 (5569), 910-913.
180. May, R., & Lloyd, A. (2001). Infection dynamics on scale-free networks. Physical Review E, 64 (6), 66112.
181. McCallum, A., Wang, X., & Corrada-Emmanuel, A. (2007). Topic and role discovery in social networks with experiments on enron and academic email. In Journal of Artificial Intelligence Research, pp. 249-272.
182. McCallum, A., Wang, X., & Mohanty, N. (2007). Joint group and topic discovery from relations and text. In Statistical Network Analysis: Models, Issues and New Directions, Lecture Notes in Computer Science 4503, pp. 28-44.
183. McDowell, L., Gupta, K., & Aha, D. (2009). Cautious collective classification. Journal of Machine Learning Research, 10, 2777-2836.
184. McDowell, L., Gupta, K., & Aha, D. (2007). Cautious inference in collective classification. In Proceedings of the 22nd AAAI Conference on Artificial Intelligence.
185. McDowell, L., Gupta, K., & Aha, D. (2010). Meta-Prediction for Collective Classification. In Proceedings of the 23rd International FLAIRS Conference.
186. McGovern, A., Friedland, L., Hay, M., Gallagher, B., Fast, A., Neville, J., & Jensen, D. (2003). Exploiting relational structure to understand publication patterns in highenergy physics. SIGKDD Explorations, 5 (2), 165-172.
187. McGovern, A., Collier, N., Matthew Gagne, I., Brown, D., & Rodger, A. (2008). Spatiotemporal Relational Probability Trees: An Introduction. In Eighth IEEE International Conference on Data Mining, ICDM., pp. 935-940.
188. Menon, A., & Elkan, C. (2011). Link prediction via matrix factorization. In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, pp. 437-452.
189. Menon, A., & Elkan, C. (2010). Predicting labels for dyadic data. Data Mining and Knowledge Discovery, 21 (2), 327-343.
190. Michie, D., Spiegelhalter, D., Taylor, C., & Campbell, J. (1994). Machine Learning, Neural and Statistical Classification. Ellis Horwood Limited.
191. Mihalkova, L., & Mooney, R. (2007). Bottom-up learning of Markov logic network structure. In Proceedings of the 24th International Conference on Machine Learning, pp. 625- 632.
192. Miller, K., Griths, T., & Jordan, M. (2009). Nonparametric latent feature models for link prediction. Advances in Neural Information Processing Systems (NIPS), 10, 1276- 1284.
193. Minsky, M. (1974). A framework for representing knowledge. Tech. rep., Massachusetts Institute of Technology, Cambridge, MA, USA.
194. Mislove, A., Marcon, M., Gummadi, K., Druschel, P., & Bhattacharjee, B. (2007). Measurement and analysis of online social networks. In Proceedings of the 7th ACM SIGCOMM Conference on Internet measurement, pp. 29-42.
195. Moore, C., & Newman, M. (2000). Epidemics and percolation in small-world networks. Physical Review E, 61 (5), 5678-5682.
196. Moreno, S., & Neville, J. (2009). An investigation of the distributional characteristics of generative graph models. In Proceedings of the 1st Workshop on Information in Networks.
197. Nallapati, R., Ahmed, A., Xing, E., & Cohen, W. (2008). Joint latent topic models for text and citations. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 542-550.
198. Namata, G., Kok, S., & Getoor, L. (2011). Collective graph identification. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 87-95. ACM.
199. Narayanan, A., & Shmatikov, V. (2009). De-anonymizing social networks. In Proceedings of the 30th IEEE Symposium on Security and Privacy, pp. 173-187.
200. Natarajan, S., Khot, T., Kersting, K., Gutmann, B., & Shavlik, J. (2012). Gradient-based boosting for statistical relational learning: The relational dependency network case. Machine Learning, 86, 25-56.
201. Neville, J., Adler, M., & Jensen, D. (2004). Spectral clustering with links and attributes. Tech. rep. 04-42, Dept of Computer Science, University of Massachusetts Amherst.
202. Neville, J., & Jensen, D. (2000). Iterative classi-cation in relational data. In Proceedings of the Workshop on SRL, 17th AAAI Conference on Artificial Intelligence, pp. 42-49.
203. Neville, J., & Jensen, D. (2005). Leveraging relational autocorrelation with latent group models. In Proceedings of the 5th IEEE International Conference on Data Mining, pp. 322-329.
204. Neville, J., & Jensen, D. (2007). Relational dependency networks. Journal of Machine Learning Research, 8, 653-692.
205. Neville, J., Jensen, D., Friedland, L., & Hay, M. (2003). Learning relational probability trees. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 625-630.
206. Neville, J., Jensen, D., & Gallagher, B. (2003). Simple estimators for relational Bayesian classifers. In Proceedings of the 3rd IEEE International Conference on Data Mining, pp. 609-612.
207. Neville, J., Simsek, O., Jensen, D., Komoroske, J., Palmer, K., & Goldberg, H. (2005). Using relational knowledge discovery to prevent securities fraud. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 449-458.
208. Newman, M. (2010). Networks: An Introduction. Oxford Univ Press.
209. Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45, 167-256.
210. Newman, M. (2001a). Clustering and preferential attachment in growing networks. Physical Review E, 64 (2), 025102.
211. Newman, M. (2001b). The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98 (2), 404-409.
212. Newman, M., & Girvan, M. (2004). Finding and evaluating community structure in networks. Physical review E, 69 (2), 26113.
213. Ng, A., Jordan, M., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems, pp. 849-856.
214. Nie, L., Davison, B., & Qi, X. (2006). Topical link analysis for web search. In Proceedings of the 29th International ACM SIGIR Conference on Research and Development in Information Retrieval, p. 98.
215. Nowicki, K., & Snijders, T. (2001). Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96, 1077-1087.
216. Oktay, H., Taylor, B., & Jensen, D. (2010). Causal Discovery in Social Media Using Quasi- Experimental Designs. In Proceedings of the ACM SIGKDD 1st Workshop on Social Media Analytics (SOMA-KDD).
217. Onnela, J.-P., Saramaki, J., Hyvonen, J., Szabo, G., Lazer, D., Kaski, K., Kertesz, J., & Barabasi, A.-L. (2007). Structure and tie strengths in mobile communication networks. Proceedings of the National Academy of Sciences, 104, 7332-7336.
218. Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The pagerank citation ranking: Bringing order to the web. Tech. rep., Technical Report, Stanford Digital Library Technologies Project.
219. Pang, B., & Lee, L. (2008). Opinion mining and sentiment analysis. Foundations and Trends in Information Retrieval, 2 (1-2), 1-135.
220. Pastor-Satorras, R., & Vespignani, A. (2001). Epidemic spreading in scale-free networks. Physical Review Letters, 86 (14), 3200-3203.
221. Pasula, H., Marthi, B., Milch, B., Russell, S., & Shpitser, I. (2003). Identity uncertainty and citation matching. In In NIPS. MIT Press.
222. Perlich, C., & Provost, F. (2003). Aggregation-based feature invention and relational concept classes. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 167-176.
223. Perlich, C., & Provost, F. (2006). Acora: Distribution-based aggregation for relational learning from identifier attributes. Machine Learning, 62, 65-105.
224. Poole, D. (2003). First-order probabilistic inference. In International Joint Conference on Artificial Intelligence, pp. 985-991.
225. Popescul, A., Popescul, R., & Ungar, L. H. (2003a). Statistical relational learning for link prediction. In Proceedings of the Workshop on Learning Statistical Models from Relational Data at IJCAI.
226. Popescul, A., Popescul, R., & Ungar, L. H. (2003b). Structural logistic regression for link analysis. In Proceedings of the Second International Workshop on Multi-Relational Data Mining, pp. 92-106.
227. Popescul, A., & Ungar, L. H. (2004). Cluster-based concept invention for statistical relational learning. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 665-670.
228. Price, D. (1976). A general theory of bibliometric and other cumulative advantage processes. Journal of the American Society for Information Science, 27 (5), 292-306.
229. Pudil, P., Novovicová, J., & Kittler, J. (1994). Floating search methods in feature selection. Pattern recognition letters, 15 (11), 1119-1125.
230. Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004). Defining and identifying communities in networks. Proceedings of the National Academy of Sciences, 101 (9), 2658-2663.
231. Rattigan, M. J., & Jensen, D. (2005). The case for anomalous link discovery. SIGKDD Explorations Newsletter, 7 (2), 41-47.
232. Ravasz, E., Somera, A., Mongru, D., Oltvai, Z., & Barabási, A. (2002). Hierarchical organization of modularity in metabolic networks. Science, 297 (5586), 1551-1555.
233. Resnick, P., & Varian, H. (1997). Recommender systems. Communications of the ACM, 40 (3), 56-58.
234. Richardson, M., & Domingos, P. (2002). The intelligent surfer: Probabilistic combination of link and content information in pagerank. In Advances in Neural Information Processing Systems, pp. 1441-1448.
235. Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62 (1), 107-136.
236. Riedel, S., & Meza-Ruiz, I. (2008). Collective semantic role labelling with markov logic. In Proceedings of the Twelfth Conference on Computational Natural Language Learning, pp. 193-197.
237. Robins, G., Pattison, P., Kalish, Y., & Lusher, D. (2007). An introduction to exponential random graph (p*) models for social networks. Social Networks, 29, 173-191.
238. Robins, G., Snijders, T., Wang, P., & Handcock, M. (2006). Recent developments in exponential random graph (p*) models for social networks. Social Networks, 29, 192-215.
239. Rossi, R., Gallagher, B., Neville, J., & Henderson, K. (2012). Dynamic behavioral mixedmembership model for large evolving networks. In Arxiv preprint arXiv:1205.2056, pp. 1-17.
240. Rossi, R., & Neville, J. (2010). Modeling the evolution of discussion topics and communication to improve relational classification. In Proceedings of the ACM SIGKDD 1st Workshop on Social Media Analytics (SOMA-KDD), pp. 1-10.
241. Rossi, R., Gallagher, B., Neville, J., & Henderson, K. (2012). Role-Dynamics: Fast Mining of Large Dynamic Networks. In LSNA-WWW, pp. 1-9.
242. Rossi, R., & Neville, J. (2012). Time-evolving relational classi-cation and ensemble methods. In Proceedings of the 16th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 1-12.
243. Roth, M., Ben-David, A., Deutscher, D., Flysher, G., Horn, I., Leichtberg, A., Leiser, N., Merom, R., & Mattias, Y. (2010). Suggesting Friends Using the Implicit Social Graph. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 233-242.
244. Russell, S. J., & Norvig, P. (2009). Artificial Intelligence: A Modern Approach (3rd International Edition edition). Prentice Hall.
245. Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31 (4), 581-603.
246. Salton, G., & McGill, M. (1983). Introduction to modern information retrieval, Vol. 1. McGraw-Hill New York.
247. Sarkar, P., & Moore, A. (2005). Dynamic Social Network Analysis using Latent Space Models. SIGKDD Explorations Newsletter, 7 (2), 31-40.
248. Sarukkai, R. R. (2000). Link prediction and path analysis using markov chains. In Proceedings of the 9th International World Wide Web Conference on Computer Networks: The International Journal of Computer and Telecommunications Networking, pp. 377-386.
249. Sarwar, B., Karypis, G., Konstan, J., & Riedl, J. (2000). Application of dimensionality reduction in recommender system-a case study. In ACM WebKDD 2000 Web Mining for E-Commerce Workshop.
250. Schulte, O. (2011). A tractable pseudo-likelihood function for bayes nets applied to relational data. In SDM, pp. 462-473.
251. Schwarz, G. (1978). Estimating the dimension of a model. The annals of statistics, 6 (2), 461-464.
252. Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., & Eliassi-Rad, T. (2008). Collective classification in network data. AI Magazine, 29 (3), 93.
253. Shao, J. (1996). Bootstrap model selection. Journal of the American Statistical Association, 91 (434), 655-665.
254. Shapiro, E. (1982). Algorithmic Program Debugging. ACM Distinguished Dissertation..
255. Sharan, U., & Neville, J. (2008). Temporal-relational classifiers for prediction in evolving domains. In Proceedings of the 8th IEEE International Conference on Data Mining, pp. 540-549.
256. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22 (8), 888-905.
257. Shi, X., Li, Y., & Yu, P. (2011). Collective prediction with latent graphs. In Proceedings of the 20th ACM Conference on Information and Knowledge Management, pp. 1127- 1136.
258. Singla, P., & Domingos, P. (2006). Entity resolution with markov logic. In Proceedings of the 6th IEEE International Conference on Data Mining, pp. 572-582.
259. Srinivasan, A. (1999). The aleph manual. Computing Laboratory, Oxford University, 1.
260. Strehl, A., & Ghosh, J. (2003). Cluster ensembles-a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583-617.
261. Tang, J., Musolesi, M., Mascolo, C., & Latora, V. (2009). Temporal distance metrics for social network analysis. In Proceedings of the 2nd ACM workshop on Online social networks, pp. 31-36.
262. Tang, J., Musolesi, M., Mascolo, C., Latora, V., & Nicosia, V. (2010). Analysing information ows and key mediators through temporal centrality metrics. In Proceedings of the 3rd Workshop on Social Network Systems, pp. 1-6.
263. Tang, L., & Liu, H. (2009). Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 817-826.
264. Tang, L., & Liu, H. (2011). Leveraging social media networks for classification. Journal of Data Mining and Knowledge Discovery, 23, 447-478.
265. Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. In Eighteenth Conference on Uncertainty in Artificial Intelligence, pp. 485-492.
266. Taskar, B., Segal, E., & Koller, D. (2001). Probabilistic classification and clustering in relational data. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp. 870-878.
267. Taskar, B., Wong, M., Abbeel, P., & Koller, D. (2003). Link prediction in relational data. In Advances in Neural Information Processing Systems.
268. Topchy, A., Law, M., Jain, A., & Fred, A. (2004). Analysis of consensus partition in cluster ensemble. In Proceedings of the 4th IEEE International Conference on Data Mining, pp. 225-232.
269. Vert, J., & Yamanishi, Y. (2005). Supervised graph inference. Advances in Neural Information Processing Systems, 17, 1433-1440.
270. Vishwanathan, S., Schraudolph, N., Kondor, R., & Borgwardt, K. (2010). Graph kernels. Journal of Machine Learning Research, 11, 1201-1242.
271. von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17 (4), 395-416.
272. Wagner, A., & Fell, D. (2001). The small world inside large metabolic networks. Proceedings of the Royal Society of London. Series B: Biological Sciences, 268 (1478), 1803-1810.
273. Wang, C., Blei, D., & Heckerman, D. (2008). Continuous time dynamic topic models. In Proceedings of Uncertainty in Artificial Intelligence.
274. Wang, X., & McCallum, A. (2006). Topics over time: a non-Markov continuous-time model of topical trends. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 424-433.
275. Wang, Z., & Chan, L. (2010). An efficient causal discovery algorithm for linear models. In Proceeding of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1109-1118.
276. Wasserman, S., & Faust, K. (1994). Social network analysis: Methods and applications. Cambridge University Press.
277. Watts, D., & Strogatz, S. (1998). Collective dynamics of small-worldnetworks. Nature, 393 (6684), 440-442.
278. White, S., & Smyth, P. (2003). Algorithms for estimating relative importance in networks. In Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data mining, pp. 266-275.
279. Wu, B., & Davison, B. (2005). Identifying link farm spam pages. In Special interest tracks and posters of the 14th International Conference on World Wide Web, pp. 820-829.
280. Xiang, R., Neville, J., & Rogati, M. (2010). Modeling relationship strength in online social networks. In Proceedings of the 19th International World Wide Web Conference, pp. 981-990.
281. Yang, Y., & Pedersen, J. (1997). A comparative study on feature selection in text categorization. In Proceedings of the 14th International Conference on Machine Learning, pp. 412-420.
282. Yin, X., Han, J., Yang, J., & Yu, P. (2006). Crossmine: Efficient classification across multiple database relations. Transactions on Knowledge and Data Engineering, 18 (6), 770-783.
283. Zheleva, E., Getoor, L., Golbeck, J., & Kuter, U. (2010). Using friendship ties and family circles for link prediction. In Advances in Social Network Mining and Analysis, pp. 97-113.
284. Zheleva, E., & Getoor, L. (2007). Preserving the privacy of sensitive relationships in graph data. In PinKDD, pp. 153-171.
285. Zhou, B., Pei, J., & Luk, W. (2008). A brief survey on anonymization techniques for privacy preserving publishing of social network data. SIGKDD Explorations, 10 (2), 12-22.
286. Zhou, H. (2003). Distance, dissimilarity index, and network community structure. Physical review e, 67 (6), 61901.
287. Zhou, T., Lü, L., & Zhang, Y. (2009). Predicting missing links via local information. The European Physical Journal B-Condensed Matter and Complex Systems, 71 (4), 623- 630.
288. Zhu, S., Yu, K., Chi, Y., & Gong, Y. (2007). Combining content and link for classification using matrix factorization. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 487- 494. ACM.
289. Zhu, X. (2006). Semi-supervised learning literature survey. Computer Science Tech Reports, 1530, 1-60.