{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T20:35:01Z","timestamp":1780518901059,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540729020","type":"print"},{"value":"9783540729037","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72903-7_21","type":"book-chapter","created":{"date-parts":[[2007,8,19]],"date-time":"2007-08-19T22:54:03Z","timestamp":1187564043000},"page":"228-239","source":"Crossref","is-referenced-by-count":4,"title":["A New Greedy Algorithm for Improving b-Coloring Clustering"],"prefix":"10.1007","author":[{"given":"Haytham","family":"Elghazel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tetsuya","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00e9ronique","family":"Deslandres","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohand-Said","family":"Hacid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Dussauchoy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/3477.678624","volume":"28","author":"J.C. Bezdek","year":"1998","unstructured":"Bezdek, J.C., Pal, N.R.: Some new indexes of cluster validity. IEEE Transactions on Systems, Man. and Cybernetics\u00a028(3), 301\u2013315 (1998)","journal-title":"IEEE Transactions on Systems, Man. and Cybernetics"},{"issue":"1","key":"21_CR2","first-page":"45","volume":"6","author":"B. Effantin","year":"2003","unstructured":"Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science\u00a06(1), 45\u201354 (2003)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/11875604_54","volume-title":"High Performance Computing and Communications","author":"H. Elghazel","year":"2006","unstructured":"Elghazel, H., Deslandres, V., Hacid, M.S., Dussauchoy, A., Kheddouci, H.: A new clustering approach for symbolic data and its validation: Application to the healthcare data. In: Gerndt, M., Kranzlm\u00fcller, D. (eds.) HPCC 2006. LNCS, vol.\u00a04208, pp. 473\u2013482. Springer, Heidelberg (2006)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02616245","volume":"8","author":"A. Gu\u00ebnoche","year":"1991","unstructured":"Gu\u00ebnoche, A., Hansen, P., Jaumard, B.: Efficient algorithms for divisive hierarchical clustering with the diameter criterion. Journal of Classification\u00a08, 5\u201330 (1991)","journal-title":"Journal of Classification"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: Cure: An efficient clustering algorithm for large databases. In: Proceedings of the ACM SIGMOD Conference, pp. 73\u201384 (1998)","DOI":"10.1145\/276305.276312"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"397","DOI":"10.2307\/2286672","volume":"73","author":"P. Hansen","year":"1978","unstructured":"Hansen, P., Delattre, M.: Complete-link cluster analysis by graph coloring. Journal of the American Statistical Association\u00a073, 397\u2013403 (1978)","journal-title":"Journal of the American Statistical Association"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.2307\/2346830","volume":"28","author":"J. Hartigan","year":"1979","unstructured":"Hartigan, J., Wong, M.: Algorithm as136: A k-means clustering algorithm. Journal of Applied Statistics\u00a028, 100\u2013108 (1979)","journal-title":"Journal of Applied Statistics"},{"key":"21_CR8","unstructured":"Hettich, S., Blake, C.L., Merz, C.J.: Uci repository of machine learning databases (1998)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"W. Irving","year":"1999","unstructured":"Irving, W., Manlov, D.F.: The b-chromatic number of a graph. Discrete Applied Mathematics\u00a091, 127\u2013141 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N.: Data clustering: A review. ACM Computing Surveys\u00a031, 264\u2013323 (1999)","journal-title":"ACM Computing Surveys"},{"issue":"14","key":"21_CR11","doi-asserted-by":"publisher","first-page":"2367","DOI":"10.1016\/S0167-8655(03)00066-7","volume":"24","author":"M. Kalyani","year":"2003","unstructured":"Kalyani, M., Sushmita, M.: Clustering and its validation in a symbolic framework. Pattern Recognition Letters\u00a024(14), 2367\u20132376 (2003)","journal-title":"Pattern Recognition Letters"},{"issue":"5","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","volume":"14","author":"R. Ng","year":"2002","unstructured":"Ng, R., Han, J.: Clarans: a method for clustering objects for spatial data mining. IEEE Transactions on Knowledge and Data. Engineering\u00a014(5), 1003\u20131016 (2002)","journal-title":"IEEE Transactions on Knowledge and Data. Engineering"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C.T. Zahn","year":"1971","unstructured":"Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers\u00a020, 68\u201386 (1971)","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representations in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72903-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:57:57Z","timestamp":1558472277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72903-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540729020","9783540729037"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72903-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}