Search (39 results, page 1 of 2)

0.06047028 = product of:
  0.18141083 = sum of:
    0.18141083 = sum of:
      0.12657282 = weight(_text_:database in 1270) [ClassicSimilarity], result of:
        0.12657282 = score(doc=1270,freq=6.0), product of:
          0.20452234 = queryWeight, product of:
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.050593734 = queryNorm
          0.6188704 = fieldWeight in 1270, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.0625 = fieldNorm(doc=1270)
      0.05483802 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
        0.05483802 = score(doc=1270,freq=2.0), product of:
          0.17717063 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050593734 = 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.33333334 = coord(1/3)

Abstract

Current algorithms for finding associations among the attributes describing data in a database have a number of shortcomings. Presents a novel method for association generation, that answers all desiderata. The method is different from all existing algorithms and especially suitable to textual databases with binary attributes. Uses subword trees for quick indexing into the required database statistics. Tests the algorithm on the Reuters-22173 database with satisfactory results

Source

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

0.047730967 = product of:
  0.07159645 = sum of:
    0.03205038 = weight(_text_:reference in 1789) [ClassicSimilarity], result of:
      0.03205038 = score(doc=1789,freq=6.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.039546072 = sum of:
      0.025836568 = weight(_text_:database in 1789) [ClassicSimilarity], result of:
        0.025836568 = score(doc=1789,freq=4.0), product of:
          0.20452234 = queryWeight, product of:
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.050593734 = queryNorm
          0.12632638 = fieldWeight in 1789, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
      0.013709505 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.013709505 = score(doc=1789,freq=2.0), product of:
          0.17717063 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050593734 = 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.6666667 = coord(2/3)

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.
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.04189677 = product of:
  0.062845156 = sum of:
    0.037008587 = weight(_text_:reference in 362) [ClassicSimilarity], result of:
      0.037008587 = score(doc=362,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.025836568 = product of:
      0.051673137 = sum of:
        0.051673137 = weight(_text_:database in 362) [ClassicSimilarity], result of:
          0.051673137 = score(doc=362,freq=4.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.25265276 = fieldWeight in 362, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.03125 = fieldNorm(doc=362)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

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.

LCSH

Database management

Subject

Database management

0.037308503 = product of:
  0.111925505 = sum of:
    0.111925505 = sum of:
      0.06394224 = weight(_text_:database in 2908) [ClassicSimilarity], result of:
        0.06394224 = score(doc=2908,freq=2.0), product of:
          0.20452234 = queryWeight, product of:
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.050593734 = queryNorm
          0.31264183 = fieldWeight in 2908, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.042444 = idf(docFreq=2109, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2908)
      0.047983266 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
        0.047983266 = score(doc=2908,freq=2.0), product of:
          0.17717063 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.050593734 = 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.33333334 = coord(1/3)

Abstract

Focuses on the information modelling side of conceptual modelling. Deals with the exploitation of fact verbalisations after finishing the actual information system. Verbalisations are used as input for the design of the so-called information model. Exploits these verbalisation in 4 directions: considers their use for a conceptual query language, the verbalisation of instances, the description of the contents of a database and for the verbalisation of queries in a computer supported query environment. Provides an example session with an envisioned tool for end user query formulations that exploits the verbalisation

Source

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

0.036851868 = product of:
  0.0552778 = sum of:
    0.037008587 = weight(_text_:reference in 1178) [ClassicSimilarity], result of:
      0.037008587 = score(doc=1178,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.018269211 = product of:
      0.036538422 = sum of:
        0.036538422 = weight(_text_:database in 1178) [ClassicSimilarity], result of:
          0.036538422 = score(doc=1178,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.17865248 = fieldWeight in 1178, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.03125 = fieldNorm(doc=1178)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

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.02158834 = product of:
  0.06476502 = sum of:
    0.06476502 = weight(_text_:reference in 2300) [ClassicSimilarity], result of:
      0.06476502 = score(doc=2300,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.33333334 = coord(1/3)

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.02131408 = product of:
  0.06394224 = sum of:
    0.06394224 = product of:
      0.12788448 = sum of:
        0.12788448 = weight(_text_:database in 246) [ClassicSimilarity], result of:
          0.12788448 = score(doc=246,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.62528366 = fieldWeight in 246, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.109375 = fieldNorm(doc=246)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Footnote

Rez. in: Database 21(1998) no.3, S.94 (J.D. Blackwell)

0.02131408 = product of:
  0.06394224 = sum of:
    0.06394224 = product of:
      0.12788448 = sum of:
        0.12788448 = weight(_text_:database in 2897) [ClassicSimilarity], result of:
          0.12788448 = score(doc=2897,freq=8.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.62528366 = fieldWeight in 2897, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2897)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Data dependencies are used in database schema design to enforce the correctness of a database as well as to reduce redundant data. These dependencies are usually determined from the semantics of the attributes and are then enforced upon the relations. Describes a bottom-up procedure for discovering multivalued dependencies in observed data without knowing a priori the relationships among the attributes. The proposed algorithm is an application of the technique designed for learning conditional independencies in probabilistic reasoning. A prototype system for automated database schema design has been implemented. Experiments were carried out to demonstrate both the effectiveness and efficiency of the method

0.02131408 = product of:
  0.06394224 = sum of:
    0.06394224 = product of:
      0.12788448 = sum of:
        0.12788448 = weight(_text_:database in 3940) [ClassicSimilarity], result of:
          0.12788448 = score(doc=3940,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.62528366 = fieldWeight in 3940, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.109375 = fieldNorm(doc=3940)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.018504292 = product of:
  0.055512875 = sum of:
    0.055512875 = weight(_text_:reference in 1303) [ClassicSimilarity], result of:
      0.055512875 = score(doc=1303,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.33333334 = coord(1/3)

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.018269213 = product of:
  0.054807637 = sum of:
    0.054807637 = product of:
      0.109615274 = sum of:
        0.109615274 = weight(_text_:database in 977) [ClassicSimilarity], result of:
          0.109615274 = score(doc=977,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.53595746 = fieldWeight in 977, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.09375 = fieldNorm(doc=977)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.018269213 = product of:
  0.054807637 = sum of:
    0.054807637 = product of:
      0.109615274 = sum of:
        0.109615274 = weight(_text_:database in 2301) [ClassicSimilarity], result of:
          0.109615274 = score(doc=2301,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.53595746 = fieldWeight in 2301, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.09375 = fieldNorm(doc=2301)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

0.015994422 = product of:
  0.047983266 = sum of:
    0.047983266 = product of:
      0.09596653 = sum of:
        0.09596653 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
          0.09596653 = score(doc=4577,freq=2.0), product of:
            0.17717063 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050593734 = 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.33333334 = coord(1/3)

Date

2. 4.2000 18:01:22

0.015420245 = product of:
  0.046260733 = sum of:
    0.046260733 = weight(_text_:reference in 3540) [ClassicSimilarity], result of:
      0.046260733 = score(doc=3540,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.33333334 = coord(1/3)

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.0150713315 = product of:
  0.045213994 = sum of:
    0.045213994 = product of:
      0.09042799 = sum of:
        0.09042799 = weight(_text_:database in 2899) [ClassicSimilarity], result of:
          0.09042799 = score(doc=2899,freq=4.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.44214234 = fieldWeight in 2899, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2899)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Defines knowledge discovery and database mining. The challenge for knowledge discovery in databases (KDD) is to automatically process large quantities of raw data, identifying the most significant and meaningful patterns, and present these as as knowledge appropriate for achieving a user's goals. Data mining is the process of deriving useful knowledge from real world databases through the application of pattern extraction techniques. Explains the goals of, and motivation for, research work on data mining. Discusses the nature of database contents, along with problems within the field of data mining

0.013709504 = product of:
  0.041128512 = sum of:
    0.041128512 = product of:
      0.082257025 = sum of:
        0.082257025 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
          0.082257025 = score(doc=6783,freq=2.0), product of:
            0.17717063 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.050593734 = 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.33333334 = coord(1/3)

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.012918284 = product of:
  0.03875485 = sum of:
    0.03875485 = product of:
      0.0775097 = sum of:
        0.0775097 = weight(_text_:database in 3464) [ClassicSimilarity], result of:
          0.0775097 = score(doc=3464,freq=4.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.37897915 = fieldWeight in 3464, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.046875 = fieldNorm(doc=3464)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

We propose a new hybrid clustering framework to incorporate text mining with bibliometrics in journal set analysis. The framework integrates two different approaches: clustering ensemble and kernel-fusion clustering. To improve the flexibility and the efficiency of processing large-scale data, we propose an information-based weighting scheme to leverage the effect of multiple data sources in hybrid clustering. Three different algorithms are extended by the proposed weighting scheme and they are employed on a large journal set retrieved from the Web of Science (WoS) database. The clustering performance of the proposed algorithms is systematically evaluated using multiple evaluation methods, and they were cross-compared with alternative methods. Experimental results demonstrate that the proposed weighted hybrid clustering strategy is superior to other methods in clustering performance and efficiency. The proposed approach also provides a more refined structural mapping of journal sets, which is useful for monitoring and detecting new trends in different scientific fields.

0.012336196 = product of:
  0.037008587 = sum of:
    0.037008587 = weight(_text_:reference in 2222) [ClassicSimilarity], result of:
      0.037008587 = score(doc=2222,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.33333334 = coord(1/3)

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.012336196 = product of:
  0.037008587 = sum of:
    0.037008587 = weight(_text_:reference in 354) [ClassicSimilarity], result of:
      0.037008587 = score(doc=354,freq=2.0), product of:
        0.205834 = queryWeight, product of:
          4.0683694 = idf(docFreq=2055, maxDocs=44218)
          0.050593734 = 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.33333334 = coord(1/3)

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.012179474 = product of:
  0.036538422 = sum of:
    0.036538422 = product of:
      0.073076844 = sum of:
        0.073076844 = weight(_text_:database in 6759) [ClassicSimilarity], result of:
          0.073076844 = score(doc=6759,freq=2.0), product of:
            0.20452234 = queryWeight, product of:
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.050593734 = queryNorm
            0.35730496 = fieldWeight in 6759, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.042444 = idf(docFreq=2109, maxDocs=44218)
              0.0625 = fieldNorm(doc=6759)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Abstract

Examines the relationship between systems and users from the knowledge discovery in databases or data mining perspecitives. A comprehensive study on knowledge discovery in human computer symbiosis is needed. Proposes a database-user adversarial partnership, which is general enough to cover knowledge discovery and security of issues related to databases and their users. It can be further generalized into system-user adversarial paertnership. Discusses opportunities provided by knowledge discovery techniques and potential social implications