Book contents
- Frontmatter
- Contents
- List of Algorithms
- List of Symbols and Notation
- Preface
- 1 Preliminaries and Notation
- 2 Similarity/Proximity Measures between Nodes
- 3 Families of Dissimilarity between Nodes
- 4 Centrality Measures on Nodes and Edges
- 5 Identifying Prestigious Nodes
- 6 Labeling Nodes: Within-Network Classification
- 7 Clustering Nodes
- 8 Finding Dense Regions
- 9 Bipartite Graph Analysis
- 10 Graph Embedding
- Bibliography
- Index
- References
Bibliography
Published online by Cambridge University Press: 05 July 2016
Book contents
- Frontmatter
- Contents
- List of Algorithms
- List of Symbols and Notation
- Preface
- 1 Preliminaries and Notation
- 2 Similarity/Proximity Measures between Nodes
- 3 Families of Dissimilarity between Nodes
- 4 Centrality Measures on Nodes and Edges
- 5 Identifying Prestigious Nodes
- 6 Labeling Nodes: Within-Network Classification
- 7 Clustering Nodes
- 8 Finding Dense Regions
- 9 Bipartite Graph Analysis
- 10 Graph Embedding
- Bibliography
- Index
- References
- Type
- Chapter
- Information
- Algorithms and Models for Network Data and Link Analysis , pp. 479 - 514Publisher: Cambridge University PressPrint publication year: 2016
References
[1] , and . Foundations of databases. Addison-Wesley, 1994.
[2] . Semisupervised learning for computational linguistics. Chapman and Hall/CRC, 2008.
[4] and . Introduction to optimization methods. Chapman and Hall, 1974.
[5] , editor. Social network data analytics. Springer, 2011.
[6] and , editors. Data clustering: Algorithms and applications. CRC Press, 2014.
[7] and , editors. Managing and mining graph data. Springer, 2010.
[8] and . A survey of clustering algorithms for graph data. In and , editors, Managing and mining graph data, pages 275–301. Springer, 2010.
[9] and . Graph theory: Modeling, applications, and algorithms. Pearson, 2007.
[10] and . Semisupervised clustering. In and , editors, Data clustering: Algorithms and applications, pages 505–534. CRC Press, 2014.Google Scholar
[11] . Categorical data analysis. 3rd ed. Wiley, 2013.
[12] , and . Data structures and algorithms. Addison-Wesley, 1983.
[13] , and . Network flows: Theory, algorithms, and applications. Prentice Hall, 1993.
[14] . Cyclic flows, Markov process and stochastic traffic assignment.
Transportation Research B, 30((5)):369–386
1996.Google Scholar
[15] . Decomposition of path choice entropy in general transport networks.
Transportation Science, 31((4)):349–362
1997.Google Scholar
[16] and . A survey of link prediction. In , editor, Social network data analytics, pages 243–275.Springer, 2011.
[17] . and . Visualizing social networks. In , editor, Social network data analytics, pages 307–326. Springer, 2011.
[18] . Analysis of distance functions in graphs. PhD thesis, University of Hamburg, 2014.
[19] and . Multi-agent random walks for local clustering on graphs. In Proceedings of the 10th International Conference on Data Mining (ICDM'10), pages 18–2., 2010.Google Scholar
[20] and . Phase transition in the family of p-resistances. In Advances in Neural Information Processing Systems 24: Proceedings of the NIPS '11 Conference, pages 379–38., 2011.Google Scholar
[21] . Regression and the Moore-Penrose pseudoinverse. Academic Press, 1972.
[22] and . Reversible Markov chains and random walks on graphs. Unpublished manuscript available at http://www.stat.berkeley.edu/?aldous, 2002.
[23] . Introduction to machine learning. 2nd ed. MIT Press, 2010.
[24] , and . Spectral partitioning with multiple eigenvectors.
Discrete Applied Mathematics, 90(1–3):3–2., 1999.Google Scholar
[25] , , and . k-core decomposition of internet graphs: Hierarchies, self-similarity and measurement biases. ArXiv preprint arXiv:cs/0511007, 2005.Google Scholar
[26] , , and . Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in Neural Information Processing Systems 18: Proceedings of the NIPS '05 Conference, pages 41–5., 2005.Google Scholar
[27] and . Recherche information: Applications, modèles et algorithmes. Eyrolles, 2013.
[28] and . Communities from seed sets. In Proceedings of the 15th International Conference on World Wide Web (WWW'06), pages 223–23., 2006.Google Scholar
[29] . Spatial econometrics: Methods and models. Kluwer, 1988.
[30] and . Contemporary linear algebra. Wiley, 2003.
[31] , , and . Size reduction of complex networks preserving modularity.
New Journal of Physics, 9:176. 2007.Google Scholar
[32] , , and . Motif-based communities in complex networks.
Journal of Physics A: Mathematical and Theoretical, 41:22400., 2008.Google Scholar
[33] and . Mathematical methods for physics. Elsevier, 2005.
[34] . Mathematical statistics. Prentice Hall, 1990.
[35] , and . Parameter estimation and inverse problems. 2nd ed. Academic Press, 2013.
[36] ,,and . An autologistic model for the spatial distribution of wildlife.
Journal of Applied Ecology, 33((2)):339–347
1996.Google Scholar
[37] , and . The role of simulation in modelling spatially correlated data.
Environmetrics, 9((2)):175–196
1998.Google Scholar
[38] , and . Semi-supervised learning with regularized laplacian.
arXiv preprint arXiv:1508.04906, 2015.Google Scholar
[39] and . Modern information retrieval. 2nd ed. Addison-Wesley, 2011.
[40] and . Introduction to probability and mathematical statistics. 2nd ed. PWS-KENT, 1992.Google Scholar
[41] . Applied optimization. Cambridge University Press, 2006.
[42] , , and. Efficient and principledmethod for detecting communities in networks.
Physical Review E, 84(3):03610., 2011.Google Scholar
[43] , , , and . A generalized maximum entropy approach to Bregman co-clustering and matrix approximation. Journal of Machine Learning Research, 8
1919–1986:, 2007.Google Scholar
[44] . The Laplacian matrix of a graph. TheMathematics Student, 65(1–4):87–9., 1996.
[46] . Graphs and matrices. Springer, 2010.
[47] . Network science. Cambridge University Press, forthcoming. Preprint available from http://barabasi.com/networksciencebook, 2016.
[48] and . Emergence of scaling in random networks. Science, 286((5439)):509–512
1999.Google Scholar
[49] . Bayesian reasoning and machine learning. Cambridge University Press, 2012.
[50] and . Detecting network communities by propagating labels under constraints. Physical Review E, 80(2):026129, 2009.Google Scholar
[51] . Matrices: Methods and applications. Oxford University Press, 1992.
[52] , , and . The architecture of complex weighted networks. Proceedings of the National Academy of Sciences of the USA, 101((11)):3747–3752
2004.Google Scholar
[53] . Latent variable models and factor analysis. 2nd ed. Arnold Publishers, 1999.
[54] . Robust sports ratings based on least absolute errors.
The American Statistician, 51((2)):99–105
1997.Google Scholar
[55] , , and. Partitioning approach to visualization of large graphs. In , editor, Graph drawing, volume 1731 of Lecture Notes in Computer Science, pages 90–97.Springer, 1999.
[56] and . Fast algorithms for determining (generalized) core groups in social networks. Advances in Data Analysis and Classification, 5((2)):129–145
2011.Google Scholar
[57] , , and . Spectral sparsification of graphs: Theory and algorithms.
Communications of the ACM, 56((8)):87–94
2009.Google Scholar
[58] . Normalized graph laplacians for directed graphs. Linear Algebra and Its Applications, 436((11)):4193–4222
2012.Google Scholar
[59] and . An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bulletin of the American Mathematical Society, 73((3)):360–363
1967.Google Scholar
[60] . Information theory, relative entropy and statistics. In , editor, Formal theories of information, volume 5363 of Lecture Notes in Computer Science, pages 54–78.Springer, 2009.
[61] . Euclidean distances, soft and spectral clustering on weighted graphs. In , , , and, editors, Proceedings of the 21th European Conference on Machine Learning (ECML '10), volume 6321 of Lecture Notes in Computer Science, pages 103–118.Springer, 2010.
[62] and . Interpolating between random walks and shortest paths: A path functional approach. In , ,, , and , editors, Proceedings of the 4th International Conference on Social Informatics (SocInfo '12), volume 7710 of Lecture Notes in Computer Science, pages 68–81. Springer, 2012.
[63] . Communication patterns in task-oriented groups. The Journal of the Acoustical Society of America, 22((6)):725–730
1950.Google Scholar
[64] and . Correspondence analysis: Theory, practice and new strategies. Wiley, 2014.
[65] , and .Regularization and semi-supervised learning on large graphs. In Proceedings of the International Conference on Learning Theory (COLT '04), pages 624–638, 2004.Google Scholar
[66] , and .Tikhonov regularization and semi-supervised learning on large graphs. In Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '04), pages 1000–1003, 2004.Google Scholar
[67] and . Laplacian eigenmaps and spectral techniques for embedding and clustering. In Advances in Neural Information Processing Systems 14: Proceedings of the NIPS '01 Conference, pages 585–591, 2002.Google Scholar
[68] and . Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15:1373–1396, 2003.Google Scholar
[69] , and . On manifold regularization. In Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (AISTATS '05), pages 17–24, 2005.Google Scholar
[70] , and . Manifold regularization: A geometric framework for learning from examples. Journal of Machine Learning Research, 7:2399–2434, 2006.Google Scholar
[71] . Alternatives to diaLs logit assignment algorithm. Transportation Research Part B: Methodological, 29((4)):287–295
1995.Google Scholar
[72] and.
Generalized inverses: Theory and applications. 2nd ed. Springer, 2003.
[73] and . Analyse factorielle lissée et analyse des différences locales. Revue de Statistique Appliquée, 38((2)):55–76
1990.Google Scholar
[74] , and . Label propagation and quadratic criterion. In , and , editors, Semi-supervised learning, pages 193–216. MIT Press, 2006.
[76] and . A matrix analysis of different centrality measures. ArXiv preprint arxiv:1312.6722, 2013.Google Scholar
[77] and . Total communicability as a centrality measure. Journal of Complex Networks, 1((2)):124–149
2013.Google Scholar
[78] . The theory of graphs and its applications. Wiley, 1962.
[79] , and . Incomplete information within relative pairwise comparisons as utilized by the AHP In ., and , editors, Business Information Systems Workshops: Proceedings of the 2010 Business Information Systems Workshops (BIS '10). Revised Papers, volume 57 of Lecture Notes in Business Information Processing, pages 39–50. Springer, 2010.
[80] , , and . Graph approximations to geodesics on embedded manifold. Technical report, Stanford University, 2000.
[81] and . Email surveillance using non-negative matrix factorization. Computational and Mathematical Organization Theory, 11((3)):249–264
2005.Google Scholar
[82] and
Understanding search engines: Mathematical modeling and text retrieval. 2nd ed. Society for Industrial and Applied Mathematics, 2005.Google Scholar
[83] , , , and . Algorithms and applications for approximate nonnegative matrix factorization. Computational Statistics and Data Analysis, 52((1)):155–173
2007.Google Scholar
[84] . . Lanalyse des données multi-dimensionnelles. Presses Universitaires de France, 1975.
[85] . Network optimization: Continuous and discrete models. Athena Scientific, 1998.
[86] . 2nd ed. Nonlinear programming. Athena Scientific, 1999.
[87] . 2nd ed. Dynamic programming and optimal control. Athena Scientific, 2000.
[88] . Nearest-neighbour systems and the auto-logistic model for binary data. Journal of the Royal Statistical Society, Series B (Methodological), 34((1)):75–83
1972.Google Scholar
[89] , and . Node classification in social networks. In , editor, Social network data analytics, pages 115–148. Springer, 2011.
[90] , and . Graph theory 1736–1936. Oxford University Press, 1976.
[91] . Pattern recognition and machine learning. Springer, 2006.
[92] , and . Discrete multivariate analysis, theory and practice. MIT Press, 1975.
[93] , and . Applied spatial data analysis with R. Springer, 2008.
[94] . Numerical methods for least squares problems. SIAM, 1996.
[95] , , , and . A measure of similarity between graph vertices: Applications to synonym extraction and web searching. SIAM Review, 46((4)):647–666
2004.Google Scholar
[96] , , and . Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 10:P10008, 2008.Google Scholar
[97] . Clustering methods: A history of k-means algorithms. In , , and , editors, Selected Contributions in Data Analysis and Classification, pages 161–172. Springer, 2007.
[98] , and . PageRank as a function of the damping factor. In Proceedings of the 14th International Conference on World Wide Web (WWW 2005), pages 557–566, 2005.Google Scholar
[100] , and . Commute times for a directed graph using an asymmetric Laplacian. Linear Algebra and Its Applications, 435((2)):224–242
2011.Google Scholar
[101] . Spectral clustering and biclustering. Wiley, 2013.
[102] . Modern graph theory. 2nd ed. Springer, 1998.
[103] . Random graphs. 2nd ed. Cambridge University Press, 2001.
[104] . Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2((1)):113–120
1972.Google Scholar
[105] . Power and centrality: A family of measures. The American Journal of Sociology, 92((5)):1170–1182
1987.Google Scholar
[106] and . Graph theory. Springer, 2008.
[107] and .All-scale spatial analysis of ecological data by means of principal coordinates of neighbour matrices. Ecological Modelling, 153(1–2):51–68, 2002.Google Scholar
[108] and . Modern multidimensional scaling: Theory and applications. Springer, 1997.
[109] . Identifying sets of key players in a social network. Computational and Mathematical Organization Theory, 12((1)):21–34
2006.Google Scholar
[110] . Everett. Network analysis of 2-mode data. Social Networks, 19((3)):243–269
1997.Google Scholar
[111] and . A graph-theoretic perspective on centrality. Social Networks, 28((4)):466–484
2006.Google Scholar
[112] , , and . Batch kernel {SOM} and related laplacian methods for social network analysis. Neurocomputing, 71(7–9):1257–1273, 2008.Google Scholar
[113] and . Lanalyse des données. Presses Universitaires de France, 1992.
[114] and . Convex optimization. Cambridge University Press, 2004.
[115] and . Approximations of the generalized inverse of the graph Laplacian matrix. Internet Mathematics, 8((4)):456–481
2012.Google Scholar
[116] and . Resistance distance, closeness, and betweenness. Social Networks, 35((3)):460–469
2013.Google Scholar
[118] . A random walks perspective on maximizing satisfaction and profit. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM '05), pages 12–19, 2005.Google Scholar
[119] . A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology, 25((2)):163–177
2001.Google Scholar
[120] . On variants of shortest-path betweenness centrality and their generic computation. Social Networks, 30((2)):136–145
2008.Google Scholar
[121] and . Visual ranking of link structures. Journal of Graph Algorithms and Applications, 7((2)):181–201
2003.Google Scholar
[122] , , , , , and . On modularity clustering. IEEE Transactions on Knowledge and Data Engineering, 20(2):172–188, 2008.Google Scholar
[123] and , editors. Network analysis:Methodological foundations. Springer, 2005.
[124] and . Centrality measures based on current flow. In Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS '05), pages 533–544, 2005.Google Scholar
[125] and . Smallest graphs with distinct singleton centers. Network Science, 2:416–418, 2014.Google Scholar
[126] . Markov chains: Gibbs fields, Monte Carlo simulation, and queues. Springer, 1999.
[127] and . p-voltages: Laplacian regularization for semi-supervised learning on high-dimensional data. In Proceedings of the 11th Workshop on Mining and Learning with Graphs (MLG '13), 2013.Google Scholar
[128] and . Maximum hitting time for random walks on graphs. Random Structures and Algorithms, 1((3)):263–276
1990.Google Scholar
[129] and . The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems, 30(1–7):107–117, 1998.Google Scholar
[130] and . A fast non-negativity-constrained least squares algorithm. Journal of Chemometrics, 11((5)):393–401
1997.
[131] and . Modelling individual differences between assessors in sensory evaluations. Food Quality and Preference, 5:215–224, 1994.Google Scholar
[132] , , , , , , and . Graph structure in the web: Experiments and models. In Proceedings of the 9th International World Wide Web Conference (WWW '00), pages 309–320, 2000.Google Scholar
[133] and . Evaluation of clustering algorithms for protein-protein interaction networks. BMC Bioinformatics, 7((1)):1–19
2006.Google Scholar
[134] . Matrix operations. McGraw-Hill, 1989.
[135] and . Distance in graphs. Addison-Wesley, 1990.
[136] and . Model selection and multimodel inference. 2nd ed. Springer, 2002.
[137] , , and . Semi-supervised classification from discriminative random walks. In and , editors, Proceedings of the 19th European Conference on Machine Learning (ECML '08), volume 5211 of Lecture Notes in Artificial Intelligence, pages 162–177. Springer, 2008.
[138] and . Generalized inverses of linear transformations. Pitman, 1979.
[139] , , and . A framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies. Data Mining and Knowledge Discovery, 27:344–371, 2013.Google Scholar
[140] , and . A generalized and adaptive method for community detection. ArXiv preprint arxiv:1406.2518, 2014.Google Scholar
[141] .George. Explaining theGibbs sampler. TheAmerican Statistician, 46(3):167–174, 1992.Google Scholar
[142] and . Monte Carlo statistical methods. Springer, 2004.
[143] , , and . The Kemeny constant for finite homogeneous Ergodic Markov chains. Journal of Scientific Computing, 45(1–3):151–166, 2010.Google Scholar
[144] . On the analytical forms called trees: With application to the theory of chemical combinations. Reports of the British Association for the Advancement of Science, 45:257–305, 1875.Google Scholar
[145] , , , and . Classification automatique des données. Dunod, 1989.
[146] , and . Enhanced hypertext categorization using hyperlinks. In Proceedings of the 1998 ACM International Conference on Management of Data (SIGMOD '98), pages 307–318, 1998.Google Scholar
[147] , , , , , , and . Mining the web's link structure. Computer, 32((8)):60–67
1999.Google Scholar
[148] and . Shortest path tree computation in dynamic graphs. IEEE Transactions on Computers, 58((4)):541–557
2009.Google Scholar
[149] , and .On the optimality of the median cut spectral bisection graph partitioning method. SIAM Journal on Scientific Computing, 18((3)):943–948
1997.Google Scholar
[150] , , , and . The electrical resistance of a graph captures its commute and cover times. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC '89), pages 574–586, 1989.Google Scholar
[151] , , , and . The electrical resistance of a graph captures its commute and cover times. Computational Complexity, 6((4)):312–340
1996.Google Scholar
[152] , and , editors. Semi-supervised learning. MIT Press, 2006.
[153] . Greedy approximation algorithms for finding dense components in a graph. In and , editors, Approximation algorithms for combinatorial optimization, volume 1913 of Lecture Notes in Computer Science, pages 84–95. Springer, 2000.
[154] . Aggregation of preferences by the generalized row sum method. Mathematical Social Sciences, 27((3)):293–320
1994.Google Scholar
[155] . A class of graph-geodetic distances generalizing the shortest-path and the resistance distances. Discrete Applied Mathematics, 159((5)):295–302
2011.Google Scholar
[156] . The graph bottleneck identity. Advances in Applied Mathematics, 47(3):403–413, 2011.
[157] . Thewalk distances in graphs. Discrete AppliedMathematics, 160(10–11):1484–1500, 2012.Google Scholar
[158] . Studying new classes of graph metrics. In and , editors, Proceedings of the 1st International Conference on Geometric Science of Information (GSI '13), volume 8085 of Lecture Notes in Computer Science, pages 207–214. Springer, 2013.
[159] and . Forest matrices around the Laplacian matrix. Linear Algebra and Its Applications, 356:253–274, 2002.Google Scholar
[160] and . The matrix-forest theorem and measuring relations in small social groups. Automation and Remote Control, 58((9)):1505–1514
1997.Google Scholar
[161] and . Erratum of: On a duality between metrics and Σ-proximities. Automation and Remote Control, 59(10):1501, 1998.Google Scholar
[162] and . On a duality between metrics and Σ-proximities. Automation and Remote Control, 59((4)):608–612
1998.Google Scholar
[163] and . On proximity measures for graph vertices. Automation and Remote Control, 59((10)):1443–1459
1998.Google Scholar
[164] and . Preference fusion when the number of alternatives exceeds two: Indirect scoring procedures. Journal of the Franklin Institute, 336:205–226, 1999.Google Scholar
[165] . A lower bound for the smallest eigenvalue of the laplacian. In , editor, Problems in analysis: A symposium in honor of Salomon Bochner, pages 195–199. Princeton University Press, 1971.
[166] and . On different facets of regularization theory. Neural Computation, 14((12)):2791–2846
2002.Google Scholar
[168] , and . Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming, 73((2)):129–174
1996.Google Scholar
[169] , and . Extended latent class models for collaborative recommendation. IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 34:143–148, 2004.Google Scholar
[170] . Graph theory: An algorithmic approach. Academic Press, 1975.
[171] and . Spatial statistics and geostatistics. Sage, 2013.
[172] . A brief survey of PageRank algorithms. IEEE Transactions on Network Science and Engineering, 1((1)):38–42
2014.Google Scholar
[173] and . Discrete Green's functions. Journal of Combinatorial Theory, Series A, 91(1–2):191–214, 2000.Google Scholar
[174] . Spectral graph theory. American Mathematical Society, 1997.
[175] . Laplacians and the Cheeger inequality for directed graphs. Annals of Combinatorics, 9((1)):1–19
2005.Google Scholar
[176] , , and . Nonnegative matrix and tensor factorizations. Wiley, 2009.
[177] . Introduction to stochastic processes. Prentice Hall, 1975.
[178] , and . Finding community structure in very large networks.
Physical Review E, 70(6):066111, 2004.Google Scholar
[179] and . Learning to probabilistically identify authoritative documents. In Proceedings of the 17th International Conference on Machine Learning (ICML '00), pages 167–174, 2000.Google Scholar
[180] and . The missing link: A probabilistic model of document content and hypertext connectivity. In Advances in Neural Information Processing Systems 13: Proceedings of the NIPS '00 Conference, pages 430–436, 2001.Google Scholar
[181] and . Diffusion maps. Applied and Computational Harmonic Analysis, 21((1)):5–30
2006.Google Scholar
[182] , , , , , and .Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps. Proceedings of the National Academy of Sciences of the USA, 102((21)):7426–7431
2005.Google Scholar
[183] and . Latent class and latent transition analysis. Wiley, 2010.
[184] . Basic properties of the soft maximum. Unpublished manuscript available from www. johndcook.com/blog/2010/01/13/soft-maximum, 2011.
[185] , , and . Introduction to algorithms. 3rd ed. MIT Press, 2009.
[186] , and . A classification for community discovery methods in complex networks. Statistical Analysis and Data Mining, 4((5)):512–546
2011.Google Scholar
[187] and . Multidimensional scaling. 2nd ed. Chapman and Hall, 2001.
[188] . Statistics for spatial data, revised edition. Wiley, 1993.
[189] and . Graph spectra in computer science. Linear Algebra and its Applications, 434((6)):1545–1562
2011.Google Scholar
[191] .
An iterative image space reconstruction algorthm suitable for volume ECT
IEEE Transactions on Medical Imaging., 5((2)):61–66
1986.Google Scholar
[192] , and . A mixture model for random graphs. Statistics and Computing, 18((2)):173–183
2008.
[193] and . Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15((4)):301–331
1996.Google Scholar
[194] and . Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems. Journal of Machine Learning Research, 7:1409–1436, 2006.Google Scholar
[195] , and . Learning from general label constraints. In , , ,, and, editors, Proceedings of the Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition (SSPR-SPR '04), volume 3138 of Lecture Notes in Computer Science, pages 671–679. Springer, 2004.Google Scholar
[196] , and . On extreme values of Moran's I and Geary's c. Geographical Analysis, 16((1)):17–24
1984.Google Scholar
[197] and . Iterative filtering in reputation systems. SIAM Journal on Matrix Analysis and Applications, 31((4)):1812–1834
2010.Google Scholar
[198] . A modified expectation maximization algorithm for penalized likelihood estimation in emission tomography. IEEE Transactions on Medical Imaging, 14((1)):132–137
1994.Google Scholar
[199] . Logical and relational learning. Springer, 2008.
[200] , and . Influence of graph construction on semi-supervised learning. In Proceedings of the 2013 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD '13), volume III, pages 160–175, 2013.Google Scholar
[201] , , , and . Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41:391–407, 1990.Google Scholar
[202] . Reaching a consensus. Journal of the American Statistical Association, 69((345)):118–121
1974.Google Scholar
[203] , and . Efficient non-parametric function induction in semi-supervised learning. In Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics (AISTATS '05), pages 96–103, 2005.Google Scholar
[204] and . Collaborative filtering with interlaced generalized linear models. Neurocomputing, 71(7–9):1300–1310, 2008.Google Scholar
[205] and . Centrality measures and thermodynamic formalism for complex networks. Physical Review E, 83(4):046117, 2011.Google Scholar
[206] , and . Stability of graph communities across time scales. Proceedings of the National Academy of Sciences of the USA, 107((29)):12755–12760
2010.Google Scholar
[207] and . Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms, 2((4)):578–601
2006.Google Scholar
[208] , and . Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B (Methodological), 39((1)):1–38
1977.Google Scholar
[209] and . On the complexity of cooperative solution concepts. Mathematics of Operations Research, 19((2)):257–266
1994.Google Scholar
[210] . Estimation theory. Prentice Hall, 1965.
[211] , , , , and . Random walks based modularity: Application to semi-supervised learning. In Proceedings of the 23rd International World Wide Web Conference (WWW '14), pages 213–224, 2014.Google Scholar
[212] and . Encyclopedia of distances. 3rd ed. Springer, 2014.
[213] and . Geometry of cuts and metrics. Springer, 1997.
[214] , and . Kernel k-means, spectral clustering and normalized cuts. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '04), pages 551–556, 2004.Google Scholar
[215] , and . A unified view of kernel k-means, spectral clustering and graph cuts. UTCS Technical Report TR-04-25, Department of Computer Science, University of Texas at Austin, 2005.
[216] , and . Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(11):1944–1957, 2007.Google Scholar
[217] , and . Information-theoretic co-clustering. In Proceedings of the 9th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '03), pages 89–98, 2003.Google Scholar
[218] and . Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1/2):143–175, 2001.Google Scholar
[219] . Introductory econometrics. Springer, 1978.
[220] , , and .Algorithms for drawing graphs: An annotated bibliography. Computational Geometry, 4((5)):235–282
1994.Google Scholar
[221] , , and . Graph drawing. Prentice Hall, 1999.
[222] . Measures of the amount of ecologic association between species. Ecology, 26((3)):297–302
1945.Google Scholar
[223] . Graph theory. 4th ed. Springer, 2010.
[224] . A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.Google Scholar
[225] . Spectral clustering. Tutorial presented at the 16th European Conference on Machine Learning (ECML '05), 2005.
[226] , , and . A learning framework using Green's function and kernel regularization with application to recommender system. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pages 260–269, 2007.Google Scholar
[227] , and .Nonnegative matrix factorization for combinatorial optimization: Spectral clustering, graph matching, and clique finding. In Proceedings of the eighth IEEE International Conference on Data Mining (ICDM '08), pages 183–192, 2008.Google Scholar
[228] , , and. Nonnegative matrix factorization and probabilistic latent semantic indexing: Equivalence, chi-square statistic, and a hybrid method. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI '06), pages 342–347, 2006.Google Scholar
[229] , , , and . PageRank: HITS and a unified framework for link analysis. In Proceedings of the 3rd SIAM International Conference on Data Mining (SDM '03), pages 249–253, 2003.Google Scholar
[230] , and . On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM '05), pages 606–610, 2005.Google Scholar
[231] , , , and . A min-max cut algorithm for graph partitioning and data clustering. In Proceedings of the 1st IEEE International Conference on Data Mining (ICDM '01), pages 107–114, 2001.Google Scholar
[232] , , , and . Link analysis: Hubs and authorities on the World Wide Web. SIAM Review, 46((2)):256–268
2004.Google Scholar
[233] and . Networks and algorithms: An introductory approach. Wiley, 1993.
[234] . Prospects and challenges for multi-relational data mining. SIGKDD Explorations, 5((1)):80–83
2003.Google Scholar
[235] and . Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17((5)):420–425
1973.Google Scholar
[236] and . Introduction to electric circuits. 9th ed. Wiley, 2013.
[237] and . Kron reduction of graphs with applications to electrical networks. ArXiv preprint arXiv:1102.2950v1, pages 1–28, 2011.Google Scholar
[238] . The Kemeny constant of a Markov chain. Unpublished manuscript available at http://www.math.dartmouth.edu/?doyle, 2009.
[239] and . Random walks and electric networks. The Mathematical Association of America, 1984.
[240] , and . Spatial modelling: A comprehensive framework for principal coordinate analysis of neighbour matrices (PCNM). Ecological Modelling, 196(3–4):483–493, 2006.Google Scholar
[241] , and . Robust kernel fuzzy clustering. In and , editors, Proceedings of Fuzzy Systems and Knowledge Discovery (FSKD '05), volume 3613 of Lecture Notes in Artificial Intelligence, pages 454–461. Springer, 2005.
[242] and . Community detection in complex networks using extremal optimization. Physical Review E, 72(2):027104, 2005.Google Scholar
[243] and . Pattern classification and scene analysis. Wiley, 1973.
[244] , and . Pattern classification. 2nd ed. Wiley, 2001.
[245] . Data mining: Introductory and advanced topics. Prentice Hall, 2003.
[246] , , , and . Relevant subgraph extraction from random walks in a graph. Research report UCL/FSA/INGI RR 2006-07, INGI department, Université catholique de Louvain, Belgium, 2006.
[247] . New faster Kernighan-Lin-type graph-partitioning algorithms. In Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design (ICCAD '93), pages 370–377, 1993.Google Scholar
[249] and .The approximation of one matrix by another of lower rank. Psychometrika, 1((3)):211–218
1936.Google Scholar
[250] , and . Nonlocal discrete regularization on weighted graphs: A framework for image and manifold processing. IEEE Transactions on Image Processing, 17((7)):1047–1060
2008.Google Scholar
[251] , and . Functional annotation of genes in saccharomyces cerevisiae based on joint betweenness. arXiv preprint arXiv:0709.3291, 2007.Google Scholar
[252] , and . An efficient algorithm for large-scale detection of protein families. Nucleic Acids Research, 30((7)):1575–1584
2002.Google Scholar
[254] and . On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences, 5:17–61, 1960.Google Scholar
[255] . The structure of complex networks. Oxford University Press, 2012.
[256] and . Communicability in complex networks. Physical Review E, 77(3):036111, 2008.Google Scholar
[257] , and . Communicability betweenness in complex networks. Physica A: Statistical Mechanics and its Applications, 388((5)):764–774
2009.Google Scholar
[258] and . A first course in network theory. Oxford University Press, 2015.
[259] and . Subgraph centrality in complex networks. Physical Review E, 71(5):056103, 2005.Google Scholar
[260] . Solutio problematis ad geometriam situs pertinentis. Opera Omnia, 7:128–140, 1736.Google Scholar
[261] . Graph algorithms. Pitman, 1979.
[262] and . The centrality of groups and classes. The Journal of Mathematical Sociology, 23((3)):181–201
1999.Google Scholar
[263] and . The dual-projection approach for two-mode networks. Social Networks, 35((2)):204–210
2013.Google Scholar
[265] and . The analysis of proximity data. Arnold, 1997.
[266] . On a theorem of Weyl concerning eigenvalues of linear transformations I
Proceedings of the National Academy of Sciences of the USA., 35((11)):652–655
1949.Google Scholar
[267] . Using correspondence analysis for joint displays of affiliation networks. In , and , editors, Models and methods in social network analysis, pages 117–147. Cambridge University Press, 2005.
[268] , , and . Pathway discovery in metabolic networks by subgraph extraction. Bioinformatics, 26((9)):1211–1218
2010.Google Scholar
[269] , and . Multi-task averaging. In Advances in Neural Information Processing Systems 26: Proceedings of the NIPS '12 Conference, pages 1169–1177, 2012.Google Scholar
[270] , and . Revisiting Stein's paradox: Multi-task averaging. Journal of Machine Learning Research, 15:3441–3482, 2014.Google Scholar
[271] . Algebraic connectivity of graphs. CzechoslovakMathematical Journal, 23(2):298–305, 1975.Google Scholar
[272] .A property of eigenvectors of nonnegative symmetric matrices and Its applications to graph theory. Czechoslovak Mathematical Journal, 25((100)):619–633
1975.Google Scholar
[273] , , and . A survey of kernel and spectral methods for clustering. Pattern Recognition, 41:176–190, 2008.Google Scholar
[274] and . Nonnegative matrix factorization and i-divergence alternating minimization. Linear Algebra and Its Applications, 416(2–3):270–287, 2006.Google Scholar
[275] and . Amplifying the block matrix structure for spectral clustering. In Proceedings of the Annual Machine Learning Conference of Belgium and the Netherlands (Benelearn 2005), pages 21–28, 2005.Google Scholar
[276] . The precision of discriminant functions. Annals of Eugenics, 10:422–429, 1940.Google Scholar
[277] , and . Efficient identification of web communities. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '00), pages 150–160, 2000.Google Scholar
[279] and . Maximal flow trhough a network. Canadian Journal of Mathematics, 8:399–404, 1956.Google Scholar
[281] . Barthelemy. Resolution limit in community detection.
Proceedings of the National Academy of Sciences of the USA, 104((1)):36–41
2007.Google Scholar
[282] . Introduction to recommender systems. In , editor, Collaborative search and communities of interest: Trends in knowledge sharing and assessment, pages 21–37. IGI Global, 2011.Google Scholar
[283] , and . A probabilistic reputation model based on transaction ratings.
Information Sciences, 180((11)):2095–2123
2010.Google Scholar
[284] , , , and . An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Networks, 31:53–72, 2012.Google Scholar
[285] , , and . Random-walk computation of similarities between nodes of a graph, with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19((3)):355–369
2007.Google Scholar
[286] , and . Links between Kleinberg's hubs and authorities, correspondence analysis, and Markov chains. In Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM '03), pages 521–524, 2003.Google Scholar
[287] , and . Some relationships between Kleinberg's hubs and authorities, correspondence analysis, and the SALSA algorithm. In Proceedings of the 7th International Conference on the Statistical Analysis of Textual Data (JADT '04), pages 445–455, 2004.Google Scholar
[288] , , and . An experimental investigation of graph kernels on a collaborative recommendation task. In Proceedings of the 6th IEEE International Conference on Data Mining (ICDM '06), pages863–868, 2006.Google Scholar
[289] and . Information retrieval, data structure and algorithms. Prentice Hall, 1992.
[290] and . Two-way multidimensional scaling: A review. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 41((5)):644–661
2011.Google Scholar
[291] . PageRank: Standing on the shoulders of giants. Communications of the ACM, 54((6)):35–41
2011.Google Scholar
[292] , , , and . A bag-of-paths framework for network data analysis. ArXiv preprint arXiv:1302.6766, 2013.Google Scholar
[293] .Aset of measures of centrality based on betweenness. Sociometry, 40((1)):35–41
1977.Google Scholar
[294] . Centrality in social networks conceptual clarification. Social Networks, 1((3)):215–239
1978.
[295] , and . Centrality in valued graphs: A measure of betweenness based on network flow. Social Networks, 13((2)):141–154
1991.Google Scholar
[296] . Graphical models for machine learning and digital communication.MIT Press, 1998.
[297] and . Evaluation of the predictive performance of biased regression estimators. Journal of Forecasting, 4((2)):153–163
1985.Google Scholar
[298] and . Biased random walks in complex networks: the role of local navigation rules. Physical Review E, 80(1):016107, 2009.Google Scholar
[299] , , and . Higher order clustering coefficients in Bar'asi-Albert networks. Physica A: Statistical Mechanics and Its Applications, 316(1–4):688–694, 2002.Google Scholar
[300] and . Graph drawing by force-directed placement. Software Practice and Experience, 21((11)):1129–1164
1991.Google Scholar
[301] and . Spatial statistics and modeling. Springer, 2009.
[302] , and . A fast parametric maximum flow algorithm and applications. SIAM Journal on Computing, 18((1)):30–55
1989.Google Scholar
[303] , and
Data clustering: Theory, algorithms, and applications. Society for Industrial and Applied Mathematics, 2007.
[304] , and . A continuous-state version of discrete randomized shortest-paths. In Proceedings of the 50th IEEE International Conference on Decision and Control (CDC '11), pages 6570–6577, 2011.Google Scholar
[305] , and . Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237–267, 1976.Google Scholar
[306] . Kernels for structured data. World Scientific, 2008.
[307] .Goutte. Relation between PLSA andNMFand implications. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '05), pages 601–602, 2005.Google Scholar
[308] and . Normalized cuts are approximately inverse exit times. SIAM Journal on Matrix Analysis and Applications, 34((2)):757–772
2013.Google Scholar
[309] . The contiguity ratio and statistical mapping. The Incorporated Statistician, 5((3)):115–146
1954.Google Scholar
[310] , and . Relational link-based ranking. In Proceedings of the 30th International Conference on Very Large Databases (VLDB '04), pages 552–563, 2004.Google Scholar
[311] . On the citation influence methodology of Pinski and Narin. Information Processing and Management, 14((2)):93–95
1978.Google Scholar
[312] , , , , and . Bayesian data analysis. 3rd ed. Chapman and Hall, 2013.
[313] , and . Supervised nonlinear dimensionality reduction for visualization and classification. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 35((6)):1098–1107
2005.Google Scholar
[314] and , editors. Introduction to statistical relational learning. MIT Press, 2007.
[315] , and . Minimizing effective resistance of a graph. SIAM Review, 50((1)):37–66
2008.Google Scholar
[316] . Algorithmic graph theory. Cambridge University Press, 1985.
[318] , and . Practical optimization. Academic Press, 1982.
[319] and . Nonnegative factorization and the maximum edge biclique problem. ArXiv preprint arXiv:0810.4225, 2008.Google Scholar
[320] and . Using underapproximations for sparse nonnegative matrix factorization. Pattern Recognition, 43((4)):1676–1687
2010.Google Scholar
[321] . Mercer kernel-based clustering in feature space. IEEE Transactions on Neural Networks, 13((3)):780–784
2002.Google Scholar
[322] and . Journal impact measures in bibliometric research. Scientometrics, 53((2)):171–193
2002.Google Scholar
[323] , , and . Euclidean embedding of co-occurrence data.
Journal of Machine Learning Research, 8:2047–2076, 2007.Google Scholar
[324] , , . and
An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM Journal on Matrix Analysis and Applications, 11((4)):589–600
1990.Google Scholar
[325] and . Random walks on graphs. Stochastic Processes and Their Applications, 2:311–336, 1974.
[326] , and . Universal behavior of load distribution in scale-free networks. Physical Review Letters, 87(27):278701, 2001.Google Scholar
[327] , , , and . Classification of scale-free networks. Proceedings of the National Academy of Sciences of the USA, 99((20)):12583–12588
2002.Google Scholar
[328] . Finding a maximum density subgraph. Technical Report UCB/CSD-84-171, EECS Department, University of California at Berkeley, 1984.
[329] and . Continuum of all-pair shortest-path to all-path via random walk. Technical report TR 13-016, University of Minnesota, Department of Computer Science and Engineering, 2013.
[330] and . Matrix computations. 3rd ed. Johns Hopkins University Press, 1996.
[331] and . Graphs and algorithms. Wiley, 1984.
[332] and . Graphes et algorithmes. Collection EDF RD, 2009.
[334] and . Research paper recommender systems: A random-walk based approach. In Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI '06), pages 778–781, 2006.Google Scholar
[335] . Classification croisée. Thèse d'état, 1983.
[337] and . Clustering of contingency table and mixture model.
European Journal of Operational Research, 183((3)):1055–1066
2007.Google Scholar
[338] and . Biplots. Chapman and Hall, 1996.
[339] and . Metric and Euclidean properties of dissimilarities coefficients. Journal of Classification, 3:5–48, 1986.Google Scholar
[340] . Similarity, dissimilarity and distance, measures of. In , , , and , editors, Encyclopedia of statistical sciences. Wiley, 2004.
[341] . Random walks for image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28((11)):1768–1783
2006.Google Scholar
[342] and . Discrete calculus: Applied analysis on graphs for computational science. Springer, 2010.
[343] . Matrices with applications in statistics. Wadsworth International Group, 1983.
[344] . Penalized likelihood for general semi-parametric regression models. International Statistical Review, 55((3)):245–259
1987.Google Scholar
[345] and . Nonparametric regression and generalized linear models: A roughness penalty approach. Chapman and Hall, 1994.
[346] . Theory and applications of correspondence analysis. Academic Press, 1984.
[347] . Econometric analysis. 6th ed. Prentice Hall, 2008.
[348] and . Probability, an introduction. 2nd ed. Oxford University Press, 2014.
[349] and . Introduction to probability. 2nd ed. The Mathematical Association of America, 1997.
[350] . Sciandrone. On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Operations Research Letters, 26((3)):127–136
2000.Google Scholar
[351] . A least squares solution for paired comparisons with incomplete data. Psychometrika, 21((2)):125–134
1956.Google Scholar
[352] .Bavaud. Flow-based dissimilarities: shortest path, commute time, max-flowand free energy. In , S.Krolak-Schwerdt,and , editors, Data science, learning by latent structures, and knowledge discovery, volume 1564 of Studies in Classification, Data Analysis, and Knowledge Organization, pages 101–111. Springer, 2015.
[353] . Metric and ultrametric spaces of resistances. Discrete Applied Mathematics, 158((14)):1496–1505
2010.Google Scholar
[354] . Triangle inequality for resistances. Technical Report 20-2012, Rutgers Center for Operations Research, Rutcor Research Report, 2012.
[355] and . Metric and ultrametric spaces of resistances. Russian Mathematical Surveys, 42((6)):235–236
1987.Google Scholar
[356] and . A new spectral method for ratio cut partitioning and clustering. IEEE Transactions on Computer-Aided Design, 11((9)):1074–1085
1992.Google Scholar
[357] . Spatial data analysis. Cambridge University Press, 2003.
[358] .An r-dimensional quadratic placement algorithm. Management Science, 17((8)):219–229
1970.Google Scholar
[359] and . Fundamentals of physics. 8th ed. Wiley, 2007.
[360] . Account of the icosian calculus. Proceedings of the Royal Irish Academy, 6((7)):415–416
1856.Google Scholar
[362] , and
Model-based clustering for social networks. Journal of the Royal Statistical Society, Series A (Statistics in Society), 170((2)):301–354
2007.Google Scholar
[363] , and . Least squares data fitting with applications. Johns Hopkins University Press, 2013.
[364] . Graph theory. Addison-Wesley, 1969.
[365] and .Matrix measures for transitivity and balance. The Journal of Mathematical Sociology, 6((2)):199–210
1979.Google Scholar
[366] and . Applied multivariate statistical analysis. 3rd ed. Springer, 2012.
[367] . Regression modeling strategies. Springer, 2001.
[368] . The use of linear-modelmethodology to rate high school or college football teams. Journal of the American Statistical Association, 72((358)):278–289
1977.Google Scholar
[369] . Matrix algebra from a statistician's perspective. Springer, 1997.
[370] , and . From random walks to distances on unweighted graphs. ArXiv preprint arXiv:1509.03147, 2015.Google Scholar
[371] . Mathematical physics: A modern introduction to its foundations. 2nd ed. Springer, 2013.
[372] , and . The elements of statistical learning: Data mining, inference, and prediction. Springer, 2009.
[373] . Topic-sensitive PageRank. In Proceedings of the 11th InternationalWorldWide Web conference (WWW '02), pages 517–526, 2002.Google Scholar
[374] . Topic-sensitive PageRank: A context-sensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering, 15((4)):784–796
2003.Google Scholar
[375] and . Approximation by matrices positive semidefinite on a subspace.
Linear Algebra and Its Applications, 109((0)):115–130
1988.Google Scholar
[376] . Neural networks and learning machines. Pearson, 2009.
[377] . Laplacian regularized D-optimal design for active learning and its application to image retrieval. IEEE Transactions on Image Processing, 19((1)):254–263
2010.Google Scholar
[378] . A triangle inequality for p-resistance. In Proceedings of the NIPS '10 Workshop on Networks Across Disciplines: Theory and Applications, 2010.Google Scholar
[379] and . Predicting the labelling of a graph via minimum p-seminorm interpolation. In Proceedings of the 22nd Conference on Learning Theory (COLT '09), pages 18–21, 2009.Google Scholar
[380] , and . Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6((1)):24–43
2000.Google Scholar
[381] .Griego. Brownian motion and potential theory. ScientificAmerican, 220(3):67–74, 1969.Google Scholar
[382] . Computing a nearest symmetric positive semidefinite matrix. Linear Algebra and Its Applications, 103:103–118, 1988.Google Scholar
[383] . Correspondence analysis: A neglected multivariate method. Applied Statistics, 23((3)):340–354
1974.Google Scholar
[384] . Noun classification from predicate-argument structures. In Proceedings of the 28th Annual Meeting of Association for Computational Linguistics (ACL '90), pages 268–275, 1990.Google Scholar
[385] . A connection between correlation and contingency. Mathematical Proceedings of the Cambridge Philosophical Society, 31:520–524, 1935.Google Scholar
[386] and . On the pseudo-inverse of the Laplacian of a bipartite graph. Applied Mathematics Letters, 18((8)):917–922
2005.Google Scholar
[387] and .Non-negative matrix factorization with fixed row and column sums. Linear Algebra and Its Applications, 429(5-6):1020–1025, 2008.Google Scholar
[388] . Introduction to mathematical statistics. 5th ed. Wiley, 1984.
[389] and . Ridge regression: Biased estimation for nonorthogonal problems. Technometrics, 12((1)):55–67
1970.Google Scholar
[390] , and . Latent space approaches to social network analysis. Journal of the American Statistical Association, 97((460)):1090–1098
2002.Google Scholar
[391] . Probabilistic latent semantic analyis. In Proceedings of the 15th International Conference on Uncertainty in Artificial Intelligence (UAI '99), pages 289–296, 1999.Google Scholar
[392] . Probabilistic latent semantic indexing. In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '99), pages 50–57, 1999.Google Scholar
[393] . Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42(1–2):177–196, 2001.Google Scholar
[394] . Latent semantic models for collaborative filtering.
ACM Transactions on Information Systems, 22((1)):89–115
2004.Google Scholar
[395] and .Latent class models for collaborative filtering. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI '99), pages 688–693, 1999.Google Scholar
[396] , and . Learning from dyadic data. In Advances in Neural Information Processing Systems 11: Proceedings of the NIPS '98 Conference, pages 466–472, 1999.Google Scholar
[397] , and . Stochastic blockmodels: First steps. Social Networks, 5((2)):109–137
1983.Google Scholar
[398] . Multivariate data analysis: The French way. In and , editors, Probability and statistics: Essays in honor of David Freedman A., volume 2, pages 219–233. Institute of Mathematical Statistics, 2008.
[399] and . Stochastic local search: Foundations and applications. Morgan Kaufmann, 2004.
[400] and .Results on the bias and inconsistency of ordinary least squares for the linear probability model. Economics Letters, 90((3)):321–327
2006.Google Scholar
[401] and . Applied logistic regression. 2nd ed. Wiley, 2000.
[402] and . A comparison of methods for multiclass support vector machines. IEEE Transactions on Neural Networks, 13((2)):415–425
2002.Google Scholar
[403] . Efficient, high-quality force-directed graph drawing. The Mathematica Journal, 10((1)):37–71
2006.Google Scholar
[404] , and . Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Transactions on Information Systems, 22(1):116–142, 2004.Google Scholar
[405] . An input-output approach to clique identification. Sociometry, 28((4)):377–399
1965.Google Scholar
[406] . Mixing times with applications to perturbed Markov chains. Linear Algebra and Its Applications, 417((1)):108–123
2006.Google Scholar
[407] and . Optimization transfer using surrogate objective functions. Journal of Computational and Graphical Statistics, 9((1)):1–20
2000.Google Scholar
[409] and . LVQ clustering and SOM using a kernel function. In Proceedings of the IEEE International Conference on Fuzzy Systems (FUZZ-IEEE '04), pages 1497–1500, 2004.Google Scholar
[410] and . Markov chains theory and applications. Wiley, 1976.
[411] , and . Finding strong bridges and strong articulation points in linear time. Theoretical Computer Science, 447:74–84, 2012.Google Scholar
[412] , , and . Application of kernels to link analysis. In Proceedings of the 11th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '05), pages 586–592, 2005.Google Scholar
[413] . Modern multivariate statistical techniques. Springer, 2008.
[414] . Etude comparative de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Société Vaudoise des Sciences Naturelles, 37:547–579, 1901.Google Scholar
[415] . Social and economic networks. Princeton University Press, 2010.
[416] , and . Learning latent representations of nodes for classifying in heterogeneous social networks. In Proceedings of the 7th ACM international conference on web search and data mining (WSDM '14), pages 373–382, 2014.Google Scholar
[417] , , , and. Forceatlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLOS ONE, 9(6):e98679, 2014.Google Scholar
[418] and . Algorithms for clustering data. Prentice Hall, 1988.
[419] and . On the relationship between the algebraic connectivity and graph's robustness to node and link failures. In Proceedings of the 3rd IEEE Conference on Next Generation Internet Networks (EuroNGI '07), pages 96–102, 2007.Google Scholar
[421] . Mathematical taxonomy. Wiley, 1971.
[422] . Information theory and statistical mechanics. Physical Review, 106:620–630, 1957.Google Scholar
[423] and . B-matching for spectral clustering. In Proceedings of the 17th European Conference on Machine Learning (ECML '06), pages 679–686, 2006.Google Scholar
[424] , and . Graph construction and b-matching for semi-supervised learning. In Proceedings of the 26th International Conference on Machine Learning (ICML '09), pages 441–448, 2009.Google Scholar
[425] and . SimRank: A measure of structural-context similarity. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '02), pages 538–543, 2002.Google Scholar
[426] , and . Network-based auto-probit modeling for protein function prediction. Biometrics, 67(3):958–966
2011.Google Scholar
[427] . Transductive learning via spectral graph partitioning. In Proceedings of the 20th International Conference on Machine Learning (ICML '03), pages 290–297, 2003.Google Scholar
[428] . Applied multivariate data analysis, volume II: Categorical and multivariate methods. Springer, 1992.
[429] and . Applied multivariate statistical analysis. 6th ed. Prentice Hall, 2007.
[430] . Principal components analysis. 2nd ed. Springer, 2002.
[431] , , and . An introduction to variational methods for graphical models. Machine Learning, 37(2):183–233
1999.Google Scholar
[432] . Graphs, networks, and algorithms. 4th ed. Springer, 2013.
[433] and . An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7–15
1989.Google Scholar
[434] , , and . Hyperparameter and kernel learning for graph based semi-supervised classification. In Advances in Neural Information Processing Systems 18: Proceedings of the NIPS '05 Conference, pages 627–634, 2005.Google Scholar
[435] and . Entropy optimization principles with applications. Academic Press, 1992.
[436] . Statistical physics of particles. Cambridge University Press, 2007.
[437] and . Stochastic blockmodels and community structure in networks. Physical Review E, 83(1):016107, 2011.Google Scholar
[438] and . A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359–392
1998.Google Scholar
[439] , and . User position measures in social networks. In Proceedings of the 3rd Workshop on Social Network Mining and Analysis, pages 6:1–6:9, 2009.Google Scholar
[440] and . Inference and characterization of multi-attribute networks with application to computational biology. The Annals of Applied Statistics, 6(3):1068–1094
2012.Google Scholar
[441] , , and. Robust label propagation on multiple networks. IEEE Transactions on Neural Networks, 20(1):35–44
2009.Google Scholar
[442] . A new status index derived from sociometric analysis. Psychometrika, 18(1):39–43
1953.Google Scholar
[443] and . Finding groups in data: An introduction to cluster analysis. Wiley, 1990.
[444] and , editors. Drawing graphs. Springer, 2001.
[445] . The Perron-Frobenius theorem and the ranking of football teams. SIAM Review, 35(1):80–93
1993.Google Scholar
[446] . Reversibility and stochastic networks. Wiley, 1979.
[447] . Network routing. Philosophical Transactions: Physical Sciences and Engineering, 337(1647):343–367
1991.Google Scholar
[448] and . Finite Markov chains. Springer, 1976.
[449] , and . Denumerable Markov chains. Springer, 1976.
[450] and , editors. Graph algorithms in the language of linear algebra. Society for Industrial and Applied Mathematics, 2011.
[451] and . An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49(2):291–307
1970.Google Scholar
[452] . Bibliographic coupling between scientific papers. American Documentation, 14(1):10–25
1963.Google Scholar
[453] , , , , and . Automated detection of influential patents using singular values. IEEE Transactions on Automation Science and Engineering, 9(4):723–733
2012.Google Scholar
[454] , and . Fast projection-basedmethods for the least squares nonnegative matrix approximation problem. Statistical Analysis and Data Mining, 1(1):38–51
2008.Google Scholar
[455] , , and . Evaluation of the performance of clustering algorithms in kernel-induced feature space. Pattern Recognition, 38(4):607–611
2005.Google Scholar
[456] . Algebraic connectivity. In , editor, Handbook of linear algebra, pages 36:1–36:12. Chapman and Hall, 2007.Google Scholar
[457] , , and . Two betweenness centrality measures based on randomized shortest paths. Scientific Reports, 6:srep19668, 2016.Google Scholar
[458] , , , , , , and . A graph-based approach to skill extraction from text. Proceedings of the TextGraphs-8 EMNLP Workshop on Graph-Based Methods for Natural Language Processing, pages 79–87, 2013.Google Scholar
[459] , and . Developments in the theory of randomized shortest paths with a comparison of graph node distances. Physica A: Statistical Mechanics and its Applications, 393:600–616, 2014.Google Scholar
[460] . Centrality measure in graphs. Journal of Mathematical Chemistry, 47(4):1209–1223, 2010.Google Scholar
[461] and . Resistance distance. Journal of Mathematical Chemistry, 12(1):81–95, 1993.
[462] and . Logistic regression, a self-learning text. 2nd ed. Springer, 2002.
[463] . Authoritative sources in a hyperlinked environment. Journal of the Association for Computing Machinery, 46(5):604–632
1999.Google Scholar
[464] and . Graph drawing by classical multidimensional scaling: New perspectives. In and , editors, Graph drawing, volume 7704 of Lecture Notes in Computer Science, pages 55–66. Springer, 2013.
[465] , and . Probability, random processes and statistical analysis. Cambridge University Press, 2012.
[466] . Force-directed drawing algorithms. In , editor, Handbook of graph drawing and visualization, chapter 12. Chapman and Hall, 2013.
[467] , and . Group betweenness and co-betweenness: Interrelated notions of coalition centrality. Social Networks, 31(3):190–203
2009.Google Scholar
[468] and . Statistical analysis of network data with R. Springer Series in Statistics. Springer, 2014.
[469] . Statistical analysis of network data: Methods and models. Springer Series in Statistics. Springer, 2009.
[470] and . Diffusion kernels. In , and , editors, Kernel methods in computational biology, pages 171–191. MIT Press, 2004.
[471] and . Diffusion kernels on graphs and other discrete structures. In Proceedings of the 19th International Conference on Machine Learning (ICML '02), pages 315–322, 2002.Google Scholar
[472]
Theorie der endlichen und unendlichenGraphen. Akademische Verlagsgesellschaft, Leipzig, 1936.
[473] . On spectral graph drawing. In , and , editors, Proceedings of the 9th Annual International Conference on Computing and Combinatorics (COCOON'03), volume 2697 of LectureNotes in Computer Science, pages 496–508. Springer, 2003.
[474] . Drawing graphs by eigenvectors: Theory and practice. Computer and Mathematics with Applications, 49(11–12):1867–1888, 2005.Google Scholar
[475] . Factorization meets the neighborhood: A multifaceted collaborative filtering model. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '08), pages 426–434, 2008.Google Scholar
[476] , and . Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30–37
2009.Google Scholar
[477] , , , , and . Centrality indices. In Network analysis, pages 16–61. Springer, 2005.
[478] . Local density. In and , editors, Network analysis, volume 3418 of Lecture Notes in Computer Science, pages 112–142. Springer, 2005.
[479] . Advanced engineering mathematics. 10th ed. Wiley, 2004.
[480] and . Multidimensional scaling. Sage, 1978.
[481] . The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83–97, 1955.Google Scholar
[482] .Exploiting the structure of bipartite graphs for algebraic and spectral graph theory applications. Internet Mathematics, 11(3):201–321
2015.Google Scholar
[483] and . Learning spectral graph transformations for link prediction. In Proceedings of the 26th International Conference on Machine Learning (ICML '09), pages 561–568, 2009.
[484] . Kernel methods and machine learning. Cambridge University Press, 2014.
[485] and . Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(9):1393–1403
2006.Google Scholar
[486] , and . Random walks, Markov processes and the multiscale modular organization of complex networks. IEEE Transactions on Network Science and Engineering, 1(2):76–90
2014.Google Scholar
[487] , , , and . Learning the kernel matrix with semidefinite programming. The Journal of Machine Learning Research, 5:27–72, 2004.Google Scholar
[488] . Optimization. Springer, 2nd ed., 2013.
[489] , , , and . Algorithms, initializations, and convergence for the nonnegative matrix factorization. SAS Technical Report preprint available on ArXiv, 1407.7299, 2006.Google Scholar
[491] . and . A survey of eigenvector methods forWeb information retrieval. SIAM Review, 47:135–161, 2005.Google Scholar
[492] and . Google's PageRank and beyond: The science of search engine rankings. Princeton University Press, 2006.
[493] and . Who is number one? The science of rating and ranking. Princeton University Press, 2012.
[494] . Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical Computer Science, 407(1–3):458–473, 2008.Google Scholar
[495] , and . Basic notions for the analysis of large two-mode networks. Social Networks, 30(1):31–48
2008.Google Scholar
[496] , and . Variational Bayesian inference and complexity control for stochastic block models. Statistical Modelling, 12(1):93–115
2012.Google Scholar
[497] , , and . Information filtering via iterative refinement. Europhysics Letters, 75:1006–1012, 2006.Google Scholar
[498] . Random walk and the heat equation. American Mathematical Society, 2010.
[499] and . Random walk: A modern introduction. Cambridge University Press, 2010.
[500] and . Solving least squares problems. Prentice-Hall, 1974.
[501] . Linear algebra and its applications. 3rd ed. Addison-Wesley, 2003.
[502] and . Latent structure analysis. Houghton Mifflin, 1968.
[503] and . Ridge estimators in logistic regression. Journal of the Royal Statistical Society, Series C (Applied Statistics), 41(1):191–201
1992.
[504] . Contiguity analysis and classification. In, and , editors, Data Analysis, pages 233–243. Springer, 2000.
[505] , and . Statistique exploratoire multidimensionnelle. 4th ed. Dunod, 1995.
[506] , , and . Semi-supervised classification through the bag-of-paths group betweenness. IEEE Transactions on Neural Networks and Learning Systems, 25(6):1173–1186
2014.Google Scholar
[507] , and . Bag-of-paths absorption probabilities for semisupervised classification on graphs. Submitted for publication, 2015.Google Scholar
[508] , , and. A node criticality measure based on the bag-of-paths framework. Submitted for publication, 2015.Google Scholar
[509] and . Graph-based semi-supervised classification with information on the nodes. Submitted for publication, 2015.Google Scholar
[510] and . Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755):788–791
1999.
[511] and . Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems 13: Proceedings of the NIPS '00 Conference, pages 556–562, 2001.Google Scholar
[512] and . Nonlinear dimensionality reduction. Springer, 2007.
[513] . Bayesian statistics: An introduction. 4th ed. Wiley, 2012.
[514] , , and .Asurvey of algorithms for dense subgraph discovery. In and , editors, Managing and mining graph data, pages 303–336. Springer, 2010.
[515] and . Numerical ecology. 3rd ed. Elsevier, 2012.
[517] and . SALSA: The stochastic approach for link-structure analysis. ACM Transactions on Information Systems, 19(2):131–160
2001.Google Scholar
[518] . Probability, statistics and random processes for electrical engineering. 3rd ed. Pearson, 2008.
[519] and . Introduction to spatial econometrics. Chapman and Hall, 2009.
[520] and . Kemeny's constant and the random surfer. The American Mathematical Monthly, 109(8):741–745
2002.Google Scholar
[521] . Introduction to the design and analysis of algorithms. 3rd ed. Pearson, 2011.
[522] . Network science. Wiley, 2009.
[523] , and . Improvement of HITS-based algorithms on web documents. In Proceedings of the 11th international Conference on World Wide Web (WWW '02), pages 527–535, 2002.Google Scholar
[524] , and . Discovering protein complexes in dense reliable neighborhoods of protein interaction networks. Computational Systems Bioinformatics Conference, 6:157–168, 2007.Google Scholar
[525] , . Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry. In and , editors, Algorithms and models for the Web-graph, volume 6516 of Lecture Notes in Computer Science, pages 74–85. Springer, 2010.
[526] , . Random walks and Green's function on digraphs: A framework for estimating wireless transmission costs. IEEE/ACM Transactions on Networking, 21(1):135–148, 2013.Google Scholar
[527] , and . The routing continuum from shortest-path to all-path: A unifying theory. In Proceedings of the 31st International Conference on DistributedComputing Systems (ICDCS '11), pages 847–856, 2011.Google Scholar
[528] , and . From shortest-path to all-path: The routing continuum theory and its applications. IEEE Transactions on Parallel and Distributed Systems, 25(7):1745–1755
2013.Google Scholar
[529] and . The link-prediction problem for social networks. Journal of the American Society for Information Science and Technology, 58(7):1019–1031
2007.Google Scholar
[530] . UCI machine learning repository, 2013.
[531] . Measures of association. Sage, 1983.
[532] . Seriation and matrix reordering methods: An historical overview. Statistical Analysis and Data Mining, 3(2):70–91
2010.Google Scholar
[533] . Visual complexity: Mapping patterns of information. Princeton Architectural Press, 2011.
[534] . Projected gradient methods for nonnegative matrix factorization. Neural Computation, 19(10):2756–2779
2007.Google Scholar
[535] . An information-theoretic definition of similarity. In Proceedings of the 15th International Conference on Machine Learning (ICML '98), pages 296–304, 1998.Google Scholar
[536] . Foundations of social research. McGraw-Hill, 1976.
[538] and . Spectral clustering. In and , editors, Data clustering: Algorithms and applications, pages 177–199. CRC Press, 2014.Google Scholar
[539] , and . Large graph construction for scalable semi-supervised learning. In Proceedings of the 27th International Conference on Machine Learning (ICML '10), pages 679–686, 2010.Google Scholar
[540] , and . Similarity index based on local paths for link prediction of complex networks. Physical Review E, 80(4):046122, 2009.Google Scholar
[541] and . Link prediction in complex networks: A survey. Physica A: Statistical Mechanics and Its Applications, 390:1150–1170, 2011.Google Scholar
[542] and . Link-based classification. In Proceedings of the 20th International Conference on Machine Learning (ICML '03), pages 496–503, 2001.Google Scholar
[543] and . A method of matrix analysis of group structure. Psychometrika, 14(2):95–116
1949.Google Scholar
[544] . Introduction to dynamic systems: Theory, models, and applications.Wiley, 1979.
[545] and . Linear and nonlinear programming. 3rd ed. Springer, 2010.
[546] and . Large-scale graph visualization and analytics. IEEE Computer, 46(7):39–46
2013.Google Scholar
[547] and . The kernel self-organising map. In Proceedings of the 4th International Conference on Knowledge-Based Intelligent Engineering Systems and Allied Technologies, volume 1, pages 317–320, 2000.Google Scholar
[548] and . Classification in networked data: A toolkit and a univariate case study. Journal of Machine Learning Research, 8:935–983, 2007.Google Scholar
[549] and . Biclustering algorithms for biological data analysis: A survey. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1):24–45
2004.Google Scholar
[550] , and . Optimal construction of k-nearest-neighbor graphs for identifying noisy clusters. Theoretical Computer Science, 410(19):1749–1764
2009.Google Scholar
[551] and . Clustering and community detection in directed networks: A survey. Physics Reports, 533(4):95–142
2013.Google Scholar
[552] , and . Introduction to information retrieval. Cambridge University Press, 2008.
[553] . Novel measures on directed graphs and applications to large-scale withinnetwork classification. PhD thesis, Université Libre de Bruxelles, Brussels, 2010.
[554] , , , , and . Semisupervised classification and betweenness computation on large, sparse, directed graphs. Pattern Recognition, 44(6):1212–1224
2011.Google Scholar
[555] , , , , , and. The sum-over-paths covariance kernel: A novel covariance between nodes of a directed graph. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(6):1112–1126
2010.Google Scholar
[556] . On the location of supply points to minimize transportation costs. IBM Systems Journal, 2:129–135, 1963.Google Scholar
[557] . Block seriation problems: A unified approach. Applied Stochastic Models and Data Analysis, 3(2):73–91
1987.Google Scholar
[558] . Seriation problems: An overview. Applied Stochastic Models and Data Analysis, 7(2):139–151
1991.
[559] . Some properties of classical multidimensional scaling. Communications in Statistics: Theory and Methods, 7(13):1233–1241
1978.Google Scholar
[560] , and . Multivariate analysis. Academic Press, 1979.
[562] . Statistical models applied to the rating of sports teams. Bachelor's thesis, Bluefield College, 1997.
[563] . The best Euclidian fit to a given distance matrix in prescribed dimensions. Linear Algebra and Its Applications, 67:1–6, 1985.Google Scholar
[565] , and . Problem decomposition and data reorganization by a clustering technique. Operations Research, 20(5):993–1009
1972.Google Scholar
[566] and . Generalized linear models. Chapman and Hall, 1989.
[567] and . Generalized, linear, and mixed models. 2nd ed. Wiley, 2008.
[568] and . Mixture models: Inference and applications to clustering. Statistics: Textbooks and Monographs. Marcel Dekker, 1988.
[569] and . The EM algorithm and extensions. 2nd ed. Wiley, 2008.
[570] . Comparing clusterings–an information based distance. Journal of Multivariate Analysis, 98:873–895, 2007.Google Scholar
[571] and . A random walks view of spectral segmentation. In Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics (AISTATS '01), 2001.Google Scholar
[572] , and . Opérateurs de voisinage et analyse des données spatiotemporelles. In and , editors, Biométrie et environnement, pages 45–72. Masson, 1993.Google Scholar
[573] .Stochastic complementation, uncouplingMarkov chains, and the theory of nearly reducible systems. SIAM Review, 31(2):240–272
1989.Google Scholar
[574] . Matrix analysis and applied linear algebra. Society for Industrial and Applied Mathematics, 2000.
[575] . Maximum likelihood estimation and inference. Wiley, 2011.
[576] and . An examination of procedures for determining the number of clusters in a data set. Psychometrika, 50(2):159–179
1985.Google Scholar
[577] . The Laplacian spectrum of graphs. In , , and , editors, Graph theory, combinatorics, and applications, volume 2, pages 871–898. Wiley, 1991.
[578] . Laplace eigenvalues of graphs—a survey. Discrete Mathematics, 109:171–183, 1992.Google Scholar
[579] , and . Foundations of machine learning. MIT Press, 2012.
[580] , and . Introduction to linear regression analysis.Wiley, 4th ed., 2006.
[581] . Stirling. Mathematical methods and algorithms for signal processing. Prentice Hall, 2000.
[582] . The expectation-maximization algorithm. IEEE Signal Processing Magazine, 13(6):47–60
1996.Google Scholar
[583] and . Metric transformation of an (m + 1) terminal resistive network into a hyper acute angled simplex PM in Euclidean space EM. In Proceedings of the 11th IEEE Midwest Symposium on Circuit Theory, pages 184–192, 1968.
[585] . Newmethod for the assignment of psychometric scale values from incomplete paired comparisons. Journal of the Optical Society of America, 45(5):373–378
1955.Google Scholar
[586] . Remarks on the method of paired comparisons: The least squares solution assuming equal standard deviations and equal correlations I.. Psychometrika, 16(1):3–9
1951.Google Scholar
[587] and . Maxima for graphs and a new proof of a theorem of Turán. Canadian Journal of Mathematics, 17(4):533–540
1965.Google Scholar
[588] .. From indefinite to positive semi-definite matrices. In , , , , and , editors, Proceedings of the Joint IAPR International Workshops on Structural, Syntactic, and Statistical Pattern Recognition (SSPR-SPR '06), volume 4109 of Lecture Notes in Computer Science, pages 764–772. Springer, 2006.
[589] . Machine learning: A probabilistic perspective. MIT Press, 2012.
[590] . Classical and modern regression with applications. PWS-KENT, 1990.
[591] and . Fundamental limitations of spectral clustering. In Advances in Neural Information Processing Systems 19: Proceedings of the NIPS '06 Conference, pages 1017–1024, 2007.Google Scholar
[592] , , and . Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators. In Advances in Neural Information Processing Systems 18: Proceedings of the NIPS '05 Conference, pages 955–962, 2006.Google Scholar
[593] , , and . Diffusion maps, spectral clustering and reaction coordinate of dynamical systems. Applied and Computational Harmonic Analysis, 21:113–127, 2006.Google Scholar
[594] , and . Statistical analysis of semi-supervised learning: The limit of infinite unlabelled data. In Advances in Neural Information Processing Systems 22: Proceedings of the NIPS '09 Conference, pages 1330–1338, 2009.Google Scholar
[595] and . A shapley value-based approach to discover influential nodes in social networks. IEEE Transactions on Automation Science and Engineering, 8(1):130–147
2011.Google Scholar
[596] and . Spectral methods for graph clustering–a survey. European Journal of Operational Research, 211(2):221–231
2011.Google Scholar
[597] and . A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning in graphical models, pages 355–368. Springer, 1998.
[598] , , and . Coincidingwalk kernels: parallel absorbing random walks for learning with graphs and few labels. In Proceedings of the asian Conference on Machine Learning (ACML-13, JMLR WCP 29), pages 357–372, 2013.Google Scholar
[599] and . Leveraging relational autocorrelation with latent group models. In Proceedings of the 4th International Workshop on Multi-Relational Data Mining (MRDM '05), pages 49–55, 2005.Google Scholar
[600] . Clustering and preferential attachment in growing networks. Physical Review E, 64(2):025102, 2001.Google Scholar
[601] . Scientific collaboration networks. II Shortest paths, weighted networks, and centrality. Physical Review E, 64(1):016132, 2001.Google Scholar
[602] . The structure and function of complex networks. SIAM Review, 45(2):167–256, 2003.Google Scholar
[604] . A measure of betweenness centrality based on random walks. Social Networks, 27(1):39–54
2005.Google Scholar
[605] . Erratum: Scientific collaboration networks. II Shortest paths, weighted networks, and centrality [phys. rev. e 64, 016132 (2001)].
Physical Review E, 73(3):039906, 2006.Google Scholar
[606] . Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3):036104, 2006.
[607] . Modularity and community structure in networks. Proceedings of the National Academy of Sciences of the USA, 103:8577–8582, 2006.Google Scholar
[608] . Networks: An introduction. Oxford University Press, 2010.
[609] . Spectral methods for community detection and graph partitioning. Physical Review E, 88(4):042822, 2013.Google Scholar
[610] and . Finding and evaluating community structure in networks. Physical Review E, 69(2):026113, 2004.Google Scholar
[611] , and . On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14: Proceedings of the NIPS '01 Conference, pages 849–856, 2002.Google Scholar
[612] , , and . Link analysis, eigenvectors and stability. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI '01), pages 903–910, 2001.Google Scholar
[613] , and . Stable algorithms for link analysis. In Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '01), pages 258–266, 2001.Google Scholar
[614] , , and . Improved MinMax cut graph clustering with nonnegative relaxation. In Proceedings of the 2010 European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD '10), pages 451–466, 2010.Google Scholar
[615] . Application d'outils de la théorie des graphes à l'analyse du réseau commercial mondial. Master's thesis, Applied mathematics engineering at the Université catholique de Louvain, 2013.
[616] , and . Word sense disambiguation using label propagation based semi-supervised learning. In Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL '05), pages 395–402, 2005.Google Scholar
[617] and . Feature extraction and image processing. 3rd ed. Academic Press, 2012.
[618] . Energy models for graph clustering. Journal of Graph Algorithms and Applications, 11(2):453–480
2007.
[619] . Modularity clustering is force-directed layout. Physical Review E, 79(2):026102, 2009.Google Scholar
[620] and . Multi-level algorithms for modularity clustering. In , editor, Proceedings of the International Symposium on Experimental Algorithms (SEA '09), volume 5526 of Lecture Notes in Computer Science, pages 257–268. Springer, 2009.
[621] and . 3rd ed. Applied linear algebra. Prentice Hall, 1988.
[622] and . 2nd ed. Numerical optimization. Springer, 2006.
[623] . Markov chains. Cambridge University Press, 1997.
[624] , and . Deciding on the number of classes in latent class analysis and growth mixture modeling: A Monte-Carlo simulation study. Structural Equation Modeling, 14(4):535–569
2007.Google Scholar
[625] and . Applied linear algebra. Pearson, 2006.
[626] , , and . Using the mutual k-nearest neighbor graphs for semi-supervised classification of natural language data. In Proceedings of the 15th Conference on Computational Natural Language Learning (CoNLL '11), pages 154–162, 2011.Google Scholar
[627] and . Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, 5(2):111–126
1994.Google Scholar
[628] , , and . The PageRank citation ranking: Bringing order to the web. Technical report 1999-66, Computer Science Department, Stanford InfoLab, Stanford University, USA, 1998.
[629] and . The measurement of intellectual influence. Econometrica, 72(3):963–977
2004.Google Scholar
[630] , , and . Automatic multimedia cross-modal correlation discovery. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '04), pages 653–658, 2004.Google Scholar
[631] , , and . Community detection in social media. Data Mining and Knowledge Discovery, 24(3):515–554
2012.Google Scholar
[632] and . Probability, random variables and stochastic processes. 4th ed. McGraw-Hill, 2002.
[633] and . The maximum clique problem.
Journal of Global Optimization, 4(3):301–328
1994.Google Scholar
[634] and . Network clustering. In and , editors, Data clustering: Algorithms and applications, pages 415–456. CRC Press, 2014.
[635] , and . Community detection in social networks. In , editor, Social network data analytics, pages 79–113. Springer, 2011.
[636] . Stochastic processes. Holden-Day, 1962.
[637] . In all likelihood: Statistical modelling and inference using likelihood. Oxford University Press, 2001.
[638] and . The dissimilarity representation for pattern recognition. World Scientific, 2005.
[639] . Relaxation labeling networks for the maximum clique problem. Journal of Artificial Neural Networks, 2(4):313–328
1995.Google Scholar
[640] . Statistical mechanics in a nutshell. Princeton University Press, 2011.
[641] , and . Distributional clustering of English words. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (ACL '93), pages 183–190, 1993.
[642] . Die Theorie der regularen Graphen. Acta Mathematica, 15:193–220, 1891.
[643] , , , , and . Spatial analysis in epidemiology. Oxford University Press, 2008.
[644] , , and . Network-based prediction for sources of transcriptional dysregulation using latent pathway identification analysis. Proceedings of the National Academy of Sciences of the USA, 108(32):13347–13352
2011.Google Scholar
[645] and . Citation influence for journal aggregates of scientific publications: Theory, with application to the literature of physics. Information Processing and Management, 12(5):297–312
1976.Google Scholar
[646] and . The mathematics of learning: Dealing with data. Notices of the American Mathematical Society, 50(5):537–544
2003.Google Scholar
[647] and . Computing communities in large networks using random walks. In , , and , editors, Proceedings of the 20th International Symposium on Computer and Information Sciences (ISCIS '05), volume 3733 of Lecture Notes in Computer Science, pages 284–293. Springer, 2005.
[648] and . Computing communities in large networks using random walks. Journal of Graph Algorithms and Applications, 10(2):191–218
2006.Google Scholar
[649] , and . Communities in networks. Notices of the American Mathematical Society, 56(9):1082–1097
2009.
[650] , , and . Numerical recipes: The art of scientific computing. 3rd ed. Cambridge University Press, 2007.
[651] , , and . Overlapping community detection using Bayesian non-negative matrix factorization. Physical Review E, 83(6):066114, 2011.Google Scholar
[652] , and . A random-walk based scoring algorithm applied to recommender engines. In Proceedings of the ACM SIGKDD Workshop on Web Mining and Web Usage Analysis (WebKDD '06), pages 127–146, 2006.Google Scholar
[653] and . Clustering and embedding using commute times. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(11):1873–1890
2007.Google Scholar
[654] , and . Hubs in space: Popular nearest neighbors in high-dimensional data. Journal of Machine Learning Research, 11:2487–2531, 2010.Google Scholar
[655] , and . On the existence of obstinate results in vector space models. In Proceedings of the 33rd Annual International ACMSIGIR Conference on Research and Development in Information Retrieval (SIGIR '10), pages 186–193, 2010.Google Scholar
[656] , and . Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3):036106, 2007.Google Scholar
[657] and . On random eccentricity in complex networks. Technical report, Department of Computer Science, University of Minnesota, USA, 2010.
[658] and . Geometry of complex networks and structural centrality. Technical report, Department of Computer Science, University of Minnesota, 2011. Preprint available on ArXiv as arXiv:1107.0989.
[659] , and . Incremental computation of pseudo-inverse of Laplacian: Theory and applications. Technical report, Department of Computer Science, University of Minnesota, 2013. Preprint available on ArXiv as arXiv:1304.2300.
[660] and . Geometry of complex networks and topological centrality. Physica A: Statistical Mechanics and Its Applications, 392(17):3833–3845
2013.Google Scholar
[661] and . Generalized inverse of matrices and its applications. Wiley, 1971.
[662] . Optimization in operations research. Prentice Hall, 1998.
[663] , , , and . Hierarchical organization of modularity in metabolic networks. Science, 297(5586):1551–1555
2002.
[664] and . Statistical mechanics of community detection. Physical Review E, 74:016110, 2006.Google Scholar
[665] . A modern course in statistical physics. 2nd ed. Wiley, 1998.
[666] . Using information content to evaluate semantic similarity in a taxonomy. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI '95), pages 448–453, 1995.Google Scholar
[667] , , , and . Discrete Laplace-Beltrami operators for shape analysis and segmentation. Computers and Graphics, 33(3):381–390
2009.Google Scholar
[668] and . The intelligent surfer: Probabilistic combination of link and content information in PageRank. In Advances in Neural Information Processing Systems 14: Proceedings of the NIPS '01 Conference, pages 1441–1448, 2002.Google Scholar
[669] and . In defense of one-vs-all classification. Journal of Machine Learning Research, 5:101–141, 2004.Google Scholar
[670] . Correspondence analysis of two-mode network data. SocialNetworks, 22(1):65–72, 2000.Google Scholar
[671] . Complex graph algorithms. In , and , editors, Graph algorithms in the language of linear algebra, chapter 6, pages 59–84. Society for Industrial and Applied Mathematics, 2011.Google Scholar
[672] . Discrete mathematics and its applications. 7th ed. McGraw-Hill, 2011.
[673] . Stochastic processes. 2nd ed. Wiley, 1996.
[674] . Introduction to probability models. 10th ed. Academic Press, 2010.
[675] and . Optimizing an organized modularity measure for topographic graph clustering: A deterministic annealing approach. Neurocomputing, 73(7–9):1142–1163, 2010.Google Scholar
[676] and . A continuous characterization of maximal cliques in k-uniform hypergraphs. In , and , editors, Learning and intelligent optimization, volume 5313 of Lecture Notes in Computer Science, pages 220–233. Springer, 2008.
[677] . Probabilistic discriminative kernel classifiers for multi-class problems. In and , editors, Pattern recognition: Proceedings of the 23rd DAGM Symposium, volume 2191 of Lecture Notes in Computer Science, pages 246–253. Springer, 2001.
[678] . Network meta-analysis, electrical networks and graph theory. Research Synthesis Methods, 3(4):312–324
2012.Google Scholar
[679] , and . Semiparametric regression. Cambridge University Press, 2003.
[681] , , and . Randomized shortest-path problems: Two related models. Neural Computation, 21(8):2363–2404
2009.Google Scholar
[682] , , and . The principal components analysis of a graph, and its relationships to spectral clustering. In , , and , editors, Proceedings of the 15th European Conference on Machine Learning (ECML '04), volume 3201 of Lecture Notes in Artificial Intelligence, pages 371–383. Springer, 2004.Google Scholar
[683] . Les réseaux (ou graphes), volume 18 of Mémorial des Sciences Mathématiques. Gauthier-Villars, Paris, France, 1926.
[684] , and . The k-dense method to extract communities from complex networks. In , , and , editors, Mining complex data, pages 243–257. Springer, 2009.
[685] and . Introduction to modern information retrieval.McGraw-Hill, 1983.
[686] and . Determining the number of clusters/segments in hierarchical clustering/ segmentation algorithms. In Proceedings of the IEEE International Conference on Tools with Artificial Intelligence (ICTAI '04), pages 401–409, 2004.
[687] .Anonlinearmapping for data structure analysis. IEEE Transactions on Computers, C-18(5):401–409, 1969.
[688] and . Similarity measures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9):871–883
1999.Google Scholar
[689] . Probabilités, analyse des données et statistique. 2nd ed. Editions Technip, 2006.
[690] , , , , and . Generalizations of the clustering coefficient to weighted complex networks. Physical Review E, 75(2):027105, 2007.Google Scholar
[691] and . Random walks in social networks and their applications: A survey. In , editor, Social network data analytics, pages 43–77. Springer, 2011.
[692] and . Dynamic social network analysis using latent space models. SIGKDD Explorations, 7(2):31–40
2005.Google Scholar
[693] and . Scalable graph clustering using stochastic flows: Applications to community discovery. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pages 737–746, 2009.Google Scholar
[694] , and . Markov clustering of protein interaction networks with improved balance and scalability. In Proceedings of the 1st ACMInternational Conference on Bioinformatics and Computational Biology (BCB '10), pages 247–256, 2010.Google Scholar
[695] , and . Ridge regression learning algorithm in dual variables. In Proceedings of the 15th International Conference on Machine Learning (ICML '98), pages 515–521, 1998.Google Scholar
[697] . An analysis of variance for paired comparisons. Journal of the American Statistical Association, 47(259):381–400
1952.Google Scholar
[698] and . Learning with kernels. MIT Press, 2002.
[699] , and . Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 5(10):1299–1319
1998.Google Scholar
[700] . Matrix analysis for statistics. 2nd ed. Wiley, 2005.
[701] . Statistical thermodynamics. 2nd ed. Cambridge University Press, 1952.
[702] . Linear models. Wiley, 1971.
[703] . Matrix algebra useful for statistics. Wiley, 1982.
[704] and . Partitioning networks by eigenvectors. In Proceedings of the International Conference on Social Networks, volume 1: Methodology, pages 47–58, 1995.Google Scholar
[705] . A matrix handbook for statisticians. Wiley, 2008.
[706] . Algorithms in C, parts 1–5. 3rd ed. Addison-Wesley, 1998.
[707] . The net of reciprocal influence:Aproblem in treating sociometric data. TheCanadian Journal of Psychology, 4(3):234–240
1949.Google Scholar
[709] and . A graph theoretic generalization of the clique concept. Journal of Mathematical Sociology, 6:139–154, 1978.Google Scholar
[710] and . Automatic discovery of similar words. In , editor, Survey of text mining, pages 25–43. Springer, 2004.Google Scholar
[711] . Measures on graphs: From similarity to density. PhD thesis, Université catholique de Louvain, Louvain-la-Neuve, Belgium, 2013.
[712] , , , , and . The sumover- forests density index: Identifying dense regions in a graph. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(6):1268–1274
2014.Google Scholar
[713] , and . The sum-over-forests clustering. In Proceedings of the European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN '14), pages 565–570, 2014.Google Scholar
[714] . Matrices, theory and applications. Springer, 2002.
[715] , , and . Document clustering using nonnegative matrix factorization. Information Processing and Management, 42(2):373–386
2006.Google Scholar
[716] . Graph-theoretic interpretation of the generalized row sum method. Mathematical Social Sciences, 27(3):321–333
1994.Google Scholar
[717] . Solution of the (m + 1) terminal resistive network problem by means of metric geometry. In Proceedings of the first Asilomar Conference on Circuits and Systems, pages 319–328, 1967.Google Scholar
[718] . On the (m + 1)-terminal resistive-network problem. Proceedings of the Institution of Electrical Engineers, 116(4):503–509
1969.Google Scholar
[719] and .Kernel methods for pattern analysis.Cambridge University Press, 2004.
[720] , , and . Lazy random walks for superpixel segmentation. IEEE Transactions on Image Processing, 23(4):1451–1462
2014.Google Scholar
[721] and . Normalised cuts and image segmentation. IEEE Transactions on Pattern Matching and Machine Intelligence, 22(8):888–905
2000.Google Scholar
[722] and . Nonparametric statistics for the behavioral sciences. 2nd ed. McGraw-Hill, 1988.
[723] . Maximum penalized likelihood estimation. In , , , and , editors, Encyclopedia of statistical sciences, pages 4640–4643. Wiley, 2004.
[724] , and . The geometric basis of semi-supervised learning. In Semi-supervised learning, pages 217–235. MIT Press, 2006.
[725] , and . Beyond the point cloud: From transductive to semisupervised learning. In Proceedings of the 22nd International Conference on Machine Learning (ICML '05), pages 824–831, 2005.Google Scholar
[726] . Co-citation in the scientific literature: A new measure of the relationship between two documents. Journal of the American Society for Information Science, 24(4):265–269
1973.Google Scholar
[727] . Analyse et évaluation de nouvelles approches de filtrage collaboratif. Master's thesis, Mémoire présenté en vue de l'obtention du grade d'ingénieur civil en informatique, Université catholique de Louvain, INGI/ISYS, Louvain-la-Neuve, Belgium, 2005.
[728] and . Kernels and regularization on graphs. In and , editors, Learning theory and kernel machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, Proceedings (COLT-Kernel '03), volume 2777 of Lecture Notes in Artificial Intelligence, pages 144–158. Springer, 2003.
[729] and . Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification, 14(1):75–100
1997.Google Scholar
[730] . A method of establishing groups of equal amplitude in plant sociology based on similarity of species content and its application to analyses of the vegetation on Danish commons. Kongelige Danske Videnskabernes Selskabs Skrifter, 5:341–354, 1948.Google Scholar
[731] . Course on spectral graph theory; lecture 8: Effective resistance. http://www.cs.yale.edu/homes/spielman/561/lect08-12.pdf, 2012.
[732] and . Spectral partitioning works: Planar graphs and finite element meshes. Linear Algebra and Its Applications, 421(2–3):284–305, 2007.Google Scholar
[733] . Stochastic calculus and financial application. Springer, 2001.
[734] . Football and basketball predictions using least squares. IEEE Transactions on Systems, Man and Cybernetics, 7(2):117–121
1977.Google Scholar
[735] . Improved least squares football, basketball, and soccer predictions. IEEE Transactions on Systems, Man and Cybernetics, 10(2):116–123
1980.Google Scholar
[736] . K-means clustering: A half-century synthesis. British Journal of Mathematical and Statistical Psychology, 59(1):1–34
2006.Google Scholar
[737] and . Rethinking centrality: Methods and examples. Social Networks, 11(1):1–37
1989.Google Scholar
[738] . Introduction to the numerical solution of Markov chains. Princeton University Press, 1994.
[739] and . Introduction to numerical analysis. 3rd ed. Springer, 2002.
[740] and . Cyclic minimizers, majorization techniques, and the expectationmaximization algorithm: A refresher. IEEE Signal Processing Magazine, 21(1):112–114
2004.Google Scholar
[741] . Introduction to applied mathematics. Wellesley-Cambridge Press, 1986.
[742] , , and . A consistent adjacency spectral embedding for stochastic blockmodel graphs. Journal of the American Statistical Association, 107(499):1119–1128
2012.Google Scholar
[743] and . Least squares support vector machine classifiers. Neural Processing Letters, 9(3):293–300
1999.Google Scholar
[744] , , , , and. Investigating the effectiveness of Laplacian-based kernels in hub reduction. In Proceedings of the 26th AAAI Conference on Artificial Intelligence (AAAI '12), pages 1112–1118, 2012.Google Scholar
[746] and . Information regularization with partially labeled data. In Advances in Neural Information Processing Systems 15: Proceedings of the NIPS '02 Conference, pages 1025–1032, 2003.Google Scholar
[747] and . A one-parameter family of distributed consensus algorithms with boundary: From shortest paths to mean hitting times. In Proceedings of the IEEE Conference on Decision and Control (CDC '06), pages 4664–4669, 2006.Google Scholar
[748] , editor. Handbook of graph drawing and visualization. CRC Press, 2013.
[749] and . Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '09), pages 817–826, 2009.Google Scholar
[750] and . Scalable learning of collective behavior based on sparse social dimensions. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM '09), pages 1107–1116, 2009.Google Scholar
[751] and . Community detection and mining in social media. Morgan and Claypool, 2010.
[752] and . Toward predicting collective behavior via social dimension extraction. IEEE Intelligent Systems, 25(4):19–25
2010.Google Scholar
[753] . Depth first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146–160
1972.Google Scholar
[754] . Data structures and network algorithms. Society for Industrial and Applied Mathematics, 1984.
[755] and . An introduction to stochastic modeling. 3rd ed. Academic Press, 1998.
[756] . Allele-frequency change in a class-structured population. The American Naturalist, 135(1):95–106
1990.Google Scholar
[757] . Inclusive fitness arguments in genetic models of behaviour. Journal of Mathematical Biology, 34(5–6):654–674, 1996.Google Scholar
[758] and . An analysis and synthesis of multiple correspondence analysis, optimal scaling, dual scaling, homogeneity analysis and other methods for quantifying categorical multivariate data. Psychometrika, 50(1):91–119
1985.Google Scholar
[759] . Random walks and the effective resistance of networks. Journal of Theoretical Probability, 4:101–109, 1991.Google Scholar
[760] . Machine learning. A Bayesian and optimization perspective. Academic Press, 2014.
[761] and . Pattern recognition. 4th ed. Academic Press, 2009.
[762] . A first course in stochastic models. Wiley, 2003.
[763] and . Betweenness centrality and resistance distance in communication networks. IEEE Network, 24(6):10–16
2010.Google Scholar
[764] . General duality between optimal control and estimation. In Proceedings of 47th IEEE Conference on Decision and Control (CDC'08), pages 4286–4292, 2008.Google Scholar
[765] . A new paradigm for ranking pages on the World Wide Web. In Proceedings of the 12th International World Wide Web Conference (WWW '03), pages 350–355, 2003.Google Scholar
[766] , and . Fast random walk with restart and its applications. In Proceedings of the 6th IEEE International Conference on Data Mining (ICDM '06), pages 613–622, 2006.Google Scholar
[767] , and . Randomwalk with restart: Fast solutions and applications. Knowledge and Information Systems, 14(3):327–346
2008.Google Scholar
[768] , and . Fast direction-aware proximity for graph mining. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07), pages 747–756, 2007.Google Scholar
[769] . Algorithms and dynamical models for communities and reputation in social networks. PhD dissertation, Université catholique de Louvain, ICTEAM Research Institute, 2013.
[770] . Algorithms and dynamical models for communities and reputation in social networks. Springer, 2014.
[771] , and . Narrow scope for resolution-limit-free community detection. Physical Review E, 84(1):016114, 2011.Google Scholar
[772] . Computing distances between convex sets and subsets of the positive semidefinite matrices. Technical report 97-03, Department of Computational and Applied Mathematics, Rice University, 1997.
[773] , , , , and W.Myrvold. Finding the most vital edge with respect to the number of spanning trees. IEEE Transactions on Reliability, 43(4):600–602
1994.
[774] . Counting triangles in real-world networks using projections. Knowledge and Information Systems, 26(3):501–520
2011.Google Scholar
[775] and . How to analyze paired comparison data. Technical report UWEETR-2011-0004, University of Washington, College of Engineering, 2011.
[776] . How to draw a graph. Proceedings of the London Mathematical Society, 13(1):743–767, 1963.Google Scholar
[777] . Graph theory. Cambridge University Press, 2001.
[779] . Graph clustering by flow simulation. PhD thesis, University of Utrecht, 2000. http://www.library.uu.nl/digiarchief/dip/diss/1895620/full.pdf.
[780] . Graph clustering via a discrete uncoupling process. SIAM Journal on Matrix Analysis and Applications, 30(1):121–141
2008.Google Scholar
[781] . Graph theory and complex networks. 2010.
[782] and . Graph-based clustering and data visualization algorithms. Springer, 1998.
[783] , and . A primer on kernel methods. In , and , editors, Kernel methods in computational biology, pages 35–70. MIT Press, 2004.
[784] . Spectral ranking. ArXiv preprint arXiv:0912.0238v9, 2011.
[785] . Laplacian solvers and their algorithmic applications. Theoretical Computer Science, 8(1–2):1–141, 2012.Google Scholar
[786] , , and . Graph kernels. Journal of Machine Learning Research, 11:1201–1242, 2010.Google Scholar
[787] . A tutorial on spectral clustering. Statistics and Computing, 17(4):395–416
2007.Google Scholar
[788] and . Density estimation from unweighted k-nearest neighbor graphs: A roadmap. In Advances in Neural Information Processing Systems 26: Proceedings of the NIPS '13 Conference, pages 225–233, 2013.Google Scholar
[789] , and . Consistency of spectral clustering. The Annals of Statistics, 36(2):555–586
2008.Google Scholar
[790] , and . Getting lost in space: Large sample analysis of the commute distance. In Advances in Neural Information Processing Systems 23: Proceedings of the NIPS '10 Conference, pages 2622–2630, 2010.Google Scholar
[791] , and . Hitting times, commute distances and the spectral gap for large random geometric graphs. Technical report, University of Hamburg, Department of Computer Science, 2010. Preprint available on ArXiv as arXiv:1003.1266.
[792] , and . Hitting and commute times in large random neighborhood graphs. Journal of Machine Learning Research, 15:1751–1798, 2014.Google Scholar
[793] and . Between min cut and graph bisection. In Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science (MFCS '93), pages 744–750, 1993.Google Scholar
[794] , , and . Constrained k-means clustering with background knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML '01), pages 577–584, 2001.Google Scholar
[795] .Moran's spatial autocorrelation coefficient. In , , , and , editors, Encyclopedia of statistical sciences, volume 12, pages 7875–7878. Wiley, 2006.
[796] and . Applied spatial statistics for public health data. Wiley, 2004.
[797] , and . Graph tranduction via alternating minimization. In Proceedings of the 25th International Conference on Machine Learning (ICML '08), pages 1144–1151, 2008.Google Scholar
[798] and . Similarity index based on the information of neighbor nodes for link prediction of complex network. Modern Physics Letters B, 27(6):1350039, 2013.Google Scholar
[799] , , , and . Linear neighborhood propagation and its applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 31(9):1600–1615, 2009.Google Scholar
[800] . Hierarchical grouping to optimize an objective function. Journal of American Statistical Association, 58:236–244, 1963.Google Scholar
[801] , , and . Discrete Laplace operators: No free lunch. In Proceedings of the Eurographics Symposium on Geometry Processing, pages 33–37, 2007.Google Scholar
[802] . A theorem on Boolean matrices. Journal of the Association for Computing Machinery, 9(1):11–12
1962.Google Scholar
[803] . All of statistics: A concise course in statistical inference. Springer, 2004.
[804] and . Social network analysis: Methods and applications. Cambridge University Press, 1994.
[805] , and . Logit models and logistic regressions for social networks:I An introduction to Markov graphs and p*.
Psychometrika, 61(3):401–425
1996.Google Scholar
[806] and . Collective dynamics of small-world networks. Nature, 393(6684):440–442
1998.Google Scholar
[807] and . Statistical pattern recognition. 3rd ed. Wiley, 2011.
[808] and . Ratio cut partitioning for hierarchical designs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10(7):911–921
1991.Google Scholar
[809] . Segmentation using eigenvectors: A unifying view. In Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV '99), pages 975–982, 1999.Google Scholar
[810] . Introduction to graph theory. 2nd ed. Prentice Hall, 2001.
[811] , and . Social structure from multiple networks. I. Blockmodels of roles and positions
American Journal of Sociology, 81(4):730–780
1976.Google Scholar
[812] and . Algorithms for estimating relative importance in networks. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '03), pages 266–275, 2003.Google Scholar
[813] and . A spectral clustering approach to finding communities in graph. In Proceedings of the 2005 SIAM International Conference on Data Mining (SDM '05), pages 274–285, 2005.Google Scholar
[814] . Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54(1):150–168
1932.Google Scholar
[815] . On a connection between kernel PCA and metric multidimensional scaling. Machine Learning, 46(1–3):11–19, 2002.Google Scholar
[816] . Introductory econometrics. 5th ed. South-Western College Publishing, 2013.
[817] and . Finding communities in linear time: A physics approach. The European Physical Journal B, 38(2):331–338
2004.Google Scholar
[818] , and . Analyzing the harmonic structure in graph-based learning. In Advances in Neural Information Processing Systems 26: Proceedings of the NIPS '13 Conference, pages 3129–3137, 2013.Google Scholar
[819] , , , and . Learning with partially absorbing random walks. In Advances in Neural Information Processing Systems 25: Proceedings of the NIPS '12 Conference, pages 3077–3085, 2012.Google Scholar
[820] , and . Fuzzy c-means clustering algorithm based on kernel method. In Proceedings of the 5th International Conference on Computational Intelligence and Multimedia Applications (ICCIMA '03), page 49, 2003.Google Scholar
[821] and . Clustering. Wiley-Blackwell, 2008.
[822] and . Resistance distance and Laplacian spectrum. Theoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta), 110(4):284–289
2003.Google Scholar
[823] and . On semidefinite relaxation for normalized k-cut and connections to spectral clustering. Technical Report UCB/CSD-3-1265, University of California, Berkeley, 2003.
[824] and . Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16(3):645–678
2005.Google Scholar
[825] .and . Efficient formulations for 1-SVM and their application to recommendation tasks. Journal of Computers, 1(3):27–34
2006.Google Scholar
[826] , , , , and . Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Transactions on Pattern Analysis and Machine Intelligence, 29(1):40–51
2007.Google Scholar
[827] . Evaluating latent class analysis models in qualitative phenotype identification. Computational Statistics and Data Analysis, 50(4):1090–1104
2006.Google Scholar
[828] and . Overlapping community detection at scale: A nonnegative matrix factorization approach. In Proceedings of the Sixth ACM International Conference on Web Search and Data Mining (WSDM '13), pages 587–596, 2013.Google Scholar
[829] and . A recursion formula for resistance distances and its applications. Discrete Applied Mathematics, 161(16–17):2702–2715, 2013.Google Scholar
[830] and . Unified development of multiplicative algorithms for linear and quadratic nonnegative matrix factorization. IEEE Transactions on Neural Networks, 22(12):1878–1891
2011.Google Scholar
[831] , , , and . Graph nodes clustering based on the commute-time kernel. In , and , editors, Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD '07), volume 4426 of Lecture Notes in Artificial Intelligence, pages 1037–1045. Springer, 2007.
[832] , , , , and. Graph nodes clustering with the sigmoid commute-time kernel: A comprehensive study. Data and Knowledge Engineering, 68(3):338–361
2008.Google Scholar
[833] , ,, and. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '08), pages 785–793, 2008.Google Scholar
[834] , and . A link analysis extension of correspondence analysis for mining relational databases. IEEE Transactions on Knowledge and Data Engineering, 23(4):481–495
2011.Google Scholar
[835] and . Network community discovery: Solving modularity clustering via normalized cut. In Proceedings of the Eighth Workshop on Mining and Learning with Graphs, pages 34–36, 2010.Google Scholar
[836] and . Data mining and analysis. Cambridge University Press, 2014.
[837] , , , and . Bipartite graph partitioning and data clustering. In Proceedings of the 10th ACM International Conference on Information and Knowledge Management (CIKM '01), pages 25–32, 2001.Google Scholar
[838] and . A novel kernelized fuzzy c-means algorithm with application in medical image segmentation. Artificial Intelligence in Medicine, 32(1):37–50
2004.Google Scholar
[839] , , , and . Learning with local and global consistency. In Advances in Neural Information Processing Systems 16: Proceedings of the NIPS '03 Conference, pages 237–244, 2004.Google Scholar
[840] , and . Learning from labeled and unlabeled data on a directed graph. In Proceedings of the 22nd International Conference on Machine Learning (ICML '05), pages 1036–1043, 2005.Google Scholar
[841] and . Discrete regularization. In , and , editors, Semi-supervised learning, pages 237–249. MIT Press, 2006.Google Scholar
[842] , and . Predicting missing links via local information. The European Physical Journal B, 71(4):623–630
2009.Google Scholar
[843] and . Semi-supervised learning by higher order regularization. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics (AISTATS '11), pages 892–900, 2011.Google Scholar
[844] . Semi-supervised learning literature survey. http://pages.cs.wisc.edu/?jerryzhu/research/ssl/semireview.html, 2008.
[845] and . Learning from labeled and unlabeled data with label propagation. Technical report CMU-CALD-02-107, Center for Automated Learning and Discovery, School of Computer Science, Carnegie Mellon University, 2002.
[846] , and . Semi-supervised learning using Gaussian fields and harmonic functions. In Proceedings of the 20th International Conference on Machine Learning (ICML '03), pages 912–919, 2003.Google Scholar
[847] and . Introduction to semi-supervised learning. Morgan and Claypool, 2009.
[848] , , and . Nonparametric transforms of graph kernels for semi-supervised learning. In Advances in Neural Information Processing Systems 17: Proceedings of the NIPS '04 Conference, pages 1641–1648, 2004.Google Scholar
[849] , and . Multilevel spectral hypergraph partitioning with arbitrary vertex sizes. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 18(9):1389–1399
1999
Google Scholar