{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:14:57Z","timestamp":1725534897155},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030666"},{"type":"electronic","value":"9783642030673"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03067-3_25","type":"book-chapter","created":{"date-parts":[[2009,7,9]],"date-time":"2009-07-09T01:45:02Z","timestamp":1247103902000},"page":"310-324","source":"Crossref","is-referenced-by-count":3,"title":["Clustering with Domain Value Dissimilarity for Categorical Data"],"prefix":"10.1007","author":[{"given":"Jeonghoon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoon-Joon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minho","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0470101024","volume-title":"Making Sense of Data: A Practical Guide to Exploratory Data Analysis and Data Mining","author":"G.J. Myatt","year":"2007","unstructured":"Myatt, G.J.: Making Sense of Data: A Practical Guide to Exploratory Data Analysis and Data Mining. John Wiley & Sons, Inc., Chichester (2007)"},{"key":"25_CR2","volume-title":"Algorithms for Clustering Data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Ganti, V., Gehrke, J., Ramakrishnan, R.: Cactus-clustering categorical data using summaries. In: Proc. of ACM SIGKDD, pp. 73\u201383 (1999)","DOI":"10.1145\/312129.312201"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Guha, S., Rastogi, R., Shim, K.: Rock: A robust clustering algorithm for categorical attributes. In: Information Systems, pp. 512\u2013521 (1999)","DOI":"10.1109\/ICDE.1999.754967"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Fu, A.W.C., Cai, C.H., Heng, P.A.: Clustering categorical data. In: ICDE, p. 305 (2000)","DOI":"10.1109\/ICDE.2000.839422"},{"key":"25_CR6","volume-title":"Introduction to Data Mining","author":"P.N. Tan","year":"2005","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley, Reading (2005)"},{"key":"25_CR7","first-page":"57","volume":"10","author":"S. Cost","year":"1993","unstructured":"Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with symbolic features. Machine Learning\u00a010, 57\u201378 (1993)","journal-title":"Machine Learning"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.patrec.2006.06.006","volume":"28","author":"A. Ahmad","year":"2007","unstructured":"Ahmad, A., Dey, L.: A method to compute distance between two categorical values of same attribute in unsupervised learning for categorical data set. Pattern Recognition Letters\u00a028(1), 110\u2013118 (2007)","journal-title":"Pattern Recognition Letters"},{"key":"25_CR9","first-page":"582","volume-title":"Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002)","author":"D. Barbar\u00e1","year":"2002","unstructured":"Barbar\u00e1, D., Li, Y., Couto, J.: COOLCAT: an entropy-based algorithm for categorical clustering. In: Kalpakis, K., Goharian, N., Grossmann, D. (eds.) Proceedings of the Eleventh International Conference on Information and Knowledge Management (CIKM 2002), November 4\u20139, pp. 582\u2013589. ACM Press, New York (2002)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-24741-8_9","volume-title":"Advances in Database Technology - EDBT 2004","author":"P. Andritsos","year":"2004","unstructured":"Andritsos, P., Tsaparas, P., Miller, R.J., Sevcik, K.C.: LIMBO: Scalable clustering of categorical data. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 123\u2013146. Springer, Heidelberg (2004)"},{"key":"25_CR11","first-page":"243","volume-title":"SDM","author":"S. Boriah","year":"2008","unstructured":"Boriah, S., Chandola, V., Kumar, V.: Similarity measures for categorical data: A comparative evaluation. In: SDM, pp. 243\u2013254. SIAM, Philadelphia (2008)"},{"key":"25_CR12","unstructured":"Huang, Z.: A fast clustering algorithm to cluster very large categorical data sets in data mining. In: Research Issues on Data Mining and Knowledge Discovery, pp. 1\u20138 (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Data Mining. Applications and Theoretical Aspects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03067-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T09:24:45Z","timestamp":1558430685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03067-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030666","9783642030673"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03067-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}