Abstract
This paper proposes a two-step graph partitioning method to discover constrained clusters with an objective function that follows the well-known min-max clustering principle. Compared with traditional approaches, the proposed method has several advantages. Firstly, the objective function not only follows the theoretical min-max principle but also reflects certain practical requirements. Secondly, a new constraint is introduced and solved to suit more application needs while unconstrained methods can only control the number of produced clusters. Thirdly, the proposed method is general and can be used to solve other practical constraints. The experimental studies on word grouping and result visualization show very encouraging results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained K-Means Clustering. In: MSRTR- 2000-65, Microsoft Research (2000)
Cheng, C.-K., Wei, Y.A.: An improved two-way partitioning algorithm with stable performance. IEEE. Trans. on Computed Aided Design 10, 1502–1511 (1991)
Ding, H.Q.C., He, X., Zha, H., Gu, M., Simon, H.: A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering. In: Proc. of International Conf on Data Mining, pp. 107–114 (2001)
Donath, W.E., Hoffman, A.J.: Lower bounds for partitioning of graphs. IBM J. Res. Develop. 17, 420–425 (1973)
Fisher, D.: Knowledge acquisition via incremental conceptual clustering. Machine Learning 2, 139–172 (1987)
Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on Computed Aided Design 11, 1074–1085 (1992)
Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31, 7–15 (1989)
Kandemir, M., Banerjee, P., Ramanujam, J., Shenoy, N.: A global communication optimization technique based on data-flow analysis and linear algebra. ACM Transactions on Programming Languages and Systems 21(6), 1251–1297 (2000)
Qian, Y., Zhang, K.: A Customizable Hybrid Approach to Data Clustering. In: Proc. of the, ACM Symposium on Applied Computing, pp. 485–489 (2003)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)
Tung, A.K.H., Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constrained-based clustering in large databases. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol. 1973, pp. 405–419. Springer, Heidelberg (2000)
Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: Proc. of the 17th Intl. Conf. on Machine Learning, pp. 1103–1110 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Qian, Y., Zhang, K., Lai, W. (2004). Constraint-Based Graph Clustering through Node Sequencing and Partitioning. In: Dai, H., Srikant, R., Zhang, C. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2004. Lecture Notes in Computer Science(), vol 3056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24775-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24775-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22064-0
Online ISBN: 978-3-540-24775-3
eBook Packages: Springer Book Archive