An improved RDF data Clustering Algorithm

Linked data has been officially approved as one of the best useful sources for background information that publishing and connecting structured data on the Web. Therefore, Machine Learning community should respond with a clear package of methods and best practices to bring this type of data into the...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science 2019, Vol.148, p.208-217
Main Authors: Eddamiri, Siham, Zemmouri, El Moukhtar, Benghabrit, Asmaa
Format: Article
Language:English
Subjects:
Clustering
Linked data
Machine Learning
RDF
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Linked data has been officially approved as one of the best useful sources for background information that publishing and connecting structured data on the Web. Therefore, Machine Learning community should respond with a clear package of methods and best practices to bring this type of data into the field. Relatively little attention has been paid in the literature to the possible union of both linked data and Machine Learning. In order to overcome this carelessness and achieve this joining, we should focus little more on RDF data. The main purpose of this article, is to present a typical Machine Learning Pipeline on RDF data and an improved version of RDF clustering algorithm based on Candidate Description by using different similarity measures and agglomerative hierarchical techniques.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2019.01.038