Search (227 results, page 1 of 12)

0.098738894 = product of:
  0.19747779 = sum of:
    0.19747779 = sum of:
      0.14256552 = weight(_text_:mining in 2740) [ClassicSimilarity], result of:
        0.14256552 = score(doc=2740,freq=2.0), product of:
          0.28585905 = queryWeight, product of:
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.05066224 = queryNorm
          0.49872664 = fieldWeight in 2740, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.0625 = fieldNorm(doc=2740)
      0.054912273 = weight(_text_:22 in 2740) [ClassicSimilarity], result of:
        0.054912273 = score(doc=2740,freq=2.0), product of:
          0.17741053 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05066224 = queryNorm
          0.30952093 = fieldWeight in 2740, 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=2740)
  0.5 = coord(1/2)

Date

1. 8.1996 22:08:06

0.080165744 = product of:
  0.16033149 = sum of:
    0.16033149 = sum of:
      0.12601131 = weight(_text_:mining in 2938) [ClassicSimilarity], result of:
        0.12601131 = score(doc=2938,freq=4.0), product of:
          0.28585905 = queryWeight, product of:
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.05066224 = queryNorm
          0.44081625 = fieldWeight in 2938, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2938)
      0.034320172 = weight(_text_:22 in 2938) [ClassicSimilarity], result of:
        0.034320172 = score(doc=2938,freq=2.0), product of:
          0.17741053 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05066224 = queryNorm
          0.19345059 = fieldWeight in 2938, 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=2938)
  0.5 = coord(1/2)

Abstract

We present CopeOpi, an opinion-analysis system, which extracts from the Web opinions about specific targets, summarizes the polarity and strength of these opinions, and tracks opinion variations over time. Objects that yield similar opinion tendencies over a certain time period may be correlated due to the latent causal events. CopeOpi discovers relationships among objects based on their opinion-tracking plots and collocations. Event bursts are detected from the tracking plots, and the strength of opinion relationships is determined by the coverage of these plots. To evaluate opinion mining, we use the NTCIR corpus annotated with opinion information at sentence and document levels. CopeOpi achieves sentence- and document-level f-measures of 62% and 74%. For relationship discovery, we collected 1.3M economics-related documents from 93 Web sources over 22 months, and analyzed collocation-based, opinion-based, and hybrid models. We consider as correlated company pairs that demonstrate similar stock-price variations, and selected these as the gold standard for evaluation. Results show that opinion-based and collocation-based models complement each other, and that integrated models perform the best. The top 25, 50, and 100 pairs discovered achieve precision rates of 1, 0.92, and 0.79, respectively.

0.074054174 = product of:
  0.14810835 = sum of:
    0.14810835 = sum of:
      0.10692415 = weight(_text_:mining in 2639) [ClassicSimilarity], result of:
        0.10692415 = score(doc=2639,freq=2.0), product of:
          0.28585905 = queryWeight, product of:
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.05066224 = queryNorm
          0.37404498 = fieldWeight in 2639, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.642448 = idf(docFreq=425, maxDocs=44218)
            0.046875 = fieldNorm(doc=2639)
      0.0411842 = weight(_text_:22 in 2639) [ClassicSimilarity], result of:
        0.0411842 = score(doc=2639,freq=2.0), product of:
          0.17741053 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05066224 = queryNorm
          0.23214069 = fieldWeight in 2639, 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=2639)
  0.5 = coord(1/2)

Abstract

Online communities are becoming an important tool in the communication and participation processes in our society. However, the most widespread applications are difficult to use for people with disabilities, or may involve some risks if no previous training has been undertaken. This work describes a novel social network for cognitively disabled people along with a clustering-based method for modeling activity and socialization processes of its users in a noninvasive way. This closed social network is specifically designed for people with cognitive disabilities, called Guremintza, that provides the network administrators (e.g., social workers) with two types of reports: summary statistics of the network usage and behavior patterns discovered by a data mining process. Experiments made in an initial stage of the network show that the discovered patterns are meaningful to the social workers and they find them useful in monitoring the progress of the users.

Date

22. 1.2016 12:02:26

0.062372416 = product of:
  0.12474483 = sum of:
    0.12474483 = product of:
      0.24948967 = sum of:
        0.24948967 = weight(_text_:mining in 3905) [ClassicSimilarity], result of:
          0.24948967 = score(doc=3905,freq=8.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.8727716 = fieldWeight in 3905, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3905)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

