{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:39:59Z","timestamp":1725565199746},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_7","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"41-51","source":"Crossref","is-referenced-by-count":3,"title":["Constraint-Based Graph Clustering through Node Sequencing and Partitioning"],"prefix":"10.1007","author":[{"given":"Yu","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained K-Means Clustering. In: MSRTR- 2000-65, Microsoft Research (2000)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C.-K. Cheng","year":"1991","unstructured":"Cheng, C.-K., Wei, Y.A.: An improved two-way partitioning algorithm with stable performance. IEEE. Trans. on Computed Aided Design\u00a010, 1502\u20131511 (1991)","journal-title":"IEEE. Trans. on Computed Aided Design"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013114 (2001)","DOI":"10.1109\/ICDM.2001.989507"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"Donath, W.E., Hoffman, A.J.: Lower bounds for partitioning of graphs. IBM J. Res. Develop.\u00a017, 420\u2013425 (1973)","journal-title":"IBM J. Res. Develop."},{"key":"7_CR5","first-page":"139","volume":"2","author":"D. Fisher","year":"1987","unstructured":"Fisher, D.: Knowledge acquisition via incremental conceptual clustering. Machine Learning\u00a02, 139\u2013172 (1987)","journal-title":"Machine Learning"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1109\/43.159993","volume":"11","author":"L. Hagen","year":"1992","unstructured":"Hagen, L., Kahng, A.B.: New spectral methods for ratio cut partitioning and clustering. IEEE Trans. on Computed Aided Design\u00a011, 1074\u20131085 (1992)","journal-title":"IEEE Trans. on Computed Aided Design"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters\u00a031, 7\u201315 (1989)","journal-title":"Information Processing Letters"},{"issue":"6","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1145\/330643.330647","volume":"21","author":"M. Kandemir","year":"2000","unstructured":"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\u00a021(6), 1251\u20131297 (2000)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Qian, Y., Zhang, K.: A Customizable Hybrid Approach to Data Clustering. In: Proc. of the, ACM Symposium on Applied Computing, pp. 485\u2013489 (2003)","DOI":"10.1145\/952532.952628"},{"issue":"8","key":"7_CR10","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J. Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a022(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-44503-X_26","volume-title":"Database Theory - ICDT 2001","author":"A.K.H. Tung","year":"2000","unstructured":"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.\u00a01973, pp. 405\u2013419. Springer, Heidelberg (2000)"},{"key":"7_CR12","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: Proc. of the 17th Intl. Conf. on Machine Learning, pp. 1103\u20131110 (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:54Z","timestamp":1620011394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}