Search (21 results, page 1 of 2)

0.016453851 = product of:
  0.04936155 = sum of:
    0.04936155 = product of:
      0.0987231 = sum of:
        0.0987231 = weight(_text_:22 in 334) [ClassicSimilarity], result of:
          0.0987231 = score(doc=334,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = queryNorm
            0.61904186 = fieldWeight in 334, 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=334)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Source

Annual review of information science and technology. 22(1987), S.109-145

0.010283656 = product of:
  0.03085097 = sum of:
    0.03085097 = product of:
      0.06170194 = sum of:
        0.06170194 = weight(_text_:22 in 3103) [ClassicSimilarity], result of:
          0.06170194 = score(doc=3103,freq=2.0), product of:
            0.15947726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045541126 = queryNorm
            0.38690117 = fieldWeight in 3103, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=3103)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

27. 2.1999 20:55:22

0.008869919 = product of:
  0.026609756 = sum of:
    0.026609756 = weight(_text_:to in 1094) [ClassicSimilarity], result of:
      0.026609756 = score(doc=1094,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 1094, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.125 = fieldNorm(doc=1094)
  0.33333334 = coord(1/3)

0.008869919 = product of:
  0.026609756 = sum of:
    0.026609756 = weight(_text_:to in 7863) [ClassicSimilarity], result of:
      0.026609756 = score(doc=7863,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 7863, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.125 = fieldNorm(doc=7863)
  0.33333334 = coord(1/3)

0.0077611795 = product of:
  0.023283537 = sum of:
    0.023283537 = weight(_text_:to in 3898) [ClassicSimilarity], result of:
      0.023283537 = score(doc=3898,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28121543 = fieldWeight in 3898, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.109375 = fieldNorm(doc=3898)
  0.33333334 = coord(1/3)

0.0074376534 = product of:
  0.02231296 = sum of:
    0.02231296 = weight(_text_:to in 460) [ClassicSimilarity], result of:
      0.02231296 = score(doc=460,freq=10.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.26949292 = fieldWeight in 460, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=460)
  0.33333334 = coord(1/3)

Abstract

XML holds the promise to yield (1) a more precise search by providing additional information in the elements, (2) a better integrated search of documents from heterogeneous sources, (3) a powerful search paradigm using structural as well as content specifications, and (4) data and information exchange to share resources and to support cooperative search. We survey several indexing techniques for XML documents, grouping them into flatfile, semistructured, and structured indexing paradigms. Searching techniques and supporting techniques for searching are reviewed, including full text search and multistage search. Because searching XML documents can be very flexible, various search result presentations are discussed, as well as database and information retrieval system integration and XML query languages. We also survey various retrieval models, examining how they would be used or extended for retrieving XML documents. To conclude the article, we discuss various open issues that XML poses with respect to information retrieval and database research.

0.0073336246 = product of:
  0.022000873 = sum of:
    0.022000873 = weight(_text_:to in 4277) [ClassicSimilarity], result of:
      0.022000873 = score(doc=4277,freq=14.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.2657236 = fieldWeight in 4277, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4277)
  0.33333334 = coord(1/3)

Abstract

This chapter reviews research and applications in statistical language modeling for information retrieval (IR), which has emerged within the past several years as a new probabilistic framework for describing information retrieval processes. Generally speaking, statistical language modeling, or more simply language modeling (LM), involves estimating a probability distribution that captures statistical regularities of natural language use. Applied to information retrieval, language modeling refers to the problem of estimating the likelihood that a query and a document could have been generated by the same language model, given the language model of the document either with or without a language model of the query. The roots of statistical language modeling date to the beginning of the twentieth century when Markov tried to model letter sequences in works of Russian literature (Manning & Schütze, 1999). Zipf (1929, 1932, 1949, 1965) studied the statistical properties of text and discovered that the frequency of works decays as a Power function of each works rank. However, it was Shannon's (1951) work that inspired later research in this area. In 1951, eager to explore the applications of his newly founded information theory to human language, Shannon used a prediction game involving n-grams to investigate the information content of English text. He evaluated n-gram models' performance by comparing their crossentropy an texts with the true entropy estimated using predictions made by human subjects. For many years, statistical language models have been used primarily for automatic speech recognition. Since 1980, when the first significant language model was proposed (Rosenfeld, 2000), statistical language modeling has become a fundamental component of speech recognition, machine translation, and spelling correction.

0.006721379 = product of:
  0.020164136 = sum of:
    0.020164136 = weight(_text_:to in 4028) [ClassicSimilarity], result of:
      0.020164136 = score(doc=4028,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24353972 = fieldWeight in 4028, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4028)
  0.33333334 = coord(1/3)

Abstract

Reports on an analysis of lexical ambiguity in information retrieval text collections and on experiments to determine the utility of word meanings for separating relevant from nonrelevant documents. Results show that there is considerable ambiguity even in a specialised database. Word senses provide a significant separation between relevant and nonrelevant documents, but several factors contribute to determining whether disambiguation will make an improvement in performance such as: resolving lexical ambiguity was found to have little impact on retrieval effectiveness for documents that have many words in common with the query. Discusses other uses of word sense disambiguation in an information retrieval context

0.006721379 = product of:
  0.020164136 = sum of:
    0.020164136 = weight(_text_:to in 4494) [ClassicSimilarity], result of:
      0.020164136 = score(doc=4494,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24353972 = fieldWeight in 4494, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4494)
  0.33333334 = coord(1/3)

Abstract

Although commonly used in both commercial and experimental information retrieval systems, thesauri have not demonstrated consistent benefits for retrieval performance, and it is difficult to construct a thesaurus automatically for large text databases. In this paper, an approach, called PhraseFinder, is proposed to construct collection-dependent association thesauri automatically using large full-text document collections. The association thesaurus can be accessed through natural language queries in INQUERY, an information retrieval system based on the probabilistic inference network. Experiments are conducted in INQUERY to evaluate different types of association thesauri, and thesauri constructed for a variety of collections

0.006652439 = product of:
  0.019957317 = sum of:
    0.019957317 = weight(_text_:to in 6093) [ClassicSimilarity], result of:
      0.019957317 = score(doc=6093,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24104178 = fieldWeight in 6093, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.09375 = fieldNorm(doc=6093)
  0.33333334 = coord(1/3)

Abstract

One of nine articles in this issue of Communications of the ACM devoted to information filtering

0.006652439 = product of:
  0.019957317 = sum of:
    0.019957317 = weight(_text_:to in 38) [ClassicSimilarity], result of:
      0.019957317 = score(doc=38,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24104178 = fieldWeight in 38, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=38)
  0.33333334 = coord(1/3)

Abstract

Effective retrieval in a distributed environment is an important but difficult problem. Lack of effectiveness appears to have two major causes. First, existing collection selection algorithms do not work well on heterogeneous collections. Second, relevant documents are scattered over many collections and searching a few collections misses many relevant documents. We propose a topic-oriented approach to distributed retrieval. With this approach, we structure the document set of a distributed retrieval environment around a set of topics. Retrieval for a query involves first selecting the right topics for the query and then dispatching the search process to collections that contain such topics. The content of a topic is characterized by a language model. In environments where the labeling of documents by topics is unavailable, document clustering is employed for topic identification. Based on these ideas, three methods are proposed to suit different environments. We show that all three methods improve effectiveness of distributed retrieval

0.006652439 = product of:
  0.019957317 = sum of:
    0.019957317 = weight(_text_:to in 902) [ClassicSimilarity], result of:
      0.019957317 = score(doc=902,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24104178 = fieldWeight in 902, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=902)
  0.33333334 = coord(1/3)

Abstract

People use questions to elicit information from other people in their everyday lives and yet the most common method of obtaining information from a search engine is by posing keywords. There has been research that suggests users are better at expressing their information needs in natural language, however the vast majority of work to improve document retrieval has focused on queries posed as sets of keywords or Boolean queries. This paper focuses on improving document retrieval for the subset of natural language questions asking about how something is done. We classify questions as asking either for a description of a process or asking for a statement of fact, with better than 90% accuracy. Further we identify non-content features of documents relevant to questions asking about a process. Finally we demonstrate that we can use these features to significantly improve the precision of document retrieval results for questions asking about a process. Our approach, based on exploiting the structure of documents, shows a significant improvement in precision at rank one for questions asking about how something is done.

0.006652439 = product of:
  0.019957317 = sum of:
    0.019957317 = weight(_text_:to in 496) [ClassicSimilarity], result of:
      0.019957317 = score(doc=496,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.24104178 = fieldWeight in 496, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=496)
  0.33333334 = coord(1/3)

Abstract

This research analyzes human-generated clarification questions to provide insights into how they are used to disambiguate and provide a better understanding of information needs. A set of clarification questions is extracted from posts on the Stack Exchange platform. Novel taxonomy is defined for the annotation of the questions and their responses. We investigate the clarification questions in terms of whether they add any information to the post (the initial question posted by the asker) and the accepted answer, which is the answer chosen by the asker. After identifying, which clarification questions are more useful, we investigated the characteristics of these questions in terms of their types and patterns. Non-useful clarification questions are identified, and their patterns are compared with useful clarifications. Our analysis indicates that the most useful clarification questions have similar patterns, regardless of topic. This research contributes to an understanding of clarification in conversations and can provide insight for clarification dialogues in conversational search scenarios and for the possible system generation of clarification requests in information-seeking conversations.

0.00627198 = product of:
  0.018815938 = sum of:
    0.018815938 = weight(_text_:to in 589) [ClassicSimilarity], result of:
      0.018815938 = score(doc=589,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22725637 = fieldWeight in 589, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=589)
  0.33333334 = coord(1/3)

Source

From classification to 'knowledge organization': Dorking revisited or 'past is prelude'. A collection of reprints to commemorate the firty year span between the Dorking Conference (First International Study Conference on Classification Research 1957) and the Sixth International Study Conference on Classification Research (London 1997). Ed.: A. Gilchrist

0.00627198 = product of:
  0.018815938 = sum of:
    0.018815938 = weight(_text_:to in 1258) [ClassicSimilarity], result of:
      0.018815938 = score(doc=1258,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22725637 = fieldWeight in 1258, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=1258)
  0.33333334 = coord(1/3)

Abstract

Current user interfaces for textual database searching leave much to be desired: individually, they are often confusing, and as a group, they are seriously inconsistent. We propose a four- phase framework for user-interface design: the framework provides common structure and terminology for searching while preserving the distinct features of individual collections and search mechanisms. Users will benefit from faster learning, increased comprehension, and better control, leading to more effective searches and higher satisfaction.

0.0061980444 = product of:
  0.018594133 = sum of:
    0.018594133 = weight(_text_:to in 2692) [ClassicSimilarity], result of:
      0.018594133 = score(doc=2692,freq=10.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22457743 = fieldWeight in 2692, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2692)
  0.33333334 = coord(1/3)

Abstract

Both general and domain-specific search engines have adopted query suggestion techniques to help users formulate effective queries. In the specific domain of literature search (e.g., finding academic papers), the initial queries are usually based on a draft paper or abstract, rather than short lists of keywords. In this paper, we investigate phrasal-concept query suggestions for literature search. These suggestions explicitly specify important phrasal concepts related to an initial detailed query. The merits of phrasal-concept query suggestions for this domain are their readability and retrieval effectiveness: (1) phrasal concepts are natural for academic authors because of their frequent use of terminology and subject-specific phrases and (2) academic papers describe their key ideas via these subject-specific phrases, and thus phrasal concepts can be used effectively to find those papers. We propose a novel phrasal-concept query suggestion technique that generates queries by identifying key phrasal-concepts from pseudo-labeled documents and combines them with related phrases. Our proposed technique is evaluated in terms of both user preference and retrieval effectiveness. We conduct user experiments to verify a preference for our approach, in comparison to baseline query suggestion methods, and demonstrate the effectiveness of the technique with retrieval experiments.

0.005761182 = product of:
  0.017283546 = sum of:
    0.017283546 = weight(_text_:to in 6862) [ClassicSimilarity], result of:
      0.017283546 = score(doc=6862,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20874833 = fieldWeight in 6862, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=6862)
  0.33333334 = coord(1/3)

Abstract

The combination of different text representations and search strategies has become a standard technique for improving the effectiveness of information retrieval. Combination, for example, has been studied extensively in the TREC evaluations and is the basis of the "meta-search" engines used on the Web. This paper examines the development of this technique, including both experimental results and the retrieval models that have been proposed as formal frameworks for combination. We show that combining approaches for information retrieval can be modeled as combining the outputs of multiple classifiers based on one or more representations, and that this simple model can provide explanations for many of the experimental results. We also show that this view of combination is very similar to the inference net model, and that a new approach to retrieval based on language models supports combination and can be integrated with the inference net model

0.005761182 = product of:
  0.017283546 = sum of:
    0.017283546 = weight(_text_:to in 2080) [ClassicSimilarity], result of:
      0.017283546 = score(doc=2080,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20874833 = fieldWeight in 2080, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=2080)
  0.33333334 = coord(1/3)

Abstract

In this paper, a new novelty detection approach based on the identification of sentence level information patterns is proposed. First, "novelty" is redefined based on the proposed information patterns, and several different types of information patterns are given corresponding to different types of users' information needs. Second, a thorough analysis of sentence level information patterns is elaborated using data from the TREC novelty tracks, including sentence lengths, named entities (NEs), and sentence level opinion patterns. Finally, a unified information-pattern-based approach to novelty detection (ip-BAND) is presented for both specific NE topics and more general topics. Experiments on novelty detection on data from the TREC 2002, 2003 and 2004 novelty tracks show that the proposed approach significantly improves the performance of novelty detection in terms of precision at top ranks. Future research directions are suggested.

0.005761182 = product of:
  0.017283546 = sum of:
    0.017283546 = weight(_text_:to in 2605) [ClassicSimilarity], result of:
      0.017283546 = score(doc=2605,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20874833 = fieldWeight in 2605, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=2605)
  0.33333334 = coord(1/3)

Abstract

For introductory information retrieval courses at the undergraduate and graduate level in computer science, information science and computer engineering departments. Written by a leader in the field of information retrieval, Search Engines: Information Retrieval in Practice, is designed to give undergraduate students the understanding and tools they need to evaluate, compare and modify search engines. Coverage of the underlying IR and mathematical models reinforce key concepts. The book's numerous programming exercises make extensive use of Galago, a Java-based open source search engine. SUPPLEMENTS / Extensive lecture slides (in PDF and PPT format) / Solutions to selected end of chapter problems (Instructors only) / Test collections for exercises / Galago search engine

0.005487982 = product of:
  0.016463947 = sum of:
    0.016463947 = weight(_text_:to in 2418) [ClassicSimilarity], result of:
      0.016463947 = score(doc=2418,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.19884932 = fieldWeight in 2418, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2418)
  0.33333334 = coord(1/3)

Abstract

Results from research in information retrieval have suggested that significant improvements in retrieval effectiveness can be obtained by combining results from multiple index representioms, query formulations, and search strategies. The inference net model of retrieval, which was designed from this point of view, treats information retrieval as an evidental reasoning process where multiple sources of evidence about document and query content are combined to estimate relevance probabilities. Uses a system based on this model to study the retrieval effectiveness benefits of combining these types of document and query information that are found in typical commercial databases and information services. The results indicate that substantial real benefits are possible