With increasing user presence in the Web and Web 2.0, Web social mining becomes an important and challenging task that finds a wide range of new applications relevant to e-commerce and social software. In this entry, we describe three Web social mining topics, namely, social network discovery, social network analysis, and social network applications. The essential concepts, models, and techniques of these Web social mining topics will be surveyed so as to establish the basic foundation for developing novel applications and for conducting research.

0.054016102 = product of:
  0.108032204 = sum of:
    0.108032204 = product of:
      0.21606441 = sum of:
        0.21606441 = weight(_text_:mining in 4676) [ClassicSimilarity], result of:
          0.21606441 = score(doc=4676,freq=6.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.75584245 = fieldWeight in 4676, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4676)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper discusses an approach of collecting qualitative data on human information behaviour that is based on mining web data using search engines. The approach is technically the same that has been used for some time in webometric research to make statistical inferences on web data, but the present paper shows how the same tools and data collecting methods can be used to gather data for qualitative data analysis on human information behaviour.

Theme

Data Mining

0.053462073 = product of:
  0.10692415 = sum of:
    0.10692415 = product of:
      0.2138483 = sum of:
        0.2138483 = weight(_text_:mining in 179) [ClassicSimilarity], result of:
          0.2138483 = score(doc=179,freq=2.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.74808997 = fieldWeight in 179, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.09375 = fieldNorm(doc=179)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.053462073 = product of:
  0.10692415 = sum of:
    0.10692415 = product of:
      0.2138483 = sum of:
        0.2138483 = weight(_text_:mining in 1611) [ClassicSimilarity], result of:
          0.2138483 = score(doc=1611,freq=8.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.74808997 = fieldWeight in 1611, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.046875 = fieldNorm(doc=1611)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

"Garbage in, garbage out" is a well-known phrase in computer analysis, and one that comes to mind when mining Web data to draw conclusions about Web users. The challenge is that data analysts wish to infer patterns of client-side behavior from server-side data. However, because only a fraction of the user's actions ever reaches the Web server, analysts must rely an incomplete data. In this paper, we propose a client-side monitoring system that is unobtrusive and supports flexible data collection. Moreover, the proposed framework encompasses client-side applications beyond the Web browser. Expanding monitoring beyond the browser to incorporate standard office productivity tools enables analysts to derive a much richer and more accurate picture of user behavior an the Web.

Footnote

Teil eines Themenheftes: "Web retrieval and mining: A machine learning perspective"

Theme

Data Mining

0.047149118 = product of:
  0.094298236 = sum of:
    0.094298236 = product of:
      0.18859647 = sum of:
        0.18859647 = weight(_text_:mining in 2222) [ClassicSimilarity], result of:
          0.18859647 = score(doc=2222,freq=14.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.6597534 = fieldWeight in 2222, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.03125 = fieldNorm(doc=2222)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

Rez. in: JASIST 55(2004) no.3, S.275-276 (C. Chen): "This is a book about finding significant statistical patterns on the Web - in particular, patterns that are associated with hypertext documents, topics, hyperlinks, and queries. The term pattern in this book refers to dependencies among such items. On the one hand, the Web contains useful information an just about every topic under the sun. On the other hand, just like searching for a needle in a haystack, one would need powerful tools to locate useful information an the vast land of the Web. Soumen Chakrabarti's book focuses an a wide range of techniques for machine learning and data mining an the Web. The goal of the book is to provide both the technical Background and tools and tricks of the trade of Web content mining. Much of the technical content reflects the state of the art between 1995 and 2002. The targeted audience is researchers and innovative developers in this area, as well as newcomers who intend to enter this area. The book begins with an introduction chapter. The introduction chapter explains fundamental concepts such as crawling and indexing as well as clustering and classification. The remaining eight chapters are organized into three parts: i) infrastructure, ii) learning and iii) applications.
Part I, Infrastructure, has two chapters: Chapter 2 on crawling the Web and Chapter 3 an Web search and information retrieval. The second part of the book, containing chapters 4, 5, and 6, is the centerpiece. This part specifically focuses an machine learning in the context of hypertext. Part III is a collection of applications that utilize the techniques described in earlier chapters. Chapter 7 is an social network analysis. Chapter 8 is an resource discovery. Chapter 9 is an the future of Web mining. Overall, this is a valuable reference book for researchers and developers in the field of Web mining. It should be particularly useful for those who would like to design and probably code their own Computer programs out of the equations and pseudocodes an most of the pages. For a student, the most valuable feature of the book is perhaps the formal and consistent treatments of concepts across the board. For what is behind and beyond the technical details, one has to either dig deeper into the bibliographic notes at the end of each chapter, or resort to more in-depth analysis of relevant subjects in the literature. lf you are looking for successful stories about Web mining or hard-way-learned lessons of failures, this is not the book."

Theme

Data Mining

0.038582932 = product of:
  0.077165864 = sum of:
    0.077165864 = product of:
      0.15433173 = sum of:
        0.15433173 = weight(_text_:mining in 6521) [ClassicSimilarity], result of:
          0.15433173 = score(doc=6521,freq=6.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.5398875 = fieldWeight in 6521, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6521)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The popularity of digital images is rapidly increasing due to improving digital imaging technologies and convenient availability facilitated by the Internet. However, how to find user-intended images from the Internet is nontrivial. The main reason is that the Web images are usually not annotated using semantic descriptors. In this article, we present an effective approach to and a prototype system for image retrieval from the Internet using Web mining. The system can also serve as a Web image search engine. One of the key ideas in the approach is to extract the text information on the Web pages to semantically describe the images. The text description is then combined with other low-level image features in the image similarity assessment. Another main contribution of this work is that we apply data mining on the log of users' feedback to improve image retrieval performance in three aspects. First, the accuracy of the document space model of image representation obtained from the Web pages is improved by removing clutter and irrelevant text information. Second, to construct the user space model of users' representation of images, which is then combined with the document space model to eliminate mismatch between the page author's expression and the user's understanding and expectation. Third, to discover the relationship between low-level and high-level features, which is extremely useful for assigning the low-level features' weights in similarity assessment

0.037803393 = product of:
  0.075606786 = sum of:
    0.075606786 = product of:
      0.15121357 = sum of:
        0.15121357 = weight(_text_:mining in 3090) [ClassicSimilarity], result of:
          0.15121357 = score(doc=3090,freq=4.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.5289795 = fieldWeight in 3090, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.046875 = fieldNorm(doc=3090)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Recent Web-searching and -mining tools are combining text and link analysis to improve ranking and crawling algorithms. The central assumption behind such approaches is that there is a correiation between the graph structure of the Web and the text and meaning of pages. Here I formalize and empirically evaluate two general conjectures drawing connections from link information to lexical and semantic Web content. The link-content conjecture states that a page is similar to the pages that link to it, and the link-cluster conjecture that pages about the same topic are clustered together. These conjectures are offen simply assumed to hold, and Web search tools are built an such assumptions. The present quantitative confirmation sheds light an the connection between the success of the latest Web-mining techniques and the small world topology of the Web, with encouraging implications for the design of better crawling algorithms.

0.037803393 = product of:
  0.075606786 = sum of:
    0.075606786 = product of:
      0.15121357 = sum of:
        0.15121357 = weight(_text_:mining in 4242) [ClassicSimilarity], result of:
          0.15121357 = score(doc=4242,freq=4.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.5289795 = fieldWeight in 4242, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.046875 = fieldNorm(doc=4242)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Theme

Data Mining

0.03564138 = product of:
  0.07128276 = sum of:
    0.07128276 = product of:
      0.14256552 = sum of:
        0.14256552 = weight(_text_:mining in 505) [ClassicSimilarity], result of:
          0.14256552 = score(doc=505,freq=2.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.49872664 = fieldWeight in 505, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0625 = fieldNorm(doc=505)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Theme

Data Mining

0.033975236 = product of:
  0.06795047 = sum of:
    0.06795047 = product of:
      0.13590094 = sum of:
        0.13590094 = weight(_text_:22 in 8727) [ClassicSimilarity], result of:
          0.13590094 = score(doc=8727,freq=4.0), product of:
            0.17741053 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05066224 = queryNorm
            0.76602525 = fieldWeight in 8727, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=8727)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

5. 8.2001 12:22:47

Source

Information outlook. 3(1999) no.2, S.18-22

0.031502828 = product of:
  0.063005656 = sum of:
    0.063005656 = product of:
      0.12601131 = sum of:
        0.12601131 = weight(_text_:mining in 3603) [ClassicSimilarity], result of:
          0.12601131 = score(doc=3603,freq=4.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.44081625 = fieldWeight in 3603, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3603)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper addresses a bibliometric methodology to discover the structure of the scientific 'landscape' in order to gain detailed insight into the development of MD fields, their interaction, and the transfer of knowledge between them. This methodology is appropriate to visualize the position of MD activities in relation to interdisciplinary MD developments, and particularly in relation to socio-economic problems. Furthermore, it allows the identification of the major actors. It even provides the possibility of foresight. We describe a first approach to apply bibliometric mapping as an instrument to investigate characteristics of knowledge transfer. In this paper we discuss the creation of 'maps of science' with help of advanced bibliometric methods. This 'bibliometric cartography' can be seen as a specific type of data-mining, applied to large amounts of scientific publications. As an example we describe the mapping of the field neuroscience, one of the largest and fast growing fields in the life sciences. The number of publications covered by this database is about 80,000 per year, the period covered is 1995-1998. Current research is going an to update the mapping for the years 1999-2002. This paper addresses the main lines of the methodology and its application in the study of knowledge transfer.

Theme

Data Mining

0.031502828 = product of:
  0.063005656 = sum of:
    0.063005656 = product of:
      0.12601131 = sum of:
        0.12601131 = weight(_text_:mining in 4988) [ClassicSimilarity], result of:
          0.12601131 = score(doc=4988,freq=4.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.44081625 = fieldWeight in 4988, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4988)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This article presents a search-intent-based method to generate pornographic blacklists for collaborative cyberporn filtering. A novel porn-detection framework that can find newly appearing pornographic web pages by mining search query logs is proposed. First, suspected queries are identified along with their clicked URLs by an automatically constructed lexicon. Then, a candidate URL is determined if the number of clicks satisfies majority voting rules. Finally, a candidate whose URL contains at least one categorical keyword will be included in a blacklist. Several experiments are conducted on an MSN search porn dataset to demonstrate the effectiveness of our method. The resulting blacklist generated by our search-intent-based method achieves high precision (0.701) while maintaining a favorably low false-positive rate (0.086). The experiments of a real-life filtering simulation reveal that our proposed method with its accumulative update strategy can achieve 44.15% of a macro-averaging blocking rate, when the update frequency is set to 1 day. In addition, the overblocking rates are less than 9% with time change due to the strong advantages of our search-intent-based method. This user-behavior-oriented method can be easily applied to search engines for incorporating only implicit collective intelligence from query logs without other efforts. In practice, it is complementary to intelligent content analysis for keeping up with the changing trails of objectionable websites from users' perspectives.

0.031186208 = product of:
  0.062372416 = sum of:
    0.062372416 = product of:
      0.12474483 = sum of:
        0.12474483 = weight(_text_:mining in 3971) [ClassicSimilarity], result of:
          0.12474483 = score(doc=3971,freq=2.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.4363858 = fieldWeight in 3971, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0546875 = fieldNorm(doc=3971)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The navigational behaviour of users in the web is essential for the providers of information, services and goods. Search eingines can help a user find a provider of interest, but it is the proper organization of the provider's site that stimulates the user's propensity to consume. To verif whether the site is effectively organized, knowledge of the navigation patterns occuring during visits to the site must be obtained. Our Web Utilization Miner WUM can assist in obtaining this knowledge. WUM is a mining system for the discovery of navigation patterns

0.031186208 = product of:
  0.062372416 = sum of:
    0.062372416 = product of:
      0.12474483 = sum of:
        0.12474483 = weight(_text_:mining in 2338) [ClassicSimilarity], result of:
          0.12474483 = score(doc=2338,freq=2.0), product of:
            0.28585905 = queryWeight, product of:
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.05066224 = queryNorm
            0.4363858 = fieldWeight in 2338, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.642448 = idf(docFreq=425, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2338)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Theme

Data Mining

0.027456136 = product of:
  0.054912273 = sum of:
    0.054912273 = product of:
      0.109824546 = sum of:
        0.109824546 = weight(_text_:22 in 4514) [ClassicSimilarity], result of:
          0.109824546 = score(doc=4514,freq=2.0), product of:
            0.17741053 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05066224 = queryNorm
            0.61904186 = fieldWeight in 4514, 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=4514)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Audiovisual librarian. 22(1996) no.2, S.108-110

0.027456136 = product of:
  0.054912273 = sum of:
    0.054912273 = product of:
      0.109824546 = sum of:
        0.109824546 = weight(_text_:22 in 7783) [ClassicSimilarity], result of:
          0.109824546 = score(doc=7783,freq=2.0), product of:
            0.17741053 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05066224 = queryNorm
            0.61904186 = fieldWeight in 7783, 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=7783)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Encyclopedia of library and information science. Vol.59, [=Suppl.22]

0.027456136 = product of:
  0.054912273 = sum of:
    0.054912273 = product of:
      0.109824546 = sum of:
        0.109824546 = weight(_text_:22 in 2504) [ClassicSimilarity], result of:
          0.109824546 = score(doc=2504,freq=2.0), product of:
            0.17741053 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05066224 = queryNorm
            0.61904186 = fieldWeight in 2504, 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=2504)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

27.12.2015 18:22:38