Search (62 results, page 1 of 4)

0.024530545 = product of:
  0.073591635 = sum of:
    0.058284443 = weight(_text_:services in 1605) [ClassicSimilarity], result of:
      0.058284443 = score(doc=1605,freq=6.0), product of:
        0.16591617 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.045191888 = 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.015307193 = product of:
      0.030614385 = sum of:
        0.030614385 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
          0.030614385 = score(doc=1605,freq=2.0), product of:
            0.1582543 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045191888 = 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.5 = coord(1/2)
  0.33333334 = coord(2/6)

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.02270303 = product of:
  0.06810909 = sum of:
    0.046679016 = weight(_text_:computer in 2908) [ClassicSimilarity], result of:
      0.046679016 = score(doc=2908,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.28263903 = fieldWeight in 2908, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2908)
    0.02143007 = product of:
      0.04286014 = sum of:
        0.04286014 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.04286014 = score(doc=2908,freq=2.0), product of:
            0.1582543 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045191888 = 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.33333334 = coord(2/6)

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.022094546 = product of:
  0.066283636 = sum of:
    0.026673725 = weight(_text_:computer in 2222) [ClassicSimilarity], result of:
      0.026673725 = score(doc=2222,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.16150802 = fieldWeight in 2222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.03125 = fieldNorm(doc=2222)
    0.039609913 = weight(_text_:network in 2222) [ClassicSimilarity], result of:
      0.039609913 = score(doc=2222,freq=2.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.1968132 = fieldWeight in 2222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.03125 = fieldNorm(doc=2222)
  0.33333334 = coord(2/6)

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.02011343 = product of:
  0.060340293 = sum of:
    0.040380646 = weight(_text_:services in 605) [ClassicSimilarity], result of:
      0.040380646 = score(doc=605,freq=2.0), product of:
        0.16591617 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.045191888 = 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.01995965 = product of:
      0.0399193 = sum of:
        0.0399193 = weight(_text_:resources in 605) [ClassicSimilarity], result of:
          0.0399193 = score(doc=605,freq=2.0), product of:
            0.16496566 = queryWeight, product of:
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.045191888 = queryNorm
            0.2419855 = fieldWeight in 605, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.046875 = fieldNorm(doc=605)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

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.019804956 = product of:
  0.118829735 = sum of:
    0.118829735 = weight(_text_:network in 4286) [ClassicSimilarity], result of:
      0.118829735 = score(doc=4286,freq=8.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.59043956 = fieldWeight in 4286, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.046875 = fieldNorm(doc=4286)
  0.16666667 = coord(1/6)

Abstract

Geolocated social media data provide a powerful source of information about places and regional human behavior. Because only a small amount of social media data have been geolocation-annotated, inference techniques play a substantial role to increase the volume of annotated data. Conventional research in this area has been based on the text content of posts from a given user or the social network of the user, with some recent crossovers between the text- and network-based approaches. This paper proposes a novel approach to categorize highly-mentioned users (celebrities) into Local and Global types, and consequently use Local celebrities as location indicators. A label propagation algorithm is then used over the refined social network for geolocation inference. Finally, we propose a hybrid approach by merging a text-based method as a back-off strategy into our network-based approach. Empirical experiments over three standard Twitter benchmark data sets demonstrate that our approach outperforms state-of-the-art user geolocation methods.

0.017864719 = product of:
  0.053594157 = sum of:
    0.02692043 = weight(_text_:services in 1178) [ClassicSimilarity], result of:
      0.02692043 = score(doc=1178,freq=2.0), product of:
        0.16591617 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.045191888 = 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.026673725 = weight(_text_:computer in 1178) [ClassicSimilarity], result of:
      0.026673725 = score(doc=1178,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.16150802 = fieldWeight in 1178, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.03125 = fieldNorm(doc=1178)
  0.33333334 = coord(2/6)

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.017151598 = product of:
  0.10290959 = sum of:
    0.10290959 = weight(_text_:network in 3322) [ClassicSimilarity], result of:
      0.10290959 = score(doc=3322,freq=6.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.51133573 = fieldWeight in 3322, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.046875 = fieldNorm(doc=3322)
  0.16666667 = coord(1/6)

Abstract

Despite the rapid growth in social network sites and in data mining for emotion (sentiment analysis), little research has tied the two together, and none has had social science goals. This article examines the extent to which emotion is present in MySpace comments, using a combination of data mining and content analysis, and exploring age and gender. A random sample of 819 public comments to or from U.S. users was manually classified for strength of positive and negative emotion. Two thirds of the comments expressed positive emotion, but a minority (20%) contained negative emotion, confirming that MySpace is an extraordinarily emotion-rich environment. Females are likely to give and receive more positive comments than are males, but there is no difference for negative comments. It is thus possible that females are more successful social network site users partly because of their greater ability to textually harness positive affect.

0.017034791 = product of:
  0.10220875 = sum of:
    0.10220875 = sum of:
      0.05322573 = weight(_text_:resources in 4261) [ClassicSimilarity], result of:
        0.05322573 = score(doc=4261,freq=2.0), product of:
          0.16496566 = queryWeight, product of:
            3.650338 = idf(docFreq=3122, maxDocs=44218)
            0.045191888 = queryNorm
          0.32264733 = fieldWeight in 4261, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.650338 = idf(docFreq=3122, maxDocs=44218)
            0.0625 = fieldNorm(doc=4261)
      0.048983015 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
        0.048983015 = score(doc=4261,freq=2.0), product of:
          0.1582543 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.045191888 = 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.16666667 = coord(1/6)

Date

17. 7.2002 19:22:06

Theme

Information Resources Management

0.016761195 = product of:
  0.05028358 = sum of:
    0.03365054 = weight(_text_:services in 605) [ClassicSimilarity], result of:
      0.03365054 = score(doc=605,freq=2.0), product of:
        0.16591617 = queryWeight, product of:
          3.6713707 = idf(docFreq=3057, maxDocs=44218)
          0.045191888 = 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.016633041 = product of:
      0.033266082 = sum of:
        0.033266082 = weight(_text_:resources in 605) [ClassicSimilarity], result of:
          0.033266082 = score(doc=605,freq=2.0), product of:
            0.16496566 = queryWeight, product of:
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.045191888 = queryNorm
            0.20165458 = fieldWeight in 605, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.650338 = idf(docFreq=3122, maxDocs=44218)
              0.0390625 = fieldNorm(doc=605)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

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.

Footnote

Beitrag eines Themenschwerpunktes "Mining Web resources for enhancing information retrieval"

0.016338257 = product of:
  0.09802954 = sum of:
    0.09802954 = weight(_text_:network in 3028) [ClassicSimilarity], result of:
      0.09802954 = score(doc=3028,freq=4.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.48708782 = fieldWeight in 3028, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.0546875 = fieldNorm(doc=3028)
  0.16666667 = coord(1/6)

Abstract

This paper describes a system to semi-automatically extend and refine ontologies by mining textual data from the Web sites of international online media. Expanding a seed ontology creates a semantic network through co-occurrence analysis, trigger phrase analysis, and disambiguation based on the WordNet lexical dictionary. Spreading activation then processes this semantic network to find the most probable candidates for inclusion in an extended ontology. Approaches to identifying hierarchical relationships such as subsumption, head noun analysis and WordNet consultation are used to confirm and classify the found relationships. Using a seed ontology on "climate change" as an example, this paper demonstrates how spreading activation improves the result by naturally integrating the mentioned methods.

0.014004219 = product of:
  0.084025316 = sum of:
    0.084025316 = weight(_text_:network in 3327) [ClassicSimilarity], result of:
      0.084025316 = score(doc=3327,freq=4.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.41750383 = fieldWeight in 3327, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.046875 = fieldNorm(doc=3327)
  0.16666667 = coord(1/6)

Abstract

Social network sites (SNSs) such as MySpace and Facebook are important venues for interpersonal communication, especially among youth. One way in which members can communicate is to write public messages on each other's profile, but how is this unusual means of communication used in practice? An analysis of 2,293 public comment exchanges extracted from large samples of U.S. and U.K. MySpace members found them to be relatively rapid, but rarely used for prolonged exchanges. They seem to fulfill two purposes: making initial contact and keeping in touch occasionally such as at birthdays and other important dates. Although about half of the dialogs seem to exchange some gossip, the dialogs seem typically too short to play the role of gossip-based social grooming for typical pairs of Friends, but close Friends may still communicate extensively in SNSs with other methods.

0.014004219 = product of:
  0.084025316 = sum of:
    0.084025316 = weight(_text_:network in 3704) [ClassicSimilarity], result of:
      0.084025316 = score(doc=3704,freq=4.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.41750383 = fieldWeight in 3704, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.046875 = fieldNorm(doc=3704)
  0.16666667 = coord(1/6)

Abstract

Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices (Thomson Reuters) and Scopus (Elsevier), on the one hand, and these various visualization tools on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI databases and with Scopus. Pajek enables a combination of visualization and statistical analysis, whereas the Google Maps and its derivatives provide superior tools on the Internet.

0.013336862 = product of:
  0.08002117 = sum of:
    0.08002117 = weight(_text_:computer in 977) [ClassicSimilarity], result of:
      0.08002117 = score(doc=977,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.48452407 = fieldWeight in 977, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.09375 = fieldNorm(doc=977)
  0.16666667 = coord(1/6)

0.013336862 = product of:
  0.08002117 = sum of:
    0.08002117 = weight(_text_:computer in 2301) [ClassicSimilarity], result of:
      0.08002117 = score(doc=2301,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.48452407 = fieldWeight in 2301, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.09375 = fieldNorm(doc=2301)
  0.16666667 = coord(1/6)

0.011981669 = product of:
  0.035945006 = sum of:
    0.02982213 = weight(_text_:computer in 1789) [ClassicSimilarity], result of:
      0.02982213 = score(doc=1789,freq=10.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.18057145 = fieldWeight in 1789, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.015625 = fieldNorm(doc=1789)
    0.006122877 = product of:
      0.012245754 = sum of:
        0.012245754 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
          0.012245754 = score(doc=1789,freq=2.0), product of:
            0.1582543 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045191888 = 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.33333334 = coord(2/6)

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.011670183 = product of:
  0.0700211 = sum of:
    0.0700211 = weight(_text_:network in 2345) [ClassicSimilarity], result of:
      0.0700211 = score(doc=2345,freq=4.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.34791988 = fieldWeight in 2345, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2345)
  0.16666667 = coord(1/6)

Abstract

Text mining has been widely used in multiple types of user-generated data to infer user opinion, but its application to microblogging is difficult because text messages are short and noisy, providing limited information about user opinion. Given that microblogging users communicate with each other to form a social network, we hypothesize that user opinion is influenced by its neighbors in the network. In this paper, we infer user opinion on a topic by combining two factors: the user's historical opinion about relevant topics and opinion influence from his/her neighbors. We thus build a topic-level opinion influence model (TOIM) by integrating both topic factor and opinion influence factor into a unified probabilistic model. We evaluate our model in one of the largest microblogging sites in China, Tencent Weibo, and the experiments show that TOIM outperforms baseline methods in opinion inference accuracy. Moreover, incorporating indirect influence further improves inference recall and f1-measure. Finally, we demonstrate some useful applications of TOIM in analyzing users' behaviors in Tencent Weibo.

0.00994071 = product of:
  0.05964426 = sum of:
    0.05964426 = weight(_text_:computer in 362) [ClassicSimilarity], result of:
      0.05964426 = score(doc=362,freq=10.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.3611429 = fieldWeight in 362, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.03125 = fieldNorm(doc=362)
  0.16666667 = coord(1/6)

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

Computer science
Computer Communication Networks

Subject

Computer science
Computer Communication Networks

0.008891242 = product of:
  0.05334745 = sum of:
    0.05334745 = weight(_text_:computer in 6759) [ClassicSimilarity], result of:
      0.05334745 = score(doc=6759,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.32301605 = fieldWeight in 6759, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0625 = fieldNorm(doc=6759)
  0.16666667 = coord(1/6)

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

0.008891242 = product of:
  0.05334745 = sum of:
    0.05334745 = weight(_text_:computer in 3822) [ClassicSimilarity], result of:
      0.05334745 = score(doc=3822,freq=2.0), product of:
        0.16515417 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.045191888 = queryNorm
        0.32301605 = fieldWeight in 3822, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0625 = fieldNorm(doc=3822)
  0.16666667 = coord(1/6)

Series

Lecture notes in computer science; vol.1510

0.008252066 = product of:
  0.049512394 = sum of:
    0.049512394 = weight(_text_:network in 1286) [ClassicSimilarity], result of:
      0.049512394 = score(doc=1286,freq=2.0), product of:
        0.2012564 = queryWeight, product of:
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.045191888 = queryNorm
        0.2460165 = fieldWeight in 1286, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.4533744 = idf(docFreq=1398, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1286)
  0.16666667 = coord(1/6)

Abstract

With the rapid growth of Web 2.0, community question answering (CQA) has become a prevalent information seeking channel, in which users form interactive communities by posting questions and providing answers. Communities may evolve over time, because of changes in users' interests, activities, and new users joining the network. To better understand user interactions in CQA communities, it is necessary to analyze the community structures and track community evolution over time. Existing work in CQA focuses on question searching or content quality detection, and the important problems of community extraction and evolutionary pattern detection have not been studied. In this article, we propose a probabilistic community model (PCM) to extract overlapping community structures and capture their evolution patterns in CQA. The empirical results show that our algorithm appears to improve the community extraction quality. We show empirically, using the iPhone data set, that interesting community evolution patterns can be discovered, with each evolution pattern reflecting the variation of users' interests over time. Our analysis suggests that individual users could benefit to gain comprehensive information from tracking the transition of products. We also show that the communities provide a decision-making basis for business.