Abstract
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the “raw coordinates” encountered in spectral clustering, and can be extended by means of higher-dimensional embeddings (Schoenberg transformations). Geographical flow data, properly conditioned, illustrate the procedure as well as visualization aspects.
Chapter PDF
Similar content being viewed by others
Keywords
References
Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs. Draft chapters, http://www.stat.berkeley.edu/users/aldous/RWG/book.html
Bavaud, F.: The quasi-symmetric side of gravity modelling. Environment and Planning A 34, 61–79 (2002)
Bavaud, F.: Spectral clustering and multidimensional scaling: a unified view. In: Batagelj, V., Bock, H.-H., Ferligoj, A., Ziberna, A. (eds.) Data science and classification, pp. 131–139. Springer, Heidelberg (2006)
Bavaud, F.: The Endogenous analysis of flows, with applications to migrations, social mobility and opinion shifts. Journal of Mathematical Sociology 32, 239–266 (2008)
Bavaud, F.: Aggregation invariance in general clustering approaches. Advances in Data Analysis and Classification 3, 205–225 (2009)
Bavaud, F.: On the Schoenberg Transformations in Data Analysis: Theory and Illustrations (submitted, 2010)
Belkin, M., Niyogi, P.: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation. Neural Computation 15, 1373–1396 (2003)
Berger, J., Snell, J.L.: On the concept of equal exchange. Behavioral Science 2, 111–118 (1957)
Beurling, A., Deny, J.: Espaces de Dirichlet. I. Le cas élémentaire. Acta Mathematica 99, 203–224 (1958)
Chung, F.R.K.: Spectral graph theory. In: CBMS Regional Conference Series in Mathematics, vol. 92. American Mathematical Society, Washington (1997)
Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley, Chichester (1991)
Critchley, F., Fichet, B.: The partial order by inclusion of the principal classes of dissimilarity on a finite set, and some of their basic properties. In: van Cutsem, B. (ed.) Classification and dissimilarity analysis. Lecture Notes in Statistics, pp. 5–65. Springer, Heidelberg (1994)
Deza, M., Laurent, M.: Geometry of cuts and metrics. Springer, Heidelberg (1997)
Dunn, G., Everitt, B.: An Introduction to Mathematical Taxonomy. Cambridge University Press, Cambridge (1982)
Filippone, M., Camastra, F., Masulli, F., Rovetta, S.: A survey of kernel and spectral methods for clustering. Pattern Recognition 41, 176–190 (2008)
Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering 19, 355–369 (2007)
Greenacre, M.J.: Correspondence analysis in practice. Chapman and Hall, Boca Raton (2007)
Hein, M., Bousquet, O., Schölkopf, B.: Maximal margin classification for metric spaces. Journal of Computer and System Sciences 71, 333–359 (2005)
Huang, Z., Ng, M.K.: A fuzzy k-modes algorithm for clustering categorical data. IEEE Transactions on Fuzzy Systems 7, 446–452 (1999)
Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)
Kijima, M.: Markov processes for stochastic modeling. Chapman and Hall, Boca Raton (1997)
Kondor, R.I., Lafferty, J.D.: Diffusion kernels on graphs and other discrete input spaces. In: Sammut, C., Hoffmann, A.G. (eds.) Proceedings of the Nineteenth International Conference on Machine Learning, pp. 315–322 (2002)
Lafon, S., Lee, A.B.: Diffusion Maps and Coarse-Graining: A Unified Framework for Dimensionality Reduction, Graph Partitioning, and Data Set Parameterization. IEEE Trans. on Pattern Analysis and Machine Intelligence 28, 1393–1403 (2006)
von Luxburg, U.: A tutorial on spectral clustering. Statistics and Computing 17, 395–416 (2007)
Mardia, K.V., Kent, J.T., Bibby, J.M.: Multivariate analysis. Academic Press, London (1979)
Meila, M.: Comparing clusterings: an axiomatic view. In: ACM International Conference Proceeding Series, vol. 119, pp. 577–584 (2005)
Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, vol. 14, pp. 849–856. MIT Press, Cambridge (2002)
Nock, R., Vaillant, P., Henry, C., Nielsen, F.: Soft memberships for spectral clustering, with application to permeable language distinction. Pattern Recognition 42, 43–53 (2009)
Rose, K., Gurewitz, E., Fox, G.C.: Statistical mechanics and phase transitions in clustering. Phys. Rev. Lett. 65, 945–948 (1990)
Rose, K.: Deterministic Annealing for clustering, compression, classification, regression, and related optimization problems. Proceedings of the IEEE 86, 2210–2239 (1998)
Schoenberg, I.J.: Metric Spaces and Completely Monotone Functions. The Annals of Mathematics 39, 811–841 (1938a)
Schoenberg, I.J.: Metric Spaces and Positive Definite Functions. Transactions of the American Mathematical Society 44, 522–536 (1938b)
Schölkopf, B.: The Kernel Trick for Distances. In: Advances in Neural Information Processing Systems, vol. 13, pp. 301–307 (2000)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 888–905 (2000)
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 22, 2319–2323 (2000)
Torgerson, W.S.: Theory and Methods of Scaling. Wiley, Chichester (1958)
Williams, C.K.I.: On a Connection between Kernel PCA and Metric Multidimensional Scaling. Machine Learning 46, 11–19 (2002)
Young, G., Householder, A.S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3, 19–22 (1938)
Yu, S., Shi, J.: Multiclass Spectral Clustering. In: Proceedings of the Ninth IEEE International Conference on Computer Vision, pp. 313–319 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bavaud, F. (2010). Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2010. Lecture Notes in Computer Science(), vol 6321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15880-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-15880-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15879-7
Online ISBN: 978-3-642-15880-3
eBook Packages: Computer ScienceComputer Science (R0)