Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto
description
Transcript of Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto
![Page 1: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/1.jpg)
Date: 2014/05/06Author: Michael Schuhmacher, Simon Paolo PonzettoSource: WSDM’14Advisor: Jia-ling KohSpeaker: Chen-Yu Huang
Knowledge-based Graph Document
Modeling
![Page 2: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/2.jpg)
2
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 3: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/3.jpg)
3
•Recent years have seen great deal of work on developing wide-coverage semantic technologies and method embedding semantic models.•Semantic information and knowledge-rich approaches can be used effectively for IR and NLP tasks.
Introduction
![Page 4: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/4.jpg)
4
•Not exploit the relational knowledge and network structure encoded within wide-coverage knowledge bases.•Propose a graph-based semantic model for representing document content, relies on the use of a semantic network.
Introduction
![Page 5: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/5.jpg)
5
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 6: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/6.jpg)
6
DBpedia•A community effort to extract structured information from Wikipedia.•Provide a wide-coverage knowledge base with many explicit semantic relations between entities.•RDF triple in DBpedia : subject, predicate and object
![Page 7: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/7.jpg)
7
Semantic graph construction•Create a labeled directed graph G = (V, E)•Nodes V : all input concepts C • connect: semantic relations R• Edges E : (v, r, v)• Expand : perform a depth-first search along the DBpedia graph and add all outgoing relations r•Maximal length L = 2
Dylan played Mozambique atMonterey right before Cash.
![Page 8: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/8.jpg)
8
•Weights are meant to capture the degree of associativity between concepts in the graph.•Assumption that specificity is a good proxy for relevance.• Information Content(IC)
• P(ωPred) : the probability that the random variable XPred describing the type of edge• EX :
Semantic relation weighting
rdf:type dbo:associatedBand
![Page 9: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/9.jpg)
9
• Joint Information Content(joint IC)
•EX:
•Combined Information Content(combIC)
•EX:
Semantic relation weighting
foef:Person dbo:MusicalArtist
db:American folk music
![Page 10: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/10.jpg)
10
• Information Content and Pointwise Mutual Information (IC+PMI)•PMI : measure the mutual dependence between the two
variable
Semantic relation weighting
![Page 11: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/11.jpg)
11
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 12: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/12.jpg)
12
•Three main steps:•Build a semantic graph•Weight graph edges by edge cost
• W(e) : weighting function
• Wmax : globally highest possible weight in DBpedia graph
Graph-based entity ranking
![Page 13: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/13.jpg)
13
•Compute semantic distances between entity pairs
• EX:
• cp1 = 6.0-4.7=1.3• cp2=(6.0-4.8)+(6.0-5.3) +(6.0-5.1)=2.8• distance = 1.3
Graph-based entity ranking
db: Bob Dylan
db: Desire(Bob Dylan album)
Wmax=6.0
![Page 14: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/14.jpg)
14
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 15: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/15.jpg)
15
Computing document similarity
![Page 16: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/16.jpg)
16
•Opt for an application of Graph Edit Distance(GED) to be able to effectively quantify degrees of similarity.•Define the distance between two graph in terms of the minimum cost of edit operation needed to transform one graph to the other.•Nodes in the DBpedia graph is unique, not need to account for label mismatch between concepts.•Define node modifications on the basis of the underlying edge structure.
Computing document similarity
![Page 17: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/17.jpg)
17
•The modification cost between two nodes is defined as the sum of the edge costs along their connecting graph.•Adapt an approximation method based on bipartite graph matching for finding the minimal edit cost.•GED is now a bipartite graph matching problem that solve this minimization problem using the Hungarian method.
Computing document similarity
![Page 18: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/18.jpg)
18
•EX: Doc A : db:Bob_Dylan, db:Johnny_Cash Doc B : db:Desire_(Bob Dylan album), db: folk music• (v1, v3)(v1, v4)(v2, v3)(v2, v4)• c(v1,v3) =1.3 c(v1,v4)=3.5 c(v2,v3)=4.2 c(v2,v4)=1.7•Distance(vi,vj) = c(vi,vj)
• distance = (1.3+1.7) / 2
Computing document similarityv1 v2
v3 v4
Hungarian Algorithm
![Page 19: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/19.jpg)
19
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 20: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/20.jpg)
20
•dataset•21 different reference entities
Experiments---entity ranking
![Page 21: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/21.jpg)
21
•Dataset•50 news articles
•Linked system•Dbpedia•TagMe
Experiments---similarity
![Page 22: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/22.jpg)
22
•Dataset•50 news articles
Experiments---similarity
![Page 23: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/23.jpg)
23
Outline• Introduction•Modeling document content•Graph-based entity ranking•Computing document similarity•Experiments•Conclusion
![Page 24: Date: 2014/05/06 Author: Michael Schuhmacher , Simon Paolo Ponzetto](https://reader036.fdocuments.in/reader036/viewer/2022062411/56814d4d550346895dba7b60/html5/thumbnails/24.jpg)
24
•The first proposal to exploit a Web-scale ontology to provide structured representations of a document content and computing semantic distances in a knowledge-rich fashion.
•Future work plan to develop method to jointly perform entity disambiguation and compute semantic similarity.
Conclusion