Abstract
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is of great practical interest, as these clusters may correspond to cohesive software modules, semantically related documents, and groups of friends or collaborators. Many existing clustering criteria and energy models are biased towards clustering together nodes with high degrees. In this paper, we introduce a clustering criterion based on normalizing cuts with edge numbers (instead of node numbers), and a corresponding energy model based on edge repulsion (instead of node repulsion) that reveal clusters without this bias.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Reviews of Modern Physics 74(1), 47–97 (2002)
Alpert, C.J., Kahng, A.B.: Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal 19(1-2), 1–81 (1995)
Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature 324, 446–449 (1986)
Blythe, J., McGrath, C., Krackhardt, D.: The effect of graph layout on inference from social network data. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 40–51. Springer, Heidelberg (1996)
Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15(4), 301–331 (1996)
Dengler, E., Cowan, W.: Human perception of laid-out graphs. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 441–443. Springer, Heidelberg (1999)
Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)
Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software – Practice and Experience 21(11), 1129–1164 (1991)
Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 211–221. Springer, Heidelberg (2001)
Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285–295. Springer, Heidelberg (2005)
Hall, K.M.: An r-dimensional quadratic placement algorithm. Management Science 17(3), 219–229 (1970)
Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 183–196. Springer, Heidelberg (2001)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31(1), 7–15 (1989)
Kannan, R., Vempala, S., Vetta, A.: On clusterings: Good, bad and spectral. Journal of the ACM 51(3), 497–515 (2004)
Leighton, T., Rao, S.: An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pp. 422–431. IEEE, Los Alamitos (1988)
Mancoridis, S., Mitchell, B.S., Rorres, C., Chen, Y., Gansner, E.R.: Using automatic clustering to produce high-level system organizations of source code. In: Proc. 6th IEEE International Workshop on Program Comprehension (IWPC 1998), pp. 45–52. IEEE, Los Alamitos (1998)
Noack, A.: An energy model for visual graph clustering. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 425–436. Springer, Heidelberg (2004)
Noack, A., Lewerentz, C.: A space of layout styles for hierarchical graph models of software systems. In: Proc. 2nd ACM Symposium on Software Visualization (SoftVis 2005), pp. 155–164. ACM, New York (2005)
Quigley, A.J., Eades, P.: FADE: Graph drawing, clustering, and visual abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 197–210. Springer, Heidelberg (2001)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 171–182. Springer, Heidelberg (2001)
Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence 15(11), 1101–1113 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Noack, A. (2006). Energy-Based Clustering of Graphs with Nonuniform Degrees. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_28
Download citation
DOI: https://doi.org/10.1007/11618058_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)