Search (124 results, page 1 of 7)

0.07607783 = product of:
  0.114116736 = sum of:
    0.012443737 = weight(_text_:information in 1605) [ClassicSimilarity], result of:
      0.012443737 = score(doc=1605,freq=4.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.13714671 = fieldWeight in 1605, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1605)
    0.101673 = sum of:
      0.06665953 = weight(_text_:services in 1605) [ClassicSimilarity], result of:
        0.06665953 = score(doc=1605,freq=6.0), product of:
          0.18975723 = queryWeight, product of:
            3.6713707 = idf(docFreq=3057, maxDocs=44218)
            0.05168566 = 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.035013467 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
        0.035013467 = score(doc=1605,freq=2.0), product of:
          0.18099438 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05168566 = 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.6666667 = coord(2/3)

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.049104135 = product of:
  0.0736562 = sum of:
    0.024637345 = weight(_text_:information in 4577) [ClassicSimilarity], result of:
      0.024637345 = score(doc=4577,freq=2.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.27153665 = fieldWeight in 4577, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.109375 = fieldNorm(doc=4577)
    0.049018852 = product of:
      0.098037705 = sum of:
        0.098037705 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
          0.098037705 = score(doc=4577,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

Date

2. 4.2000 18:01:22

0.037445158 = product of:
  0.056167737 = sum of:
    0.028156964 = weight(_text_:information in 1737) [ClassicSimilarity], result of:
      0.028156964 = score(doc=1737,freq=8.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3103276 = fieldWeight in 1737, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=1737)
    0.028010774 = product of:
      0.05602155 = sum of:
        0.05602155 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
          0.05602155 = score(doc=1737,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

Abstract

Defines digital libraries and discusses the effects of new technology on librarians. Examines the different viewpoints of librarians and information technologists on digital libraries. Describes the development of a digital library at the National Drug Intelligence Center, USA, which was carried out in collaboration with information technology experts. The system is based on Web enabled search technology to find information, data visualization and data mining to visualize it and use of SGML as an information standard to store it

Date

22.11.1998 18:57:22

0.03470321 = product of:
  0.052054815 = sum of:
    0.027545389 = weight(_text_:information in 2908) [ClassicSimilarity], result of:
      0.027545389 = score(doc=2908,freq=10.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3035872 = fieldWeight in 2908, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2908)
    0.024509426 = product of:
      0.049018852 = sum of:
        0.049018852 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.049018852 = score(doc=2908,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/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.0283487 = product of:
  0.04252305 = sum of:
    0.0232801 = weight(_text_:information in 605) [ClassicSimilarity], result of:
      0.0232801 = score(doc=605,freq=14.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.256578 = fieldWeight in 605, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=605)
    0.019242948 = product of:
      0.038485896 = sum of:
        0.038485896 = weight(_text_:services in 605) [ClassicSimilarity], result of:
          0.038485896 = score(doc=605,freq=2.0), product of:
            0.18975723 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

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"

Source

Journal of the American Society for Information Science and Technology. 58(2007) no.12, S.1838-1850

0.028302697 = product of:
  0.042454045 = sum of:
    0.015240406 = weight(_text_:information in 2533) [ClassicSimilarity], result of:
      0.015240406 = score(doc=2533,freq=6.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.16796975 = fieldWeight in 2533, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2533)
    0.027213639 = product of:
      0.054427277 = sum of:
        0.054427277 = weight(_text_:services in 2533) [ClassicSimilarity], result of:
          0.054427277 = score(doc=2533,freq=4.0), product of:
            0.18975723 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

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.028059505 = product of:
  0.042089257 = sum of:
    0.014078482 = weight(_text_:information in 4261) [ClassicSimilarity], result of:
      0.014078482 = score(doc=4261,freq=2.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.1551638 = fieldWeight in 4261, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4261)
    0.028010774 = product of:
      0.05602155 = sum of:
        0.05602155 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
          0.05602155 = score(doc=4261,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

Date

17. 7.2002 19:22:06

Theme

Information Resources Management

0.028059505 = product of:
  0.042089257 = sum of:
    0.014078482 = weight(_text_:information in 1270) [ClassicSimilarity], result of:
      0.014078482 = score(doc=1270,freq=2.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.1551638 = fieldWeight in 1270, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=1270)
    0.028010774 = product of:
      0.05602155 = sum of:
        0.05602155 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.05602155 = score(doc=1270,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

Source

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

0.025349349 = product of:
  0.038024023 = sum of:
    0.014932485 = weight(_text_:information in 605) [ClassicSimilarity], result of:
      0.014932485 = score(doc=605,freq=4.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.16457605 = fieldWeight in 605, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=605)
    0.023091538 = product of:
      0.046183076 = sum of:
        0.046183076 = weight(_text_:services in 605) [ClassicSimilarity], result of:
          0.046183076 = score(doc=605,freq=2.0), product of:
            0.18975723 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

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.

Source

Journal of the American Society for Information Science and Technology. 64(2013) no.2, S.321-333

0.019648561 = product of:
  0.029472841 = sum of:
    0.014078482 = weight(_text_:information in 1178) [ClassicSimilarity], result of:
      0.014078482 = score(doc=1178,freq=8.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.1551638 = fieldWeight in 1178, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=1178)
    0.015394359 = product of:
      0.030788718 = sum of:
        0.030788718 = weight(_text_:services in 1178) [ClassicSimilarity], result of:
          0.030788718 = score(doc=1178,freq=2.0), product of:
            0.18975723 = queryWeight, product of:
              3.6713707 = idf(docFreq=3057, maxDocs=44218)
              0.05168566 = 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.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.01753719 = product of:
  0.026305784 = sum of:
    0.008799051 = weight(_text_:information in 668) [ClassicSimilarity], result of:
      0.008799051 = score(doc=668,freq=2.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.09697737 = fieldWeight in 668, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=668)
    0.017506734 = product of:
      0.035013467 = sum of:
        0.035013467 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
          0.035013467 = score(doc=668,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.6666667 = coord(2/3)

Date

22. 3.2013 19:43:01

Source

Journal of the American Society for Information Science and Technology. 64(2013) no.3, S.574-586

0.01753719 = product of:
  0.026305784 = sum of:
    0.008799051 = weight(_text_:information in 5011) [ClassicSimilarity], result of:
      0.008799051 = score(doc=5011,freq=2.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.09697737 = fieldWeight in 5011, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5011)
    0.017506734 = product of:
      0.035013467 = sum of:
        0.035013467 = weight(_text_:22 in 5011) [ClassicSimilarity], result of:
          0.035013467 = score(doc=5011,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = queryNorm
            0.19345059 = fieldWeight in 5011, 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=5011)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Date

7. 3.2019 16:32:22

Source

Journal of the Association for Information Science and Technology. 70(2019) no.4, S.402-411

0.014041934 = product of:
  0.021062901 = sum of:
    0.010558861 = weight(_text_:information in 1833) [ClassicSimilarity], result of:
      0.010558861 = score(doc=1833,freq=8.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.116372846 = fieldWeight in 1833, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1833)
    0.01050404 = product of:
      0.02100808 = sum of:
        0.02100808 = weight(_text_:22 in 1833) [ClassicSimilarity], result of:
          0.02100808 = score(doc=1833,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = queryNorm
            0.116070345 = fieldWeight in 1833, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0234375 = fieldNorm(doc=1833)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

Als in den siebziger Jahren des vergangenen Jahrhunderts immer häufiger die Bezeichnung Informationsmanager für Leute propagiert wurde, die bis dahin als Dokumentare firmierten, wurde dies in den etablierten Kreisen der Archivare und Bibliothekare gelegentlich belächelt und als Zeichen einer Identitätskrise oder jedenfalls einer Verunsicherung des damit überschriebenen Berufsbilds gewertet. Für den Berufsstand der Medienarchivare/Mediendokumentare, die sich seit 1960 in der Fachgruppe 7 des Vereins, später Verbands deutscher Archivare (VdA) organisieren, gehörte diese Verortung im Zeichen neuer inhaltlicher Herausforderungen (Informationsflut) und Technologien (EDV) allerdings schon früh zu den Selbstverständlichkeiten des Berufsalltags. "Halt, ohne uns geht es nicht!" lautete die Überschrift eines Artikels im Verbandsorgan "Info 7", der sich mit der Einrichtung von immer mächtigeren Leitungsnetzen und immer schnelleren Datenautobahnen beschäftigte. Information, Informationsgesellschaft: diese Begriffe wurden damals fast nur im technischen Sinne verstanden. Die informatisierte, nicht die informierte Gesellschaft stand im Vordergrund - was wiederum Kritiker auf den Plan rief, von Joseph Weizenbaum in den USA bis hin zu den Informations-Ökologen in Bremen. Bei den nationalen, manchmal auch nur regionalen Projekten und Modellversuchen mit Datenautobahnen - auch beim frühen Btx - war nie so recht deutlich geworden, welche Inhalte in welcher Gestalt durch diese Netze und Straßen gejagt werden sollten und wer diese Inhalte eigentlich selektieren, portionieren, positionieren, kurz: managen sollte. Spätestens mit dem World Wide Web sind diese Projekte denn auch obsolet geworden, jedenfalls was die Hardware und Software anging. Geblieben ist das Thema Inhalte (neudeutsch: Content). Und - immer drängender im nicht nur technischen Verständnis - das Thema Informationsmanagement. MedienInformationsManagement war die Frühjahrstagung der Fachgruppe 7 im Jahr 2000 in Weimar überschrieben, und auch die Folgetagung 2001 in Köln, die der multimedialen Produktion einen dokumentarischen Pragmatismus gegenüber stellte, handelte vom Geschäftsfeld Content und von Content-Management-Systemen. Die in diesem 6. Band der Reihe Beiträge zur Mediendokumentation versammelten Vorträge und Diskussionsbeiträge auf diesen beiden Tagungen beleuchten das Titel-Thema aus den verschiedensten Blickwinkeln: archivarischen, dokumentarischen, kaufmännischen, berufsständischen und juristischen. Deutlich wird dabei, daß die Berufsbezeichnung Medienarchivarln/Mediendokumentarln ziemlich genau für all das steht, was heute mit sog. alten wie neuen Medien im organisatorischen, d.h. ordnenden und vermittelnden Sinne geschieht. Im besonderen Maße trifft dies auf das Internet und die aus ihm geborenen Intranets zu. Beide bedürfen genauso der ordnenden Hand, die sich an den alten Medien, an Buch, Zeitung, Tonträger, Film etc. geschult hat, denn sie leben zu großen Teilen davon. Daß das Internet gleichwohl ein Medium sui generis ist und die alten Informationsberufe vor ganz neue Herausforderungen stellt - auch das durchzieht die Beiträge von Weimar und Köln.

Content

Enthält u.a. die Beiträge (Dokumentarische Aspekte): Günter Perers/Volker Gaese: Das DocCat-System in der Textdokumentation von Gr+J (Weimar 2000) Thomas Gerick: Finden statt suchen. Knowledge Retrieval in Wissensbanken. Mit organisiertem Wissen zu mehr Erfolg (Weimar 2000) Winfried Gödert: Aufbereitung und Rezeption von Information (Weimar 2000) Elisabeth Damen: Klassifikation als Ordnungssystem im elektronischen Pressearchiv (Köln 2001) Clemens Schlenkrich: Aspekte neuer Regelwerksarbeit - Multimediales Datenmodell für ARD und ZDF (Köln 2001) Josef Wandeler: Comprenez-vous only Bahnhof'? - Mehrsprachigkeit in der Mediendokumentation (Köln 200 1)

Date

11. 5.2008 19:49:22

LCSH

Information technology / Management / Congresses

Subject

Information technology / Management / Congresses

0.014005387 = product of:
  0.04201616 = sum of:
    0.04201616 = product of:
      0.08403232 = sum of:
        0.08403232 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
          0.08403232 = score(doc=6783,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.0134479385 = product of:
  0.020171907 = sum of:
    0.013169214 = weight(_text_:information in 1789) [ClassicSimilarity], result of:
      0.013169214 = score(doc=1789,freq=28.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.14514244 = fieldWeight in 1789, product of:
          5.2915025 = tf(freq=28.0), with freq of:
            28.0 = termFreq=28.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.015625 = fieldNorm(doc=1789)
    0.0070026936 = product of:
      0.014005387 = sum of:
        0.014005387 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
          0.014005387 = score(doc=1789,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = 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.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.
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."

LCSH

Information visualization

RSWK

Information Retrieval (BVB)

Subject

Information Retrieval (BVB)
Information visualization

0.011980189 = product of:
  0.017970283 = sum of:
    0.0074662426 = weight(_text_:information in 1178) [ClassicSimilarity], result of:
      0.0074662426 = score(doc=1178,freq=4.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.08228803 = fieldWeight in 1178, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0234375 = fieldNorm(doc=1178)
    0.01050404 = product of:
      0.02100808 = sum of:
        0.02100808 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
          0.02100808 = score(doc=1178,freq=2.0), product of:
            0.18099438 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05168566 = queryNorm
            0.116070345 = fieldWeight in 1178, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0234375 = fieldNorm(doc=1178)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Content

"Ob man als Terrorist einen Anschlag gegen die Vereinigten Staaten plant, als Kassierer Scheine aus der Kasse unterschlägt oder für bestimmte Produkte besonders gerne Geld ausgibt - einen Unterschied macht Data-Mining-Software da nicht. Solche Programme analysieren riesige Daten- mengen und fällen statistische Urteile. Mit diesen Methoden wollen nun die For- scher des "Information Awaren in den Vereinigten Staaten Spuren von Terroristen in den Datenbanken von Behörden und privaten Unternehmen wie Kreditkartenfirmen finden. 200 Millionen Dollar umfasst der Jahresetat für die verschiedenen Forschungsprojekte. Dass solche Software in der Praxis funktioniert, zeigen die steigenden Umsätze der Anbieter so genannter Customer-Relationship-Management-Software. Im vergangenen Jahr ist das Potenzial für analytische CRM-Anwendungen laut dem Marktforschungsinstitut IDC weltweit um 22 Prozent gewachsen, bis zum Jahr 2006 soll es in Deutschland mit einem jährlichen Plus von 14,1 Prozent so weitergehen. Und das trotz schwacher Konjunktur - oder gerade deswegen. Denn ähnlich wie Data-Mining der USRegierung helfen soll, Terroristen zu finden, entscheiden CRM-Programme heute, welche Kunden für eine Firma profitabel sind. Und welche es künftig sein werden, wie Manuela Schnaubelt, Sprecherin des CRM-Anbieters SAP, beschreibt: "Die Kundenbewertung ist ein zentraler Bestandteil des analytischen CRM. Sie ermöglicht es Unternehmen, sich auf die für sie wichtigen und richtigen Kunden zu fokussieren. Darüber hinaus können Firmen mit speziellen Scoring- Verfahren ermitteln, welche Kunden langfristig in welchem Maße zum Unternehmenserfolg beitragen." Die Folgen der Bewertungen sind für die Betroffenen nicht immer positiv: Attraktive Kunden profitieren von individuellen Sonderangeboten und besonderer Zuwendung. Andere hängen vielleicht so lauge in der Warteschleife des Telefonservice, bis die profitableren Kunden abgearbeitet sind. So könnte eine praktische Umsetzung dessen aussehen, was SAP-Spreche-rin Schnaubelt abstrakt beschreibt: "In vielen Unternehmen wird Kundenbewertung mit der klassischen ABC-Analyse durchgeführt, bei der Kunden anhand von Daten wie dem Umsatz kategorisiert werden. A-Kunden als besonders wichtige Kunden werden anders betreut als C-Kunden." Noch näher am geplanten Einsatz von Data-Mining zur Terroristenjagd ist eine Anwendung, die heute viele Firmen erfolgreich nutzen: Sie spüren betrügende Mitarbeiter auf. Werner Sülzer vom großen CRM-Anbieter NCR Teradata beschreibt die Möglichkeiten so: "Heute hinterlässt praktisch jeder Täter - ob Mitarbeiter, Kunde oder Lieferant - Datenspuren bei seinen wirtschaftskriminellen Handlungen. Es muss vorrangig darum gehen, einzelne Spuren zu Handlungsmustern und Täterprofilen zu verdichten. Das gelingt mittels zentraler Datenlager und hoch entwickelter Such- und Analyseinstrumente." Von konkreten Erfolgen sprich: Entlas-sungen krimineller Mitarbeiter-nach Einsatz solcher Programme erzählen Unternehmen nicht gerne. Matthias Wilke von der "Beratungsstelle für Technologiefolgen und Qualifizierung" (BTQ) der Gewerkschaft Verdi weiß von einem Fall 'aus der Schweiz. Dort setzt die Handelskette "Pick Pay" das Programm "Lord Lose Prevention" ein. Zwei Monate nach Einfüh-rung seien Unterschlagungen im Wert von etwa 200 000 Franken ermittelt worden. Das kostete mehr als 50 verdächtige Kassiererinnen und Kassierer den Job.
Jede Kasse schickt die Daten zu Stornos, Rückgaben, Korrekturen und dergleichen an eine zentrale Datenbank. Aus den Informationen errechnet das Programm Kassiererprofile. Wessen Arbeit stark Durchschnitt abweicht, macht sich verdächtig. Die Kriterien" legen im Einzelnen die Revisionsabteilungen fest, doch generell gilt: "Bei Auffälligkeiten wie überdurchschnittlichvielenStornierungen, Off nen der Kassenschublade ohne Verkauf nach einem Storno oder Warenrücknahmen ohne Kassenbon, können die Vorgänge nachträglich einzelnen Personen zugeordnet werden", sagt Rene Schiller, Marketing-Chef des Lord-Herstellers Logware. Ein Kündigungsgrund ist eine solche Datensammlung vor Gericht nicht. Doch auf der Basis können Unternehmen gezielt Detektive einsetzen. Oder sie konfrontieren die Mitarbeiter mit dem Material; woraufhin Schuldige meist gestehen. Wilke sieht Programme wie Lord kritisch:"Jeder, der in dem Raster auffällt, kann ein potenzieller Betrüger oder Dieb sein und verdient besondere Beobachtung." Dabei könne man vom Standard abweichen, weil man unausgeschlafen und deshalb unkonzentriert sei. Hier tut sich für Wilke die Gefahr technisierter Leistungskontrolle auf. "Es ist ja nicht schwierig, mit den Programmen zu berechnen, wie lange beispielsweise das Kassieren eines Samstagseinkaufs durchschnittlich dauert." Die Betriebsräte - ihre Zustimmung ist beim Einsatz technischer Kon trolleinrichtungen nötig - verurteilen die wertende Software weniger eindeutig. Im Gegenteil: Bei Kaufhof und Edeka haben sie dem Einsatz zugestimmt. Denn: "Die wollen ja nicht, dass ganze Abteilungen wegen Inventurverlusten oder dergleichen unter Generalverdacht fallen", erklärt Gewerkschaftler Wilke: "Angesichts der Leistungen kommerzieller Data-Mining-Programme verblüfft es, dass in den Vereinigten Staaten das "Information Awareness Office" noch drei Jahre für Forschung und Erprobung der eigenen Programme veranschlagt. 2005 sollen frühe Prototypen zur Terroristensuche einesgetz werden. Doch schon jetzt regt sich Protest. Datenschützer wie Marc Botenberg vom Informationszentrum für Daten schutz sprechen vom "ehrgeizigsten öffentlichen Überwachungssystem, das je vorgeschlagen wurde". Sie warnen besonders davor, Daten aus der Internetnutzung und private Mails auszuwerten. Das Verteidigungsministerium rudert zurück. Man denke nicht daran, über die Software im Inland aktiv zu werden. "Das werden die Geheimdienste, die Spionageabwehr und die Strafverfolger tun", sagt Unterstaatssekretär Edward Aldridge. Man werde während der Entwicklung und der Tests mit konstruierten und einigen - aus Sicht der Datenschützer unbedenklichen - realen Informationen arbeiten. Zu denken gibt jedoch Aldriges Antwort auf die Frage, warum so viel Geld für die Entwicklung von Übersetzungssoftware eingeplant ist: Damit man Datenbanken in anderen Sprachen nutzen könne - sofern man auf sie rechtmäßigen Zugriff bekommt."

0.0104934815 = product of:
  0.031480443 = sum of:
    0.031480443 = weight(_text_:information in 4263) [ClassicSimilarity], result of:
      0.031480443 = score(doc=4263,freq=10.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3469568 = fieldWeight in 4263, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=4263)
  0.33333334 = coord(1/3)

Abstract

Data mining (DM) is part of a process by which information can be extracted from data or databases and used to inform decision making in a variety of contexts (Benoit, 2002; Michalski, Bratka & Kubat, 1997). DM includes a range of tools and methods for extractiog information; their use in the commercial sector for knowledge extraction and discovery has been one of the main driving forces in their development (Adriaans & Zantinge, 1996; Benoit, 2002). DM has been developed and applied in numerous areas. This review describes its use in analyzing health and medical information.

Source

Annual review of information science and technology. 38(2004), S.331-370

0.010058153 = product of:
  0.03017446 = sum of:
    0.03017446 = weight(_text_:information in 600) [ClassicSimilarity], result of:
      0.03017446 = score(doc=600,freq=12.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3325631 = fieldWeight in 600, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=600)
  0.33333334 = coord(1/3)

Abstract

The amount of information on the Web has been expanding at an enormous pace. There are a variety of Web documents in different genres, such as news, reports, reviews. Traditionally, the information displayed on Web sites has been static. Recently, there are many Web sites offering content that is dynamically generated and frequently updated. It is also common for Web sites to contain information in different languages since many countries adopt more than one language. Moreover, content may exist in multimedia formats including text, images, video, and audio.

Footnote

Einführung in einen Themenschwerpunkt "Mining Web resources for enhancing information retrieval"

Source

Journal of the American Society for Information Science and Technology. 58(2007) no.12, S.1791-1792

0.009954991 = product of:
  0.02986497 = sum of:
    0.02986497 = weight(_text_:information in 4655) [ClassicSimilarity], result of:
      0.02986497 = score(doc=4655,freq=4.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3291521 = fieldWeight in 4655, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.09375 = fieldNorm(doc=4655)
  0.33333334 = coord(1/3)

Source

Journal of information science. 30(2005) no.6, S.550-

0.009385655 = product of:
  0.028156964 = sum of:
    0.028156964 = weight(_text_:information in 3246) [ClassicSimilarity], result of:
      0.028156964 = score(doc=3246,freq=8.0), product of:
        0.09073304 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.05168566 = queryNorm
        0.3103276 = fieldWeight in 3246, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=3246)
  0.33333334 = coord(1/3)

Abstract

Surveys the use of empirical, machine-learning methods for information extraction. Presents a generic architecture for information extraction systems and surveys the learning algorithms that have been developed to address the problems of accuracy, portability, and knowledge acquisition for each component of the architecture

Footnote

Contribution to a special section reviewing recent research in empirical methods in speech recognition, syntactic parsing, semantic processing, information extraction and machine translation