Search (41 results, page 2 of 3)

  • × theme_ss:"Data Mining"
  1. Kong, S.; Ye, F.; Feng, L.; Zhao, Z.: Towards the prediction problems of bursting hashtags on Twitter (2015) 0.00 
    0.0018306099 = product of:
  0.021967318 = sum of:
    0.021967318 = weight(_text_:internet in 2338) [ClassicSimilarity], result of:
      0.021967318 = score(doc=2338,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.22832564 = fieldWeight in 2338, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2338)
  0.083333336 = coord(1/12)
    Theme
    Internet
  2. Heyer, G.; Läuter, M.; Quasthoff, U.; Wolff, C.: Texttechnologische Anwendungen am Beispiel Text Mining (2000) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 5565) [ClassicSimilarity], result of:
      0.01882913 = score(doc=5565,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 5565, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=5565)
  0.083333336 = coord(1/12)
    Abstract
    Die zunehmende Menge von Informationen und deren weltweite Verfügbarkeit auf der Basis moderner Internet Technologie machen es erforderlich, Informationen nach inhaltlichen Kriterien zu strukturieren und zu bewerten sowie nach inhaltlichen Kriterien weiter zu verarbeiten. Vom Standpunkt des Benutzers aus sind dabei folgende Fälle zu unterscheiden: Handelt es sich bei den gesuchten Informationen um strukturierle Daten (z.B. in einer SQL-Datenbank) oder unstrukturierte Daten (z.B. grosse Texte)? Ist bekannt, welche Daten benötigt werden und wie sie zu finden sind? Oder ist vor dein Zugriff auf die Daten noch nicht bekannt welche Ergebnisse erwartet werden?
  3. Fenstermacher, K.D.; Ginsburg, M.: Client-side monitoring for Web mining (2003) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 1611) [ClassicSimilarity], result of:
      0.01882913 = score(doc=1611,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 1611, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=1611)
  0.083333336 = coord(1/12)
    Theme
    Internet
  4. Ohly, H.P.: Bibliometric mining : added value from document analysis and retrieval (2008) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 2386) [ClassicSimilarity], result of:
      0.01882913 = score(doc=2386,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 2386, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=2386)
  0.083333336 = coord(1/12)
    Abstract
    Bibliometrics is understood as statistical analysis of scientific structures and processes. The analyzed data result from information and administrative actions. The demand for quality judgments or the discovering of new structures and information means that Bibliometrics takes on the role of being exploratory and decision supporting. To the extent that it has acquired important features of Data Mining, the analysis of text and internet material can be viewed as an additional challenge. In the sense of an evaluative approach Bibliometrics can also be seen to apply inference procedures as well as navigation tools.
  5. Wu, K.J.; Chen, M.-C.; Sun, Y.: Automatic topics discovery from hyperlinked documents (2004) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 2563) [ClassicSimilarity], result of:
      0.01882913 = score(doc=2563,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 2563, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=2563)
  0.083333336 = coord(1/12)
    Abstract
    Topic discovery is an important means for marketing, e-Business and social science studies. As well, it can be applied to various purposes, such as identifying a group with certain properties and observing the emergence and diminishment of a certain cyber community. Previous topic discovery work (J.M. Kleinberg, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, p. 668) requires manual judgment of usefulness of outcomes and is thus incapable of handling the explosive growth of the Internet. In this paper, we propose the Automatic Topic Discovery (ATD) method, which combines a method of base set construction, a clustering algorithm and an iterative principal eigenvector computation method to discover the topics relevant to a given query without using manual examination. Given a query, ATD returns with topics associated with the query and top representative pages for each topic. Our experiments show that the ATD method performs better than the traditional eigenvector method in terms of computation time and topic discovery quality.
  6. Chen, H.; Chau, M.: Web mining : machine learning for Web applications (2003) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 4242) [ClassicSimilarity], result of:
      0.01882913 = score(doc=4242,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 4242, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=4242)
  0.083333336 = coord(1/12)
    Theme
    Internet
  7. Leydesdorff, L.; Persson, O.: Mapping the geography of science : distribution patterns and networks of relations among cities and institutes (2010) 0.00 
    0.0015690941 = product of:
  0.01882913 = sum of:
    0.01882913 = weight(_text_:internet in 3704) [ClassicSimilarity], result of:
      0.01882913 = score(doc=3704,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1957077 = fieldWeight in 3704, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.046875 = fieldNorm(doc=3704)
  0.083333336 = coord(1/12)
    Abstract
    Using Google Earth, Google Maps, and/or network visualization programs such as Pajek, one can overlay the network of relations among addresses in scientific publications onto the geographic map. The authors discuss the pros and cons of various options, and provide software (freeware) for bridging existing gaps between the Science Citation Indices (Thomson Reuters) and Scopus (Elsevier), on the one hand, and these various visualization tools on the other. At the level of city names, the global map can be drawn reliably on the basis of the available address information. At the level of the names of organizations and institutes, there are problems of unification both in the ISI databases and with Scopus. Pajek enables a combination of visualization and statistical analysis, whereas the Google Maps and its derivatives provide superior tools on the Internet.
  8. Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997) 0.00 
    0.0014717856 = product of:
  0.017661426 = sum of:
    0.017661426 = product of:
      0.035322852 = sum of:
        0.035322852 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
          0.035322852 = score(doc=1737,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    Date
    22.11.1998 18:57:22
  9. Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997) 0.00 
    0.0014717856 = product of:
  0.017661426 = sum of:
    0.017661426 = product of:
      0.035322852 = sum of:
        0.035322852 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
          0.035322852 = score(doc=1270,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    Source
    Information systems. 22(1997) nos.5/6, S.333-347
  10. Raan, A.F.J. van; Noyons, E.C.M.: Discovery of patterns of scientific and technological development and knowledge transfer (2002) 0.00 
    0.0013075785 = product of:
  0.015690941 = sum of:
    0.015690941 = weight(_text_:internet in 3603) [ClassicSimilarity], result of:
      0.015690941 = score(doc=3603,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.16308975 = fieldWeight in 3603, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3603)
  0.083333336 = coord(1/12)
    Theme
    Internet
  11. Classification, automation, and new media : Proceedings of the 24th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Passau, March 15 - 17, 2000 (2002) 0.00 
    0.0013075785 = product of:
  0.015690941 = sum of:
    0.015690941 = weight(_text_:internet in 5997) [ClassicSimilarity], result of:
      0.015690941 = score(doc=5997,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.16308975 = fieldWeight in 5997, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
  0.083333336 = coord(1/12)
    Abstract
    Given the huge amount of information in the internet and in practically every domain of knowledge that we are facing today, knowledge discovery calls for automation. The book deals with methods from classification and data analysis that respond effectively to this rapidly growing challenge. The interested reader will find new methodological insights as well as applications in economics, management science, finance, and marketing, and in pattern recognition, biology, health, and archaeology.
  12. Liu, Y.; Huang, X.; An, A.: Personalized recommendation with adaptive mixture of markov models (2007) 0.00 
    0.0013075785 = product of:
  0.015690941 = sum of:
    0.015690941 = weight(_text_:internet in 606) [ClassicSimilarity], result of:
      0.015690941 = score(doc=606,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.16308975 = fieldWeight in 606, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.0390625 = fieldNorm(doc=606)
  0.083333336 = coord(1/12)
    Abstract
    With more and more information available on the Internet, the task of making personalized recommendations to assist the user's navigation has become increasingly important. Considering there might be millions of users with different backgrounds accessing a Web site everyday, it is infeasible to build a separate recommendation system for each user. To address this problem, clustering techniques can first be employed to discover user groups. Then, user navigation patterns for each group can be discovered, to allow the adaptation of a Web site to the interest of each individual group. In this paper, we propose to model user access sequences as stochastic processes, and a mixture of Markov models based approach is taken to cluster users and to capture the sequential relationships inherent in user access histories. Several important issues that arise in constructing the Markov models are also addressed. The first issue lies in the complexity of the mixture of Markov models. To improve the efficiency of building/maintaining the mixture of Markov models, we develop a lightweight adapt-ive algorithm to update the model parameters without recomputing model parameters from scratch. The second issue concerns the proper selection of training data for building the mixture of Markov models. We investigate two different training data selection strategies and perform extensive experiments to compare their effectiveness on a real dataset that is generated by a Web-based knowledge management system, Livelink.
  13. Hofstede, A.H.M. ter; Proper, H.A.; Van der Weide, T.P.: Exploiting fact verbalisation in conceptual information modelling (1997) 0.00 
    0.0012878124 = product of:
  0.015453748 = sum of:
    0.015453748 = product of:
      0.030907497 = sum of:
        0.030907497 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
          0.030907497 = score(doc=2908,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    Source
    Information systems. 22(1997) nos.5/6, S.349-385
  14. Lackes, R.; Tillmanns, C.: Data Mining für die Unternehmenspraxis : Entscheidungshilfen und Fallstudien mit führenden Softwarelösungen (2006) 0.00 
    0.0011038391 = product of:
  0.01324607 = sum of:
    0.01324607 = product of:
      0.02649214 = sum of:
        0.02649214 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
          0.02649214 = score(doc=1383,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    Date
    22. 3.2008 14:46:06
  15. Chakrabarti, S.: Mining the Web : discovering knowledge from hypertext data (2003) 0.00 
    0.0010460628 = product of:
  0.012552753 = sum of:
    0.012552753 = weight(_text_:internet in 2222) [ClassicSimilarity], result of:
      0.012552753 = score(doc=2222,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1304718 = fieldWeight in 2222, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=2222)
  0.083333336 = coord(1/12)
    Theme
    Internet
  16. Klein, H.: Web Content Mining (2004) 0.00 
    0.0010460628 = product of:
  0.012552753 = sum of:
    0.012552753 = weight(_text_:internet in 3154) [ClassicSimilarity], result of:
      0.012552753 = score(doc=3154,freq=2.0), product of:
        0.09621047 = queryWeight, product of:
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.032588977 = queryNorm
        0.1304718 = fieldWeight in 3154, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.9522398 = idf(docFreq=6276, maxDocs=44218)
          0.03125 = fieldNorm(doc=3154)
  0.083333336 = coord(1/12)
    Theme
    Internet
  17. Hallonsten, O.; Holmberg, D.: Analyzing structural stratification in the Swedish higher education system : data contextualization with policy-history analysis (2013) 0.00 
    9.19866E-4 = product of:
  0.011038392 = sum of:
    0.011038392 = product of:
      0.022076784 = sum of:
        0.022076784 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
          0.022076784 = score(doc=668,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    Date
    22. 3.2013 19:43:01
  18. Vaughan, L.; Chen, Y.: Data mining from web search queries : a comparison of Google trends and Baidu index (2015) 0.00 
    9.19866E-4 = product of:
  0.011038392 = sum of:
    0.011038392 = product of:
      0.022076784 = sum of:
        0.022076784 = weight(_text_:22 in 1605) [ClassicSimilarity], result of:
          0.022076784 = score(doc=1605,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = queryNorm
            0.19345059 = fieldWeight in 1605, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1605)
      0.5 = coord(1/2)
  0.083333336 = coord(1/12)
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.1, S.13-22
  19. Peters, G.; Gaese, V.: ¬Das DocCat-System in der Textdokumentation von G+J (2003) 0.00 
    7.358928E-4 = product of:
  0.008830713 = sum of:
    0.008830713 = product of:
      0.017661426 = sum of:
        0.017661426 = weight(_text_:22 in 1507) [ClassicSimilarity], result of:
          0.017661426 = score(doc=1507,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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)
  0.083333336 = coord(1/12)
    Date
    22. 4.2003 11:45:36
  20. Lischka, K.: Spurensuche im Datenwust : Data-Mining-Software fahndet nach kriminellen Mitarbeitern, guten Kunden - und bald vielleicht auch nach Terroristen (2002) 0.00 
    5.5191957E-4 = product of:
  0.006623035 = sum of:
    0.006623035 = product of:
      0.01324607 = sum of:
        0.01324607 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
          0.01324607 = score(doc=1178,freq=2.0), product of:
            0.11412105 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.032588977 = 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.083333336 = coord(1/12)
    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.

Authors

Years

Languages

  • e 25
  • d 16

Types

  • a 28
  • m 10
  • s 6
  • el 5
  • p 1
  • x 1
  • More… Less…

Themes

Subjects

Classifications