Search (26 results, page 1 of 2)

0.024004735 = product of:
  0.04800947 = sum of:
    0.03411752 = weight(_text_:reference in 1178) [ClassicSimilarity], result of:
      0.03411752 = score(doc=1178,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.17979822 = fieldWeight in 1178, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.03125 = fieldNorm(doc=1178)
    0.013891948 = product of:
      0.027783897 = sum of:
        0.027783897 = weight(_text_:services in 1178) [ClassicSimilarity], result of:
          0.027783897 = score(doc=1178,freq=2.0), product of:
            0.1712379 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.04664141 = queryNorm
            0.1622532 = fieldWeight in 1178, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.03125 = fieldNorm(doc=1178)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

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.02293756 = product of:
  0.09175024 = sum of:
    0.09175024 = sum of:
      0.060153905 = weight(_text_:services in 1605) [ClassicSimilarity], result of:
        0.060153905 = score(doc=1605,freq=6.0), product of:
          0.1712379 = queryWeight, product of:
            3.6713707 = idf(docFreq=3057, maxDocs=44218)
            0.04664141 = queryNorm
          0.3512885 = fieldWeight in 1605, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.6713707 = idf(docFreq=3057, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1605)
      0.031596337 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
        0.031596337 = score(doc=1605,freq=2.0), product of:
          0.16333027 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04664141 = queryNorm
          0.19345059 = fieldWeight in 1605, 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=1605)
  0.25 = coord(1/4)

Abstract

Numerous studies have explored the possibility of uncovering information from web search queries but few have examined the factors that affect web query data sources. We conducted a study that investigated this issue by comparing Google Trends and Baidu Index. Data from these two services are based on queries entered by users into Google and Baidu, two of the largest search engines in the world. We first compared the features and functions of the two services based on documents and extensive testing. We then carried out an empirical study that collected query volume data from the two sources. We found that data from both sources could be used to predict the quality of Chinese universities and companies. Despite the differences between the two services in terms of technology, such as differing methods of language processing, the search volume data from the two were highly correlated and combining the two data sources did not improve the predictive power of the data. However, there was a major difference between the two in terms of data availability. Baidu Index was able to provide more search volume data than Google Trends did. Our analysis showed that the disadvantage of Google Trends in this regard was due to Google's smaller user base in China. The implication of this finding goes beyond China. Google's user bases in many countries are smaller than that in China, so the search volume data related to those countries could result in the same issue as that related to China.

Source

Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22

