Optimal fuzzy aggregation of networks

Multiscale Modeling and Simulation

Volumn 8, Issue 4, 2010, Pages 1535-1561

  Sarich, Marco ^a   Schütte, Christof ^a   Vanden Eijnden, Eric ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Affiliation function; Clustering; Constrained nonlinear minimization problem; Fuzzy aggregation; Markov chain; Network; Numerical minimization; Partitioning; Random walk; Restricted line search

Indexed keywords

AFFILIATION FUNCTION; CLUSTERING; FUZZY AGGREGATION; LINE SEARCHES; MARKOV CHAIN; NETWORK; NONLINEAR MINIMIZATION; NUMERICAL MINIMIZATION; PARTITIONING; RANDOM WALK;

MARKOV PROCESSES; MATRIX ALGEBRA;

OPTIMIZATION;

EID: 77956821564     PISSN: 15403459     EISSN: 15403467     Source Type: Journal    
DOI: 10.1137/090758519     Document Type: Article

References (29)

1. W. E, T. Li, and E. Vanden-Eijnden, Optimal partition and effective dynamics of complex networks, Proc. Natl. Acad. Sci. USA, 105 (2008), pp. 7907-7912.
2. T. Li, J. Liu, and W. E, A probabilistic framework for network partition, Phys. Rev. E (3), 80 (2009), 026106.
3. A. Jain and R. Dubes, Algorithms for Clustering Data, Prentice-Hall, Englewood Cliffs, NJ, 1988.
4. J.A. Hartigan and M.A. Wong, A K-means clustering algorithm, Applied Statistics, 28 (1979), pp. 100-108.
5. P. Deuflhard and M. Weber, Robust Perron cluster analysis in conformation dynamics, Linear Algebra Appl., 398 (2005), pp. 161-184.
6. P. Deuflhard, W. Huisinga, A. Fischer, and Ch. Schütte, Identification of almost invariant aggregates in reversible nearly uncoupled Markov chains, Linear Algebra Appl., 315 (2000), pp. 39-59.
7. M.E.J. Newman and M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E (3), 69 (2004), 026113.
8. G. McLachlan and K.E. Basford, Mixture Models: Inference and Applications to Clustering, Marcel Dekker, New York, Basel, 1988.
9. G. McLachlan and D. Peel, Finite Mixture Models, Wiley, New York, 2000.
10. F.V. Jensen, Bayesian Networks and Decision Graphs, Springer, New York, 2001.
11. F. Höppner, F. Klawonn, R. Kruse, and T. Runkler, Fuzzy Cluster Analysis, John Wiley and Sons, New York, 1999.
12. S. Kube and M. Weber, A coarse graining method for the identification of transition rates between molecular conformations, J. Chem. Phys., 126 (2007), 024103.
13. M. Weber, W. Rungsarityotin, and A. Schliep, Perron Cluster Analysis and Its Connection to Graph Partitioning for Noisy Data, ZIB Report 04-39, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany, 2004.
14. J. Shi and J. Mali, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Mach. Intell., 22 (2000), pp. 888-905.
15. M. Meila and J. Shi, A random walks view of spectral segmentation, in Proceedings of the 8th International Workshop on Artificial Intelligence and Statistics (AISTATS), 2001.
16. M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput., 6 (2003), pp. 1373-1396.
17. D.L. Donoho and C. Grimes, Hessian eigenmaps: New locally linear embedding techniques for high-dimensional data, Proc. Natl. Acad. Sci. USA, 100 (2003), pp. 5591-5596.
18. S. Lafon and A.B. Lee, Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, IEEE Trans. Pattern Anal. Mach. Intell., 28 (2006), pp. 1393-1403.
19. P.G. Doyle and J.L. Snell, Random Walks and Electric Networks, http://arvix.org/abs/math/0001057 (2000).
20. M.E.J. Newman and E.A. Leicht, Mixture models and exploratory analysis in networks, Proc. Natl. Acad. Sci. USA, 104 (2007), pp. 9564-9569.
21. J.J. Daudin, F. Picard, and S. Robin, A mixture model for random graphs, Stat. Comput., 18 (2008), pp. 173-183.
22. E. Airoldi, D. Blei, S. Fienberg, and E.P. Xing, Mixed membership stochastic block model, J. Mach. Learn. Res., 9 (2008), pp. 1981-2014.
23. E.A. Erosheva and S.E. Fienberg, Bayesian mixed membership models for soft clustering and classification, in Classification-The Ubiquitous Challenge, C. Weihs and W. Gaul, eds., Springer, Heidelberg, 2005, pp. 11-26.
24. E. Airoldi, Bayesian Mixed-Membership Models of Complex and Evolving Networks, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 2006.
25. A. Snyman, Practical Mathematical Optimization: An Introduction to Basic Optimization Theory and Classical and New Gradient-Based Algorithms, Springer, New York, 2005.
26. P.R. Östergard, A fast algorithm for the maximum clique problem, Discrete Appl. Math., 120 (2002), pp. 197-207.
27. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, The maximum clique problem, in Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1999, pp. 1-74.
28. L. Elsner and S. Friedland, Variation of the discrete eigenvalues of normal operators, Proc. Amer. Math. Soc., 123 (1995), pp. 2511-2517.
29. D.E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing, Addison- Wesley, Reading, MA, 1993.