-
Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999)
0.03
0.031813513 = product of:
0.06362703 = sum of:
0.0071393843 = weight(_text_:in in 4261) [ClassicSimilarity], result of:
0.0071393843 = score(doc=4261,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.120230645 = fieldWeight in 4261, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=4261)
0.032829512 = weight(_text_:und in 4261) [ClassicSimilarity], result of:
0.032829512 = score(doc=4261,freq=6.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.33931053 = fieldWeight in 4261, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=4261)
0.02365813 = product of:
0.04731626 = sum of:
0.04731626 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
0.04731626 = score(doc=4261,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = 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(3/6)
- Abstract
- Im Mittelpunkt dieses anwendungsbezogenen Lehrbuchs stehen Architekturen, Methoden und Werkzeuge entscheidungsunterstützender Systeme. Beispiele und Aufgaben ermöglichen die Entwicklung von Anwendungen mit der Demonstrationssoftware der CD-ROM. Eine interaktive Foliensammlung veranschaulicht den Buchtext und verweist auf zusätzliches Lernmaterial
- Date
- 17. 7.2002 19:22:06
-
Jäger, L.: Von Big Data zu Big Brother (2018)
0.02
0.02268393 = product of:
0.04536786 = sum of:
0.0035696921 = weight(_text_:in in 5234) [ClassicSimilarity], result of:
0.0035696921 = score(doc=5234,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.060115322 = fieldWeight in 5234, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.03125 = fieldNorm(doc=5234)
0.029969105 = weight(_text_:und in 5234) [ClassicSimilarity], result of:
0.029969105 = score(doc=5234,freq=20.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.3097467 = fieldWeight in 5234, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.03125 = fieldNorm(doc=5234)
0.011829065 = product of:
0.02365813 = sum of:
0.02365813 = weight(_text_:22 in 5234) [ClassicSimilarity], result of:
0.02365813 = score(doc=5234,freq=2.0), product of:
0.15286934 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.043654136 = 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.5 = coord(3/6)
- Abstract
- 1983 bewegte ein einziges Thema die gesamte Bundesrepublik: die geplante Volkszählung. Jeder Haushalt in Westdeutschland sollte Fragebögen mit 36 Fragen zur Wohnsituation, den im Haushalt lebenden Personen und über ihre Einkommensverhältnisse ausfüllen. Es regte sich massiver Widerstand, hunderte Bürgerinitiativen formierten sich im ganzen Land gegen die Befragung. Man wollte nicht "erfasst" werden, die Privatsphäre war heilig. Es bestand die (berechtigte) Sorge, dass die Antworten auf den eigentlich anonymisierten Fragebögen Rückschlüsse auf die Identität der Befragten zulassen. Das Bundesverfassungsgericht gab den Klägern gegen den Zensus Recht: Die geplante Volkszählung verstieß gegen den Datenschutz und damit auch gegen das Grundgesetz. Sie wurde gestoppt. Nur eine Generation später geben wir sorglos jedes Mal beim Einkaufen die Bonuskarte der Supermarktkette heraus, um ein paar Punkte für ein Geschenk oder Rabatte beim nächsten Einkauf zu sammeln. Und dabei wissen wir sehr wohl, dass der Supermarkt damit unser Konsumverhalten bis ins letzte Detail erfährt. Was wir nicht wissen, ist, wer noch Zugang zu diesen Daten erhält. Deren Käufer bekommen nicht nur Zugriff auf unsere Einkäufe, sondern können über sie auch unsere Gewohnheiten, persönlichen Vorlieben und Einkommen ermitteln. Genauso unbeschwert surfen wir im Internet, googeln und shoppen, mailen und chatten. Google, Facebook und Microsoft schauen bei all dem nicht nur zu, sondern speichern auf alle Zeiten alles, was wir von uns geben, was wir einkaufen, was wir suchen, und verwenden es für ihre eigenen Zwecke. Sie durchstöbern unsere E-Mails, kennen unser persönliches Zeitmanagement, verfolgen unseren momentanen Standort, wissen um unsere politischen, religiösen und sexuellen Präferenzen (wer kennt ihn nicht, den Button "an Männern interessiert" oder "an Frauen interessiert"?), unsere engsten Freunde, mit denen wir online verbunden sind, unseren Beziehungsstatus, welche Schule wir besuchen oder besucht haben und vieles mehr.
- Date
- 22. 1.2018 11:33:49
-
Datentracking in der Wissenschaft : Aggregation und Verwendung bzw. Verkauf von Nutzungsdaten durch Wissenschaftsverlage. Ein Informationspapier des Ausschusses für Wissenschaftliche Bibliotheken und Informationssysteme der Deutschen Forschungsgemeinschaft (2021)
0.02
0.01893891 = product of:
0.056816727 = sum of:
0.0075724614 = weight(_text_:in in 248) [ClassicSimilarity], result of:
0.0075724614 = score(doc=248,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.12752387 = fieldWeight in 248, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=248)
0.049244266 = weight(_text_:und in 248) [ClassicSimilarity], result of:
0.049244266 = score(doc=248,freq=24.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.5089658 = fieldWeight in 248, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=248)
0.33333334 = coord(2/6)
- Abstract
- Das Informationspapier beschreibt die digitale Nachverfolgung von wissenschaftlichen Aktivitäten. Wissenschaftlerinnen und Wissenschaftler nutzen täglich eine Vielzahl von digitalen Informationsressourcen wie zum Beispiel Literatur- und Volltextdatenbanken. Häufig fallen dabei Nutzungsspuren an, die Aufschluss geben über gesuchte und genutzte Inhalte, Verweildauern und andere Arten der wissenschaftlichen Aktivität. Diese Nutzungsspuren können von den Anbietenden der Informationsressourcen festgehalten, aggregiert und weiterverwendet oder verkauft werden. Das Informationspapier legt die Transformation von Wissenschaftsverlagen hin zu Data Analytics Businesses dar, verweist auf die Konsequenzen daraus für die Wissenschaft und deren Einrichtungen und benennt die zum Einsatz kommenden Typen der Datengewinnung. Damit dient es vor allem der Darstellung gegenwärtiger Praktiken und soll zu Diskussionen über deren Konsequenzen für die Wissenschaft anregen. Es richtet sich an alle Wissenschaftlerinnen und Wissenschaftler sowie alle Akteure in der Wissenschaftslandschaft.
- Editor
- Deutsche Forschungsgemeinschaft / Ausschuss für Wissenschaftliche Bibliotheken und Informationssysteme
-
Winterhalter, C.: Licence to mine : ein Überblick über Rahmenbedingungen von Text and Data Mining und den aktuellen Stand der Diskussion (2016)
0.02
0.016001623 = product of:
0.048004866 = sum of:
0.010096614 = weight(_text_:in in 673) [ClassicSimilarity], result of:
0.010096614 = score(doc=673,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.17003182 = fieldWeight in 673, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=673)
0.037908252 = weight(_text_:und in 673) [ClassicSimilarity], result of:
0.037908252 = score(doc=673,freq=8.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.39180204 = fieldWeight in 673, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=673)
0.33333334 = coord(2/6)
- Abstract
- Der Artikel gibt einen Überblick über die Möglichkeiten der Anwendung von Text and Data Mining (TDM) und ähnlichen Verfahren auf der Grundlage bestehender Regelungen in Lizenzverträgen zu kostenpflichtigen elektronischen Ressourcen, die Debatte über zusätzliche Lizenzen für TDM am Beispiel von Elseviers TDM Policy und den Stand der Diskussion über die Einführung von Schrankenregelungen im Urheberrecht für TDM zu nichtkommerziellen wissenschaftlichen Zwecken.
- Content
- Beitrag in einem Themenschwerpunkt 'Computerlinguistik und Bibliotheken'. Vgl.: http://0277.ch/ojs/index.php/cdrs_0277/article/view/153/350.
-
Loonus, Y.: Einsatzbereiche der KI und ihre Relevanz für Information Professionals (2017)
0.02
0.015176678 = product of:
0.045530032 = sum of:
0.010709076 = weight(_text_:in in 5668) [ClassicSimilarity], result of:
0.010709076 = score(doc=5668,freq=8.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.18034597 = fieldWeight in 5668, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=5668)
0.034820955 = weight(_text_:und in 5668) [ClassicSimilarity], result of:
0.034820955 = score(doc=5668,freq=12.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.35989314 = fieldWeight in 5668, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=5668)
0.33333334 = coord(2/6)
- Abstract
- Es liegt in der Natur des Menschen, Erfahrungen und Ideen in Wort und Schrift mit anderen teilen zu wollen. So produzieren wir jeden Tag gigantische Mengen an Texten, die in digitaler Form geteilt und abgelegt werden. The Radicati Group schätzt, dass 2017 täglich 269 Milliarden E-Mails versendet und empfangen werden. Hinzu kommen größtenteils unstrukturierte Daten wie Soziale Medien, Presse, Websites und firmeninterne Systeme, beispielsweise in Form von CRM-Software oder PDF-Dokumenten. Der weltweite Bestand an unstrukturierten Daten wächst so rasant, dass es kaum möglich ist, seinen Umfang zu quantifizieren. Der Versuch, eine belastbare Zahl zu recherchieren, führt unweigerlich zu diversen Artikeln, die den Anteil unstrukturierter Texte am gesamten Datenbestand auf 80% schätzen. Auch wenn nicht mehr einwandfrei nachvollziehbar ist, woher diese Zahl stammt, kann bei kritischer Reflexion unseres Tagesablaufs kaum bezweifelt werden, dass diese Daten von großer wirtschaftlicher Relevanz sind.
-
Kipcic, O.; Cramer, C.: Wie Zeitungsinhalte Forschung und Entwicklung befördern (2017)
0.01
0.013138894 = product of:
0.039416682 = sum of:
0.006246961 = weight(_text_:in in 3885) [ClassicSimilarity], result of:
0.006246961 = score(doc=3885,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.10520181 = fieldWeight in 3885, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=3885)
0.03316972 = weight(_text_:und in 3885) [ClassicSimilarity], result of:
0.03316972 = score(doc=3885,freq=8.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.34282678 = fieldWeight in 3885, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0546875 = fieldNorm(doc=3885)
0.33333334 = coord(2/6)
- Abstract
- Das F.A.Z.-Archiv ist nach innen das Informationszentrum der F.A.Z. Hier ist seine oberste Aufgabe die Informationsversorgung der Redaktionen der F.A.Z. GmbH und der Nachweis der F.A.Z. mit allen Teilen und Ausgaben. Nach außen tritt es als Vermarkter von Zeitungsdaten auf, dies sowohl für das eigene Haus wie auch für Dritte. Klarer Auftrag ist dabei die Generierung von Erlösen für die F.A.Z.-Gruppe durch Informations- und Datenbankdienste für externe Kunden.
- Content
- Dieser Beitrag beruht auf einem Vortrag der Autorinnen auf der vfm-Frühjahrstagung 2017. Er wird demnächst in info7 2017/3 veröffentlicht.
-
Bauckhage, C.: Moderne Textanalyse : neues Wissen für intelligente Lösungen (2016)
0.01
0.013056986 = product of:
0.039170958 = sum of:
0.012365777 = weight(_text_:in in 2568) [ClassicSimilarity], result of:
0.012365777 = score(doc=2568,freq=6.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.2082456 = fieldWeight in 2568, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=2568)
0.026805183 = weight(_text_:und in 2568) [ClassicSimilarity], result of:
0.026805183 = score(doc=2568,freq=4.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.27704588 = fieldWeight in 2568, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=2568)
0.33333334 = coord(2/6)
- Abstract
- Im Zuge der immer größeren Verfügbarkeit von Daten (Big Data) und rasanter Fortschritte im Daten-basierten maschinellen Lernen haben wir in den letzten Jahren Durchbrüche in der künstlichen Intelligenz erlebt. Dieser Vortrag beleuchtet diese Entwicklungen insbesondere im Hinblick auf die automatische Analyse von Textdaten. Anhand einfacher Beispiele illustrieren wir, wie moderne Textanalyse abläuft und zeigen wiederum anhand von Beispielen, welche praktischen Anwendungsmöglichkeiten sich heutzutage in Branchen wie dem Verlagswesen, der Finanzindustrie oder dem Consulting ergeben.
-
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.01
0.0091104945 = product of:
0.027331483 = sum of:
0.013115887 = weight(_text_:in in 3205) [ClassicSimilarity], result of:
0.013115887 = score(doc=3205,freq=12.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.22087781 = fieldWeight in 3205, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=3205)
0.014215595 = weight(_text_:und in 3205) [ClassicSimilarity], result of:
0.014215595 = score(doc=3205,freq=2.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.14692576 = fieldWeight in 3205, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.046875 = fieldNorm(doc=3205)
0.33333334 = coord(2/6)
- 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.
- Content
- Beitrag in einem Themenschwerpunkt 'Computerlinguistik und Bibliotheken'. Vgl.: http://0277.ch/ojs/index.php/cdrs_0277/article/view/157/355.
-
Nohr, H.: Big Data im Lichte der EU-Datenschutz-Grundverordnung (2017)
0.00
0.0044675306 = product of:
0.026805183 = sum of:
0.026805183 = weight(_text_:und in 4076) [ClassicSimilarity], result of:
0.026805183 = score(doc=4076,freq=4.0), product of:
0.09675359 = queryWeight, product of:
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.043654136 = queryNorm
0.27704588 = fieldWeight in 4076, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
2.216367 = idf(docFreq=13101, maxDocs=44218)
0.0625 = fieldNorm(doc=4076)
0.16666667 = coord(1/6)
- Abstract
- Der vorliegende Beitrag beschäftigt sich mit den Rahmenbedingungen für analytische Anwendungen wie Big Data, die durch das neue europäische Datenschutzrecht entstehen, insbesondere durch die EU-Datenschutz-Grundverordnung. Er stellt wesentliche Neuerungen vor und untersucht die spezifischen datenschutzrechtlichen Regelungen im Hinblick auf den Einsatz von Big Data sowie Voraussetzungen, die durch die Verordnung abverlangt werden.
- Source
- JurPC: Internet-Zeitschrift für Rechtsinformatik und Informationsrecht, [http://www.jurpc.de/jurpc/show?id=20170111]
-
Maaten, L. van den: Learning a parametric embedding by preserving local structure (2009)
0.00
0.0027546515 = product of:
0.016527908 = sum of:
0.016527908 = weight(_text_:in in 3883) [ClassicSimilarity], result of:
0.016527908 = score(doc=3883,freq=14.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.27833787 = fieldWeight in 3883, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=3883)
0.16666667 = coord(1/6)
- Abstract
- The paper presents a new unsupervised dimensionality reduction technique, called parametric t-SNE, that learns a parametric mapping between the high-dimensional data space and the low-dimensional latent space. Parametric t-SNE learns the parametric mapping in such a way that the local structure of the data is preserved as well as possible in the latent space. We evaluate the performance of parametric t-SNE in experiments on three datasets, in which we compare it to the performance of two other unsupervised parametric dimensionality reduction techniques. The results of experiments illustrate the strong performance of parametric t-SNE, in particular, in learning settings in which the dimensionality of the latent space is relatively low.
-
Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012)
0.00
0.0021859813 = product of:
0.013115887 = sum of:
0.013115887 = weight(_text_:in in 3884) [ClassicSimilarity], result of:
0.013115887 = score(doc=3884,freq=12.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.22087781 = fieldWeight in 3884, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=3884)
0.16666667 = coord(1/6)
- Abstract
- Techniques for multidimensional scaling visualize objects as points in a low-dimensional metric map. As a result, the visualizations are subject to the fundamental limitations of metric spaces. These limitations prevent multidimensional scaling from faithfully representing non-metric similarity data such as word associations or event co-occurrences. In particular, multidimensional scaling cannot faithfully represent intransitive pairwise similarities in a visualization, and it cannot faithfully visualize "central" objects. In this paper, we present an extension of a recently proposed multidimensional scaling technique called t-SNE. The extension aims to address the problems of traditional multidimensional scaling techniques when these techniques are used to visualize non-metric similarities. The new technique, called multiple maps t-SNE, alleviates these problems by constructing a collection of maps that reveal complementary structure in the similarity data. We apply multiple maps t-SNE to a large data set of word association data and to a data set of NIPS co-authorships, demonstrating its ability to successfully visualize non-metric similarities.
-
Wongthontham, P.; Abu-Salih, B.: Ontology-based approach for semantic data extraction from social big data : state-of-the-art and research directions (2018)
0.00
0.0021859813 = product of:
0.013115887 = sum of:
0.013115887 = weight(_text_:in in 4097) [ClassicSimilarity], result of:
0.013115887 = score(doc=4097,freq=12.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.22087781 = fieldWeight in 4097, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=4097)
0.16666667 = coord(1/6)
- Abstract
- A challenge of managing and extracting useful knowledge from social media data sources has attracted much attention from academic and industry. To address this challenge, semantic analysis of textual data is focused in this paper. We propose an ontology-based approach to extract semantics of textual data and define the domain of data. In other words, we semantically analyse the social data at two levels i.e. the entity level and the domain level. We have chosen Twitter as a social channel challenge for a purpose of concept proof. Domain knowledge is captured in ontologies which are then used to enrich the semantics of tweets provided with specific semantic conceptual representation of entities that appear in the tweets. Case studies are used to demonstrate this approach. We experiment and evaluate our proposed approach with a public dataset collected from Twitter and from the politics domain. The ontology-based approach leverages entity extraction and concept mappings in terms of quantity and accuracy of concept identification.
- Theme
- Semantisches Umfeld in Indexierung u. Retrieval
-
Cohen, D.J.: From Babel to knowledge : data mining large digital collections (2006)
0.00
0.0018813931 = product of:
0.011288359 = sum of:
0.011288359 = weight(_text_:in in 1178) [ClassicSimilarity], result of:
0.011288359 = score(doc=1178,freq=20.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.19010136 = fieldWeight in 1178, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.03125 = fieldNorm(doc=1178)
0.16666667 = coord(1/6)
- Abstract
- In Jorge Luis Borges's curious short story The Library of Babel, the narrator describes an endless collection of books stored from floor to ceiling in a labyrinth of countless hexagonal rooms. The pages of the library's books seem to contain random sequences of letters and spaces; occasionally a few intelligible words emerge in the sea of paper and ink. Nevertheless, readers diligently, and exasperatingly, scan the shelves for coherent passages. The narrator himself has wandered numerous rooms in search of enlightenment, but with resignation he simply awaits his death and burial - which Borges explains (with signature dark humor) consists of being tossed unceremoniously over the library's banister. Borges's nightmare, of course, is a cursed vision of the research methods of disciplines such as literature, history, and philosophy, where the careful reading of books, one after the other, is supposed to lead inexorably to knowledge and understanding. Computer scientists would approach Borges's library far differently. Employing the information theory that forms the basis for search engines and other computerized techniques for assessing in one fell swoop large masses of documents, they would quickly realize the collection's incoherence though sampling and statistical methods - and wisely start looking for the library's exit. These computational methods, which allow us to find patterns, determine relationships, categorize documents, and extract information from massive corpuses, will form the basis for new tools for research in the humanities and other disciplines in the coming decade. For the past three years I have been experimenting with how to provide such end-user tools - that is, tools that harness the power of vast electronic collections while hiding much of their complicated technical plumbing. In particular, I have made extensive use of the application programming interfaces (APIs) the leading search engines provide for programmers to query their databases directly (from server to server without using their web interfaces). In addition, I have explored how one might extract information from large digital collections, from the well-curated lexicographic database WordNet to the democratic (and poorly curated) online reference work Wikipedia. While processing these digital corpuses is currently an imperfect science, even now useful tools can be created by combining various collections and methods for searching and analyzing them. And more importantly, these nascent services suggest a future in which information can be gleaned from, and sense can be made out of, even imperfect digital libraries of enormous scale. A brief examination of two approaches to data mining large digital collections hints at this future, while also providing some lessons about how to get there.
-
Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014)
0.00
0.0018033426 = product of:
0.010820055 = sum of:
0.010820055 = weight(_text_:in in 3886) [ClassicSimilarity], result of:
0.010820055 = score(doc=3886,freq=6.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.1822149 = fieldWeight in 3886, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0546875 = fieldNorm(doc=3886)
0.16666667 = coord(1/6)
- Abstract
- The paper investigates the acceleration of t-SNE-an embedding technique that is commonly used for the visualization of high-dimensional data in scatter plots-using two tree-based algorithms. In particular, the paper develops variants of the Barnes-Hut algorithm and of the dual-tree algorithm that approximate the gradient used for learning t-SNE embeddings in O(N*logN). Our experiments show that the resulting algorithms substantially accelerate t-SNE, and that they make it possible to learn embeddings of data sets with millions of objects. Somewhat counterintuitively, the Barnes-Hut variant of t-SNE appears to outperform the dual-tree variant.
-
Maaten, L. van den; Hinton, G.: Visualizing data using t-SNE (2008)
0.00
0.0012881019 = product of:
0.007728611 = sum of:
0.007728611 = weight(_text_:in in 3888) [ClassicSimilarity], result of:
0.007728611 = score(doc=3888,freq=6.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.1301535 = fieldWeight in 3888, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0390625 = fieldNorm(doc=3888)
0.16666667 = coord(1/6)
- Abstract
- We present a new technique called "t-SNE" that visualizes high-dimensional data by giving each datapoint a location in a two or three-dimensional map. The technique is a variation of Stochastic Neighbor Embedding (Hinton and Roweis, 2002) that is much easier to optimize, and produces significantly better visualizations by reducing the tendency to crowd points together in the center of the map. t-SNE is better than existing techniques at creating a single map that reveals structure at many different scales. This is particularly important for high-dimensional data that lie on several different, but related, low-dimensional manifolds, such as images of objects from multiple classes seen from multiple viewpoints. For visualizing the structure of very large data sets, we show how t-SNE can use random walks on neighborhood graphs to allow the implicit structure of all of the data to influence the way in which a subset of the data is displayed. We illustrate the performance of t-SNE on a wide variety of data sets and compare it with many other non-parametric visualization techniques, including Sammon mapping, Isomap, and Locally Linear Embedding. The visualizations produced by t-SNE are significantly better than those produced by the other techniques on almost all of the data sets.
-
Mohr, J.W.; Bogdanov, P.: Topic models : what they are and why they matter (2013)
0.00
0.0012620769 = product of:
0.0075724614 = sum of:
0.0075724614 = weight(_text_:in in 1142) [ClassicSimilarity], result of:
0.0075724614 = score(doc=1142,freq=4.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.12752387 = fieldWeight in 1142, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.046875 = fieldNorm(doc=1142)
0.16666667 = coord(1/6)
- Abstract
- We provide a brief, non-technical introduction to the text mining methodology known as "topic modeling." We summarize the theory and background of the method and discuss what kinds of things are found by topic models. Using a text corpus comprised of the eight articles from the special issue of Poetics on the subject of topic models, we run a topic model on these articles, both as a way to introduce the methodology and also to help summarize some of the ways in which social and cultural scientists are using topic models. We review some of the critiques and debates over the use of the method and finally, we link these developments back to some of the original innovations in the field of content analysis that were pioneered by Harold D. Lasswell and colleagues during and just after World War II.
-
Wattenberg, M.; Viégas, F.; Johnson, I.: How to use t-SNE effectively (2016)
0.00
0.0011898974 = product of:
0.0071393843 = sum of:
0.0071393843 = weight(_text_:in in 3887) [ClassicSimilarity], result of:
0.0071393843 = score(doc=3887,freq=2.0), product of:
0.059380736 = queryWeight, product of:
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.043654136 = queryNorm
0.120230645 = fieldWeight in 3887, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.3602545 = idf(docFreq=30841, maxDocs=44218)
0.0625 = fieldNorm(doc=3887)
0.16666667 = coord(1/6)
- Abstract
- Although extremely useful for visualizing high-dimensional data, t-SNE plots can sometimes be mysterious or misleading. By exploring how it behaves in simple cases, we can learn to use it more effectively. We'll walk through a series of simple examples to illustrate what t-SNE diagrams can and cannot show. The t-SNE technique really is useful-but only if you know how to interpret it.
