Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Structured Prediction using Voted Conditional Random FieldsLink Prediction in Knowledge Bases
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2017 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Knowledge bases are useful in the validation of automatically extracted information, and for hypothesis selection during the extraction process. Building knowledge bases is a dfficult task and the process is bound to miss facts. Therefore, the existence of facts can be estimated using link prediction, i.e., by solving the structured prediction problem.It has been shown that combining directly observable features with latent features increases performance. Observable features include, e.g., the presence of another chain of facts leading to the same end point. Latent features include, e.g, properties that are not modelled by facts on the form subject-predicate-object, such as being a good actor. Observable graph features are modelled using the Path Ranking Algorithm, and latent features using the bilinear RESCAL model. Voted Conditional Random Fields can be used to combine feature families while taking into account their complexity to minimize the risk of training a poor predictor. We propose a combined model fusing these theories together with a complexity analysis of the feature families used. In addition, two simple feature families are constructed to model neighborhood properties.The model we propose captures useful features for link prediction, but needs further evaluation to guarantee effcient learning. Finally, suggestions for experiments and other feature families are given.

Place, publisher, year, edition, pages
2017. , p. 50
Series
UMNAD ; 1114
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:umu:diva-140692OAI: oai:DiVA.org:umu-140692DiVA, id: diva2:1149850
Educational program
Master of Science Programme in Computing Science and Engineering
Supervisors
Examiners
Available from: 2017-10-17 Created: 2017-10-17 Last updated: 2017-10-17Bibliographically approved

Open Access in DiVA

fulltext(697 kB)90 downloads
File information
File name FULLTEXT01.pdfFile size 697 kBChecksum SHA-512
28e080a7fe3bb6564dd0e4071e9ced5bf3dd227bd489f78713f15097c5930491eec371c69c93bafb96bbe93104a4ad15045074ea7e706c1a2e4a3dbc1158637a
Type fulltextMimetype application/pdf

By organisation
Department of Computing Science
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 90 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 211 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf