Search (155 results, page 1 of 8)

0.043509427 = product of:
  0.087018855 = sum of:
    0.087018855 = sum of:
      0.008511645 = weight(_text_:a in 4577) [ClassicSimilarity], result of:
        0.008511645 = score(doc=4577,freq=2.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.17835285 = fieldWeight in 4577, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.109375 = fieldNorm(doc=4577)
      0.07850721 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
        0.07850721 = score(doc=4577,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

Date

2. 4.2000 18:01:22

Type

a

0.037293795 = product of:
  0.07458759 = sum of:
    0.07458759 = sum of:
      0.007295696 = weight(_text_:a in 6783) [ClassicSimilarity], result of:
        0.007295696 = score(doc=6783,freq=2.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.15287387 = fieldWeight in 6783, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.09375 = fieldNorm(doc=6783)
      0.06729189 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
        0.06729189 = score(doc=6783,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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.028387543 = product of:
  0.056775086 = sum of:
    0.056775086 = sum of:
      0.011913821 = weight(_text_:a in 1270) [ClassicSimilarity], result of:
        0.011913821 = score(doc=1270,freq=12.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.24964198 = fieldWeight in 1270, product of:
            3.4641016 = tf(freq=12.0), with freq of:
              12.0 = termFreq=12.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0625 = fieldNorm(doc=1270)
      0.044861265 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
        0.044861265 = score(doc=1270,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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

Type

a

0.025869856 = product of:
  0.05173971 = sum of:
    0.05173971 = sum of:
      0.006878448 = weight(_text_:a in 1737) [ClassicSimilarity], result of:
        0.006878448 = score(doc=1737,freq=4.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.14413087 = fieldWeight in 1737, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0625 = fieldNorm(doc=1737)
      0.044861265 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
        0.044861265 = score(doc=1737,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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

Type

a

0.023882624 = product of:
  0.047765248 = sum of:
    0.047765248 = sum of:
      0.008511645 = weight(_text_:a in 2908) [ClassicSimilarity], result of:
        0.008511645 = score(doc=2908,freq=8.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.17835285 = fieldWeight in 2908, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2908)
      0.039253604 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
        0.039253604 = score(doc=2908,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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

Type

a

0.01804052 = product of:
  0.03608104 = sum of:
    0.03608104 = sum of:
      0.008042749 = weight(_text_:a in 5011) [ClassicSimilarity], result of:
        0.008042749 = score(doc=5011,freq=14.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.1685276 = fieldWeight in 5011, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5011)
      0.028038291 = weight(_text_:22 in 5011) [ClassicSimilarity], result of:
        0.028038291 = score(doc=5011,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

Abstract

The present challenge faced by scientists working with Big Data comes in the overwhelming volume and level of detail provided by current data sets. Exceeding traditional empirical approaches, Big Data opens a new perspective on scientific work in which data comes to play a role in the development of the scientific problematic to be developed. Addressing this reconfiguration of our relationship with data through readings of Wittgenstein, Macherey, and Popper, we propose a picture of science that encourages scientists to engage with the data in a direct way, using the data itself as an instrument for scientific investigation. Using GIS as a theme, we develop the concept of cyber-human systems of thought and understanding to bridge the divide between representative (theoretical) thinking and (non-theoretical) data-driven science. At the foundation of these systems, we invoke the concept of the "semantic pixel" to establish a logical and virtual space linking data and the work of scientists. It is with this discussion of the relationship between analysts in their pursuit of knowledge and the rise of Big Data that this present discussion of the philosophical foundations of Big Data addresses the central questions raised by social informatics research.

Date

7. 3.2019 16:32:22

Type

a

0.017417828 = product of:
  0.034835655 = sum of:
    0.034835655 = sum of:
      0.0067973635 = weight(_text_:a in 668) [ClassicSimilarity], result of:
        0.0067973635 = score(doc=668,freq=10.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.14243183 = fieldWeight in 668, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=668)
      0.028038291 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
        0.028038291 = score(doc=668,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.19345059 = fieldWeight in 668, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=668)
  0.5 = coord(1/2)

Abstract

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

Date

22. 3.2013 19:43:01

Type

a

0.017059019 = product of:
  0.034118038 = sum of:
    0.034118038 = sum of:
      0.006079746 = weight(_text_:a in 1605) [ClassicSimilarity], result of:
        0.006079746 = score(doc=1605,freq=8.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.12739488 = fieldWeight in 1605, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1605)
      0.028038291 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
        0.028038291 = score(doc=1605,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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

Type

a

0.0133214025 = product of:
  0.026642805 = sum of:
    0.026642805 = sum of:
      0.0042121722 = weight(_text_:a in 1507) [ClassicSimilarity], result of:
        0.0042121722 = score(doc=1507,freq=6.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.088261776 = fieldWeight in 1507, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.03125 = fieldNorm(doc=1507)
      0.022430632 = weight(_text_:22 in 1507) [ClassicSimilarity], result of:
        0.022430632 = score(doc=1507,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.15476047 = fieldWeight in 1507, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=1507)
  0.5 = coord(1/2)

Abstract

Wir werden einmal die Grundlagen des Text-Mining-Systems bei IBM darstellen, dann werden wir das Projekt etwas umfangreicher und deutlicher darstellen, da kennen wir uns aus. Von daher haben wir zwei Teile, einmal Heidelberg, einmal Hamburg. Noch einmal zur Technologie. Text-Mining ist eine von IBM entwickelte Technologie, die in einer besonderen Ausformung und Programmierung für uns zusammengestellt wurde. Das Projekt hieß bei uns lange Zeit DocText Miner und heißt seit einiger Zeit auf Vorschlag von IBM DocCat, das soll eine Abkürzung für Document-Categoriser sein, sie ist ja auch nett und anschaulich. Wir fangen an mit Text-Mining, das bei IBM in Heidelberg entwickelt wurde. Die verstehen darunter das automatische Indexieren als eine Instanz, also einen Teil von Text-Mining. Probleme werden dabei gezeigt, und das Text-Mining ist eben eine Methode zur Strukturierung von und der Suche in großen Dokumentenmengen, die Extraktion von Informationen und, das ist der hohe Anspruch, von impliziten Zusammenhängen. Das letztere sei dahingestellt. IBM macht das quantitativ, empirisch, approximativ und schnell. das muss man wirklich sagen. Das Ziel, und das ist ganz wichtig für unser Projekt gewesen, ist nicht, den Text zu verstehen, sondern das Ergebnis dieser Verfahren ist, was sie auf Neudeutsch a bundle of words, a bag of words nennen, also eine Menge von bedeutungstragenden Begriffen aus einem Text zu extrahieren, aufgrund von Algorithmen, also im Wesentlichen aufgrund von Rechenoperationen. Es gibt eine ganze Menge von linguistischen Vorstudien, ein wenig Linguistik ist auch dabei, aber nicht die Grundlage der ganzen Geschichte. Was sie für uns gemacht haben, ist also die Annotierung von Pressetexten für unsere Pressedatenbank. Für diejenigen, die es noch nicht kennen: Gruner + Jahr führt eine Textdokumentation, die eine Datenbank führt, seit Anfang der 70er Jahre, da sind z.Z. etwa 6,5 Millionen Dokumente darin, davon etwas über 1 Million Volltexte ab 1993. Das Prinzip war lange Zeit, dass wir die Dokumente, die in der Datenbank gespeichert waren und sind, verschlagworten und dieses Prinzip haben wir auch dann, als der Volltext eingeführt wurde, in abgespeckter Form weitergeführt. Zu diesen 6,5 Millionen Dokumenten gehören dann eben auch ungefähr 10 Millionen Faksimileseiten, weil wir die Faksimiles auch noch standardmäßig aufheben.

Date

22. 4.2003 11:45:36

Type

a

0.012431266 = product of:
  0.024862532 = sum of:
    0.024862532 = sum of:
      0.0024318986 = weight(_text_:a in 2403) [ClassicSimilarity], result of:
        0.0024318986 = score(doc=2403,freq=2.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.050957955 = fieldWeight in 2403, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.03125 = fieldNorm(doc=2403)
      0.022430632 = weight(_text_:22 in 2403) [ClassicSimilarity], result of:
        0.022430632 = score(doc=2403,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.15476047 = fieldWeight in 2403, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=2403)
  0.5 = coord(1/2)

Date

3. 5.1997 8:44:22

Type

a

0.012431266 = product of:
  0.024862532 = sum of:
    0.024862532 = sum of:
      0.0024318986 = weight(_text_:a in 5234) [ClassicSimilarity], result of:
        0.0024318986 = score(doc=5234,freq=2.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.050957955 = fieldWeight in 5234, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.03125 = fieldNorm(doc=5234)
      0.022430632 = weight(_text_:22 in 5234) [ClassicSimilarity], result of:
        0.022430632 = score(doc=5234,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.15476047 = fieldWeight in 5234, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=5234)
  0.5 = coord(1/2)

Date

22. 1.2018 11:33:49

Type

a

0.011215316 = product of:
  0.022430632 = sum of:
    0.022430632 = product of:
      0.044861265 = sum of:
        0.044861265 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
          0.044861265 = score(doc=4261,freq=2.0), product of:
            0.14493774 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.041389145 = queryNorm
            0.30952093 = fieldWeight in 4261, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=4261)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

17. 7.2002 19:22:06

0.009701196 = product of:
  0.019402392 = sum of:
    0.019402392 = sum of:
      0.002579418 = weight(_text_:a in 1178) [ClassicSimilarity], result of:
        0.002579418 = score(doc=1178,freq=4.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.054049075 = fieldWeight in 1178, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.0234375 = fieldNorm(doc=1178)
      0.016822973 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
        0.016822973 = score(doc=1178,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = 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)

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.

Type

a

0.008707733 = product of:
  0.017415466 = sum of:
    0.017415466 = sum of:
      0.0062001497 = weight(_text_:a in 1789) [ClassicSimilarity], result of:
        0.0062001497 = score(doc=1789,freq=52.0), product of:
          0.04772363 = queryWeight, product of:
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.041389145 = queryNorm
          0.12991782 = fieldWeight in 1789, product of:
            7.2111025 = tf(freq=52.0), with freq of:
              52.0 = termFreq=52.0
            1.153047 = idf(docFreq=37942, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
      0.011215316 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
        0.011215316 = score(doc=1789,freq=2.0), product of:
          0.14493774 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.041389145 = queryNorm
          0.07738023 = fieldWeight in 1789, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.015625 = fieldNorm(doc=1789)
  0.5 = coord(1/2)

Date

23. 3.2008 19:10:22

Footnote

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.008411487 = product of:
  0.016822973 = sum of:
    0.016822973 = product of:
      0.033645947 = sum of:
        0.033645947 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
          0.033645947 = score(doc=1383,freq=2.0), product of:
            0.14493774 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.041389145 = queryNorm
            0.23214069 = fieldWeight in 1383, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=1383)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

22. 3.2008 14:46:06

0.0042057433 = product of:
  0.008411487 = sum of:
    0.008411487 = product of:
      0.016822973 = sum of:
        0.016822973 = weight(_text_:22 in 1833) [ClassicSimilarity], result of:
          0.016822973 = score(doc=1833,freq=2.0), product of:
            0.14493774 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.041389145 = 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.5 = coord(1/2)

Date

11. 5.2008 19:49:22

0.0030093212 = product of:
  0.0060186423 = sum of:
    0.0060186423 = product of:
      0.012037285 = sum of:
        0.012037285 = weight(_text_:a in 3940) [ClassicSimilarity], result of:
          0.012037285 = score(doc=3940,freq=4.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.25222903 = fieldWeight in 3940, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.109375 = fieldNorm(doc=3940)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Type

a

0.0028838771 = product of:
  0.0057677543 = sum of:
    0.0057677543 = product of:
      0.011535509 = sum of:
        0.011535509 = weight(_text_:a in 4286) [ClassicSimilarity], result of:
          0.011535509 = score(doc=4286,freq=20.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.24171482 = fieldWeight in 4286, product of:
              4.472136 = tf(freq=20.0), with freq of:
                20.0 = termFreq=20.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046875 = fieldNorm(doc=4286)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

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.

Type

a

0.002843541 = product of:
  0.005687082 = sum of:
    0.005687082 = product of:
      0.011374164 = sum of:
        0.011374164 = weight(_text_:a in 2155) [ClassicSimilarity], result of:
          0.011374164 = score(doc=2155,freq=28.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.23833402 = fieldWeight in 2155, product of:
              5.2915025 = tf(freq=28.0), with freq of:
                28.0 = termFreq=28.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2155)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The recent interest in Big Data has generated a broad range of new academic, corporate, and policy practices along with an evolving debate among its proponents, detractors, and skeptics. While the practices draw on a common set of tools, techniques, and technologies, most contributions to the debate come either from a particular disciplinary perspective or with a focus on a domain-specific issue. A close examination of these contributions reveals a set of common problematics that arise in various guises and in different places. It also demonstrates the need for a critical synthesis of the conceptual and practical dilemmas surrounding Big Data. The purpose of this article is to provide such a synthesis by drawing on relevant writings in the sciences, humanities, policy, and trade literature. In bringing these diverse literatures together, we aim to shed light on the common underlying issues that concern and affect all of these areas. By contextualizing the phenomenon of Big Data within larger socioeconomic developments, we also seek to provide a broader understanding of its drivers, barriers, and challenges. This approach allows us to identify attributes of Big Data that require more attention-autonomy, opacity, generativity, disparity, and futurity-leading to questions and ideas for moving beyond dilemmas.

Type

a

0.002814962 = product of:
  0.005629924 = sum of:
    0.005629924 = product of:
      0.011259848 = sum of:
        0.011259848 = weight(_text_:a in 2909) [ClassicSimilarity], result of:
          0.011259848 = score(doc=2909,freq=14.0), product of:
            0.04772363 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.041389145 = queryNorm
            0.23593865 = fieldWeight in 2909, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2909)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Rough set theory is a mathematical tool to deal with vagueness and uncertainty. To apply the theory, it needs to be associated with efficient and effective computational methods. A relation can be used to represent a decison table for use in decision making. By using this kind of table, rough set theory can be applied successfully to rough classification and knowledge discovery. Presents computational methods for using rough sets to identify classes in datasets, finding dependencies in relations, and discovering rules which are hidden in databases. Illustrates the methods with a running example from a database of car test results

Footnote

Contribution to a special issue devoted to knowledge discovery and data mining

Type

a