The quest for correct information on the Web: hyper search engines

https://doi.org/10.1016/S0169-7552(97)00036-6Get rights and content

Abstract

Finding the right information in the World Wide Web is becoming a fundamental problem, since the amount of global information that the WWW contains is growing at an incredible rate. In this paper, we present a novel method to extract from a web object its “hyper” informative content, in contrast with current search engines, which only deal with the “textual” informative content. This method is not only valuable per se, but it is shown to be able to considerably increase the precision of current search engines, Moreover, it integrates smoothly with existing search engines technology since it can be implemented on top of every search engine, acting as a post-processor, thus automatically transforming a search engine into its corresponding “hyper” version. We also show how, interestingly, the hyper information can be usefully employed to face the search engines persuasion problem.

References (9)

  • T. Bray
  • M. Marchiori

    The hyper information: theory and practice

  • M. Marchiori

    Security of World Wide Web search engines

  • K. Murphy

    Cheaters never win

There are more references available in the full text version of this article.

Cited by (55)

  • Empirical Analyses of Networks in Finance

    2018, Handbook of Computational Economics
    Citation Excerpt :

    During the same years a small group of computer scientists focused on the properties of information networks with the aim of finding new solutions for the development of efficient search engines of the World Wide Web. Prominent examples of these efforts are the papers of Marchiori (1997) and Kleinberg (1998) that paved the way to the famous PageRank algorithm (Brin and Page, 1998). An early use of statistical physics concepts in the development of models for social networks can be encountered in the development of the so-called exponential random graphs (Holland and Leinhardt, 1981; Strauss, 1986).

  • Density link-based methods for clustering web pages

    2009, Decision Support Systems
    Citation Excerpt :

    At the beginning, most of the works only used the direct hyperlink between pages [5,19,23]. Then, another works were developed in [16,26] that utilized hyperlink transitivity, but the web page similarity derived directly from hyperlink transitivity analysis was over-simplified or only out-links of the pages were considered. In [23], a link-based clustering algorithm is presented by co-citation and coupling analysis.

  • Spectral ranking

    2016, Network Science
  • The Design Implementation of a Small Scale Crawler based Web Search Engine

    2019, Proceedings of 2019 3rd IEEE International Conference on Electrical, Computer and Communication Technologies, ICECCT 2019
View all citing articles on Scopus
View full text