Search (96 results, page 1 of 5)

0.13176255 = product of:
  0.19764382 = sum of:
    0.07707474 = weight(_text_:wide in 1319) [ClassicSimilarity], result of:
      0.07707474 = score(doc=1319,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.342674 = fieldWeight in 1319, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1319)
    0.12056909 = sum of:
      0.07242467 = weight(_text_:web in 1319) [ClassicSimilarity], result of:
        0.07242467 = score(doc=1319,freq=6.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.43716836 = fieldWeight in 1319, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1319)
      0.048144415 = weight(_text_:22 in 1319) [ClassicSimilarity], result of:
        0.048144415 = score(doc=1319,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.2708308 = fieldWeight in 1319, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1319)
  0.6666667 = coord(2/3)

Abstract

Keyword based querying has been an immediate and efficient way to specify and retrieve related information that the user inquired. However, conventional document ranking based on an automatic assessment of document relevance to the query may not be the best approach when little information is given. Proposes an idea to integrate 2 existing techniques, query expansion and relevance feedback to achieve a concept-based information search for the Web

Date

1. 8.1996 22:08:06

Footnote

Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia

0.08617973 = product of:
  0.1292696 = sum of:
    0.093428686 = weight(_text_:wide in 5777) [ClassicSimilarity], result of:
      0.093428686 = score(doc=5777,freq=4.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.4153836 = fieldWeight in 5777, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=5777)
    0.035840917 = product of:
      0.071681835 = sum of:
        0.071681835 = weight(_text_:web in 5777) [ClassicSimilarity], result of:
          0.071681835 = score(doc=5777,freq=8.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.43268442 = fieldWeight in 5777, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=5777)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

LCSH

Web search engines

RSWK

World Wide Web / Suchmaschine / Mathematisches Modell (BVB)

Subject

World Wide Web / Suchmaschine / Mathematisches Modell (BVB)
Web search engines

0.06473547 = product of:
  0.0971032 = sum of:
    0.06606405 = weight(_text_:wide in 5771) [ClassicSimilarity], result of:
      0.06606405 = score(doc=5771,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 5771, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=5771)
    0.031039147 = product of:
      0.062078293 = sum of:
        0.062078293 = weight(_text_:web in 5771) [ClassicSimilarity], result of:
          0.062078293 = score(doc=5771,freq=6.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.37471575 = fieldWeight in 5771, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=5771)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

In unserem Retrievaltest von Suchwerkzeugen im World Wide Web (Password 11/2000) schnitt die Suchmaschine Google am besten ab. Im Vergleich zu anderen Search Engines setzt Google kaum auf Informationslinguistik, sondern auf Algorithmen, die sich aus den Besonderheiten der Web-Dokumente ableiten lassen. Kernstück der informationsstatistischen Technik ist das "PageRank"- Verfahren (benannt nach dem Entwickler Larry Page), das aus der Hypertextstruktur des Web die "Popularität" von Seiten anhand ihrer ein- und ausgehenden Links berechnet. Google besticht durch das Angebot intuitiv verstehbarer Suchbildschirme sowie durch einige sehr nützliche "Kleinigkeiten" wie die Angabe des Rangs einer Seite, Highlighting, Suchen in der Seite, Suchen innerhalb eines Suchergebnisses usw., alles verstaut in einer eigenen Befehlsleiste innerhalb des Browsers. Ähnlich wie RealNames bietet Google mit dem Produkt "AdWords" den Aufkauf von Suchtermen an. Nach einer Reihe von nunmehr vier Password-Artikeln über InternetSuchwerkzeugen im Vergleich wollen wir abschließend zu einer Bewertung kommen. Wie ist der Stand der Technik bei Directories und Search Engines aus informationswissenschaftlicher Sicht einzuschätzen? Werden die "typischen" Internetnutzer, die ja in der Regel keine Information Professionals sind, adäquat bedient? Und können auch Informationsfachleute von den Suchwerkzeugen profitieren?

