Download presentation
Presentation is loading. Please wait.
1
Learning to Match Ontologies on the Semantic Web AnHai Doan Jayant Madhavan Robin Dhamankar Pedro Domingos Alon Halevy
2
Glue Identifies Mappings between websites Uses Machine Learning Uses Common Sense Knowledge Domain Constraints
3
Motivation Data comes from Different Ontologies Answers come from multiple web pages Manual: very tedious, error prone, not very scalable
4
Outline Overview of GLUE GLUE Architecture Case Studies CGLUE Case Studies Conclusion Assessment
5
Overview Assumes 2 Ontologies 1-1 Matching Similarity between two Concepts Computing Joint Distribution P(A,B), P(A, ~B), P(~A,B), P(~A,~B) Machine Learning Multistrategy Learning Exploiting Domain Constraints Data Instances
6
Overview Relaxation Labeler Similarity Estimator Meta Learner M L1L1 LkLk Taxonomy 0 1 Taxonomy 0 2 Joint Distributions Similarity function Similarity Matrix Common knowledge Domain constraints Mappings for Taxonomies …………
7
Distribution Estimator Meta Learner M Base Learner L 1 ………… Base Learner L k Taxonomy 0 1 Taxonomy 0 2 Joint Distributions
8
Distribution Estimator R DCA F E t1,t2 t3,t4 t5 t6,t7 t1,t2,t3,t4 t5,t6,t7 Trained Learner L
9
Distribution Estimator G H B JI s2,s3 s4 s5,s6 s1,s2,s3,s4 s5,s6 L s1
10
Distribution Estimator s1,s3 s5s6 s2,s4
11
Multistrategy Learning Base Learners Content Learner Frequency Naïve Bayes Name Learner Full Name Specific and Descriptive Element MetaLearner
12
Combines the base learners Gives learner weight User Input
13
Joint Distributions Similarity function Similarity Estimator Similarity Matrix Similarity Estimator
14
Applies Function From User Jaccard-sim Outputs a matrix between concepts
15
Where are we? Find Similarities Compute Similarities Satisfy Constraints
16
Relaxation Labeler Similarity Matrix Common knowledge Domain constraints Mappings for Taxonomies
17
Constraints Domain-Independent General Knowledge Domain-Dependent Interaction between two nodes Model each as a feature f()
18
Domain Independent
19
Relaxation Labeler Searches for best mapping given constraints Labels are influenced by it “neighborhood” Performs local optimization
20
Local Optimization 1. Assigns initial labels 2. Performs Optimization 3. Uses a formula to change a label 4. Repeat 2-3
21
Local Optimization Node in taxonomy O 1 Label in taxonomy O 2 Everything we know Other label assignments to all Nodes besides X
22
Local Optimization
23
Where are we? Relaxation Labeler Similarity Estimator Meta Learner M L1L1 LkLk Taxonomy 0 1 Taxonomy 0 2 Joint Distributions Similarity function Similarity Matrix Common knowledge Domain constraints Mappings for Taxonomies …………
24
Case Study University Catalogs Business Profiles For Each one Entire set of data instances Cleaned it up
25
Results
26
Improvements Insufficient Training Data Local Optimization Additional Base Learners Ambiguous Best Match
27
CGLUE
28
Beam Search Uses structure and data No relaxation labeling (no constraints)
29
CGLUE Case Study
30
Improvements Incorporate Domain Constraints Object Identification
31
Conclusion Semantic Similarity Multistategy Learning Relaxation Labeling CGLUE
32
Assessment Data Instances Additional Sites? CGLUE Future Work
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.