Ranking Complex Relationships on the Semantic Web

Author(s)

Boanerges Aleman-Meza
Christian Halaschek-Wiener
I. Budak Arpinar
Cartic Ramakrishnan
Amit P. Sheth, University of South Carolina - ColumbiaFollow

Document Type

Article

Abstract

Industry and academia are both focusing their attention on information retrieval over semantic metadata extracted from the Web, and it is increasingly possible to analyze such metadata to discover interesting relationships. However, just as document ranking is a critical component in today's search engines, the ranking of complex relationships would be an important component in tomorrow's semantic Web engines. This article presents a flexible ranking approach to identify interesting and relevant relationships in the semantic Web. The authors demonstrate the scheme's effectiveness through an empirical evaluation over a real-world data set.

Digital Object Identifier (DOI)

https://doi.org/10.1109/MIC.2005.63

Publication Info

Published in Lecture Notes in Computer Science, Volume 9, Issue 3, 2005, pages 37-44.

© IEEE Internet Computer, 2005

APA Citation

Aleman-Meza, B., Halaschek-Wiener, C., Arpinar, I. B., Ramakrishnan, C., & Sheth, A. P. (2005). Ranking Complex Relationships on the Semantic Web. IEEE Internet Computing, 9 (3), 37-44.
https://doi.org/10.1109/MIC.2005.63