0.017932953 = product of:
  0.035865907 = sum of:
    0.029546639 = weight(_text_:reference in 1789) [ClassicSimilarity], result of:
      0.029546639 = score(doc=1789,freq=6.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.15570983 = fieldWeight in 1789, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.015625 = fieldNorm(doc=1789)
    0.006319267 = product of:
      0.012638534 = sum of:
        0.012638534 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
          0.012638534 = score(doc=1789,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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)
  0.5 = coord(2/4)

Date

23. 3.2008 19:10:22

Footnote

Rez. in: JASIST 54(2003) no.9, S.905-906 (C.A. Badurek): "Visual approaches for knowledge discovery in very large databases are a prime research need for information scientists focused an extracting meaningful information from the ever growing stores of data from a variety of domains, including business, the geosciences, and satellite and medical imagery. This work presents a summary of research efforts in the fields of data mining, knowledge discovery, and data visualization with the goal of aiding the integration of research approaches and techniques from these major fields. The editors, leading computer scientists from academia and industry, present a collection of 32 papers from contributors who are incorporating visualization and data mining techniques through academic research as well application development in industry and government agencies. Information Visualization focuses upon techniques to enhance the natural abilities of humans to visually understand data, in particular, large-scale data sets. It is primarily concerned with developing interactive graphical representations to enable users to more intuitively make sense of multidimensional data as part of the data exploration process. It includes research from computer science, psychology, human-computer interaction, statistics, and information science. Knowledge Discovery in Databases (KDD) most often refers to the process of mining databases for previously unknown patterns and trends in data. Data mining refers to the particular computational methods or algorithms used in this process. The data mining research field is most related to computational advances in database theory, artificial intelligence and machine learning. This work compiles research summaries from these main research areas in order to provide "a reference work containing the collection of thoughts and ideas of noted researchers from the fields of data mining and data visualization" (p. 8). It addresses these areas in three main sections: the first an data visualization, the second an KDD and model visualization, and the last an using visualization in the knowledge discovery process. The seven chapters of Part One focus upon methodologies and successful techniques from the field of Data Visualization. Hoffman and Grinstein (Chapter 2) give a particularly good overview of the field of data visualization and its potential application to data mining. An introduction to the terminology of data visualization, relation to perceptual and cognitive science, and discussion of the major visualization display techniques are presented. Discussion and illustration explain the usefulness and proper context of such data visualization techniques as scatter plots, 2D and 3D isosurfaces, glyphs, parallel coordinates, and radial coordinate visualizations. Remaining chapters present the need for standardization of visualization methods, discussion of user requirements in the development of tools, and examples of using information visualization in addressing research problems.
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.014926414 = product of:
  0.059705656 = sum of:
    0.059705656 = weight(_text_:reference in 2300) [ClassicSimilarity], result of:
      0.059705656 = score(doc=2300,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.31464687 = fieldWeight in 2300, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2300)
  0.25 = coord(1/4)

Abstract

State of the art review of the recently developed concepts of data mining (defined as the automated process of evaluating data and finding relationships) and knowledge discovery (defined as the automated process of extracting information, especially unpredicted relationships or previously unknown patterns among the data) with particular reference to numerical data. Includes: the knowledge acquisition process; data mining; evaluation methods; and knowledge discovery. Concludes that existing work in the field are confusing because the terminology is inconsistent and poorly defined. Although methods are available for analyzing and cleaning databases, better coordinated efforts should be directed toward providing users with improved means of structuring search mechanisms to explore the data for relationships

0.012794068 = product of:
  0.051176272 = sum of:
    0.051176272 = weight(_text_:reference in 1303) [ClassicSimilarity], result of:
      0.051176272 = score(doc=1303,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.2696973 = fieldWeight in 1303, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.046875 = fieldNorm(doc=1303)
  0.25 = coord(1/4)

Abstract

As the first book devoted to relational data mining, this coherently written multi-author monograph provides a thorough introduction and systematic overview of the area. The ferst part introduces the reader to the basics and principles of classical knowledge discovery in databases and inductive logic programmeng; subsequent chapters by leading experts assess the techniques in relational data mining in a principled and comprehensive way; finally, three chapters deal with advanced applications in various fields and refer the reader to resources for relational data mining. This book will become a valuable source of reference for R&D professionals active in relational data mining. Students as well as IT professionals and ambitioned practitioners interested in learning about relational data mining will appreciate the book as a useful text and gentle introduction to this exciting new field.

0.011058717 = product of:
  0.04423487 = sum of:
    0.04423487 = product of:
      0.08846974 = sum of:
        0.08846974 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
          0.08846974 = score(doc=4577,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Date

2. 4.2000 18:01:22

0.010661725 = product of:
  0.0426469 = sum of:
    0.0426469 = weight(_text_:reference in 3540) [ClassicSimilarity], result of:
      0.0426469 = score(doc=3540,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.22474778 = fieldWeight in 3540, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3540)
  0.25 = coord(1/4)

Abstract

Opinion mining refers to the use of natural language processing, text analysis, and computational linguistics to identify and extract subjective information in textual material. Opinion mining, also known as sentiment analysis, has received a lot of attention in recent times, as it provides a number of tools to analyze public opinion on a number of different topics. Comparative opinion mining is a subfield of opinion mining which deals with identifying and extracting information that is expressed in a comparative form (e.g., "paper X is better than the Y"). Comparative opinion mining plays a very important role when one tries to evaluate something because it provides a reference point for the comparison. This paper provides a review of the area of comparative opinion mining. It is the first review that cover specifically this topic as all previous reviews dealt mostly with general opinion mining. This survey covers comparative opinion mining from two different angles. One from the perspective of techniques and the other from the perspective of comparative opinion elements. It also incorporates preprocessing tools as well as data set that were used by past researchers that can be useful to future researchers in the field of comparative opinion mining.

0.009478901 = product of:
  0.037915602 = sum of:
    0.037915602 = product of:
      0.075831205 = sum of:
        0.075831205 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
          0.075831205 = score(doc=6783,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

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.00852938 = product of:
  0.03411752 = sum of:
    0.03411752 = weight(_text_:reference in 2222) [ClassicSimilarity], result of:
      0.03411752 = score(doc=2222,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.17979822 = fieldWeight in 2222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.03125 = fieldNorm(doc=2222)
  0.25 = coord(1/4)

Footnote

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.00852938 = product of:
  0.03411752 = sum of:
    0.03411752 = weight(_text_:reference in 354) [ClassicSimilarity], result of:
      0.03411752 = score(doc=354,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.17979822 = fieldWeight in 354, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.03125 = fieldNorm(doc=354)
  0.25 = coord(1/4)

Abstract

Web mining aims to discover useful information and knowledge from the Web hyperlink structure, page contents, and usage data. Although Web mining uses many conventional data mining techniques, it is not purely an application of traditional data mining due to the semistructured and unstructured nature of the Web data and its heterogeneity. It has also developed many of its own algorithms and techniques. Liu has written a comprehensive text on Web data mining. Key topics of structure mining, content mining, and usage mining are covered both in breadth and in depth. His book brings together all the essential concepts and algorithms from related areas such as data mining, machine learning, and text processing to form an authoritative and coherent text. The book offers a rich blend of theory and practice, addressing seminal research ideas, as well as examining the technology from a practical point of view. It is suitable for students, researchers and practitioners interested in Web mining both as a learning text and a reference book. Lecturers can readily use it for classes on data mining, Web mining, and Web search. Additional teaching materials such as lecture slides, datasets, and implemented algorithms are available online.

0.00852938 = product of:
  0.03411752 = sum of:
    0.03411752 = weight(_text_:reference in 362) [ClassicSimilarity], result of:
      0.03411752 = score(doc=362,freq=2.0), product of:
        0.18975449 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.04664141 = queryNorm
        0.17979822 = fieldWeight in 362, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.03125 = fieldNorm(doc=362)
  0.25 = coord(1/4)

Abstract

Text mining applications have experienced tremendous advances because of web 2.0 and social networking applications. Recent advances in hardware and software technology have lead to a number of unique scenarios where text mining algorithms are learned. Mining Text Data introduces an important niche in the text analytics field, and is an edited volume contributed by leading international researchers and practitioners focused on social networks & data mining. This book contains a wide swath in topics across social networks & data mining. Each chapter contains a comprehensive survey including the key research content on the topic, and the future directions of research in the field. There is a special focus on Text Embedded with Heterogeneous and Multimedia Data which makes the mining process much more challenging. A number of methods have been designed such as transfer learning and cross-lingual mining for such cases. Mining Text Data simplifies the content, so that advanced-level students, practitioners and researchers in computer science can benefit from this book. Academic and corporate libraries, as well as ACM, IEEE, and Management Science focused on information security, electronic commerce, databases, data mining, machine learning, and statistics are the primary buyers for this reference book.

0.006319267 = product of:
  0.025277069 = sum of:
    0.025277069 = product of:
      0.050554138 = sum of:
        0.050554138 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
          0.050554138 = score(doc=1737,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Date

22.11.1998 18:57:22

0.006319267 = product of:
  0.025277069 = sum of:
    0.025277069 = product of:
      0.050554138 = sum of:
        0.050554138 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
          0.050554138 = score(doc=4261,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Date

17. 7.2002 19:22:06

0.006319267 = product of:
  0.025277069 = sum of:
    0.025277069 = product of:
      0.050554138 = sum of:
        0.050554138 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.050554138 = score(doc=1270,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Source

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

0.0061394316 = product of:
  0.024557726 = sum of:
    0.024557726 = product of:
      0.049115453 = sum of:
        0.049115453 = weight(_text_:services in 2533) [ClassicSimilarity], result of:
          0.049115453 = score(doc=2533,freq=4.0), product of:
            0.1712379 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.04664141 = queryNorm
            0.28682584 = fieldWeight in 2533, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2533)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Purpose - Since library storage has been increasing day by day, it is difficult for readers to find the books which interest them as well as representative booklists. How to utilize meaningful information effectively to improve the service quality of the digital library appears to be very important. The purpose of this paper is to provide a recommendation system architecture to promote digital library services in electronic libraries. Design/methodology/approach - In the proposed architecture, a two-phase data mining process used by association rule and clustering methods is designed to generate a recommendation system. The process considers not only the relationship of a cluster of users but also the associations among the information accessed. Findings - The process considered not only the relationship of a cluster of users but also the associations among the information accessed. With the advanced filter, the recommendation supported by the proposed system architecture would be closely served to meet users' needs. Originality/value - This paper not only constructs a recommendation service for readers to search books from the web but takes the initiative in finding the most suitable books for readers as well. Furthermore, library managers are expected to purchase core and hot books from a limited budget to maintain and satisfy the requirements of readers along with promoting digital library services.

0.0055293585 = product of:
  0.022117434 = sum of:
    0.022117434 = product of:
      0.04423487 = sum of:
        0.04423487 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.04423487 = score(doc=2908,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Source

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

0.005209481 = product of:
  0.020837924 = sum of:
    0.020837924 = product of:
      0.041675847 = sum of:
        0.041675847 = weight(_text_:services in 605) [ClassicSimilarity], result of:
          0.041675847 = score(doc=605,freq=2.0), product of:
            0.1712379 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.04664141 = queryNorm
            0.2433798 = fieldWeight in 605, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.046875 = fieldNorm(doc=605)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

With the development of Web2.0, social tagging systems in which users can freely choose tags to annotate resources according to their interests have attracted much attention. In particular, literature on the emergence of collective intelligence in social tagging systems has increased. In this article, we propose a probabilistic generative model to detect latent topical communities among users. Social tags and resource contents are leveraged to model user interest in two similar and correlated ways. Our primary goal is to capture user tagging behavior and interest and discover the emergent topical community structure. The communities should be groups of users with frequent social interactions as well as similar topical interests, which would have important research implications for personalized information services. Experimental results on two real social tagging data sets with different genres have shown that the proposed generative model more accurately models user interest and detects high-quality and meaningful topical communities.

0.0047394503 = product of:
  0.018957801 = sum of:
    0.018957801 = product of:
      0.037915602 = sum of:
        0.037915602 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
          0.037915602 = score(doc=1383,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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.25 = coord(1/4)

Date

22. 3.2008 14:46:06

0.004341234 = product of:
  0.017364936 = sum of:
    0.017364936 = product of:
      0.034729872 = sum of:
        0.034729872 = weight(_text_:services in 605) [ClassicSimilarity], result of:
          0.034729872 = score(doc=605,freq=2.0), product of:
            0.1712379 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.04664141 = queryNorm
            0.2028165 = fieldWeight in 605, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.0390625 = fieldNorm(doc=605)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Documents discussing public affairs, common themes, interesting products, and so on, are reported and distributed on the Web. Positive and negative opinions embedded in documents are useful references and feedbacks for governments to improve their services, for companies to market their products, and for customers to purchase their objects. Web opinion mining aims to extract, summarize, and track various aspects of subjective information on the Web. Mining subjective information enables traditional information retrieval (IR) systems to retrieve more data from human viewpoints and provide information with finer granularity. Opinion extraction identifies opinion holders, extracts the relevant opinion sentences, and decides their polarities. Opinion summarization recognizes the major events embedded in documents and summarizes the supportive and the nonsupportive evidence. Opinion tracking captures subjective information from various genres and monitors the developments of opinions from spatial and temporal dimensions. To demonstrate and evaluate the proposed opinion mining algorithms, news and bloggers' articles are adopted. Documents in the evaluation corpora are tagged in different granularities from words, sentences to documents. In the experiments, positive and negative sentiment words and their weights are mined on the basis of Chinese word structures. The f-measure is 73.18% and 63.75% for verbs and nouns, respectively. Utilizing the sentiment words mined together with topical words, we achieve f-measure 62.16% at the sentence level and 74.37% at the document level.

0.003949542 = product of:
  0.015798168 = sum of:
    0.015798168 = product of:
      0.031596337 = sum of:
        0.031596337 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
          0.031596337 = score(doc=668,freq=2.0), product of:
            0.16333027 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04664141 = 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)
  0.25 = coord(1/4)

Date

22. 3.2013 19:43:01