{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:55:42Z","timestamp":1725569742674},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175336"},{"type":"electronic","value":"9783642175343"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17534-3_38","type":"book-chapter","created":{"date-parts":[[2010,11,12]],"date-time":"2010-11-12T08:51:22Z","timestamp":1289551882000},"page":"310-320","source":"Crossref","is-referenced-by-count":2,"title":["Clustering Categorical Data Using an Extended Modularity Measure"],"prefix":"10.1007","author":[{"given":"Lazhar","family":"Labiod","sequence":"first","affiliation":[]},{"given":"Nistor","family":"Grozavu","sequence":"additional","affiliation":[]},{"given":"Youn\u00e8ns","family":"Bennani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"33","key":"38_CR1","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","volume":"66","author":"G. Agarwal","year":"2008","unstructured":"Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. The European Physical Journal B\u00a066(33), 409\u2013418 (2008)","journal-title":"The European Physical Journal B"},{"key":"38_CR2","volume-title":"UCI Machine Learning Repository","author":"A. Asuncion","year":"2007","unstructured":"Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), \n                    \n                      http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Barbara, D., Couto, J., Li, Y.: COOLCAT: an entropy-based algorithm for categorical clustering. In: Proceedings of the Eleventh ACM CIKM Conference, pp. 582\u2013589 (2002)","DOI":"10.1145\/584792.584888"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-75040-3_2","volume-title":"Conceptual and Numerical Analysis of Data","author":"H.-H. Bock","year":"1989","unstructured":"Bock, H.-H.: Probabilistic aspects in cluster analysis. In: Opitz, O. (ed.) Conceptual and Numerical Analysis of Data, pp. 12\u201344. Springer, Berlin (1989)"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02616237","volume":"8","author":"G. Celeux","year":"1991","unstructured":"Celeux, G., Govaert, G.: Clustering criteria for discrete data and latent class models. Journal of Classification\u00a08, 157\u2013176 (1991)","journal-title":"Journal of Classification"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Ganti, V., Gehrke, J., Ramakrishnan, R.: CACTUS - clustering categorical data using summaries. In: Proceedings of the Fifth ACM SIGKDD Conference, pp. 73\u201383 (1999)","DOI":"10.1145\/312129.312201"},{"key":"38_CR7","unstructured":"Gibson, D., Kleinberg, J., Raghavan, P.: Clustering categorical data: An approach based on dynamical systems. In: Proceedings of the 24rd VLDB Conference, pp. 311\u2013322 (1998)"},{"key":"38_CR8","doi-asserted-by":"publisher","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. Information Systems\u00a025, 345\u2013366 (2000)","journal-title":"Information Systems"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z. Huang","year":"1998","unstructured":"Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery\u00a02, 283\u2013304 (1998)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"38_CR10","unstructured":"Marcotorchino, J.F.: Relational analysis theory as a general approach to data analysis and data fusion. In: Cognitive Systems with Interactive Sensors (2006)"},{"key":"38_CR11","unstructured":"Marcotorchino, J.F., Michaud, P.: Optimisation en analyse ordinale des donn\u00e9es (1978) (in Masson)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"26113","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"M. Newman","year":"2004","unstructured":"Newman, M., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E\u00a069, 26113 (2004)","journal-title":"Physical Review E"},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: SDM, pp. 76\u201384 (2005)","DOI":"10.1137\/1.9781611972757.25"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing. Models and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17534-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T21:14:39Z","timestamp":1548450879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17534-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175336","9783642175343"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17534-3_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}