Multilevel Graph Clustering with Density-Based Quality Measures
Multilevel Graph Clustering with Density-Based Quality Measures
Multilevel Graph Clustering with Density-Based Quality Measures
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
BIBLIOGRAPHY[71] A. J. Soper and C. Walshaw. A generational scheme for partitioning graphs.In L. Spector et al., editor, Proc. Genetic & Evolutionary Comput. Conf.(GECCO-2001), pages 607–614. Morgan Kaufmann, San Francisco, 2001.[72] A. J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search andmultilevel approach to graph partitioning. In D. Whitley et al., editor, Proc.Genetic & Evolutionary Comput. Conf. (GECCO-2000), pages 674–681. MorganKaufmann, San Francisco, 2000.[73] A. J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search andmultilevel optimisation approach to graph partitioning. Tech. Rep. 00/IM/58,Comp. Math. Sci., Univ. Greenwich, London SE10 9LS, UK, April 2000.[74] A. J. Soper, C. Walshaw, and M. Cross. A combined evolutionary search andmultilevel optimisation approach to graph partitioning. J. Global Optimization,29(2):225–241, 2004.[75] Stijn van Dongen. <strong>Graph</strong> <strong>Clustering</strong> by Flow Simulation. PhD thesis, Universityof Utrecht, May 2000.[76] Ken Wakita and Toshiyuki Tsurumi. Finding community structure in megascalesocial networks. cs/0702048, February 2007.[77] David Wales and Jonathan Doye. Global optimization by basin-hopping and thelowest energy structures of lennard-jones clusters containing up to 110 atoms.cond-mat/9803344, March 1998. J. Phys. Chem. A 101, 5111-5116 (1997).[78] C. Walshaw and M. Cross. Mesh partitioning: a multilevel balancing andrefinement algorithm. SIAM J. Sci. Comput., 22(1):63–80, 2000.[79] J.H. Ward Jr. Hierarchical grouping to optimize an objective function. Journalof the American Statistical Association, 58(301):236–244, 1963.[80] Scott White and Padhraic Smyth. A spectral clustering approach to findingcommunities in graph. SIAM Data Mining Conference, 2005.[81] Wu and Huberman. Finding communities in linear time: a physics approach.The European Physical Journal B - Condensed Matter and Complex Systems,38:331–338, March 2004.[82] W. W. Zachary. An information flow model for conflict and fission in smallgroups. Journal of Anthropological Research, 33:452–473, 1977.[83] Zhou and Lipowsky. Network brownian motion: A new method to measurevertex-vertex proximity and to identify communities and subcommunities.Computational Science - ICCS 2004, 2004.98
Change language