-
Liu, X.; Yu, S.; Janssens, F.; Glänzel, W.; Moreau, Y.; Moor, B.de: Weighted hybrid clustering by combining text mining and bibliometrics on a large-scale journal database (2010)
0.00
0.001153389 = product of:
0.010380501 = sum of:
0.010380501 = product of:
0.020761002 = sum of:
0.020761002 = weight(_text_:web in 3464) [ClassicSimilarity], result of:
0.020761002 = score(doc=3464,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.21634221 = fieldWeight in 3464, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=3464)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- We propose a new hybrid clustering framework to incorporate text mining with bibliometrics in journal set analysis. The framework integrates two different approaches: clustering ensemble and kernel-fusion clustering. To improve the flexibility and the efficiency of processing large-scale data, we propose an information-based weighting scheme to leverage the effect of multiple data sources in hybrid clustering. Three different algorithms are extended by the proposed weighting scheme and they are employed on a large journal set retrieved from the Web of Science (WoS) database. The clustering performance of the proposed algorithms is systematically evaluated using multiple evaluation methods, and they were cross-compared with alternative methods. Experimental results demonstrate that the proposed weighted hybrid clustering strategy is superior to other methods in clustering performance and efficiency. The proposed approach also provides a more refined structural mapping of journal sets, which is useful for monitoring and detecting new trends in different scientific fields.
-
Kraker, P.; Kittel, C,; Enkhbayar, A.: Open Knowledge Maps : creating a visual interface to the world's scientific knowledge based on natural language processing (2016)
0.00
0.001153389 = product of:
0.010380501 = sum of:
0.010380501 = product of:
0.020761002 = sum of:
0.020761002 = weight(_text_:web in 3205) [ClassicSimilarity], result of:
0.020761002 = score(doc=3205,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.21634221 = fieldWeight in 3205, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=3205)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- The goal of Open Knowledge Maps is to create a visual interface to the world's scientific knowledge. The base for this visual interface consists of so-called knowledge maps, which enable the exploration of existing knowledge and the discovery of new knowledge. Our open source knowledge mapping software applies a mixture of summarization techniques and similarity measures on article metadata, which are iteratively chained together. After processing, the representation is saved in a database for use in a web visualization. In the future, we want to create a space for collective knowledge mapping that brings together individuals and communities involved in exploration and discovery. We want to enable people to guide each other in their discovery by collaboratively annotating and modifying the automatically created maps.
-
Hallonsten, O.; Holmberg, D.: Analyzing structural stratification in the Swedish higher education system : data contextualization with policy-history analysis (2013)
0.00
0.001106661 = product of:
0.009959949 = sum of:
0.009959949 = product of:
0.019919898 = sum of:
0.019919898 = weight(_text_:22 in 668) [ClassicSimilarity], result of:
0.019919898 = score(doc=668,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.11111111 = coord(1/9)
- Date
- 22. 3.2013 19:43:01
-
Fonseca, F.; Marcinkowski, M.; Davis, C.: Cyber-human systems of thought and understanding (2019)
0.00
0.001106661 = product of:
0.009959949 = sum of:
0.009959949 = product of:
0.019919898 = sum of:
0.019919898 = weight(_text_:22 in 5011) [ClassicSimilarity], result of:
0.019919898 = score(doc=5011,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.11111111 = coord(1/9)
- Date
- 7. 3.2019 16:32:22
-
Heyer, G.; Quasthoff, U.; Wittig, T.: Text Mining : Wissensrohstoff Text. Konzepte, Algorithmen, Ergebnisse (2006)
0.00
0.0010874257 = product of:
0.009786831 = sum of:
0.009786831 = product of:
0.019573662 = sum of:
0.019573662 = weight(_text_:web in 5218) [ClassicSimilarity], result of:
0.019573662 = score(doc=5218,freq=4.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.2039694 = fieldWeight in 5218, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=5218)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- Ein großer Teil des Weltwissens befindet sich in Form digitaler Texte im Internet oder in Intranets. Heutige Suchmaschinen nutzen diesen Wissensrohstoff nur rudimentär: Sie können semantische Zusammen-hänge nur bedingt erkennen. Alle warten auf das semantische Web, in dem die Ersteller von Text selbst die Semantik einfügen. Das wird aber noch lange dauern. Es gibt jedoch eine Technologie, die es bereits heute ermöglicht semantische Zusammenhänge in Rohtexten zu analysieren und aufzubereiten. Das Forschungsgebiet "Text Mining" ermöglicht es mit Hilfe statistischer und musterbasierter Verfahren, Wissen aus Texten zu extrahieren, zu verarbeiten und zu nutzen. Hier wird die Basis für die Suchmaschinen der Zukunft gelegt. Das erste deutsche Lehrbuch zu einer bahnbrechenden Technologie: Text Mining: Wissensrohstoff Text Konzepte, Algorithmen, Ergebnisse Ein großer Teil des Weltwissens befindet sich in Form digitaler Texte im Internet oder in Intranets. Heutige Suchmaschinen nutzen diesen Wissensrohstoff nur rudimentär: Sie können semantische Zusammen-hänge nur bedingt erkennen. Alle warten auf das semantische Web, in dem die Ersteller von Text selbst die Semantik einfügen. Das wird aber noch lange dauern. Es gibt jedoch eine Technologie, die es bereits heute ermöglicht semantische Zusammenhänge in Rohtexten zu analysieren und aufzubereiten. Das For-schungsgebiet "Text Mining" ermöglicht es mit Hilfe statistischer und musterbasierter Verfahren, Wissen aus Texten zu extrahieren, zu verarbeiten und zu nutzen. Hier wird die Basis für die Suchmaschinen der Zukunft gelegt. Was fällt Ihnen bei dem Wort "Stich" ein? Die einen denken an Tennis, die anderen an Skat. Die verschiedenen Zusammenhänge können durch Text Mining automatisch ermittelt und in Form von Wortnetzen dargestellt werden. Welche Begriffe stehen am häufigsten links und rechts vom Wort "Festplatte"? Welche Wortformen und Eigennamen treten seit 2001 neu in der deutschen Sprache auf? Text Mining beantwortet diese und viele weitere Fragen. Tauchen Sie mit diesem Lehrbuch ein in eine neue, faszinierende Wissenschaftsdisziplin und entdecken Sie neue, bisher unbekannte Zusammenhänge und Sichtweisen. Sehen Sie, wie aus dem Wissensrohstoff Text Wissen wird! Dieses Lehrbuch richtet sich sowohl an Studierende als auch an Praktiker mit einem fachlichen Schwerpunkt in der Informatik, Wirtschaftsinformatik und/oder Linguistik, die sich über die Grundlagen, Verfahren und Anwendungen des Text Mining informieren möchten und Anregungen für die Implementierung eigener Anwendungen suchen. Es basiert auf Arbeiten, die während der letzten Jahre an der Abteilung Automatische Sprachverarbeitung am Institut für Informatik der Universität Leipzig unter Leitung von Prof. Dr. Heyer entstanden sind. Eine Fülle praktischer Beispiele von Text Mining-Konzepten und -Algorithmen verhelfen dem Leser zu einem umfassenden, aber auch detaillierten Verständnis der Grundlagen und Anwendungen des Text Mining. Folgende Themen werden behandelt: Wissen und Text Grundlagen der Bedeutungsanalyse Textdatenbanken Sprachstatistik Clustering Musteranalyse Hybride Verfahren Beispielanwendungen Anhänge: Statistik und linguistische Grundlagen 360 Seiten, 54 Abb., 58 Tabellen und 95 Glossarbegriffe Mit kostenlosen e-learning-Kurs "Schnelleinstieg: Sprachstatistik" Zusätzlich zum Buch gibt es in Kürze einen Online-Zertifikats-Kurs mit Mentor- und Tutorunterstützung.
-
Chen, C.-C.; Chen, A.-P.: Using data mining technology to provide a recommendation service in the digital library (2007)
0.00
9.611576E-4 = product of:
0.008650418 = sum of:
0.008650418 = product of:
0.017300837 = sum of:
0.017300837 = weight(_text_:web in 2533) [ClassicSimilarity], result of:
0.017300837 = score(doc=2533,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.18028519 = fieldWeight in 2533, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=2533)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- 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.
-
Wei, C.-P.; Lee, Y.-H.; Chiang, Y.-S.; Chen, C.-T.; Yang, C.C.C.: Exploiting temporal characteristics of features for effectively discovering event episodes from news corpora (2014)
0.00
9.611576E-4 = product of:
0.008650418 = sum of:
0.008650418 = product of:
0.017300837 = sum of:
0.017300837 = weight(_text_:web in 1225) [ClassicSimilarity], result of:
0.017300837 = score(doc=1225,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.18028519 = fieldWeight in 1225, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1225)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- An organization performing environmental scanning generally monitors or tracks various events concerning its external environment. One of the major resources for environmental scanning is online news documents, which are readily accessible on news websites or infomediaries. However, the proliferation of the World Wide Web, which increases information sources and improves information circulation, has vastly expanded the amount of information to be scanned. Thus, it is essential to develop an effective event episode discovery mechanism to organize news documents pertaining to an event of interest. In this study, we propose two new metrics, Term Frequency × Inverse Document FrequencyTempo (TF×IDFTempo) and TF×Enhanced-IDFTempo, and develop a temporal-based event episode discovery (TEED) technique that uses the proposed metrics for feature selection and document representation. Using a traditional TF×IDF-based hierarchical agglomerative clustering technique as a performance benchmark, our empirical evaluation reveals that the proposed TEED technique outperforms its benchmark, as measured by cluster recall and cluster precision. In addition, the use of TF×Enhanced-IDFTempo significantly improves the effectiveness of event episode discovery when compared with the use of TF×IDFTempo.
-
Zhang, Z.; Li, Q.; Zeng, D.; Ga, H.: Extracting evolutionary communities in community question answering (2014)
0.00
9.611576E-4 = product of:
0.008650418 = sum of:
0.008650418 = product of:
0.017300837 = sum of:
0.017300837 = weight(_text_:web in 1286) [ClassicSimilarity], result of:
0.017300837 = score(doc=1286,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.18028519 = fieldWeight in 1286, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0390625 = fieldNorm(doc=1286)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- With the rapid growth of Web 2.0, community question answering (CQA) has become a prevalent information seeking channel, in which users form interactive communities by posting questions and providing answers. Communities may evolve over time, because of changes in users' interests, activities, and new users joining the network. To better understand user interactions in CQA communities, it is necessary to analyze the community structures and track community evolution over time. Existing work in CQA focuses on question searching or content quality detection, and the important problems of community extraction and evolutionary pattern detection have not been studied. In this article, we propose a probabilistic community model (PCM) to extract overlapping community structures and capture their evolution patterns in CQA. The empirical results show that our algorithm appears to improve the community extraction quality. We show empirically, using the iPhone data set, that interesting community evolution patterns can be discovered, with each evolution pattern reflecting the variation of users' interests over time. Our analysis suggests that individual users could benefit to gain comprehensive information from tracking the transition of products. We also show that the communities provide a decision-making basis for business.
-
Peters, G.; Gaese, V.: ¬Das DocCat-System in der Textdokumentation von G+J (2003)
0.00
8.853288E-4 = product of:
0.007967959 = sum of:
0.007967959 = product of:
0.015935918 = sum of:
0.015935918 = weight(_text_:22 in 1507) [ClassicSimilarity], result of:
0.015935918 = score(doc=1507,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.11111111 = coord(1/9)
- Date
- 22. 4.2003 11:45:36
-
Hölzig, C.: Google spürt Grippewellen auf : Die neue Anwendung ist bisher auf die USA beschränkt (2008)
0.00
8.853288E-4 = product of:
0.007967959 = sum of:
0.007967959 = product of:
0.015935918 = sum of:
0.015935918 = weight(_text_:22 in 2403) [ClassicSimilarity], result of:
0.015935918 = score(doc=2403,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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)
0.11111111 = coord(1/9)
- Date
- 3. 5.1997 8:44:22
-
Jäger, L.: Von Big Data zu Big Brother (2018)
0.00
8.853288E-4 = product of:
0.007967959 = sum of:
0.007967959 = product of:
0.015935918 = sum of:
0.015935918 = weight(_text_:22 in 5234) [ClassicSimilarity], result of:
0.015935918 = score(doc=5234,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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)
0.11111111 = coord(1/9)
- Date
- 22. 1.2018 11:33:49
-
Cohen, D.J.: From Babel to knowledge : data mining large digital collections (2006)
0.00
7.6892605E-4 = product of:
0.0069203344 = sum of:
0.0069203344 = product of:
0.013840669 = sum of:
0.013840669 = weight(_text_:web in 1178) [ClassicSimilarity], result of:
0.013840669 = score(doc=1178,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.14422815 = fieldWeight in 1178, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=1178)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- 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.
-
Mining text data (2012)
0.00
7.6892605E-4 = product of:
0.0069203344 = sum of:
0.0069203344 = product of:
0.013840669 = sum of:
0.013840669 = weight(_text_:web in 362) [ClassicSimilarity], result of:
0.013840669 = score(doc=362,freq=2.0), product of:
0.09596372 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02940506 = queryNorm
0.14422815 = fieldWeight in 362, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03125 = fieldNorm(doc=362)
0.5 = coord(1/2)
0.11111111 = coord(1/9)
- Abstract
- Text mining applications have experienced tremendous advances because of web 2.0 and social networking applications. Recent advances in hardware and software technology have lead to a number of unique scenarios where text mining algorithms are learned. Mining Text Data introduces an important niche in the text analytics field, and is an edited volume contributed by leading international researchers and practitioners focused on social networks & data mining. This book contains a wide swath in topics across social networks & data mining. Each chapter contains a comprehensive survey including the key research content on the topic, and the future directions of research in the field. There is a special focus on Text Embedded with Heterogeneous and Multimedia Data which makes the mining process much more challenging. A number of methods have been designed such as transfer learning and cross-lingual mining for such cases. Mining Text Data simplifies the content, so that advanced-level students, practitioners and researchers in computer science can benefit from this book. Academic and corporate libraries, as well as ACM, IEEE, and Management Science focused on information security, electronic commerce, databases, data mining, machine learning, and statistics are the primary buyers for this reference book.
-
Lischka, K.: Spurensuche im Datenwust : Data-Mining-Software fahndet nach kriminellen Mitarbeitern, guten Kunden - und bald vielleicht auch nach Terroristen (2002)
0.00
6.6399656E-4 = product of:
0.005975969 = sum of:
0.005975969 = product of:
0.011951938 = sum of:
0.011951938 = weight(_text_:22 in 1178) [ClassicSimilarity], result of:
0.011951938 = score(doc=1178,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.11111111 = coord(1/9)
- 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.
-
Information visualization in data mining and knowledge discovery (2002)
0.00
4.426644E-4 = product of:
0.0039839796 = sum of:
0.0039839796 = product of:
0.007967959 = sum of:
0.007967959 = weight(_text_:22 in 1789) [ClassicSimilarity], result of:
0.007967959 = score(doc=1789,freq=2.0), product of:
0.10297151 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.02940506 = 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.11111111 = coord(1/9)
- Date
- 23. 3.2008 19:10:22
