Sciweavers

248 search results - page 8 / 50
» Perturbation based Large Margin Approach for Ranking
Sort
View
VLDB
1992
ACM
137views Database» more  VLDB 1992»
13 years 11 months ago
Random Sampling from Pseudo-Ranked B+ Trees
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
Gennady Antoshenkov
WWW
2005
ACM
14 years 8 months ago
SemRank: ranking complex relationship search results on the semantic web
While the idea that querying mechanisms for complex relationships (otherwise known as Semantic Associations) should be integral to Semantic Web search technologies has recently ga...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
EMNLP
2011
12 years 7 months ago
Random Walk Inference and Learning in A Large Scale Knowledge Base
We consider the problem of performing learning and inference in a large scale knowledge base containing imperfect knowledge with incomplete coverage. We show that a soft inference...
Ni Lao, Tom M. Mitchell, William W. Cohen
ESWS
2010
Springer
14 years 8 days ago
Hierarchical Link Analysis for Ranking Web Data
On the Web of Data, entities are often interconnected in a way similar to web documents. Previous works have shown how PageRank can be adapted to achieve entity ranking. In this pa...
Renaud Delbru, Nickolai Toupikov, Michele Catasta,...
SEMWEB
2009
Springer
14 years 2 months ago
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
Abstract. The Semantic Web fosters novel applications targeting a more efficient and satisfying exploitation of the data available on the web, e.g. faceted browsing of linked open...
Thomas Franz, Antje Schultz, Sergej Sizov, Steffen...