{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T00:49:53Z","timestamp":1675817393012},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T00:00:00Z","timestamp":1227657600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10852-008-9093-x","type":"journal-article","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T16:37:07Z","timestamp":1227717427000},"page":"389-423","source":"Crossref","is-referenced-by-count":8,"title":["A Graph b-coloring Framework for Data Clustering"],"prefix":"10.1007","volume":"7","author":[{"given":"Haytham","family":"Elghazel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Deslandres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Dussauchoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,26]]},"reference":[{"key":"9093_CR1","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/21.286391","volume":"24","author":"M. Ichino","year":"1994","unstructured":"Ichino, M., Yaguchi, H.: General minkowsky metrics for mixed feature type data analysis. IEEE Trans. Syst. Man Cybern. 24, 698\u2013708 (1994)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9093_CR2","unstructured":"Malerba, D., Esposito, F., Gioviale, V., Tamma, V.: Comparing dissimilarity measures in symbolic data analysis. In: Joint Conferences on New Techniques and Technologies for Statistics and Exchange of Technology and Know-how, pp. 473\u2013481, Hersonissos, 18\u201322 June 2001"},{"key":"9093_CR3","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, T.P.J.: Data clustering: a review. ACM Comput. Surv. 31, 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"9093_CR4","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, Seattle, 2\u20134 June 1998","DOI":"10.1145\/276304.276312"},{"issue":"8","key":"9093_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","volume":"32","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Han, E., Chameleon, K.V.: A hierarchical clustering algorithm using dynamic modeling. IEEE Comput. 32(8), 68\u201375 (1999)","journal-title":"IEEE Comput."},{"issue":"5","key":"9093_CR6","doi-asserted-by":"crossref","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 Trans. Knowl. Data Eng. 14(5), 1003\u20131016 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9093_CR7","doi-asserted-by":"crossref","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. J. Appl. Stat. 28, 100\u2013108 (1979)","journal-title":"J. Appl. Stat."},{"issue":"4","key":"9093_CR8","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J.G. Auguston","year":"1970","unstructured":"Auguston, J.G., Minker, J.: An analysis of some graph theoretical clustering techniques. J. Assoc. Comput. Mach. 17(4), 571\u2013588 (1970)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9093_CR9","doi-asserted-by":"crossref","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 Trans. Comput. 20, 68\u201386 (1971)","journal-title":"IEEE Trans. Comput."},{"key":"9093_CR10","first-page":"199","volume-title":"The Louisiana Conference on Combinatorics, Graph Theory, and Computing","author":"D.W. Matula","year":"1970","unstructured":"Matula, D.W.: Cluster analysis via graph theoretic techniques. In: Mullin, R.C., Reid, K.B., Roselle, D.P. (eds.) The Louisiana Conference on Combinatorics, Graph Theory, and Computing, pp. 199\u2013212. Louisiana State University, Baton Rouge (1970)"},{"key":"9093_CR11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D.W. Matula","year":"1972","unstructured":"Matula, D.W.: K-components, clusters, and slicings in graphs. SIAM J. Appl. Math. 22, 459\u2013480 (1972)","journal-title":"SIAM J. Appl. Math."},{"issue":"8","key":"9093_CR12","doi-asserted-by":"crossref","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. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"11","key":"9093_CR13","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z. Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 15(11), 1101\u20131113 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"9093_CR14","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/321479.321480","volume":"15","author":"C.C. Gotlieb","year":"1968","unstructured":"Gotlieb, C.C., Kumar, S.: Semantic clustering of index terms. J. Assoc. Comput. Mach. 15(4), 493\u2013513 (1968)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9093_CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02616245","volume":"8","author":"A. Guenoche","year":"1991","unstructured":"Guenoche, A., Hansen, P., Jaumard, B.: Efficient algorithms for divisive hierarchical clustering with the diameter criterion. J. Classif. 8, 5\u201330 (1991)","journal-title":"J. Classif."},{"key":"9093_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0020-0190(00)00142-3","volume":"76","author":"E. Hartuv","year":"2000","unstructured":"Hartuv, E., Shamir, R.: A clustering algorithm based on graph connectivity. Inf. Process. Lett. 76, 175\u2013181 (2000)","journal-title":"Inf. Process. Lett."},{"key":"9093_CR17","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1137\/0109047","volume":"9","author":"R.E. Gomory","year":"1961","unstructured":"Gomory, R.E., Hu, T.C.: Multy-terminal network flows. SIAM J. Appl. Math. 9, 551\u2013560 (1961)","journal-title":"SIAM J. Appl. Math."},{"key":"9093_CR18","unstructured":"Kuhns, J.L.: Mathematical analysis of correlation clusters. Word correlation and automatic indexing, 2 (1959)"},{"key":"9093_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/01621459.1978.10481589","volume":"73","author":"P. Hansen","year":"1978","unstructured":"Hansen, P., Delattre, M.: Complete-link cluster analysis by graph coloring. J. Am. Stat. Assoc. 73, 397\u2013403 (1978)","journal-title":"J. Am. Stat. Assoc."},{"key":"9093_CR20","first-page":"78","volume-title":"DS2007 (Springer Verlag LNAI 4755)","author":"H. Elghazel","year":"2007","unstructured":"Elghazel, H., Kheddouci, H., Deslandres, V., Dussauchoy, A.: A partially dynamic clustering algorithm for data insertion and removal. In: Corruble, V., Takeda, M., Suzuki, E. (eds.) DS2007 (Springer Verlag LNAI 4755), pp. 78\u201390. Springer, New York (2007)"},{"key":"9093_CR21","doi-asserted-by":"crossref","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 Appl. Math. 91, 127\u2013141 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9093_CR22","first-page":"45","volume":"6","author":"B. Effantin","year":"2003","unstructured":"Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discret. Math. Theor. Comput. Sci. 6(1), 45\u201354 (2003)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"9093_CR23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(01)00469-1","volume":"256","author":"M. Kouider","year":"2002","unstructured":"Kouider, M., Maheo, M.: Some bounds for the b-chromatic number of a graph. Discret. Math. 256, 267\u2013277 (2002)","journal-title":"Discret. Math."},{"key":"9093_CR24","first-page":"430","volume-title":"ISPA2006 (Springer Verlag LNCS 4330)","author":"B. Effantin","year":"2006","unstructured":"Effantin, B., Kheddouci, H.: A distributed algorithm for a b-coloring of a graph. In: ISPA2006 (Springer Verlag LNCS 4330), pp. 430\u2013438. Springer, New York (2006)"},{"key":"9093_CR25","unstructured":"Kheddouci, H.: Placement et param\u00e8tres de graphes. M\u00e9moire HDR RC 20586, University of Bourgogne (2003)"},{"key":"9093_CR26","first-page":"473","volume-title":"ISMIS2006 (Springer Verlag LNAI 4203)","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: Esposito, F., Ras, Z.W., Malerba, D., Semeraro, G. (eds.) ISMIS2006 (Springer Verlag LNAI 4203), pp. 473\u2013482. Springer, New York (2006)"},{"issue":"3","key":"9093_CR27","doi-asserted-by":"crossref","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 Trans. Syst. Man Cybern. 28(3), 301\u2013315 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"14","key":"9093_CR28","doi-asserted-by":"crossref","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 Recogn. Lett. 24(14), 2367\u20132376 (2003)","journal-title":"Pattern Recogn. Lett."},{"key":"9093_CR29","volume-title":"Uci Repository of Machine Learning Databases","author":"C.L. Blake","year":"1998","unstructured":"Blake, C.L., Merz, C.J.: Uci Repository of Machine Learning Databases. University of California Irvine, Irvine (1998)"},{"issue":"5","key":"9093_CR30","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S. Guha","year":"2000","unstructured":"Guha, S., Rastogi, R., Shim, K., Rock: A robust clustering algorithm for categorical attributes. Inf. Syst. 25(5), 345\u2013366 (2000)","journal-title":"Inf. Syst."},{"issue":"C","key":"9093_CR31","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/5326.669556","volume":"28","author":"G. Biswas","year":"1998","unstructured":"Biswas, G., Weinberg, J.B., Fisher, D.H.: Iterate: a conceptual clustering algorithm for data mining. IEEE Trans. Syst. Man Cybern. 28(C), 219\u2013230 (1998)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"9093_CR32","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W.M. Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66, 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"9093_CR33","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(91)90233-8","volume":"38","author":"G. Rote","year":"1991","unstructured":"Rote, G.: Computing the minimum Hausdorff distance between two point sets on a line under translation. Inf. Process. Lett. 38, 123\u2013127 (1991)","journal-title":"Inf. Process. Lett."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9093-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-008-9093-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-008-9093-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-008-9093-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,26]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9093"],"URL":"https:\/\/doi.org\/10.1007\/s10852-008-9093-x","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,26]]}}}