0.06093827 = product of:
  0.0914074 = sum of:
    0.06606405 = weight(_text_:wide in 105) [ClassicSimilarity], result of:
      0.06606405 = score(doc=105,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 105, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=105)
    0.025343355 = product of:
      0.05068671 = sum of:
        0.05068671 = weight(_text_:web in 105) [ClassicSimilarity], result of:
          0.05068671 = score(doc=105,freq=4.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.3059541 = fieldWeight in 105, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=105)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The rapid development of the Internet and World Wide Web has caused some critical problem for information retrieval. Researchers have made several attempts to solve these problems. Thesauri and subject heading lists as traditional information retrieval tools have been criticised for their efficiency to tackle these newly emerging problems. This paper proposes an information retrieval tool generated by cocitation analysis, comprising keyword clusters with relationships based on the co-occurrences of keywords in the literature. Such a tool can play the role of an associative thesaurus that can provide information about the keywords in a domain that might be useful for information searching and query expansion

0.06093827 = product of:
  0.0914074 = sum of:
    0.06606405 = weight(_text_:wide in 101) [ClassicSimilarity], result of:
      0.06606405 = score(doc=101,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 101, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=101)
    0.025343355 = product of:
      0.05068671 = sum of:
        0.05068671 = weight(_text_:web in 101) [ClassicSimilarity], result of:
          0.05068671 = score(doc=101,freq=4.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.3059541 = fieldWeight in 101, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=101)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Question Answering is an area of information retrieval with the added challenge of applying sophisticated techniques to identify the complex syntactic and semantic relationships present in text in order to provide a more sophisticated and satisfactory response to the user's information needs. For this reason, the authors see question answering as the next step beyond standard information retrieval. In this chapter state of the art question answering is covered focusing on providing an overview of systems, techniques and approaches that are likely to be employed in the next generations of search engines. Special attention is paid to question answering using the World Wide Web as the data source and to question answering exploiting the possibilities of Semantic Web. Considerations about the current issues and prospects for promising future research are also provided.

0.055989675 = product of:
  0.08398451 = sum of:
    0.06606405 = weight(_text_:wide in 5) [ClassicSimilarity], result of:
      0.06606405 = score(doc=5,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.29372054 = fieldWeight in 5, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.046875 = fieldNorm(doc=5)
    0.017920459 = product of:
      0.035840917 = sum of:
        0.035840917 = weight(_text_:web in 5) [ClassicSimilarity], result of:
          0.035840917 = score(doc=5,freq=2.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.21634221 = fieldWeight in 5, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=5)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of contexts on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics, through the discovery of "authoritative" information sources on such topics. We propose and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of "hub pages" that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph; these connections in turn motivate additional heuristics for link-based analysis.

0.0507819 = product of:
  0.07617284 = sum of:
    0.055053383 = weight(_text_:wide in 1427) [ClassicSimilarity], result of:
      0.055053383 = score(doc=1427,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 1427, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1427)
    0.021119464 = product of:
      0.04223893 = sum of:
        0.04223893 = weight(_text_:web in 1427) [ClassicSimilarity], result of:
          0.04223893 = score(doc=1427,freq=4.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.25496176 = fieldWeight in 1427, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1427)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Fast, effective, and adaptable techniques are needed to automatically organize and retrieve information an the ever-increasing World Wide Web. In that respect, different strategies have been suggested to take hypertext links into account. For example, hyperlinks have been used to (1) enhance document representation, (2) improve document ranking by propagating document score, (3) provide an indicator of popularity, and (4) find hubs and authorities for a given topic. Although the TREC experiments have not demonstrated the usefulness of hyperlinks for retrieval, the hypertext structure is nevertheless an essential aspect of the Web, and as such, should not be ignored. The development of abstract models of the IR task was a key factor to the improvement of search engines. However, at this time conceptual tools for modeling the hypertext retrieval task are lacking, making it difficult to compare, improve, and reason an the existing techniques. This article proposes a general model for using hyperlinks based an Probabilistic Argumentation Systems, in which each of the above-mentioned techniques can be stated. This model will allow to discover some inconsistencies in the mentioned techniques, and to take a higher level and systematic approach for using hyperlinks for retrieval.

0.048165213 = product of:
  0.07224782 = sum of:
    0.055053383 = weight(_text_:wide in 241) [ClassicSimilarity], result of:
      0.055053383 = score(doc=241,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 241, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=241)
    0.017194435 = product of:
      0.03438887 = sum of:
        0.03438887 = weight(_text_:22 in 241) [ClassicSimilarity], result of:
          0.03438887 = score(doc=241,freq=2.0), product of:
            0.17776565 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050763648 = queryNorm
            0.19345059 = fieldWeight in 241, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=241)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

