search query: @keyword online learning / total: 4
results-list
reference: 2 / 4
« previous | next »
Author:Lebre Magalhães Pereira, João Pedro
Title:Supervised learning for relationship extraction from textual documents
Publication type:Master's thesis
Publication year:2013
Pages:(8) + 55      Language:   eng
Department/School:Perustieteiden korkeakoulu
Main subject:Informaatiotekniikka   (T-61)
Supervisor:Oja, Erkki
Instructor:Martins, Bruno
OEVS:
Electronic archive copy is available via Aalto Thesis Database.
Instructions
close

Reading digital theses in the closed network of the Aalto University Harald Herlin Learning Centre

In the closed network of Learning Centre you can read digital and digitized theses not available in the open network.

The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/

You can read theses on the Learning Centre customer computers, which are available on all floors.

Logging on to the customer computers

  • Aalto University staff members log on to the customer computer using the Aalto username and password.
  • Other customers log on using a shared username and password.

Opening a thesis

  • On the desktop of the customer computers, you will find an icon titled:

    Aalto Thesis Database

  • Click on the icon to search for and open the thesis you are looking for from Aaltodoc database. You can find the thesis file by clicking the link on the OEV or OEVS field.

Reading the thesis

  • You can either print the thesis or read it on the customer computer screen.
  • You cannot save the thesis file on a flash drive or email it.
  • You cannot copy text or images from the file.
  • You cannot edit the file.

Printing the thesis

  • You can print the thesis for your personal study or research use.
  • Aalto University students and staff members may print black-and-white prints on the PrintingPoint devices when using the computer with personal Aalto username and password. Color printing is possible using the printer u90203-psc3, which is located near the customer service. Color printing is subject to a charge to Aalto University students and staff members.
  • Other customers can use the printer u90203-psc3. All printing is subject to a charge to non-University members.
Location:P1 Ark Aalto  7214   | Archive
Keywords:relationship extraction
support vector machines
online learning
multiple kernel learning
Abstract (eng): Information Extraction (IE) is the task of automatically extracting structured information from unstructured data, aiming to facilitate the use of said data by other applications.
A typical sub-problem is the extraction of relationships from textual documents, which aims at identifying and classifying the relationships expressed between entities mentioned in the texts.
In order to extract relationships from a raw text, it is important to pre-process the data, organizing the textual contents into useful data structures, with techniques from Natural Language Processing.
Furthermore, since relationships are expressed between entities, it is mandatory to identify the entities using an entity extraction method, which is another sub problem of IE.

Assigning a relationship type to a pair of entities can be seen as a classification problem.
Therefore, supervised machine learning techniques can be applied.
In this thesis, we used Support Vector Machines (SVM), which we trained with basis on online methods similar to Pegasos.
Two specific modelling choices have been tested.
The first one is a simple online solution that trains SVM models considering a single kernel.

The second approach is based on the idea of online multiple kernel learning.
With existing datasets and common pre-processing tools, we formulated a benchmark, which was then used to evaluate kernel-based methods.
We then implemented state-of-the-art kernels, specifically designed for relationship extraction.

The results show that a multiple kernel learning solution obtains the best performance, and that multiple kernel learning solutions can perform better than heuristic solutions learning with linear combinations of the same kernels.
ED:2014-03-03
INSSI record number: 48703
+ add basket
« previous | next »
INSSI