Gil2007towards question 1 by lebo

From Semantic Portal Wiki

Jump to: navigation, search

CSCI 6966 Advanced Semantic Web (Fall 2008)


A Question from Tim Lebo about Gil2007towards:

The results of the simulation compare the Mean Squared Error, k-sum, and Edit Distance to a 'baseline', which is "a ... search engine ... that ranks search results by topic and popularity, ... without taking trust into account." A lot of assumptions are made to model the trust users have for associations and resources, and the simulation used 1,000 queries generated from 1,000 generated resources, 10,000 generated associations, and 1,000 generated users.

  1. Although the paper is trying to compare their trust-based ordering against 'traditional' search engines, are they not just comparing their technique to random performance instead?

Journal XixiLuo

  • Answer:
Facts about Gil2007towards question 1 by leboRDF feed
AQuestion  +
AboutGil2007towards  +
AuthorTim Lebo  +
Question askedThe results of the simulation compare the The results of the simulation compare the Mean Squared Error, k-sum, and Edit Distance to a 'baseline', which is "a ... search engine ... that ranks search results by topic and popularity, ... without taking trust into account." A lot of assumptions are made to model the trust users have for associations and resources, and the simulation used 1,000 queries generated from 1,000 generated resources, 10,000 generated associations, and 1,000 generated users.
  1. Although the paper is trying to compare their trust-based ordering against 'traditional' search engines, are they not just comparing their technique to random performance instead? r technique to random performance instead?
Question asked byTim Lebo  +
Question for the PresentationJournal XixiLuo  +
TextThe results of the simulation compare the The results of the simulation compare the Mean Squared Error, k-sum, and Edit Distance to a 'baseline', which is "a ... search engine ... that ranks search results by topic and popularity, ... without taking trust into account." A lot of assumptions are made to model the trust users have for associations and resources, and the simulation used 1,000 queries generated from 1,000 generated resources, 10,000 generated associations, and 1,000 generated users.
  • Although the paper is trying to compare their trust-based ordering against 'traditional' search engines, are they not just comparing their technique to random performance instead? r technique to random performance instead?
  • Personal tools
    Semantic Web Community
    Tetherless World constellation
    maintenance