3 research outputs found
Improving Performance of Relation Extraction Algorithm via Leveled Adversarial PCNN and Database Expansion
This study introduces database expansion using the Minimum Description Length
(MDL) algorithm to expand the database for better relation extraction.
Different from other previous relation extraction researches, our method
improves system performance by expanding data. The goal of database expansion,
together with a robust deep learning classifier, is to diminish wrong labels
due to the incomplete or not found nature of relation instances in the relation
database (e.g., Freebase). The study uses a deep learning method (Piecewise
Convolutional Neural Network or PCNN) as the base classifier of our proposed
approach: the leveled adversarial attention neural networks (LATTADV-ATT). In
the database expansion process, the semantic entity identification is used to
enlarge new instances using the most similar itemsets of the most common
patterns of the data to get its pairs of entities. About the deep learning
method, the use of attention of selective sentences in PCNN can reduce noisy
sentences. Also, the use of adversarial perturbation training is useful to
improve the robustness of system performance. The performance even further is
improved using a combination of leveled strategy and database expansion. There
are two issues: 1) database expansion method: rule generation by allowing step
sizes on selected strong semantic of most similar itemsets with aims to find
entity pair for generating instances, 2) a better classifier model for relation
extraction. Experimental result has shown that the use of the database
expansion is beneficial. The MDL database expansion helps improvements in all
methods compared to the unexpanded method. The LATTADV-ATT performs as a good
classifier with high precision P@100=0.842 (at no expansion). It is even better
while implemented on the expansion data with P@100=0.891 (at expansion factor
k=7).Comment: 6 page
Wiki-MetaSemantik: A Wikipedia-derived Query Expansion Approach based on Network Properties
This paper discusses the use of Wikipedia for building semantic ontologies to
do Query Expansion (QE) in order to improve the search results of search
engines. In this technique, selecting related Wikipedia concepts becomes
important. We propose the use of network properties (degree, closeness, and
pageRank) to build an ontology graph of user query concepts which is derived
directly from Wikipedia structures. The resulting expansion system is called
Wiki-MetaSemantik. We tested this system against other online thesauruses and
ontology based QE in both individual and meta-search engines setups. Despite
that our system has to build a Wikipedia ontology graph in order to do its
work, the technique turns out to work very fast (1:281) compared to another
ontology QE baseline (Wikipedia Persian ontology QE). It has thus the potential
to be utilized online. Furthermore, it shows significant improvement in
accuracy. Wiki-MetaSemantik also shows better performance in a meta-search
engine (MSE) set up rather than in an individual search engine set up