{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T05:20:43Z","timestamp":1672291243356},"reference-count":13,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2013,8,28]]},"abstract":"<jats:p>Rapidly making sense of, analyzing, and extracting useful information from large and complex data is a grand challenge. A user tasked with meeting this challenge is often befuddled with questions on where and how to begin to understand the relevant characteristics of such data. Real-world problem scenarios often involve scalability limitations and time constraints.<\/jats:p>\n          <jats:p>In this paper we present an incremental interactive data analysis system as a step to address this challenge. This system builds on recent progress in the fields of interactive data exploration, locality sensitive hashing, knowledge caching, and graph visualization. Using visual clues based on rapid incremental estimates, a user is provided a multi-level capability to probe and interrogate the intrinsic structure of data. Throughout the interactive process, the output of previous probes can be used to construct increasingly tight coherence estimates across the parameter space, providing strong hints to the user about promising analysis steps to perform next.<\/jats:p>\n          <jats:p>We present examples, interactive scenarios, and experimental results on several synthetic and real-world datasets which show the effectiveness and efficiency of our approach. The implications of this work are quite broad and can impact fields ranging from top-k algorithms to data clustering and from manifold learning to similarity search.<\/jats:p>","DOI":"10.14778\/2536274.2536305","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1318-1321","source":"Crossref","is-referenced-by-count":0,"title":["PLASMA-HD"],"prefix":"10.14778","volume":"6","author":[{"given":"David","family":"Fuhry","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, Columbus, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, Columbus, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venu","family":"Satuluri","sequence":"additional","affiliation":[{"name":"Twitter and Department of Computer Science and Engineering, The Ohio State University, Columbus, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnab","family":"Nandi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, Columbus, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Ohio State University, Columbus, OH"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,8]]},"reference":[{"issue":"1","key":"e_1_2_1_1_1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/1327452.1327494","article-title":"Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions","volume":"51","author":"Andoni A.","year":"2008","journal-title":"Commun. ACM"},{"key":"e_1_2_1_2_1","volume-title":"WWW'07","author":"Bayardo R. J.","year":"2007"},{"key":"e_1_2_1_3_1","volume-title":"KDD","author":"Ghoting A.","year":"2006"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/342009.335415","volume-title":"SIGMOD'00","author":"Korn F.","year":"2000"},{"key":"e_1_2_1_5_1","volume-title":"ICDE'08","author":"Lieberman M. D.","year":"2008"},{"issue":"8","key":"e_1_2_1_6_1","first-page":"704","article-title":"V-smart-join: a scalable mapreduce framework for all-pair similarity joins of multisets and vectors","volume":"5","author":"Metwally A.","year":"2012","journal-title":"PVLDB"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/312129.312238","volume-title":"KDD'99","author":"Nag B.","year":"1999"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/319950.320010","volume-title":"CIKM'99","author":"Parthasarathy S.","year":"1999"},{"issue":"2","key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/568271.223794","article-title":"Nearest neighbor queries","volume":"24","author":"Roussopoulos N.","year":"1995","journal-title":"SIGMOD Rec."},{"key":"e_1_2_1_10_1","volume-title":"Jan.","author":"Satuluri V.","year":"2012"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1145\/1557019.1557111","volume-title":"KDD'09","author":"Tsourakakis C. E.","year":"2009"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/1376616.1376663","volume-title":"SIGMOD'08","author":"Wang N.","year":"2008"},{"key":"e_1_2_1_13_1","volume-title":"ICDE'12","author":"Zhang Y."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2536274.2536305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:50:38Z","timestamp":1672224638000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2536274.2536305"}},"subtitle":["probing the lattice structure and makeup of high-dimensional data"],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2013,8,28]]}},"alternative-id":["10.14778\/2536274.2536305"],"URL":"https:\/\/doi.org\/10.14778\/2536274.2536305","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2013,8]]}}}