Finding relevant semantic association paths using semantic ant colony optimization algorithm

Verfasser / Beitragende:
[V. Viswanathan, Ilango Krishnamurthi]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/1(2015-01-01), 251-260
Format:
Artikel (online)
ID: 60546832X
LEADER caa a22 4500
001 60546832X
003 CHVBK
005 20210128100316.0
007 cr unu---uuuuu
008 210128e20150101xx s 000 0 eng
024 7 0 |a 10.1007/s00500-014-1247-3  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00500-014-1247-3 
245 0 0 |a Finding relevant semantic association paths using semantic ant colony optimization algorithm  |h [Elektronische Daten]  |c [V. Viswanathan, Ilango Krishnamurthi] 
520 3 |a Semantic Associations are complex relationships between entities in a knowledge base represented in a graph. While searching Semantic Association between entities in an RDF graph, there may be too many paths connecting them. Each path has different meaning depending on the type of relationships, in which, some of them may be irrelevant according to the users' perspective and these paths are to be filtered. To improve the relevance in finding semantic association, the proposed research suggests Semantic Ant Colony Optimization algorithm in searching paths between entities in an RDF graph. Experiments are conducted to analyze the efficiency of the algorithm in searching the relevant paths and to check for the quality of solution. The results show that the proposed approach provide more relevant semantic associations according to the users' perspective. 
540 |a Springer-Verlag Berlin Heidelberg, 2014 
690 7 |a Semantic Web  |2 nationallicence 
690 7 |a Semantic associations  |2 nationallicence 
690 7 |a RDF  |2 nationallicence 
690 7 |a RDFS  |2 nationallicence 
690 7 |a Ant colony optimization  |2 nationallicence 
690 7 |a Semantic ant colony optimization  |2 nationallicence 
700 1 |a Viswanathan  |D V.  |u School of Computing Sciences and Engineering, VIT University, Chennai Campus, 600127, Chennai, Tamil Nadu, India  |4 aut 
700 1 |a Krishnamurthi  |D Ilango  |u Department of Computer Science and Engineering, Sri Krishna College of Engineering and Technology, Coimbatore, Tamil nadu, India  |4 aut 
773 0 |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/1(2015-01-01), 251-260  |x 1432-7643  |q 19:1<251  |1 2015  |2 19  |o 500 
856 4 0 |u https://doi.org/10.1007/s00500-014-1247-3  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00500-014-1247-3  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Viswanathan  |D V.  |u School of Computing Sciences and Engineering, VIT University, Chennai Campus, 600127, Chennai, Tamil Nadu, India  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Krishnamurthi  |D Ilango  |u Department of Computer Science and Engineering, Sri Krishna College of Engineering and Technology, Coimbatore, Tamil nadu, India  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/1(2015-01-01), 251-260  |x 1432-7643  |q 19:1<251  |1 2015  |2 19  |o 500