Search (1778 results, page 1 of 89)

  • × year_i:[2000 TO 2010}
  1. ¬The Eleventh Text Retrieval Conference, TREC 2002 (2003) 0.11
    0.11162338 = product of:
      0.22324675 = sum of:
        0.22324675 = sum of:
          0.16721052 = weight(_text_:searching in 4049) [ClassicSimilarity], result of:
            0.16721052 = score(doc=4049,freq=10.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.7995209 = fieldWeight in 4049, product of:
                3.1622777 = tf(freq=10.0), with freq of:
                  10.0 = termFreq=10.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0625 = fieldNorm(doc=4049)
          0.05603624 = weight(_text_:22 in 4049) [ClassicSimilarity], result of:
            0.05603624 = score(doc=4049,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.30952093 = fieldWeight in 4049, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0625 = fieldNorm(doc=4049)
      0.5 = coord(1/2)
    
    Abstract
    Proceedings of the llth TREC-conference held in Gaithersburg, Maryland (USA), November 19-22, 2002. Aim of the conference was discussion an retrieval and related information-seeking tasks for large test collection. 93 research groups used different techniques, for information retrieval from the same large database. This procedure makes it possible to compare the results. The tasks are: Cross-language searching, filtering, interactive searching, searching for novelty, question answering, searching for video shots, and Web searching.
  2. Trotman, A.: Searching structured documents (2004) 0.10
    0.1046527 = product of:
      0.2093054 = sum of:
        0.2093054 = sum of:
          0.1602737 = weight(_text_:searching in 2538) [ClassicSimilarity], result of:
            0.1602737 = score(doc=2538,freq=12.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.76635236 = fieldWeight in 2538, product of:
                3.4641016 = tf(freq=12.0), with freq of:
                  12.0 = termFreq=12.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=2538)
          0.049031712 = weight(_text_:22 in 2538) [ClassicSimilarity], result of:
            0.049031712 = score(doc=2538,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 2538, 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=2538)
      0.5 = coord(1/2)
    
    Abstract
    Structured document interchange formats such as XML and SGML are ubiquitous, however, information retrieval systems supporting structured searching are not. Structured searching can result in increased precision. A search for the author "Smith" in an unstructured corpus of documents specializing in iron-working could have a lower precision than a structured search for "Smith as author" in the same corpus. Analysis of XML retrieval languages identifies additional functionality that must be supported including searching at, and broken across multiple nodes in the document tree. A data structure is developed to support structured document searching. Application of this structure to information retrieval is then demonstrated. Document ranking is examined and adapted specifically for structured searching.
    Date
    14. 8.2004 10:39:22
  3. Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004) 0.10
    0.10312565 = sum of:
      0.08211206 = product of:
        0.24633618 = sum of:
          0.24633618 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
            0.24633618 = score(doc=562,freq=2.0), product of:
              0.43830654 = queryWeight, product of:
                8.478011 = idf(docFreq=24, maxDocs=44218)
                0.051699217 = queryNorm
              0.56201804 = fieldWeight in 562, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                8.478011 = idf(docFreq=24, maxDocs=44218)
                0.046875 = fieldNorm(doc=562)
        0.33333334 = coord(1/3)
      0.02101359 = product of:
        0.04202718 = sum of:
          0.04202718 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
            0.04202718 = score(doc=562,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 562, 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=562)
        0.5 = coord(1/2)
    
    Content
    Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
    Date
    8. 1.2013 10:22:32
  4. Bates, M.J.: Speculations on browsing, directed searching, and linking in relation to the Bradford distribution (2002) 0.09
    0.089702316 = product of:
      0.17940463 = sum of:
        0.17940463 = sum of:
          0.13737746 = weight(_text_:searching in 54) [ClassicSimilarity], result of:
            0.13737746 = score(doc=54,freq=12.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.65687346 = fieldWeight in 54, product of:
                3.4641016 = tf(freq=12.0), with freq of:
                  12.0 = termFreq=12.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.046875 = fieldNorm(doc=54)
          0.04202718 = weight(_text_:22 in 54) [ClassicSimilarity], result of:
            0.04202718 = score(doc=54,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 54, 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=54)
      0.5 = coord(1/2)
    
    Abstract
    Extensive literatures exist on information searching theory and techniques, as well as on the Bradford Distribution. This distribution, also known as "Bradford's Law of Scattering," tells us that information on a subject is dispersed in a characteristic and robust pattern that appears consistently across many different environments. This pattern may be expected to have important implications for information searching theory and techniques. Yet these two research literatures are rarely considered in relation to each other. It is the purpose of this article to distinguish three Bradford regions and speculate on the optimum searching techniques for each region. In the process, browsing, directed searching in databases, and the pursuit of various forms of links will all be considered. Implications of growth in size of a literature for optimal information organization and searching will also be addressed.
    Date
    22. 2.2007 18:56:23
  5. Horn, M.E.: "Garbage" in, "refuse and refuse disposal" out : making the most of the subject authority file in the OPAC (2002) 0.08
    0.08118117 = product of:
      0.16236234 = sum of:
        0.16236234 = sum of:
          0.11333063 = weight(_text_:searching in 156) [ClassicSimilarity], result of:
            0.11333063 = score(doc=156,freq=6.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.541893 = fieldWeight in 156, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=156)
          0.049031712 = weight(_text_:22 in 156) [ClassicSimilarity], result of:
            0.049031712 = score(doc=156,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 156, 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=156)
      0.5 = coord(1/2)
    
    Abstract
    Subject access in the OPAC, as discussed in this article, is predicated on two different kinds of searching: subject (authority, alphabetic, or controlled vocabulary searching) or keyword (uncontrolled, free text, natural language vocabulary). The literature has focused on demonstrating that both approaches are needed, but very few authors address the need to integrate keyword into authority searching. The article discusses this difference and compares, with a query on the term garbage, search results in two online catalogs, one that performs keyword searches through the authority file and one where only bibliographic records are included in keyword searches.
    Date
    10. 9.2000 17:38:22
  6. Mittler, E.; Schulz, M.: ProPrint world-wide print-on-demand services for study and research (2004) 0.08
    0.077013016 = product of:
      0.15402603 = sum of:
        0.15402603 = sum of:
          0.07477882 = weight(_text_:searching in 2855) [ClassicSimilarity], result of:
            0.07477882 = score(doc=2855,freq=2.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.3575566 = fieldWeight in 2855, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0625 = fieldNorm(doc=2855)
          0.079247214 = weight(_text_:22 in 2855) [ClassicSimilarity], result of:
            0.079247214 = score(doc=2855,freq=4.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.4377287 = fieldWeight in 2855, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0625 = fieldNorm(doc=2855)
      0.5 = coord(1/2)
    
    Abstract
    The libraries of more and more universities and research institutions have local digital repositories, and the amount of material is increasing every day. Users need an integrated retrieval interface that allows aggregated searching across multiple document servers without having to resort to manual processes. ProPrint offers an on-demand print service within Germany for over 2,000 monographs and 1,000 journals. Partners worldwide are now invited to join.
    Date
    8.10.2004 14:22:14
    Source
    Library hi tech. 22(2004) no.2, S.227-230
  7. Dorner, D.G.; Curtis, A.M.: ¬A comparative review of common user interface products (2004) 0.07
    0.070782885 = product of:
      0.14156577 = sum of:
        0.14156577 = sum of:
          0.092534065 = weight(_text_:searching in 2851) [ClassicSimilarity], result of:
            0.092534065 = score(doc=2851,freq=4.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.44245374 = fieldWeight in 2851, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=2851)
          0.049031712 = weight(_text_:22 in 2851) [ClassicSimilarity], result of:
            0.049031712 = score(doc=2851,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 2851, 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=2851)
      0.5 = coord(1/2)
    
    Abstract
    A common user interface replaces the multiple interfaces found among individual electronic library resources, reducing the time and effort spent by the user in both searching and learning to use a range of databases. Although the primary function of a common user interface is to simplify the search process, such products can be holistic solutions designed to address requirements other than searching, such as user authentication and site branding. This review provides a detailed summary of software currently on the market. The products reviewed were EnCompass, MetaLib, Find-It-All OneSearch, ZPORTAL, CPORTAL, InfoTrac Total Access, MetaFind, MuseSearch, SiteSearch, Single Search, Chameleon Gateway, and WebFeat.
    Source
    Library hi tech. 22(2004) no.2, S.182-197
  8. Wildemuth, B.M.: Evidence-based practice in search interface design (2006) 0.07
    0.070782885 = product of:
      0.14156577 = sum of:
        0.14156577 = sum of:
          0.092534065 = weight(_text_:searching in 5302) [ClassicSimilarity], result of:
            0.092534065 = score(doc=5302,freq=4.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.44245374 = fieldWeight in 5302, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=5302)
          0.049031712 = weight(_text_:22 in 5302) [ClassicSimilarity], result of:
            0.049031712 = score(doc=5302,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 5302, 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=5302)
      0.5 = coord(1/2)
    
    Abstract
    An evidence-based practice approach to search interface design is proposed, with the goal of designing interfaces that adequately support search strategy formulation and reformulation. Relevant findings from studies of information professionals' searching behaviors, end users' searching of bibliographic databases, and search behaviors on the Web are highlighted. Three brief examples are presented to illustrate the ways in which findings from such studies can be used to make decisions about the design of search interfaces. If academic research can be effectively connected with design practice, we can discover which design practices truly are best practices and incorporate them into future search interfaces.
    Date
    22. 7.2006 18:30:09
  9. Drabenstott, K.M.: Web search strategies (2000) 0.07
    0.07009317 = product of:
      0.14018634 = sum of:
        0.14018634 = sum of:
          0.11216822 = weight(_text_:searching in 1188) [ClassicSimilarity], result of:
            0.11216822 = score(doc=1188,freq=18.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.53633493 = fieldWeight in 1188, product of:
                4.2426405 = tf(freq=18.0), with freq of:
                  18.0 = termFreq=18.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.03125 = fieldNorm(doc=1188)
          0.02801812 = weight(_text_:22 in 1188) [ClassicSimilarity], result of:
            0.02801812 = score(doc=1188,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.15476047 = fieldWeight in 1188, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.03125 = fieldNorm(doc=1188)
      0.5 = coord(1/2)
    
    Abstract
    Surfing the World Wide Web used to be cool, dude, real cool. But things have gotten hot - so hot that finding something useful an the Web is no longer cool. It is suffocating Web searchers in the smoke and debris of mountain-sized lists of hits, decisions about which search engines they should use, whether they will get lost in the dizzying maze of a subject directory, use the right syntax for the search engine at hand, enter keywords that are likely to retrieve hits an the topics they have in mind, or enlist a browser that has sufficient functionality to display the most promising hits. When it comes to Web searching, in a few short years we have gone from the cool image of surfing the Web into the frying pan of searching the Web. We can turn down the heat by rethinking what Web searchers are doing and introduce some order into the chaos. Web search strategies that are tool-based-oriented to specific Web searching tools such as search en gines, subject directories, and meta search engines-have been widely promoted, and these strategies are just not working. It is time to dissect what Web searching tools expect from searchers and adjust our search strategies to these new tools. This discussion offers Web searchers help in the form of search strategies that are based an strategies that librarians have been using for a long time to search commercial information retrieval systems like Dialog, NEXIS, Wilsonline, FirstSearch, and Data-Star.
    Content
    "Web searching is different from searching commercial IR systems. We can learn from search strategies recommended for searching IR systems, but most won't be effective for Web searching. Web searchers need strate gies that let search engines do the job they were designed to do. This article presents six new Web searching strategies that do just that."
    Date
    22. 9.1997 19:16:05
  10. Dezelar-Tiedman, C.; Genereux, C.; Hearn, S.: Utilizing Z39.50 to obtain bibliographic copy : a cost-containment study (2006) 0.07
    0.069583856 = product of:
      0.13916771 = sum of:
        0.13916771 = sum of:
          0.097140536 = weight(_text_:searching in 113) [ClassicSimilarity], result of:
            0.097140536 = score(doc=113,freq=6.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.46447968 = fieldWeight in 113, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.046875 = fieldNorm(doc=113)
          0.04202718 = weight(_text_:22 in 113) [ClassicSimilarity], result of:
            0.04202718 = score(doc=113,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 113, 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=113)
      0.5 = coord(1/2)
    
    Abstract
    This paper looks at one approach to controlling costs when seeking cataloging copy. A small task group in the University of Minnesota Libraries Technical Services Department conducted a study to devise the most cost-effective strategy for searching for and importing bibliographic copy, by compiling costs and benefits of importing records from the OCLC Online Computer Library Center database, the Research Libraries Group Union Catalog (RLIN), and the Library of Congress (LC) catalog. Results of the study indicated that, although the LC database is smaller than the other two utilities, a sufficient portion of needed records were available from LC to more than offset the cost of re-searching in the other databases for records not found. In addition, due to differences in pricing structure, searching RLIN second was found to be more cost effective than going next to OCLC, even though a slightly larger proportion of items were found in OCLC than RLIN. This study may prove useful either as a research method or in terms of its findings for other libraries wishing to compare sources of cataloging copy.
    Date
    10. 9.2000 17:38:22
  11. Zhang, Y.; Jansen, B.J.; Spink, A.: Identification of factors predicting clickthrough in Web searching using neural network analysis (2009) 0.07
    0.069583856 = product of:
      0.13916771 = sum of:
        0.13916771 = sum of:
          0.097140536 = weight(_text_:searching in 2742) [ClassicSimilarity], result of:
            0.097140536 = score(doc=2742,freq=6.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.46447968 = fieldWeight in 2742, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.046875 = fieldNorm(doc=2742)
          0.04202718 = weight(_text_:22 in 2742) [ClassicSimilarity], result of:
            0.04202718 = score(doc=2742,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 2742, 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=2742)
      0.5 = coord(1/2)
    
    Abstract
    In this research, we aim to identify factors that significantly affect the clickthrough of Web searchers. Our underlying goal is determine more efficient methods to optimize the clickthrough rate. We devise a clickthrough metric for measuring customer satisfaction of search engine results using the number of links visited, number of queries a user submits, and rank of clicked links. We use a neural network to detect the significant influence of searching characteristics on future user clickthrough. Our results show that high occurrences of query reformulation, lengthy searching duration, longer query length, and the higher ranking of prior clicked links correlate positively with future clickthrough. We provide recommendations for leveraging these findings for improving the performance of search engine retrieval and result ranking, along with implications for search engine marketing.
    Date
    22. 3.2009 17:49:11
  12. Budd, J.: Exploring categorization : undergraduate student searching and the evolution of catalogs (2007) 0.07
    0.06540753 = product of:
      0.13081506 = sum of:
        0.13081506 = sum of:
          0.07477882 = weight(_text_:searching in 256) [ClassicSimilarity], result of:
            0.07477882 = score(doc=256,freq=2.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.3575566 = fieldWeight in 256, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0625 = fieldNorm(doc=256)
          0.05603624 = weight(_text_:22 in 256) [ClassicSimilarity], result of:
            0.05603624 = score(doc=256,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.30952093 = fieldWeight in 256, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.0625 = fieldNorm(doc=256)
      0.5 = coord(1/2)
    
    Date
    10. 9.2000 17:38:22
  13. Bian, G.-W.; Chen, H.-H.: Cross-language information access to multilingual collections on the Internet (2000) 0.06
    0.060671046 = product of:
      0.12134209 = sum of:
        0.12134209 = sum of:
          0.07931491 = weight(_text_:searching in 4436) [ClassicSimilarity], result of:
            0.07931491 = score(doc=4436,freq=4.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.37924606 = fieldWeight in 4436, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.046875 = fieldNorm(doc=4436)
          0.04202718 = weight(_text_:22 in 4436) [ClassicSimilarity], result of:
            0.04202718 = score(doc=4436,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 4436, 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=4436)
      0.5 = coord(1/2)
    
    Abstract
    Language barrier is the major problem that people face in searching for, retrieving, and understanding multilingual collections on the Internet. This paper deals with query translation and document translation in a Chinese-English information retrieval system called MTIR. Bilingual dictionary and monolingual corpus-based approaches are adopted to select suitable tranlated query terms. A machine transliteration algorithm is introduced to resolve proper name searching. We consider several design issues for document translation, including which material is translated, what roles the HTML tags play in translation, what the tradeoff is between the speed performance and the translation performance, and what from the translated result is presented in. About 100.000 Web pages translated in the last 4 months of 1997 are used for quantitative study of online and real-time Web page translation
    Date
    16. 2.2000 14:22:39
  14. Neuroth, H.; Pianos, T.: VASCODA: a German scientific portal for cross-searching distributed digital resource collections (2003) 0.06
    0.060671046 = product of:
      0.12134209 = sum of:
        0.12134209 = sum of:
          0.07931491 = weight(_text_:searching in 2420) [ClassicSimilarity], result of:
            0.07931491 = score(doc=2420,freq=4.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.37924606 = fieldWeight in 2420, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.046875 = fieldNorm(doc=2420)
          0.04202718 = weight(_text_:22 in 2420) [ClassicSimilarity], result of:
            0.04202718 = score(doc=2420,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.23214069 = fieldWeight in 2420, 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=2420)
      0.5 = coord(1/2)
    
    Abstract
    The German information science community - with the support of the two main funding agencies in Germany - will develop a scientific portal, vascoda, for cross-searching distributed metadata collections. In platitudinous words, one of the services of vascoda is going to be a ldquoGooglerdquo-like search for the academic community, an easy to use, yet sophisticated search-engine to supply information on high-quality resources from different media and technical environments. Reaching this objective requires considerable standardisation activity amongst the main players to harmonise the already existing services (e.g. regarding metadata, protocols, etc.). The co-operation amongst the participants including both of the funding agencies is creating a unique team-work situation in Germany thus strengthening the information science community.
    Source
    Research and advanced technology for digital libraries : 7th European Conference, proceedings / ECDL 2003, Trondheim, Norway, August 17-22, 2003
  15. Chau, M.; Lu, Y.; Fang, X.; Yang, C.C.: Characteristics of character usage in Chinese Web searching (2009) 0.06
    0.05798655 = product of:
      0.1159731 = sum of:
        0.1159731 = sum of:
          0.08095045 = weight(_text_:searching in 2456) [ClassicSimilarity], result of:
            0.08095045 = score(doc=2456,freq=6.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.38706642 = fieldWeight in 2456, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0390625 = fieldNorm(doc=2456)
          0.035022654 = weight(_text_:22 in 2456) [ClassicSimilarity], result of:
            0.035022654 = score(doc=2456,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.19345059 = fieldWeight in 2456, 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=2456)
      0.5 = coord(1/2)
    
    Abstract
    The use of non-English Web search engines has been prevalent. Given the popularity of Chinese Web searching and the unique characteristics of Chinese language, it is imperative to conduct studies with focuses on the analysis of Chinese Web search queries. In this paper, we report our research on the character usage of Chinese search logs from a Web search engine in Hong Kong. By examining the distribution of search query terms, we found that users tended to use more diversified terms and that the usage of characters in search queries was quite different from the character usage of general online information in Chinese. After studying the Zipf distribution of n-grams with different values of n, we found that the curve of unigram is the most curved one of all while the bigram curve follows the Zipf distribution best, and that the curves of n-grams with larger n (n = 3-6) had similar structures with ?-values in the range of 0.66-0.86. The distribution of combined n-grams was also studied. All the analyses are performed on the data both before and after the removal of function terms and incomplete terms and similar findings are revealed. We believe the findings from this study have provided some insights into further research in non-English Web searching and will assist in the design of more effective Chinese Web search engines.
    Date
    22.11.2008 17:57:22
  16. Xie, I.; Cool, C.: Understanding help seeking within the context of searching digital libraries (2009) 0.06
    0.05798655 = product of:
      0.1159731 = sum of:
        0.1159731 = sum of:
          0.08095045 = weight(_text_:searching in 2737) [ClassicSimilarity], result of:
            0.08095045 = score(doc=2737,freq=6.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.38706642 = fieldWeight in 2737, product of:
                2.4494898 = tf(freq=6.0), with freq of:
                  6.0 = termFreq=6.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0390625 = fieldNorm(doc=2737)
          0.035022654 = weight(_text_:22 in 2737) [ClassicSimilarity], result of:
            0.035022654 = score(doc=2737,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.19345059 = fieldWeight in 2737, 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=2737)
      0.5 = coord(1/2)
    
    Abstract
    To date, there has been little empirical research investigating the specific types of help-seeking situations that arise when people interact with information in new searching environments such as digital libraries. This article reports the results of a project focusing on the identification of different types of help-seeking situations, along with types of factors that precipitate them among searchers of two different digital libraries. Participants (N = 120) representing the general public in Milwaukee and New York City were selected for this study. Based on the analysis of multiple sources of data, the authors identify 15 types of help-seeking situations among this sample of novice digital library users. These situations are related to the searching activities involved in getting started, identifying relevant digital collections, browsing for information, constructing search statements, refining searches, monitoring searches, and evaluating results. Multiple factors that determine the occurrences of each type of help-seeking situation also are identified. The article concludes with a model that represents user, system, task, and interaction outcome as codeterminates in the formation of help-seeking situations, and presents the theoretical and practical implications of the study results.
    Date
    22. 3.2009 12:49:20
  17. Doszkocs, T.E.; Zamora, A.: Dictionary services and spelling aids for Web searching (2004) 0.06
    0.057812635 = product of:
      0.11562527 = sum of:
        0.11562527 = sum of:
          0.06609576 = weight(_text_:searching in 2541) [ClassicSimilarity], result of:
            0.06609576 = score(doc=2541,freq=4.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.3160384 = fieldWeight in 2541, product of:
                2.0 = tf(freq=4.0), with freq of:
                  4.0 = termFreq=4.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0390625 = fieldNorm(doc=2541)
          0.049529508 = weight(_text_:22 in 2541) [ClassicSimilarity], result of:
            0.049529508 = score(doc=2541,freq=4.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.27358043 = fieldWeight in 2541, 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=2541)
      0.5 = coord(1/2)
    
    Abstract
    The Specialized Information Services Division (SIS) of the National Library of Medicine (NLM) provides Web access to more than a dozen scientific databases on toxicology and the environment on TOXNET . Search queries on TOXNET often include misspelled or variant English words, medical and scientific jargon and chemical names. Following the example of search engines like Google and ClinicalTrials.gov, we set out to develop a spelling "suggestion" system for increased recall and precision in TOXNET searching. This paper describes development of dictionary technology that can be used in a variety of applications such as orthographic verification, writing aid, natural language processing, and information storage and retrieval. The design of the technology allows building complex applications using the components developed in the earlier phases of the work in a modular fashion without extensive rewriting of computer code. Since many of the potential applications envisioned for this work have on-line or web-based interfaces, the dictionaries and other computer components must have fast response, and must be adaptable to open-ended database vocabularies, including chemical nomenclature. The dictionary vocabulary for this work was derived from SIS and other databases and specialized resources, such as NLM's Unified Medical Language Systems (UMLS) . The resulting technology, A-Z Dictionary (AZdict), has three major constituents: 1) the vocabulary list, 2) the word attributes that define part of speech and morphological relationships between words in the list, and 3) a set of programs that implements the retrieval of words and their attributes, and determines similarity between words (ChemSpell). These three components can be used in various applications such as spelling verification, spelling aid, part-of-speech tagging, paraphrasing, and many other natural language processing functions.
    Date
    14. 8.2004 17:22:56
    Source
    Online. 28(2004) no.3, S.22-29
  18. Heery, R.: Information gateways : collaboration and content (2000) 0.06
    0.057231586 = product of:
      0.11446317 = sum of:
        0.11446317 = sum of:
          0.06543146 = weight(_text_:searching in 4866) [ClassicSimilarity], result of:
            0.06543146 = score(doc=4866,freq=2.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.31286204 = fieldWeight in 4866, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=4866)
          0.049031712 = weight(_text_:22 in 4866) [ClassicSimilarity], result of:
            0.049031712 = score(doc=4866,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 4866, 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=4866)
      0.5 = coord(1/2)
    
    Abstract
    Information subject gateways provide targeted discovery services for their users, giving access to Web resources selected according to quality and subject coverage criteria. Information gateways recognise that they must collaborate on a wide range of issues relating to content to ensure continued success. This report is informed by discussion of content activities at the 1999 Imesh Workshop. The author considers the implications for subject based gateways of co-operation regarding coverage policy, creation of metadata, and provision of searching and browsing across services. Other possibilities for co-operation include working more closely with information providers, and diclosure of information in joint metadata registries
    Date
    22. 6.2002 19:38:54
  19. Koch, T.: Quality-controlled subject gateways : definitions, typologies, empirical overview (2000) 0.06
    0.057231586 = product of:
      0.11446317 = sum of:
        0.11446317 = sum of:
          0.06543146 = weight(_text_:searching in 631) [ClassicSimilarity], result of:
            0.06543146 = score(doc=631,freq=2.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.31286204 = fieldWeight in 631, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=631)
          0.049031712 = weight(_text_:22 in 631) [ClassicSimilarity], result of:
            0.049031712 = score(doc=631,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 631, 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=631)
      0.5 = coord(1/2)
    
    Abstract
    'Quality-controlled subject gateways' are Internet services which apply a rich set of quality measures to support systematic resource discovery. Considerable manual effort is used to secure a selection of resources which meet quality criteria and to display a rich description of these resources with standards-based metadata. Regular checking and updating ensure good collection management. A main goal is to provide a high quality of subject access through indexing resources using controlled vocabularies and by offering a deep classification structure for advanced searching and browsing. This article provides an initial empirical overview of existing services of this kind, their approaches and technologies, based on proposed working definitions and typologies of subject gateways
    Date
    22. 6.2002 19:37:55
  20. Dextre Clarke, S.G.: Thesaural relationships (2001) 0.06
    0.057231586 = product of:
      0.11446317 = sum of:
        0.11446317 = sum of:
          0.06543146 = weight(_text_:searching in 1149) [ClassicSimilarity], result of:
            0.06543146 = score(doc=1149,freq=2.0), product of:
              0.2091384 = queryWeight, product of:
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.051699217 = queryNorm
              0.31286204 = fieldWeight in 1149, product of:
                1.4142135 = tf(freq=2.0), with freq of:
                  2.0 = termFreq=2.0
                4.0452914 = idf(docFreq=2103, maxDocs=44218)
                0.0546875 = fieldNorm(doc=1149)
          0.049031712 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
            0.049031712 = score(doc=1149,freq=2.0), product of:
              0.18104185 = queryWeight, product of:
                3.5018296 = idf(docFreq=3622, maxDocs=44218)
                0.051699217 = queryNorm
              0.2708308 = fieldWeight in 1149, 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=1149)
      0.5 = coord(1/2)
    
    Abstract
    A thesaurus in the controlled vocabulary environment is a tool designed to support effective infonnation retrieval (IR) by guiding indexers and searchers consistently to choose the same terms for expressing a given concept or combination of concepts. Terms in the thesaurus are linked by relationships of three well-known types: equivalence, hierarchical, and associative. The functions and properties of these three basic types and some subcategories are described, as well as some additional relationship types conunonly found in thesauri. Progressive automation of IR processes and the capability for simultaneous searching of vast networked resources are creating some pressures for change in the categorization and consistency of relationships.
    Date
    22. 9.2007 15:45:57

Languages

Types

  • a 1499
  • m 196
  • el 100
  • s 68
  • b 26
  • x 13
  • i 10
  • n 3
  • r 2
  • p 1
  • More… Less…

Themes

Subjects

Classifications