We address how individuals' (workers) knowledge needs influence the design of knowledge management systems (KMS), enabling knowledge creation and utilization. It is evident that KMS technologies and activities are indiscriminately deployed in most organizations with little regard to the actual context of their adoption. Moreover, it is apparent that the extant literature pertaining to knowledge management projects is frequently deficient in identifying the variety of factors indicative for successful KMS. This presents an obvious business practice and research gap that requires a critical analysis of the necessary intervention that will actually improve how workers can leverage and form organization-wide knowledge. This research involved an extensive review of the literature, a grounded theory methodological approach and rigorous data collection and synthesis through an empirical case analysis (Parsons Brinckerhoff and Samsung). The contribution of this study is the formulation of a model for designing KMS based upon the design science paradigm, which aspires to create artifacts that are interdependent of people and organizations. The essential proposition is that KMS design and implementation must be contextualized in relation to knowledge needs and that these will differ for various organizational settings. The findings present valuable insights and further understanding of the way in which KMS design efforts should be focused.

Date

11. 6.2012 14:22:34

0.046658065 = product of:
  0.069987096 = sum of:
    0.055053383 = weight(_text_:wide in 6690) [ClassicSimilarity], result of:
      0.055053383 = score(doc=6690,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 6690, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6690)
    0.014933716 = product of:
      0.029867431 = sum of:
        0.029867431 = weight(_text_:web in 6690) [ClassicSimilarity], result of:
          0.029867431 = score(doc=6690,freq=2.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.18028519 = fieldWeight in 6690, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6690)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

In assessing information retrieval systems, it is important to know not only the precision of the retrieved set, but also to compare the number of retrieved relevant items to the total number of relevant items. For large collections, such as the TREC test collections, or the World Wide Web, it is not possible to enumerate the entire set of relevant documents. If the retrieved documents are evaluated, a variant of the statistical "capture-recapture" method can be used to estimate the total number of relevant documents, providing the several retrieval systems used are sufficiently independent. We show that the underlying signal detection model supporting such an analysis can be extended in two ways. First, assuming that there are two distinct performance characteristics (corresponding to the chance of retrieving a relevant, and retrieving a given non-relevant document), we show that if there are three or more independent systems available it is possible to estimate the number of relevant documents without actually having to decide whether each individual document is relevant. We report applications of this 3-system method to the TREC data, leading to the conclusion that the independence assumptions are not satisfied. We then extend the model to a multi-system, multi-problem model, and show that it is possible to include statistical dependencies of all orders in the model, and determine the number of relevant documents for each of the problems in the set. Application to the TREC setting will be presented

0.046658065 = product of:
  0.069987096 = sum of:
    0.055053383 = weight(_text_:wide in 1338) [ClassicSimilarity], result of:
      0.055053383 = score(doc=1338,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 1338, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1338)
    0.014933716 = product of:
      0.029867431 = sum of:
        0.029867431 = weight(_text_:web in 1338) [ClassicSimilarity], result of:
          0.029867431 = score(doc=1338,freq=2.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.18028519 = fieldWeight in 1338, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1338)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

