{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T23:48:10Z","timestamp":1769212090474,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,14]],"date-time":"2005-06-14T00:00:00Z","timestamp":1118707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,14]]},"DOI":"10.1145\/1066157.1066211","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"467-478","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":48,"title":["CURLER"],"prefix":"10.1145","author":[{"given":"Anthony K. H.","family":"Tung","sequence":"first","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xu","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beng Chin","family":"Ooi","sequence":"additional","affiliation":[{"name":"National University of Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"506","volume-title":"Proc. of the 25th Int. Conf. on Very Large Data Bases","author":"Hinneburg A.","year":"1999","unstructured":"Hinneburg A. and Keim D . Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering . In Proc. of the 25th Int. Conf. on Very Large Data Bases , pages 506 - 517 , 1999 .]] Hinneburg A. and Keim D. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proc. of the 25th Int. Conf. on Very Large Data Bases, pages 506 - 517, 1999.]]"},{"key":"e_1_3_2_1_2_1","volume-title":"Proc. of the Int. Conf. on Knowledge Discovery and Data Mining","author":"Hinneburg A.","year":"1998","unstructured":"Hinneburg A. and Keim D. A . An efficient approach to cluster in large multimedia databases with noise . In Proc. of the Int. Conf. on Knowledge Discovery and Data Mining , 1998 .]] Hinneburg A. and Keim D. A. An efficient approach to cluster in large multimedia databases with noise. In Proc. of the Int. Conf. on Knowledge Discovery and Data Mining, 1998.]]"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335383"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_3_2_1_6_1","volume-title":"UCI repository of machine learning databases","author":"Blake C. J.","year":"1998","unstructured":"C. L. Blake and C. J. Merz . UCI repository of machine learning databases , 1998 .]] C. L. Blake and C. J. Merz. UCI repository of machine learning databases, 1998.]]"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007620"},{"key":"e_1_3_2_1_8_1","first-page":"9","volume-title":"Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98)","author":"Bradley U.","year":"1998","unstructured":"P. Bradley , U. Fayyad , and C. Reina . Scaling clustering algorithms to large databases . In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98) , pages 9 -- 15 , Aug. 1998 .]] P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD'98), pages 9--15, Aug. 1998.]]"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304188"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312199"},{"key":"e_1_3_2_1_11_1","first-page":"226","volume-title":"Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96)","author":"Ester H.-P.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases . In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96) , pages 226 -- 231 , Portland, Oregon , Aug. 1996 .]] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases. In Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining (KDD'96), pages 226--231, Portland, Oregon, Aug. 1996.]]"},{"key":"e_1_3_2_1_12_1","first-page":"203","volume-title":"Information Processing in Cells and Tissues","author":"Patrik D","year":"1998","unstructured":"Patrik D Haeseleer , Xiling Wen, Stefanie Fuhrman , and Roland Somogyi. Mining the gene expression matrix: Inferring gene relationships from large scale gene expression data . Information Processing in Cells and Tissues , pages 203 -- 212 , 1998 .]] Patrik D Haeseleer, Xiling Wen, Stefanie Fuhrman, and Roland Somogyi. Mining the gene expression matrix: Inferring gene relationships from large scale gene expression data. Information Processing in Cells and Tissues, pages 203--212, 1998.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.283.5398.83"},{"key":"e_1_3_2_1_14_1","volume-title":"Morgan Kaufmann","author":"Han J.","year":"2001","unstructured":"Han J. and Kamber M . Data mining concepts and techniques . Morgan Kaufmann , August 2001 .]] Han J. and Kamber M. Data mining concepts and techniques. Morgan Kaufmann, August 2001.]]"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/2532201"},{"key":"e_1_3_2_1_16_1","volume-title":"Principal Component Analysis","author":"Jolliffe","year":"2002","unstructured":"I. T. Jolliffe . Principal Component Analysis . Springer-Verlag , 2002 .]] I. T. Jolliffe. Principal Component Analysis. Springer-Verlag, 2002.]]"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"Kaufman L.","year":"1990","unstructured":"Kaufman L. and Rousseeuw P. J . Finding Groups in Data: An Introduction to Cluster Analysis . Wiley-Interscience , 1990 .]] Kaufman L. and Rousseeuw P. J. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley-Interscience, 1990.]]"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564739"},{"key":"e_1_3_2_1_19_1","volume-title":"A fast improvement to the em algorithm on its own terms. JRSS(B), 51:127--138","author":"Roy","year":"1989","unstructured":"J. Roy . A fast improvement to the em algorithm on its own terms. JRSS(B), 51:127--138 , 1989 .]] J. Roy. A fast improvement to the em algorithm on its own terms. JRSS(B), 51:127--138, 1989.]]"},{"key":"e_1_3_2_1_20_1","first-page":"2323","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Joshua B.","year":"2000","unstructured":"Joshua B. Tenenbaum , Vin de Silva, and John C. Langford . A global geometric framework for nonlinear dimensionality reduction . Science , 290 : 2323 -- 2326 , 2000 .]] Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2323--2326, 2000.]]","journal-title":"Science"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/645504.656273"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656387"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. 1998 Int. Conf. on Data Engineering","author":"Ester M.","year":"1998","unstructured":"XU X., Ester M. , Kriegel H-P. , and Sander J . A distributed-based clustering algorithm for mining in large spatial databases . In Proc. 1998 Int. Conf. on Data Engineering , 1998 .]] XU X., Ester M., Kriegel H-P., and Sander J. A distributed-based clustering algorithm for mining in large spatial databases. In Proc. 1998 Int. Conf. on Data Engineering, 1998.]]"}],"event":{"name":"SIGMOD\/PODS05: International Conference on Management of Data and Symposium on Principles Database and Systems","location":"Baltimore Maryland","acronym":"SIGMOD\/PODS05","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2005 ACM SIGMOD international conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066157.1066211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:19Z","timestamp":1750262899000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066157.1066211"}},"subtitle":["finding and visualizing nonlinear correlation clusters"],"short-title":[],"issued":{"date-parts":[[2005,6,14]]},"references-count":23,"alternative-id":["10.1145\/1066157.1066211","10.1145\/1066157"],"URL":"https:\/\/doi.org\/10.1145\/1066157.1066211","relation":{},"subject":[],"published":{"date-parts":[[2005,6,14]]},"assertion":[{"value":"2005-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}