Document Type
Article
Publication Date
2005
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.
Repository 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://corescholar.libraries.wright.edu/knoesis/706
DOI
10.1109/MIC.2005.63
Included in
Bioinformatics Commons, Communication Technology and New Media Commons, Databases and Information Systems Commons, OS and Networks Commons, Science and Technology Studies Commons
Comments
Posted with permission from IEEE.