Schema Matching Learning Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
No edit summary
 
m (Text replacement - ". ----" to ". ----")
 
(11 intermediate revisions by 2 users not shown)
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><U>See</U>:</B> [[Schema Matching Task]].
* <B>See:</B> [[Schema Matching Task]].
 
----
----
----
----
==References ==


===2001===
== References ==
* ([[2001_ReconcilingSchemasOfDispDatSour|Doan & al, 2001]]) &rArr; [[AnHai Doan]], [[Pedro Domingos]], and [[Alon Y. Halevy]]. (2001). "[http://www.cs.washington.edu/homes/pedrod/papers/sigmod01.pdf Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach]." In: ACM [[SIGMOD Record]], 30(2). [http://dx.doi.org/10.1145/376284.375731 doi:10.1145/376284.375731]
 
=== 2001 ===
* ([[2001_ReconcilingSchemasOfDispDatSour|Doan et al., 2001]]) [[AnHai Doan]], [[Pedro Domingos]], and [[Alon Y. Halevy]]. ([[2001]]). [http://www.cs.washington.edu/homes/pedrod/papers/sigmod01.pdf Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach].In: ACM [[SIGMOD Record]], 30(2). [http://dx.doi.org/10.1145/376284.375731 doi:10.1145/376284.375731]


----
----

Latest revision as of 20:41, 23 September 2021