Browse wiki

Jump to: navigation, search
No data available now.  +
No data available now.  +
{{{Catalogue}}}  +
No data available now.  +
Accuracy  +
Compare the system with AgreementMaker, SERIMI, and Zhishi.Links  +
2.66Ghz quad-core CPU and 4GB of memory  +
No  +
No data available now.  +
No data available now.  +
No data available now.  +
No data available now.  +
No data available now.  +
No data available now.  +
SLINT system totally outperforms the other
SLINT system totally outperforms the others on both precision and recall. AgreementMaker has a competitive precision with SLINT on dataset D3 but this system is much lower in recall. Zhishi.Links results on dataset D3 are very high, but the F1 score of SLINT is still 0.05 higher in overall.
of SLINT is still 0.05 higher in overall.  +
No data available now.  +
Linked data interlinking is the discovery
Linked data interlinking is the discovery of all instances that represent the same real-world object and locate in different data sources. Since different data publishers frequently use different schemas for storing resources, we aim at developing a schema-independent interlinking system. Our system automatically selects important predicates and useful predicate alignments, which are used as the key for blocking and instance matching. The key distinction of our system is the use of weighted co-occurrence and adaptive filtering in blocking and instance matching. Experimental results show that the system highly improves the precision and recall over some recent ones. The performance of the system and the efficiency of main steps are also discussed.
ficiency of main steps are also discussed.  +
Weighted co-occurrence and adaptive filtering in blocking and instance matching  +
In this paper, we present SLINT, an effici
In this paper, we present SLINT, an efficient schema-independent linked data interlinking system. We select important predicates by predicate’s coverage and discriminability. The predicate alignments are constructed and filtered for obtaining key alignments.We implement an adaptive filtering technique to produce candidates and identities. Compare with the most recent systems, SLINT highly outperforms the precision and recall in interlinking. The performance of SLINT is also very high when it takes around 1 minute to detect more than 13,000 identity pairs.
to detect more than 13,000 identity pairs.  +
Although SLINT has good result on tested d
Although SLINT has good result on tested datasets, it is not sufficient to evaluate the scalability of our system, which we consider as the current limiting point because of the used of weighted co-occurrence matrix. We will investigate about a solution for this issue in our next work. Besides, we also interested in automatic configuration for every threshold used in SLINT and improving SLINT into a novel cross-domain interlinking system.
a novel cross-domain interlinking system.  +
linked data, schema-independent, blocking, interlinking  +
No data available now.  +
No data available now.  +
No data available now.  +
2012  +
No data available now.  +
SLINT: A Schema-Independent Linked Data Interlinking System  +
No data available now.  +
No data available now.  +
No data available now.  +
Creation date
"Creation date" is a predefined property that corresponds to the date of the first revision of a subject and is provided by Semantic MediaWiki.
08:43:14, 28 June 2018  +
Last editor is
"Last editor is" is a predefined property that contains the page name of the user who created the last revision and is provided by Semantic MediaWiki.
Modification date
"Modification date" is a predefined property that corresponds to the date of the last modification of a subject and is provided by Semantic MediaWiki.
10:44:00, 12 July 2018  +
No properties link to this page.