{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T23:01:04Z","timestamp":1746918064354},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p>\n            Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to \"clean\", or remove, ambiguities from these databases. For example, the GPS location of a user is inexact due to measurement errors, but context information (e.g., what a user is doing) can be used to reduce the imprecision of the location value. In order to obtain a database with a higher quality, we study how to disambiguate a database by appropriately selecting candidates to clean. This problem is challenging because cleaning involves a cost, is limited by a budget, may fail, and may not remove all ambiguities. Moreover, the statistical information about how likely database objects can be cleaned may not be precisely known. We tackle these challenges by proposing two types of algorithms. The first type makes use of greedy heuristics to make sensible decisions; however, these algorithms do not make use of cleaning information and require user input for parameters to achieve high cleaning effectiveness. We propose the\n            <jats:italic>Explore-Exploit<\/jats:italic>\n            (or\n            <jats:italic>EE<\/jats:italic>\n            ) algorithm, which gathers valuable information during the cleaning process to determine how the remaining cleaning budget should be invested.\n          <\/jats:p>\n          <jats:p>\n            We also study how to fine-tune the parameters of\n            <jats:italic>EE<\/jats:italic>\n            in order to achieve optimal cleaning effectiveness. Experimental evaluations on real and synthetic datasets validate the effectiveness and efficiency of our approaches.\n          <\/jats:p>","DOI":"10.14778\/1920841.1920945","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"815-825","source":"Crossref","is-referenced-by-count":7,"title":["Explore or exploit?"],"prefix":"10.14778","volume":"3","author":[{"given":"Reynold","family":"Cheng","sequence":"first","affiliation":[{"name":"University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Lo","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuan S.","family":"Yang","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Hay","family":"Luk","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xike","family":"Xie","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.35"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.166990"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-3711-7","volume-title":"Bandit Problems: Sequential Allocation of Experiments","author":"Berry D.","year":"1985","unstructured":"D. Berry and B. Fristedt . Bandit Problems: Sequential Allocation of Experiments . Chapman and Hall , 1985 . D. Berry and B. Fristedt. Bandit Problems: Sequential Allocation of Experiments. Chapman and Hall, 1985."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687695"},{"key":"e_1_2_1_5_1","volume-title":"NIPS","author":"Chakrabarti D.","year":"2008","unstructured":"D. Chakrabarti , R. Kumar , F. Radlinski , and E. Upfal . Mortal Multi-Armed Bandits . In NIPS , 2008 . D. Chakrabarti, R. Kumar, F. Radlinski, and E. Upfal. Mortal Multi-Armed Bandits. In NIPS, 2008."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69497-7_31"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453935"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872823"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316764"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316741"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287422"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.9"},{"key":"e_1_2_1_13_1","volume-title":"Progress in Statistics","author":"Gittins J. C.","year":"1974","unstructured":"J. C. Gittins and D. M. Jones . A dynamic allocation index for the sequential design of experiments . In Progress in Statistics , 1974 . J. C. Gittins and D. M. Jones. A dynamic allocation index for the sequential design of experiments. In Progress in Statistics, 1974."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140104.1140114"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066677.1066823"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2005.17"},{"key":"e_1_2_1_17_1","volume-title":"VLDB","author":"Mar O.","year":"2006","unstructured":"O. Mar , A. Sarma , A. Halevy , and J. Widom . ULDBs: databases with uncertainty and lineage . In VLDB , 2006 . O. Mar, A. Sarma, A. Halevy, and J. Widom. ULDBs: databases with uncertainty and lineage. In VLDB, 2006."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872825"},{"key":"e_1_2_1_19_1","volume-title":"Temporal Databases: Research and Practice.","author":"Sistla P.","year":"1998","unstructured":"P. Sistla Querying the uncertain position of moving objects . In Temporal Databases: Research and Practice. 1998 . P. Sistla et al. Querying the uncertain position of moving objects. In Temporal Databases: Research and Practice. 1998."},{"key":"e_1_2_1_20_1","volume-title":"VLDB","author":"Pei J.","year":"2007","unstructured":"J. Pei , B. Jiang , X. Lin , and Y. Yuan . Probabilistic skylines on uncertain data . In VLDB , 2007 . J. Pei, B. Jiang, X. Lin, and Y. Yuan. Probabilistic skylines on uncertain data. In VLDB, 2007."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367907"},{"key":"e_1_2_1_22_1","unstructured":"Stanford University Infolab. Crime dataset. http:\/\/infolab.stanford.edu\/trio\/code\/crime_data.triql.  Stanford University Infolab. Crime dataset. http:\/\/infolab.stanford.edu\/trio\/code\/crime_data.triql."},{"key":"e_1_2_1_23_1","unstructured":"Stanford University Infolab. Moving rating database. http:\/\/infolab.stanford.edu\/trio\/code\/movie_data.triql.  Stanford University Infolab. Moving rating database. http:\/\/infolab.stanford.edu\/trio\/code\/movie_data.triql."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1920841.1920945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:37:14Z","timestamp":1672227434000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1920841.1920945"}},"subtitle":["effective strategies for disambiguating large databases"],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.14778\/1920841.1920945"],"URL":"https:\/\/doi.org\/10.14778\/1920841.1920945","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}