Efficient Graph-based Document Similarity thumbnail
slide-image
Pause
Mute
Subtitles not available
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Efficient Graph-based Document Similarity

Published on Jul 28, 20161400 Views

Assessing the relatedness of documents is at the core of many applications such as document retrieval and recommendation. Most similarity approaches operate on word-distribution-based document represe

Related categories

Chapter list

Efficient Graph-based Document Similarity00:00
Matching words do not always indicate similarity00:25
Word co-occurrence can be misleading, too01:33
Semantic Technologies: resolve ambiguity & exploit relational knowledge - 101:53
Semantic Technologies: resolve ambiguity & exploit relational knowledge - 203:25
Related Work03:42
Bridging the gap05:22
Core Contributions05:39
Related-document Search using Graph-based Similarity06:55
Semantic Document Expansion07:55
Pre-Search: Generate Candidate Set08:38
Full Search: Graph-based Document Similarity09:38
Hierarchical entity similarity10:09
Transversal entity similarity10:49
Document similarity: bipartite graph of entity similarities11:18
Document similarity: DBpedia example12:20
Evaluation12:52
Document similarity: Lee50 corpus13:45
Sentence Similarity14:40
Realted-document Search: Pre-search, Full Search & Efficiency15:36
Conclusion & Outlook17:42