|Title||Ranking Complex Relationships on the Semantic Web|
|Publication Type||Journal Article|
|Year of Publication||2005|
|Authors||Boanerges Aleman-Meza, Christian Halaschek-Wiener, Amit Sheth, Ismailcem Budak Arpinar, Cartic Ramakrishnan|
|Journal||IEEE Internet Computing|
|Keywords||graph traversal, metadata, Ontology, Relationship Ranking, Relationship-based Querying, Relationships Search, Semantic Analytics, semantic associations, semantic discovery, Semantic Metadata, semantic ranking, semantic relationships, semantic Web technology, Test-bed, User-defined Context|
The focus of contemporary Web information retrieval systems has been to provide efficient support for the querying and retrieval of relevant documents. More recently, information retrieval over semantic metadata extracted from the Web has received an increasing amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this metadata is an interesting and challenging research topic. Just as ranking of documents is a critical component of today's search engines, the ranking of complex relationships will be an important component in tomorrow's Semantic Web analytics engines. Building upon our recent work on specifying and discovering complex relationships in RDF data, called Semantic Associations, we present a flexible ranking approach which can be used to identify more interesting and relevant relationships in the Semantic Web. Additionally, we demonstrate our ranking scheme's effectiveness through an empirical evaluation over a real-world dataset.
|Full Text|| |
Boanerges Aleman-Meza, Christian Halaschek-Wiener, I. Budak Arpinar,Cartic Ramakrishnan, andAmit Sheth, 'Ranking Complex Relationships on the Semantic Web,'IEEE Internet Computing, 9 (no. 3), 2005, pp. 37-44.