A user's query is considered to be an imprecise description of their information need. Automatic query expansion is the process of reformulating the original query with the goal of improving retrieval effectiveness. Many successful query expansion techniques model syntagmatic associations that infer two terms co-occur more often than by chance in natural language. However, structural linguistics relies on both syntagmatic and paradigmatic associations to deduce the meaning of a word. Given the success of dependency-based approaches to query expansion and the reliance on word meanings in the query formulation process, we argue that modeling both syntagmatic and paradigmatic information in the query expansion process improves retrieval effectiveness. This article develops and evaluates a new query expansion technique that is based on a formal, corpus-based model of word meaning that models syntagmatic and paradigmatic associations. We demonstrate that when sufficient statistical information exists, as in the case of longer queries, including paradigmatic information alone provides significant improvements in retrieval effectiveness across a wide variety of data sets. More generally, when our new query expansion approach is applied to large-scale web retrieval it demonstrates significant improvements in retrieval effectiveness over a strong baseline system, based on a commercial search engine.

0.04540308 = product of:
  0.06810462 = sum of:
    0.03853737 = weight(_text_:wide in 93) [ClassicSimilarity], result of:
      0.03853737 = score(doc=93,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.171337 = fieldWeight in 93, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.02734375 = fieldNorm(doc=93)
    0.02956725 = product of:
      0.0591345 = sum of:
        0.0591345 = weight(_text_:web in 93) [ClassicSimilarity], result of:
          0.0591345 = score(doc=93,freq=16.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.35694647 = fieldWeight in 93, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.02734375 = fieldNorm(doc=93)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Imagine a library containing 25 billion documents but with no centralized organization and no librarians. In addition, anyone may add a document at any time without telling anyone. You may feel sure that one of the documents contained in the collection has a piece of information that is vitally important to you, and, being impatient like most of us, you'd like to find it in a matter of seconds. How would you go about doing it? Posed in this way, the problem seems impossible. Yet this description is not too different from the World Wide Web, a huge, highly-disorganized collection of documents in many different formats. Of course, we're all familiar with search engines (perhaps you found this article using one) so we know that there is a solution. This article will describe Google's PageRank algorithm and how it returns pages from the web's collection of 25 billion documents that match search criteria so well that "google" has become a widely used verb. Most search engines, including Google, continually run an army of computer programs that retrieve pages from the web, index the words in each document, and store this information in an efficient format. Each time a user asks for a web search using a search phrase, such as "search engine," the search engine determines all the pages on the web that contains the words in the search phrase. (Perhaps additional information such as the distance between the words "search" and "engine" will be noted as well.) Here is the problem: Google now claims to index 25 billion pages. Roughly 95% of the text in web pages is composed from a mere 10,000 words. This means that, for most searches, there will be a huge number of pages containing the words in the search phrase. What is needed is a means of ranking the importance of the pages that fit the search criteria so that the pages can be sorted with the most important pages at the top of the list. One way to determine the importance of pages is to use a human-generated ranking. For instance, you may have seen pages that consist mainly of a large number of links to other resources in a particular area of interest. Assuming the person maintaining this page is reliable, the pages referenced are likely to be useful. Of course, the list may quickly fall out of date, and the person maintaining the list may miss some important pages, either unintentionally or as a result of an unstated bias. Google's PageRank algorithm assesses the importance of web pages without human evaluation of the content. In fact, Google feels that the value of its service is largely in its ability to provide unbiased results to search queries; Google claims, "the heart of our software is PageRank." As we'll see, the trick is to ask the web itself to rank the importance of pages.

0.037649494 = product of:
  0.11294848 = sum of:
    0.11294848 = sum of:
      0.071681835 = weight(_text_:web in 2239) [ClassicSimilarity], result of:
        0.071681835 = score(doc=2239,freq=8.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.43268442 = fieldWeight in 2239, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.046875 = fieldNorm(doc=2239)
      0.041266643 = weight(_text_:22 in 2239) [ClassicSimilarity], result of:
        0.041266643 = score(doc=2239,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.23214069 = fieldWeight in 2239, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2239)
  0.33333334 = coord(1/3)

Abstract

Genetic-based evolutionary learning algorithms, such as genetic algorithms (GAs) and genetic programming (GP), have been applied to information retrieval (IR) since the 1980s. Recently, GP has been applied to a new IR taskdiscovery of ranking functions for Web search-and has achieved very promising results. However, in our prior research, only one fitness function has been used for GP-based learning. It is unclear how other fitness functions may affect ranking function discovery for Web search, especially since it is weIl known that choosing a proper fitness function is very important for the effectiveness and efficiency of evolutionary algorithms. In this article, we report our experience in contrasting different fitness function designs an GP-based learning using a very large Web corpus. Our results indicate that the design of fitness functions is instrumental in performance improvement. We also give recommendations an the design of fitness functions for genetic-based information retrieval experiments.

Date

31. 5.2004 19:22:06

0.026166879 = product of:
  0.078500636 = sum of:
    0.078500636 = sum of:
      0.029867431 = weight(_text_:web in 2591) [ClassicSimilarity], result of:
        0.029867431 = score(doc=2591,freq=2.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.18028519 = fieldWeight in 2591, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2591)
      0.048633203 = weight(_text_:22 in 2591) [ClassicSimilarity], result of:
        0.048633203 = score(doc=2591,freq=4.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.27358043 = fieldWeight in 2591, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2591)
  0.33333334 = coord(1/3)

Abstract

Purpose In a system-based approach, replicating the web would require large test collections, and judging the relevancy of all documents per topic in creating relevance judgment through human assessors is infeasible. Due to the large amount of documents that requires judgment, there are possible errors introduced by human assessors because of disagreements. The paper aims to discuss these issues. Design/methodology/approach This study explores exponential variation and document ranking methods that generate a reliable set of relevance judgments (pseudo relevance judgments) to reduce human efforts. These methods overcome problems with large amounts of documents for judgment while avoiding human disagreement errors during the judgment process. This study utilizes two key factors: number of occurrences of each document per topic from all the system runs; and document rankings to generate the alternate methods. Findings The effectiveness of the proposed method is evaluated using the correlation coefficient of ranked systems using mean average precision scores between the original Text REtrieval Conference (TREC) relevance judgments and pseudo relevance judgments. The results suggest that the proposed document ranking method with a pool depth of 100 could be a reliable alternative to reduce human effort and disagreement errors involved in generating TREC-like relevance judgments. Originality/value Simple methods proposed in this study show improvement in the correlation coefficient in generating alternate relevance judgment without human assessors while contributing to information retrieval evaluation.

Date

20. 1.2015 18:30:22
18. 9.2018 18:22:56

0.023873195 = product of:
  0.071619585 = sum of:
    0.071619585 = product of:
      0.14323917 = sum of:
        0.14323917 = weight(_text_:web in 6028) [ClassicSimilarity], result of:
          0.14323917 = score(doc=6028,freq=46.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.86461735 = fieldWeight in 6028, product of:
              6.78233 = tf(freq=46.0), with freq of:
                46.0 = termFreq=46.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6028)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

This research is part of the ongoing study to better understand web page ranking on the web. It looks at a web page as a graph structure or a web graph, and tries to classify different web graphs in the new coordinate space: (out-degree, in-degree). The out-degree coordinate od is defined as the number of outgoing web pages from a given web page. The in-degree id coordinate is the number of web pages that point to a given web page. In this new coordinate space a metric is built to classify how close or far different web graphs are. Google's web ranking algorithm (Brin & Page, 1998) on ranking web pages is applied in this new coordinate space. The results of the algorithm has been modified to fit different topological web graph structures. Also the algorithm was not successful in the case of general web graphs and new ranking web algorithms have to be considered. This study does not look at enhancing web ranking by adding any contextual information. It only considers web links as a source to web page ranking. The author believes that understanding the underlying web page as a graph will help design better ranking web algorithms, enhance retrieval and web performance, and recommends using graphs as a part of visual aid for browsing engine designers

0.021962207 = product of:
  0.06588662 = sum of:
    0.06588662 = sum of:
      0.041814405 = weight(_text_:web in 2509) [ClassicSimilarity], result of:
        0.041814405 = score(doc=2509,freq=8.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.25239927 = fieldWeight in 2509, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.02734375 = fieldNorm(doc=2509)
      0.024072208 = weight(_text_:22 in 2509) [ClassicSimilarity], result of:
        0.024072208 = score(doc=2509,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.1354154 = fieldWeight in 2509, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=2509)
  0.33333334 = coord(1/3)

Content

"Most Web search engines accept natural language queries, perform some kind of fuzzy matching and produce ranked output, displaying first the documents that are most likely to be relevant. On the other hand, most library online public access catalogs (OPACs) an the Web are still Boolean retrieval systems that perform exact matching, and require users to express their search requests precisely in a Boolean search language and to refine their search statements to improve the search results. It is well-documented that users have difficulty searching Boolean OPACs effectively (e.g. Borgman, 1996; Ensor, 1992; Wallace, 1993). One approach to making OPACs easier to use is to develop a natural language search interface that acts as a middleware between the user's Web browser and the OPAC system. The search interface can accept a natural language query from the user and reformulate it as a series of Boolean search statements that are then submitted to the OPAC. The records retrieved by the OPAC are ranked by the search interface before forwarding them to the user's Web browser. The user, then, does not need to interact directly with the Boolean OPAC but with the natural language search interface or search intermediary. The search interface interacts with the OPAC system an the user's behalf. The advantage of this approach is that no modification to the OPAC or library system is required. Furthermore, the search interface can access multiple OPACs, acting as a meta search engine, and integrate search results from various OPACs before sending them to the user. The search interface needs to incorporate a method for converting the user's natural language query into a series of Boolean search statements, and for ranking the OPAC records retrieved. The purpose of this study was to develop a relevancyranking algorithm for a search interface to Boolean OPAC systems. This is part of an on-going effort to develop a knowledge-based search interface to OPACs called the E-Referencer (Khoo et al., 1998, 1999; Poo et al., 2000). E-Referencer v. 2 that has been implemented applies a repertoire of initial search strategies and reformulation strategies to retrieve records from OPACs using the Z39.50 protocol, and also assists users in mapping query keywords to the Library of Congress subject headings."

Source

Electronic library. 22(2004) no.2, S.112-120

0.021418769 = product of:
  0.0642563 = sum of:
    0.0642563 = sum of:
      0.029867431 = weight(_text_:web in 56) [ClassicSimilarity], result of:
        0.029867431 = score(doc=56,freq=2.0), product of:
          0.1656677 = queryWeight, product of:
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.050763648 = queryNorm
          0.18028519 = fieldWeight in 56, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.2635105 = idf(docFreq=4597, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
      0.03438887 = weight(_text_:22 in 56) [ClassicSimilarity], result of:
        0.03438887 = score(doc=56,freq=2.0), product of:
          0.17776565 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050763648 = queryNorm
          0.19345059 = fieldWeight in 56, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=56)
  0.33333334 = coord(1/3)

Abstract

The study reported here investigated the query expansion behavior of end-users interacting with a thesaurus-enhanced search system on the Web. Two groups, namely academic staff and postgraduate students, were recruited into this study. Data were collected from 90 searches performed by 30 users using the OVID interface to the CAB abstracts database. Data-gathering techniques included questionnaires, screen capturing software, and interviews. The results presented here relate to issues of search-topic and search-term characteristics, number and types of expanded queries, usefulness of thesaurus terms, and behavioral differences between academic staff and postgraduate students in their interaction. The key conclusions drawn were that (a) academic staff chose more narrow and synonymous terms than did postgraduate students, who generally selected broader and related terms; (b) topic complexity affected users' interaction with the thesaurus in that complex topics required more query expansion and search term selection; (c) users' prior topic-search experience appeared to have a significant effect on their selection and evaluation of thesaurus terms; (d) in 50% of the searches where additional terms were suggested from the thesaurus, users stated that they had not been aware of the terms at the beginning of the search; this observation was particularly noticeable in the case of postgraduate students.

Date

22. 7.2006 16:32:43

0.018351128 = product of:
  0.055053383 = sum of:
    0.055053383 = weight(_text_:wide in 4998) [ClassicSimilarity], result of:
      0.055053383 = score(doc=4998,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 4998, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4998)
  0.33333334 = coord(1/3)

Abstract

Documents usually have a content and a structure. The content refers to the text of the document, whereas the structure refers to how a document is logically organized. An increasingly common way to encode the structure is through the use of a mark-up language. Nowadays, the most widely used mark-up language for representing structure is the eXtensible Mark-up Language (XML). XML can be used to provide a focused access to documents, i.e. returning XML elements, such as sections and paragraphs, instead of whole documents in response to a query. Such focused strategies are of particular benefit for information repositories containing long documents, or documents covering a wide variety of topics, where users are directed to the most relevant content within a document. The increased adoption of XML to represent a document structure requires the development of tools to effectively access documents marked-up in XML. This book provides a detailed description of query languages, indexing strategies, ranking algorithms, presentation scenarios developed to access XML documents. Major advances in XML retrieval were seen from 2002 as a result of INEX, the Initiative for Evaluation of XML Retrieval. INEX, also described in this book, provided test sets for evaluating XML retrieval effectiveness. Many of the developments and results described in this book were investigated within INEX.

0.018351128 = product of:
  0.055053383 = sum of:
    0.055053383 = weight(_text_:wide in 1607) [ClassicSimilarity], result of:
      0.055053383 = score(doc=1607,freq=2.0), product of:
        0.22492146 = queryWeight, product of:
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.050763648 = queryNorm
        0.24476713 = fieldWeight in 1607, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4307585 = idf(docFreq=1430, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1607)
  0.33333334 = coord(1/3)

Abstract

Pseudorelevance feedback (PRF) was proposed to solve the limitation of relevance feedback (RF), which is based on the user-in-the-loop process. In PRF, the top-k retrieved images are regarded as PRF. Although the PRF set contains noise, PRF has proven effective for automatically improving the overall retrieval result. To implement PRF, the Rocchio algorithm has been considered as a reasonable and well-established baseline. However, the performance of Rocchio-based PRF is subject to various representation choices (or factors). In this article, we examine these factors that affect the performance of Rocchio-based PRF, including image-feature representation, the number of top-ranked images, the weighting parameters of Rocchio, and similarity measure. We offer practical insights on how to optimize the performance of Rocchio-based PRF by choosing appropriate representation choices. Our extensive experiments on NUS-WIDE-LITE and Caltech 101 + Corel 5000 data sets show that the optimal feature representation is color moment + wavelet texture in terms of retrieval efficiency and effectiveness. Other representation choices are that using top-20 ranked images as pseudopositive and pseudonegative feedback sets with the equal weight (i.e., 0.5) by the correlation and cosine distance functions can produce the optimal retrieval result.

0.018340731 = product of:
  0.05502219 = sum of:
    0.05502219 = product of:
      0.11004438 = sum of:
        0.11004438 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.11004438 = score(doc=402,freq=2.0), product of:
            0.17776565 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050763648 = queryNorm
            0.61904186 = fieldWeight in 402, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=402)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Information processing and management. 22(1986) no.6, S.465-476

0.01689557 = product of:
  0.05068671 = sum of:
    0.05068671 = product of:
      0.10137342 = sum of:
        0.10137342 = weight(_text_:web in 674) [ClassicSimilarity], result of:
          0.10137342 = score(doc=674,freq=16.0), product of:
            0.1656677 = queryWeight, product of:
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.050763648 = queryNorm
            0.6119082 = fieldWeight in 674, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.2635105 = idf(docFreq=4597, maxDocs=44218)
              0.046875 = fieldNorm(doc=674)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Introduces several new versions of PageRank (the link based Web page ranking algorithm), based on an information science perspective on the concept of the Web document. Although the Web page is the typical indivisible unit of information in search engine results and most Web information retrieval algorithms, other research has suggested that aggregating pages based on directories and domains gives promising alternatives, particularly when Web links are the object of study. The new algorithms introduced based on these alternatives were used to rank four sets of Web pages. The ranking results were compared with human subjects' rankings. The results of the tests were somewhat inconclusive: the new approach worked well for the set that includes pages from different Web sites; however, it does not work well in ranking pages that are from the same site. It seems that the new algorithms may be effective for some tasks but not for others, especially when only low numbers of links are involved or the pages to be ranked are from the same site or directory.