Schema Matching Learning Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "“" to "“") |
m (Text replacement - ". ----" to ". ----") |
||
| Line 1: | Line 1: | ||
A [[Schema Matching Learning Algorithm]] is a [[Schema Matching Algorithm]] that uses a [[Learning Algorithm]]. | A [[Schema Matching Learning Algorithm]] is a [[Schema Matching Algorithm]] that uses a [[Learning Algorithm]]. | ||
* <B>See:</B> [[Schema Matching Task]]. | * <B>See:</B> [[Schema Matching Task]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 20:41, 23 September 2021
A Schema Matching Learning Algorithm is a Schema Matching Algorithm that uses a Learning Algorithm.
- See: Schema Matching Task.
References
2001
- (Doan et al., 2001) ⇒ AnHai Doan, Pedro Domingos, and Alon Y. Halevy. (2001). “Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach.” In: ACM SIGMOD Record, 30(2). doi:10.1145/376284.375731