Nonparametric Bayesian Modeling for Automated Database Schema Matching

July 06, 2015 Β· Declared Dead Β· πŸ› International Conference on Machine Learning and Applications

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Erik M. Ferragut, Jason Laska arXiv ID 1507.01443 Category cs.IR: Information Retrieval Cross-listed cs.DB Citations 2 Venue International Conference on Machine Learning and Applications Last Checked 4 months ago
Abstract
The problem of merging databases arises in many government and commercial applications. Schema matching, a common first step, identifies equivalent fields between databases. We introduce a schema matching framework that builds nonparametric Bayesian models for each field and compares them by computing the probability that a single model could have generated both fields. Our experiments show that our method is more accurate and faster than the existing instance-based matching algorithms in part because of the use of nonparametric Bayesian models.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted