Ranking complex relationships on the semantic Web

被引：64

作者：

Aleman-Meza, B ^{[1
]}

Halaschek-Wiener, C ^{[1
]}

Arpinar, IB ^{[1
]}

Ramakrishnan, C ^{[1
]}

Sheth, AP ^{[1
]}

机构：

[1] Univ Georgia, Athens, GA 30602 USA

来源：

IEEE INTERNET COMPUTING | 2005年 / 9卷 / 03期

关键词：

D O I：

10.1109/MIC.2005.63

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：37 / 44

页数：8

共 19 条

[1]

Aleman-Meza B., 2004, P 16 INT C SOFTW ENG, P490

[2]

Aleman-Meza B., 2005, P IEEE INT C INT SEC

[3]

Anderson R., 1998, P 1 INT WORKSH REC A

[4]

[Anonymous], P SWDB 03 BERL GERM

[5]

[Anonymous], P 12 INT WORLD WID W

[6]

ANYANWU K, 2005, P 14 INT WORLD WID W

[7] The shellcode generation [J].

Arce, I .

IEEE SECURITY & PRIVACY, 2004, 2 (05) :72-76

[8] The anatomy of a large-scale hypertextual Web search engine [J].

Brin, S ;

Page, L .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117

[9] SPEARMANS FOOTRULE AS A MEASURE OF DISARRAY [J].

DIACONIS, P ;

GRAHAM, RL .

JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (02) :262-268

[10]

Dill Stephen., 2003, Proceedings of the 12th international conference on World Wide Web, P178

← 1 2 →