Search (31 results, page 1 of 2)

0.049952157 = sum of:
  0.025381705 = product of:
    0.10152682 = sum of:
      0.10152682 = weight(_text_:authors in 92) [ClassicSimilarity], result of:
        0.10152682 = score(doc=92,freq=4.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.42738882 = fieldWeight in 92, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.046875 = fieldNorm(doc=92)
    0.25 = coord(1/4)
  0.024570452 = product of:
    0.049140904 = sum of:
      0.049140904 = weight(_text_:i in 92) [ClassicSimilarity], result of:
        0.049140904 = score(doc=92,freq=2.0), product of:
          0.1965379 = queryWeight, product of:
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.05210816 = queryNorm
          0.25003272 = fieldWeight in 92, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.046875 = fieldNorm(doc=92)
    0.5 = coord(1/2)

Abstract

In this paper the authors will present research on the combination of two methods of data mining: text classification and maximal association rules. Text classification has been the focus of interest of many researchers for a long time. However, the results take the form of lists of words (classes) that people often do not know what to do with. The use of maximal association rules induced a number of advantages: (1) the detection of dependencies and correlations between the relevant units of information (words) of different classes, (2) the extraction of hidden knowledge, often relevant, from a large volume of data. The authors will show how this combination can improve the process of information retrieval.

0.032606155 = sum of:
  0.014956313 = product of:
    0.059825253 = sum of:
      0.059825253 = weight(_text_:authors in 668) [ClassicSimilarity], result of:
        0.059825253 = score(doc=668,freq=2.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.25184128 = fieldWeight in 668, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.0390625 = fieldNorm(doc=668)
    0.25 = coord(1/4)
  0.01764984 = product of:
    0.03529968 = sum of:
      0.03529968 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
        0.03529968 = score(doc=668,freq=2.0), product of:
          0.1824739 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05210816 = queryNorm
          0.19345059 = fieldWeight in 668, 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=668)
    0.5 = coord(1/2)

Abstract

20th century massification of higher education and research in academia is said to have produced structurally stratified higher education systems in many countries. Most manifestly, the research mission of universities appears to be divisive. Authors have claimed that the Swedish system, while formally unified, has developed into a binary state, and statistics seem to support this conclusion. This article makes use of a comprehensive statistical data source on Swedish higher education institutions to illustrate stratification, and uses literature on Swedish research policy history to contextualize the statistics. Highlighting the opportunities as well as constraints of the data, the article argues that there is great merit in combining statistics with a qualitative analysis when studying the structural characteristics of national higher education systems. Not least the article shows that it is an over-simplification to describe the Swedish system as binary; the stratification is more complex. On basis of the analysis, the article also argues that while global trends certainly influence national developments, higher education systems have country-specific features that may enrich the understanding of how systems evolve and therefore should be analyzed as part of a broader study of the increasingly globalized academic system.

Date

22. 3.2013 19:43:01

0.024709776 = product of:
  0.049419552 = sum of:
    0.049419552 = product of:
      0.098839104 = sum of:
        0.098839104 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
          0.098839104 = score(doc=4577,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.5416616 = fieldWeight in 4577, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=4577)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

2. 4.2000 18:01:22

0.024570452 = product of:
  0.049140904 = sum of:
    0.049140904 = product of:
      0.09828181 = sum of:
        0.09828181 = weight(_text_:i in 3425) [ClassicSimilarity], result of:
          0.09828181 = score(doc=3425,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.50006545 = fieldWeight in 3425, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.09375 = fieldNorm(doc=3425)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Editor

Alpar, P. u. I. Niedereichholz

0.021179808 = product of:
  0.042359617 = sum of:
    0.042359617 = product of:
      0.08471923 = sum of:
        0.08471923 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
          0.08471923 = score(doc=6783,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.46428138 = fieldWeight in 6783, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=6783)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

A special issue of selected papers from the Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD'97), held Singapore, 22-23 Feb 1997

0.0163803 = product of:
  0.0327606 = sum of:
    0.0327606 = product of:
      0.0655212 = sum of:
        0.0655212 = weight(_text_:i in 3887) [ClassicSimilarity], result of:
          0.0655212 = score(doc=3887,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.33337694 = fieldWeight in 3887, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0625 = fieldNorm(doc=3887)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.015520505 = sum of:
  0.008460568 = product of:
    0.033842273 = sum of:
      0.033842273 = weight(_text_:authors in 1789) [ClassicSimilarity], result of:
        0.033842273 = score(doc=1789,freq=4.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.14246294 = fieldWeight in 1789, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
    0.25 = coord(1/4)
  0.0070599364 = product of:
    0.014119873 = sum of:
      0.014119873 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.014119873 = score(doc=1789,freq=2.0), product of:
          0.1824739 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05210816 = queryNorm
          0.07738023 = fieldWeight in 1789, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
    0.5 = coord(1/2)

Date

23. 3.2008 19:10:22

Footnote

In 13 chapters, Part Two provides an introduction to KDD, an overview of data mining techniques, and examples of the usefulness of data model visualizations. The importance of visualization throughout the KDD process is stressed in many of the chapters. In particular, the need for measures of visualization effectiveness, benchmarking for identifying best practices, and the use of standardized sample data sets is convincingly presented. Many of the important data mining approaches are discussed in this complementary context. Cluster and outlier detection, classification techniques, and rule discovery algorithms are presented as the basic techniques common to the KDD process. The potential effectiveness of using visualization in the data modeling process are illustrated in chapters focused an using visualization for helping users understand the KDD process, ask questions and form hypotheses about their data, and evaluate the accuracy and veracity of their results. The 11 chapters of Part Three provide an overview of the KDD process and successful approaches to integrating KDD, data mining, and visualization in complementary domains. Rhodes (Chapter 21) begins this section with an excellent overview of the relation between the KDD process and data mining techniques. He states that the "primary goals of data mining are to describe the existing data and to predict the behavior or characteristics of future data of the same type" (p. 281). These goals are met by data mining tasks such as classification, regression, clustering, summarization, dependency modeling, and change or deviation detection. Subsequent chapters demonstrate how visualization can aid users in the interactive process of knowledge discovery by graphically representing the results from these iterative tasks. Finally, examples of the usefulness of integrating visualization and data mining tools in the domain of business, imagery and text mining, and massive data sets are provided. This text concludes with a thorough and useful 17-page index and lengthy yet integrating 17-page summary of the academic and industrial backgrounds of the contributing authors. A 16-page set of color inserts provide a better representation of the visualizations discussed, and a URL provided suggests that readers may view all the book's figures in color on-line, although as of this submission date it only provides access to a summary of the book and its contents. The overall contribution of this work is its focus an bridging two distinct areas of research, making it a valuable addition to the Morgan Kaufmann Series in Database Management Systems. The editors of this text have met their main goal of providing the first textbook integrating knowledge discovery, data mining, and visualization. Although it contributes greatly to our under- standing of the development and current state of the field, a major weakness of this text is that there is no concluding chapter to discuss the contributions of the sum of these contributed papers or give direction to possible future areas of research. "Integration of expertise between two different disciplines is a difficult process of communication and reeducation. Integrating data mining and visualization is particularly complex because each of these fields in itself must draw an a wide range of research experience" (p. 300). Although this work contributes to the crossdisciplinary communication needed to advance visualization in KDD, a more formal call for an interdisciplinary research agenda in a concluding chapter would have provided a more satisfying conclusion to a very good introductory text.
With contributors almost exclusively from the computer science field, the intended audience of this work is heavily slanted towards a computer science perspective. However, it is highly readable and provides introductory material that would be useful to information scientists from a variety of domains. Yet, much interesting work in information visualization from other fields could have been included giving the work more of an interdisciplinary perspective to complement their goals of integrating work in this area. Unfortunately, many of the application chapters are these, shallow, and lack complementary illustrations of visualization techniques or user interfaces used. However, they do provide insight into the many applications being developed in this rapidly expanding field. The authors have successfully put together a highly useful reference text for the data mining and information visualization communities. Those interested in a good introduction and overview of complementary research areas in these fields will be satisfied with this collection of papers. The focus upon integrating data visualization with data mining complements texts in each of these fields, such as Advances in Knowledge Discovery and Data Mining (Fayyad et al., MIT Press) and Readings in Information Visualization: Using Vision to Think (Card et. al., Morgan Kauffman). This unique work is a good starting point for future interaction between researchers in the fields of data visualization and data mining and makes a good accompaniment for a course focused an integrating these areas or to the main reference texts in these fields."

0.014805994 = product of:
  0.029611988 = sum of:
    0.029611988 = product of:
      0.11844795 = sum of:
        0.11844795 = weight(_text_:authors in 4104) [ClassicSimilarity], result of:
          0.11844795 = score(doc=4104,freq=4.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.49862027 = fieldWeight in 4104, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4104)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

With the rapid development of Web 2.0, online reviews have become extremely valuable sources for mining customers' opinions. Fine-grained opinion mining has attracted more and more attention of both applied and theoretical research. In this article, the authors study how to automatically mine product features and opinions from multiple review sources. Specifically, they propose an integration strategy to solve the issue. Within the integration strategy, the authors mine domain knowledge from semistructured reviews and then exploit the domain knowledge to assist product feature extraction and sentiment orientation identification from unstructured reviews. Finally, feature-opinion tuples are generated. Experimental results on real-world datasets show that the proposed approach is effective.

0.014478277 = product of:
  0.028956555 = sum of:
    0.028956555 = product of:
      0.05791311 = sum of:
        0.05791311 = weight(_text_:i in 5053) [ClassicSimilarity], result of:
          0.05791311 = score(doc=5053,freq=4.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.29466638 = fieldWeight in 5053, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5053)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Big Data Analytics (BDA) is increasingly becoming a trending practice that generates an enormous amount of data and provides a new opportunity that is helpful in relevant decision-making. The developments in Big Data Analytics provide a new paradigm and solutions for big data sources, storage, and advanced analytics. The BDA provide a nuanced view of big data development, and insights on how it can truly create value for firm and customer. This article presents a comprehensive, well-informed examination, and realistic analysis of deploying big data analytics successfully in companies. It provides an overview of the architecture of BDA including six components, namely: (i) data generation, (ii) data acquisition, (iii) data storage, (iv) advanced data analytics, (v) data visualization, and (vi) decision-making for value-creation. In this paper, seven V's characteristics of BDA namely Volume, Velocity, Variety, Valence, Veracity, Variability, and Value are explored. The various big data analytics tools, techniques and technologies have been described. Furthermore, it presents a methodical analysis for the usage of Big Data Analytics in various applications such as agriculture, healthcare, cyber security, and smart city. This paper also highlights the previous research, challenges, current status, and future directions of big data analytics for various application platforms. This overview highlights three issues, namely (i) concepts, characteristics and processing paradigms of Big Data Analytics; (ii) the state-of-the-art framework for decision-making in BDA for companies to insight value-creation; and (iii) the current challenges of Big Data Analytics as well as possible future directions.

0.014332764 = product of:
  0.028665528 = sum of:
    0.028665528 = product of:
      0.057331055 = sum of:
        0.057331055 = weight(_text_:i in 4676) [ClassicSimilarity], result of:
          0.057331055 = score(doc=4676,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.29170483 = fieldWeight in 4676, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4676)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.014185757 = product of:
  0.028371515 = sum of:
    0.028371515 = product of:
      0.05674303 = sum of:
        0.05674303 = weight(_text_:i in 1178) [ClassicSimilarity], result of:
          0.05674303 = score(doc=1178,freq=6.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.28871292 = fieldWeight in 1178, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.03125 = fieldNorm(doc=1178)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In Jorge Luis Borges's curious short story The Library of Babel, the narrator describes an endless collection of books stored from floor to ceiling in a labyrinth of countless hexagonal rooms. The pages of the library's books seem to contain random sequences of letters and spaces; occasionally a few intelligible words emerge in the sea of paper and ink. Nevertheless, readers diligently, and exasperatingly, scan the shelves for coherent passages. The narrator himself has wandered numerous rooms in search of enlightenment, but with resignation he simply awaits his death and burial - which Borges explains (with signature dark humor) consists of being tossed unceremoniously over the library's banister. Borges's nightmare, of course, is a cursed vision of the research methods of disciplines such as literature, history, and philosophy, where the careful reading of books, one after the other, is supposed to lead inexorably to knowledge and understanding. Computer scientists would approach Borges's library far differently. Employing the information theory that forms the basis for search engines and other computerized techniques for assessing in one fell swoop large masses of documents, they would quickly realize the collection's incoherence though sampling and statistical methods - and wisely start looking for the library's exit. These computational methods, which allow us to find patterns, determine relationships, categorize documents, and extract information from massive corpuses, will form the basis for new tools for research in the humanities and other disciplines in the coming decade. For the past three years I have been experimenting with how to provide such end-user tools - that is, tools that harness the power of vast electronic collections while hiding much of their complicated technical plumbing. In particular, I have made extensive use of the application programming interfaces (APIs) the leading search engines provide for programmers to query their databases directly (from server to server without using their web interfaces). In addition, I have explored how one might extract information from large digital collections, from the well-curated lexicographic database WordNet to the democratic (and poorly curated) online reference work Wikipedia. While processing these digital corpuses is currently an imperfect science, even now useful tools can be created by combining various collections and methods for searching and analyzing them. And more importantly, these nascent services suggest a future in which information can be gleaned from, and sense can be made out of, even imperfect digital libraries of enormous scale. A brief examination of two approaches to data mining large digital collections hints at this future, while also providing some lessons about how to get there.

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
          0.05647949 = score(doc=1737,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.30952093 = fieldWeight in 1737, 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=1737)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22.11.1998 18:57:22

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
          0.05647949 = score(doc=4261,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.30952093 = fieldWeight in 4261, 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=4261)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

17. 7.2002 19:22:06

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.05647949 = score(doc=1270,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.30952093 = fieldWeight in 1270, 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=1270)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Information systems. 22(1997) nos.5/6, S.333-347

0.012690852 = product of:
  0.025381705 = sum of:
    0.025381705 = product of:
      0.10152682 = sum of:
        0.10152682 = weight(_text_:authors in 1326) [ClassicSimilarity], result of:
          0.10152682 = score(doc=1326,freq=4.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.42738882 = fieldWeight in 1326, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046875 = fieldNorm(doc=1326)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

The effective use of corporate memory is becoming increasingly important because every aspect of e-business requires access to information repositories. Unfortunately, less-than-satisfying effectiveness in state-of-the-art information-retrieval techniques is well known, even for some of the best search engines such as Google. In this study, the authors resolve this retrieval ineffectiveness problem by developing a new framework for predicting query performance, which is the first step toward better retrieval effectiveness. Specifically, they examine the relationship between query performance and query context. A query context consists of the query itself, the document collection, and the interaction between the two. The authors first analyze the characteristics of query context and develop various features for predicting query performance. Then, they propose a context-sensitive model for predicting query performance based on the characteristics of the query and the document collection. Finally, they validate this model with respect to five real-world collections of documents and demonstrate its utility in routing queries to the correct repository with high accuracy.

0.012354888 = product of:
  0.024709776 = sum of:
    0.024709776 = product of:
      0.049419552 = sum of:
        0.049419552 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.049419552 = score(doc=2908,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.2708308 = fieldWeight in 2908, 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=2908)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Source

Information systems. 22(1997) nos.5/6, S.349-385

0.012285226 = product of:
  0.024570452 = sum of:
    0.024570452 = product of:
      0.049140904 = sum of:
        0.049140904 = weight(_text_:i in 720) [ClassicSimilarity], result of:
          0.049140904 = score(doc=720,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.25003272 = fieldWeight in 720, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.046875 = fieldNorm(doc=720)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.011582622 = product of:
  0.023165245 = sum of:
    0.023165245 = product of:
      0.04633049 = sum of:
        0.04633049 = weight(_text_:i in 2222) [ClassicSimilarity], result of:
          0.04633049 = score(doc=2222,freq=4.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.2357331 = fieldWeight in 2222, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.7717297 = idf(docFreq=2765, 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."

0.010589904 = product of:
  0.021179808 = sum of:
    0.021179808 = product of:
      0.042359617 = sum of:
        0.042359617 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
          0.042359617 = score(doc=1383,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = queryNorm
            0.23214069 = fieldWeight in 1383, 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=1383)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 3.2008 14:46:06

0.010237687 = product of:
  0.020475375 = sum of:
    0.020475375 = product of:
      0.04095075 = sum of:
        0.04095075 = weight(_text_:i in 2155) [ClassicSimilarity], result of:
          0.04095075 = score(doc=2155,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.20836058 = fieldWeight in 2155, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2155)
      0.5 = coord(1/2)
  0.5 = coord(1/2)