Issue No. 03 - May/June (2005 vol. 9)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MIC.2005.63
Boanerges Aleman-Meza , University of Georgia
Christian Halaschek-Wiener , University of Georgia
I. Budak Arpinar , University of Georgia
Cartic Ramakrishnan , University of Georgia
Amit P. Sheth , University of Georgia
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 will 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.
Metadata, XML, XSL, RDF
A. P. Sheth, B. Aleman-Meza, C. Halaschek-Wiener, C. Ramakrishnan and I. B. Arpinar, "Ranking Complex Relationships on the Semantic Web," in IEEE Internet Computing, vol. 9, no. , pp. 37-44, 2005.