The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
An interactive clustering-based approach to integrating source query interfaces on the deep Web
Abstract
An increasing number of data sources now become available on the Web, but often their contents are only accessible through query interfaces. For a domain of interest, there often exist many such sources with varied coverage or querying capabilities. As an important step to the integration of these sources, we consider the integration of their query interfaces. More specifically, we focus on the crucial step of the integration: accurately matching the interfaces. While the integration of query interfaces has received more attentions recently, current approaches are not sufficiently general: (a) they all model interfaces with flat schemas; (b) most of them only consider 1:1 mappings of fields over the interfaces; (c) they all perform the integration in a blackbox-like fashion and the whole process has to be restarted from scratch if anything goes wrong; and (d) they often require laborious parameter tuning. In this paper, we propose an interactive, clustering-based approach to matching query interfaces. The hierarchical nature of interfaces is captured with ordered trees. Varied types of complex mappings of fields are examined and several approaches are proposed to effectively identify these mappings. We put the human integrator back in the loop and propose several novel approaches to the interactive learning of parameters and the resolution of uncertain mappings. Extensive experiments are conducted and results show that our approach is highly effective.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Measures of the Amount of Ecologic Association Between Species
Dice, L. R. (1945) · Ecology · doi:10.2307/1932409 · Cited by 11,874
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
WordNet: An Electronic Lexical Database
(1998) · The MIT Press eBooks · doi:10.7551/mitpress/7287.001.0001 · Cited by 4,857
A survey of approaches to automatic schema matching
Rahm, E., & Bernstein, P. A. (2001) · The VLDB Journal · doi:10.1007/s007780100057 · Cited by 3,352
Federated database systems for managing distributed, heterogeneous, and autonomous databases
Sheth, A. P., & Larson, J. A. (1990) · ACM Computing Surveys · doi:10.1145/96602.96604 · Cited by 2,476
Accessibility of information on the web
Lawrence, S., & Giles, C. L. (1999) · Nature · doi:10.1038/21987 · Cited by 1,349
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
Melnik, S., Garcia-Molina, H., & Rahm, E. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994702 · Cited by 1,341
Generic Schema Matching with Cupid
Madhavan, J., Bernstein, P. A., & Rahm, E. (2001) · Cited by 1,296
COMA — A system for flexible combination of schema matching approaches
Do, H.-H., & Rahm, E. (2002) · VLDB '02: Proceedings of the 28th International Conference on Very Large Databases · doi:10.1016/b978-155860869-6/50060-3 · Cited by 1,067
Reconciling schemas of disparate data sources: a machine-learning approach
Doan, A., Domingos, P., & Halevy, A. Y. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375731 · Cited by 733
Self-citationInteractive deduplication using active learning
Sarawagi, S., & Bhamidipaty, A. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775087 · Cited by 692
Potter's Wheel: An Interactive Data Cleaning System
Raman, V., & Hellerstein, J. L. (2001) · Cited by 492
Schema Mapping as Query Discovery
Miller, R. J., Haas, L. M., & Hernández, M. A. (2000) · Very Large Data Bases · Cited by 438
A theory of attributed equivalence in databases with application to schema integration
Larson, J. A., Navathe, S. B., & Elmasri, R. (1989) · IEEE Transactions on Software Engineering · doi:10.1109/32.16605 · Cited by 378
Li, W.-S., & Clifton, C. (2000) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(99)00044-0 · Cited by 347
Statistical schema matching across web query interfaces
He, B., & Chang, K. C.-C. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872784 · Cited by 320
Learning object identification rules for information integration
Tejada, S., Knoblock, C. A., & Minton, S. (2001) · Information Systems · doi:10.1016/s0306-4379(01)00042-4 · Cited by 310
Matching Theory (North-Holland mathematics studies)
Lovász, L. (1986) · Elsevier eBooks · Cited by 280
Merging Models Based on Given Correspondences
Pottinger, R. A., & Bernstein, P. A. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50081-1 · Cited by 273
Data integration using similarity joins and a word-based information representation language
Cohen, W. W. (2000) · ACM Transactions on Information Systems · doi:10.1145/352595.352598 · Cited by 223
He, H., Meng, W., Yu, C. T., & Wu, Z. (2003) · Elsevier eBooks · doi:10.1016/b978-012722442-8/50039-2 · Cited by 145
Self-citationImproving Short-Text Classification using Unlabeled Data for Classification Problems
Zelikovitz, S., & Hirsh, H. (2000) · International Conference on Machine Learning · Cited by 47
Cited by
A Survey of Web Information Extraction Systems
Chang, C.-H., Kayed, M., Girgis, M. R., & Shaalan, K. F. (2006) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2006.152 · Cited by 793
Semantic-integration research in the database community: A brief survey
Doan, A., & Halevy, A. Y. (2005) · doi:10.1609/aimag.v26i1.1801 · Cited by 421
Self-citation
Metadata
- Authors
- Wu, W., Yu, C., Doan, A., & Meng, W.
- Venue
- Proceedings of the 2004 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2004-06-13
- Pages
- 95-106
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2117058208
- Cited by
- 273
- References
- 25
- FWCI
- 17.21
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.