Search
Now showing items 1-7 of 7
SemEval-2016 Task 13: Taxonomy Extraction Evaluation (TExEval-2)
(Insight Centre for Data Analytics, 2016-06-16)
This paper describes the second edition of the shared task on Taxonomy Extraction Evaluation organised as part of SemEval 2016. This task aims to extract hypernym-hyponym relations between a given list of domain-specific ...
On learnability of constraints from RDF data
(Springer International Publishing, 2016-05-14)
RDF is structured, dynamic, and schemaless data, which enables a big deal of flexibility for Linked Data to be available in an open environment such as the Web. However, for RDF data, flexibility turns out to be the source ...
Social sentiment indices powered by X-scores
(INSIGHT Centre for Data Analytics, NUI Galway, Ireland, 2016-05)
Social Sentiment Indices powered by X-Scores (SSIX) seeks to address the challenge of extracting relevant and valuable economic signals in a cross-lingual fashion from the vast variety of and increasingly influential social ...
On the correlation between topic and user behaviour in online communities
(ICWSM-16, 2016-05-20)
In the advancement of a better understanding of user behaviour on the Internet, clustering approaches are used as a means to group and categorise online communities. Although clustering approaches indicate similarity between ...
Tell me who are your friends, and I’ll tell you who you are
(AICS 2016, 2016-09-20)
Mentions of politicians in news articles can reflect politician interactions on their daily activities. In this work, we present a mathematical model to represent such interactions as a graph, and we use it to predict the ...
SPORTAL: Searching for Public SPARQL Endpoints
(NUI Galway, 2016-10)
There are hundreds of SPARQL endpoints on the Web, but finding an endpoint relevant to a client s needs is difficult: each endpoint acts like a black box, often without a description of its content. Herein
we briefly ...
Non-partitioning merge-sort: Performance enhancement by elimination of division in divide-and-conquer algorithm
(ACM, 2016-03-04)
The importance of a high performance sorting algorithm
with low time complexity cannot be over stated. Several
benchmark algorithms viz. Bubble Sort, Insertion Sort, Quick
Sort, and Merge Sort, etc. have tried to achieve ...







