{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T22:18:09Z","timestamp":1780957089303,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1562849.1562859","type":"proceedings-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T17:34:19Z","timestamp":1247074459000},"page":"83-92","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Heidi matrix"],"prefix":"10.1145","author":[{"given":"Soujanya","family":"Vadapalli","sequence":"first","affiliation":[{"name":"Centre for Data Engineering, IIIT-Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kamalakar","family":"Karlapalem","sequence":"additional","affiliation":[{"name":"Centre for Data Engineering, IIIT-Hyderabad, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-44503-X_27","volume-title":"On the surprising behavior of distance metrics in high dimensional space","author":"Aggarwal C. C.","year":"2001","unstructured":"C. C. Aggarwal , A. Hinneburg , and D. A. Keim . On the surprising behavior of distance metrics in high dimensional space . In Lecture Notes in Computer Science , pages 420 -- 434 , 2001 . C. C. Aggarwal, A. Hinneburg, and D. A. Keim. On the surprising behavior of distance metrics in high dimensional space. In Lecture Notes in Computer Science, pages 420--434, 2001."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304188"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345451"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03567-2_17"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033430"},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"Generalized association plots for information visualization: The applications of the convergence of iteratively formed correlation matrices","author":"Chen C.-H.","year":"2002","unstructured":"C.-H. Chen . Generalized association plots for information visualization: The applications of the convergence of iteratively formed correlation matrices . volume 12 , pages 1 -- 23 . Statistica Sinica , 2002 . C.-H. Chen. Generalized association plots for information visualization: The applications of the convergence of iteratively formed correlation matrices. volume 12, pages 1--23. Statistica Sinica, 2002."},{"key":"e_1_3_2_1_7_1","first-page":"226","volume-title":"Proc. ACM SIGMOD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H. P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proc. ACM SIGMOD , pages 226 -- 231 , 1996 . M. Ester, H. P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. ACM SIGMOD, pages 226--231, 1996."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.23"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.9"},{"key":"e_1_3_2_1_10_1","volume-title":"COMAD","author":"Vennam J.","year":"2005","unstructured":"J. Vennam and S. Vadapalli . Syndeca: Synthetic generation of datasets to evaluate clustering algorithms . In COMAD , 2005 . J. Vennam and S. Vadapalli. Syndeca: Synthetic generation of datasets to evaluate clustering algorithms. In COMAD, 2005."}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","VisMaster, a European FP7 Coordination Action Project focused on Visual Analytics","PASCAL2 - Pattern Analysis, Statistical Modelling and Computational Learning","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","National Visualization and Analytics Center (NVAC)","Helsinki Institute for Information Technology HIIT","Danube University Krems, Departement of Information and Knowledge Engineering (DUK)"]},"container-title":["Proceedings of the ACM SIGKDD Workshop on Visual Analytics and Knowledge Discovery: Integrating Automated Analysis with Interactive Exploration"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1562849.1562859","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1562849.1562859","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:07Z","timestamp":1750249387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1562849.1562859"}},"subtitle":["nearest neighbor driven high dimensional data visualization"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":10,"alternative-id":["10.1145\/1562849.1562859","10.1145\/1562849"],"URL":"https:\/\/doi.org\/10.1145\/1562849.1562859","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}