The 18th European Conference on Machine Learning (ECML) and the 11th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD)

Using the Web to Reduce Data Sparseness in Pattern-based Information

author: Sebastian Blohm, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universitaet Karlsruhe

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Using the Web to Reduce Data Sparseness in Pattern-based Information Extraction
0:36	Information Extraction
1:31	Pattern-based Extraction
3:39	Problem statement
4:30	Outline
4:49	Wikipedia
5:28	Iterative Pattern Induction
6:15	The Bootstrapping Effect
6:41	... but when redundancy is low:
7:12	How often do relation instance co-occur?
8:13	Extended Algorithm
9:28	"Dual" Extraction
10:07	"Wiki Only" Extraction
10:10	"Web Once" Extraction
10:14	The Testbed
10:54	Results: Correct Extractions over Iterations
12:06	Precision, Recall, F-Measure
13:33	Conclusion
14:18	Outlook – this subject
15:37	Thank you for your attention

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.