The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Reconciling schemas of disparate data sources: a machine-learning approach
Abstract
A data-integration system provides access to a multitude of data sources through a single mediated schema. A key bottleneck in building such systems has been the laborious manual construction of semantic mappings between the source schemas and the mediated schema. We describe LSD, a system that employs and extends current machine-learning techniques to semi-automatically find such mappings. LSD first asks the user to provide the semantic mappings for a small set of data sources, then uses these mappings together with the sources to train a set of learners. Each learner exploits a different type of information either in the source schemas or in their data. Once the learners have been trained, LSD finds semantic mappings for a new data source by applying the learners, then combining their predictions using a meta-learner. To further improve matching accuracy, we extend machine learning techniques so that LSD can incorporate domain constraints as an additional source of knowledge, and develop a novel learner that utilizes the structural information in XML documents. Our approach thus is distinguished in that it incorporates multiple types of knowledge. Importantly, its architecture is extensible to additional learners that may exploit new kinds of information. We describe a set of experiments on several real-world domains, and show that LSD proposes semantic mappings with a high degree of accuracy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Self-citationQuerying Heterogeneous Information Sources Using Source Descriptions
Levy, A. Y., Rajaraman, A., & Ordille, J. J. (1996) · Very Large Data Bases · Cited by 1,091
The TSIMMIS project: Integration of heterogeneous information sources
Chawathe, S. S., García-Molina, H., Hammer, J., Ireland, K., Papakonstantinou, Y., Ullman, J. D., & Widom, J. (1994) · 情報処理学会研究報告データベースシステム(DBS) · Cited by 914
The TSIMMIS Approach to Mediation: Data Models and Languages
Garcia-Molina, H., Papakonstantinou, Y., Quass, D., Rajaraman, A., Sagiv, Y., Ullman, J., Vassalos, V., & Widom, J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008683107812 · Cited by 829
Issues in Stacked Generalization
Ting, K. M., & Witten, I. H. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.594 · Cited by 576
Wrapper induction: Efficiency and expressiveness
Kushmerick, N. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00100-9 · Cited by 553
Issues in Stacked Generalization
Ting, K. M., & Witten, I. H. (1999) · Cited by 521
Optimizing Queries Across Diverse Data Sources
Haas, L. M., Kossmann, D., Wimmers, E. L., & Yang, J. (1997) · Very Large Data Bases · Cited by 456
Schema Mapping as Query Discovery
Miller, R. J., Haas, L. M., & Hernández, M. A. (2000) · Very Large Data Bases · Cited by 438
An adaptive query execution system for data integration
Ives, Z. G., Florescu, D., Friedman, M., Levy, A. Y., & Weld, D. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304209 · Cited by 396
Using Schema Matching to Simplify Heterogeneous Data Translation
Milo, T., & Zohar, S. (1998) · Cited by 385
Machine Learning for Information Extraction in Informal Domains
Freitag, D. (2000) · Machine Learning · doi:10.1023/a:1007601113994 · Cited by 350
Li, W.-S., & Clifton, C. (2000) · Data & Knowledge Engineering · doi:10.1016/s0169-023x(99)00044-0 · Cited by 347
On Matching Schemas Automatically
Rahm, E., & Bernstein, P. A. (2001) · Cited by 127
Joins that generalize: text classification using WHIRL
Cohen, W. W., & Hirsh, H. (1998) · Cited by 104
A classifier for semi-structured documents
Yi, J., & Sundaresan, N. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347164 · Cited by 93
Experience with a Combined Approach to Attribute-Matching Across Heterogeneous Databases
Clifton, C., Housman, E., & Rosenthal, A. S. (1998) · Springer eBooks · doi:10.1007/978-0-387-35300-5_18 · Cited by 74
Proverb: the probabilistic cruciverbalist
Keim, G. A., Shazeer, N., Littman, M. L., Agarwal, S., Cheves, C. M., Fitzgerald, J., Grosland, J., Jiang, F., Pollard, S., & Weinmeister, K. (1999) · Cited by 35
Constructive induction using fragmentary knowledge
Donoho, S. K., & Rendell, L. A. (1996) · International Conference on Machine Learning · Cited by 13
Cited by
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
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
Ontology Matching: State of the Art and Future Challenges
Shvaiko, P., & Euzenat, J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.253 · Cited by 1,148
A Survey of Schema-Based Matching Approaches
Shvaiko, P., & Euzenat, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11603412_5 · Cited by 1,147
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
Metadata
- Authors
- Doan, A., Domingos, P., & Halevy, A. Y.
- Venue
- Proceedings of the 2001 ACM SIGMOD international conference on Management of data
- Publisher
- ACM
- Published
- 2001-05
- Pages
- 509-520
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2150365753
- Cited by
- 733
- References
- 21
- FWCI
- 34.63
- 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.