File Download
  Links for fulltext
     (May Require Subscription)
  • Find via Find It@HKUL
Supplementary

Conference Paper: Explore or Exploit? Effective Strategies for Disambiguating Large Databases

TitleExplore or Exploit? Effective Strategies for Disambiguating Large Databases
Authors
Issue Date2010
PublisherVery Large Data Bases (VLDB). The Proceedings' web site is located at http://www.vldb.org/pvldb/index.html
Citation
The 36th International Conference on Very Large Data Bases (VLDB), Singapore, 13 - 17 September 2010. In Proceedings of the VLDB Endowment, 2010, v. 3 n. 1, p. 815-825 How to Cite?
AbstractData 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 Explore-Exploit (or EE) algorithm, which gathers valuable information during the cleaning process to determine how the remaining cleaning budget should be invested. We also study how to fine-tune the parameters of EE in order to achieve optimal cleaning effectiveness. Experimental evaluations on real and synthetic datasets validate the effectiveness and effi- ciency of our approaches.
Persistent Identifierhttp://hdl.handle.net/10722/224244
ISSN
2023 Impact Factor: 2.6
2023 SCImago Journal Rankings: 2.666

 

DC FieldValueLanguage
dc.contributor.authorCheng, CK-
dc.contributor.authorLo, E-
dc.contributor.authorYang, X-
dc.contributor.authorLuk, MH-
dc.contributor.authorLi, X-
dc.contributor.authorXie, X-
dc.date.accessioned2016-03-30T07:06:46Z-
dc.date.available2016-03-30T07:06:46Z-
dc.date.issued2010-
dc.identifier.citationThe 36th International Conference on Very Large Data Bases (VLDB), Singapore, 13 - 17 September 2010. In Proceedings of the VLDB Endowment, 2010, v. 3 n. 1, p. 815-825-
dc.identifier.issn2150-8097-
dc.identifier.urihttp://hdl.handle.net/10722/224244-
dc.description.abstractData 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 Explore-Exploit (or EE) algorithm, which gathers valuable information during the cleaning process to determine how the remaining cleaning budget should be invested. We also study how to fine-tune the parameters of EE in order to achieve optimal cleaning effectiveness. Experimental evaluations on real and synthetic datasets validate the effectiveness and effi- ciency of our approaches.-
dc.languageeng-
dc.publisherVery Large Data Bases (VLDB). The Proceedings' web site is located at http://www.vldb.org/pvldb/index.html-
dc.relation.ispartofVery Large Data Bases (VLDB) Conference-
dc.titleExplore or Exploit? Effective Strategies for Disambiguating Large Databases-
dc.typeConference_Paper-
dc.identifier.emailCheng, CK: ckcheng@cs.hku.hk-
dc.identifier.emailYang, X: sailingwood@gmail.com-
dc.identifier.emailLi, X: thinking.xiang@gmail.com-
dc.identifier.emailXie, X: xiexike@hotmail.com-
dc.identifier.authorityCheng, CK=rp00074-
dc.description.naturelink_to_OA_fulltext-
dc.identifier.hkuros175921-
dc.identifier.volume3-
dc.identifier.issue1-
dc.identifier.spage815-
dc.identifier.epage825-
dc.publisher.placeSingapore-
dc.publisher.placeUnited States-
dc.identifier.issnl2150-8097-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats