Search (37 results, page 1 of 2)

  • × theme_ss:"Data Mining"
  1. Sperlich, T.: ¬Die Zukunft hat schon begonnen : Visualisierungssoftware in der praktischen Anwendung (2000) 0.03
    0.029677266 = product of:
      0.118709065 = sum of:
        0.014510668 = product of:
          0.043532003 = sum of:
            0.043532003 = weight(_text_:t in 5059) [ClassicSimilarity], result of:
              0.043532003 = score(doc=5059,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.34819782 = fieldWeight in 5059, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0625 = fieldNorm(doc=5059)
          0.33333334 = coord(1/3)
        0.104198396 = weight(_text_:kunst in 5059) [ClassicSimilarity], result of:
          0.104198396 = score(doc=5059,freq=2.0), product of:
            0.19342332 = queryWeight, product of:
              6.0947685 = idf(docFreq=270, maxDocs=44218)
              0.031735957 = queryNorm
            0.5387065 = fieldWeight in 5059, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              6.0947685 = idf(docFreq=270, maxDocs=44218)
              0.0625 = fieldNorm(doc=5059)
      0.25 = coord(2/8)
    
    Content
    1. Unsichtbares sichtbar machen - 2. Mit 3D-Darsteltungen besser verkaufen - 3. Mixed Realities - 4. Informationstechnik hilft heilen - 5. Informationen finden - Komplexes verstehen - 6. Informationslandschaften - Karten - 7. Arbeiten und Wohnen in der Info-Zukunft - 8. Neues Lernen in der Info-Welt - 9. Computerspiele alsTechnologie-Avantgarde - 10. Multimediale Kunst
  2. Peters, G.; Gaese, V.: ¬Das DocCat-System in der Textdokumentation von G+J (2003) 0.01
    0.010070449 = product of:
      0.040281795 = sum of:
        0.031682227 = weight(_text_:geschichte in 1507) [ClassicSimilarity], result of:
          0.031682227 = score(doc=1507,freq=2.0), product of:
            0.15083465 = queryWeight, product of:
              4.7528 = idf(docFreq=1036, maxDocs=44218)
              0.031735957 = queryNorm
            0.21004607 = fieldWeight in 1507, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.7528 = idf(docFreq=1036, maxDocs=44218)
              0.03125 = fieldNorm(doc=1507)
        0.008599568 = product of:
          0.017199136 = sum of:
            0.017199136 = weight(_text_:22 in 1507) [ClassicSimilarity], result of:
              0.017199136 = score(doc=1507,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.25 = coord(2/8)
    
    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
  3. Chowdhury, G.G.: Template mining for information extraction from digital documents (1999) 0.00
    0.0037623108 = product of:
      0.030098487 = sum of:
        0.030098487 = product of:
          0.060196973 = sum of:
            0.060196973 = weight(_text_:22 in 4577) [ClassicSimilarity], result of:
              0.060196973 = score(doc=4577,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = queryNorm
                0.5416616 = fieldWeight in 4577, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.109375 = fieldNorm(doc=4577)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    Date
    2. 4.2000 18:01:22
  4. Wattenberg, M.; Viégas, F.; Johnson, I.: How to use t-SNE effectively (2016) 0.00
    0.003627667 = product of:
      0.029021336 = sum of:
        0.029021336 = product of:
          0.087064005 = sum of:
            0.087064005 = weight(_text_:t in 3887) [ClassicSimilarity], result of:
              0.087064005 = score(doc=3887,freq=8.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.69639564 = fieldWeight in 3887, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3887)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    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.
  5. Maaten, L. van den: Accelerating t-SNE using Tree-Based Algorithms (2014) 0.00
    0.0035488727 = product of:
      0.028390981 = sum of:
        0.028390981 = product of:
          0.085172944 = sum of:
            0.085172944 = weight(_text_:t in 3886) [ClassicSimilarity], result of:
              0.085172944 = score(doc=3886,freq=10.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.6812697 = fieldWeight in 3886, product of:
                  3.1622777 = tf(freq=10.0), with freq of:
                    10.0 = termFreq=10.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=3886)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    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.
  6. KDD : techniques and applications (1998) 0.00
    0.0032248378 = product of:
      0.025798703 = sum of:
        0.025798703 = product of:
          0.051597405 = sum of:
            0.051597405 = weight(_text_:22 in 6783) [ClassicSimilarity], result of:
              0.051597405 = score(doc=6783,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = queryNorm
                0.46428138 = fieldWeight in 6783, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.09375 = fieldNorm(doc=6783)
          0.5 = coord(1/2)
      0.125 = coord(1/8)
    
    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
  7. Maaten, L. van den: Learning a parametric embedding by preserving local structure (2009) 0.00
    0.0031742086 = product of:
      0.025393669 = sum of:
        0.025393669 = product of:
          0.076181 = sum of:
            0.076181 = weight(_text_:t in 3883) [ClassicSimilarity], result of:
              0.076181 = score(doc=3883,freq=8.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.60934615 = fieldWeight in 3883, product of:
                  2.828427 = tf(freq=8.0), with freq of:
                    8.0 = termFreq=8.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=3883)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    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.
  8. Maaten, L. van den; Hinton, G.: Visualizing data using t-SNE (2008) 0.00
    0.0027768542 = product of:
      0.022214834 = sum of:
        0.022214834 = product of:
          0.0666445 = sum of:
            0.0666445 = weight(_text_:t in 3888) [ClassicSimilarity], result of:
              0.0666445 = score(doc=3888,freq=12.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.53306687 = fieldWeight in 3888, product of:
                  3.4641016 = tf(freq=12.0), with freq of:
                    12.0 = termFreq=12.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=3888)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    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.
  9. Witten, I.H.; Frank, E.: Data Mining : Praktische Werkzeuge und Techniken für das maschinelle Lernen (2000) 0.00
    0.0027207504 = product of:
      0.021766003 = sum of:
        0.021766003 = product of:
          0.065298006 = sum of:
            0.065298006 = weight(_text_:t in 6833) [ClassicSimilarity], result of:
              0.065298006 = score(doc=6833,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.5222967 = fieldWeight in 6833, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.09375 = fieldNorm(doc=6833)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    Footnote
    Rez. in: nfd 52(2001), H.7, S.427-428 (T. Mandl)
  10. Maaten, L. van den; Hinton, G.: Visualizing non-metric similarities in multiple maps (2012) 0.00
    0.002356239 = product of:
      0.018849911 = sum of:
        0.018849911 = product of:
          0.05654973 = sum of:
            0.05654973 = weight(_text_:t in 3884) [ClassicSimilarity], result of:
              0.05654973 = score(doc=3884,freq=6.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.45232224 = fieldWeight in 3884, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.046875 = fieldNorm(doc=3884)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    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.
  11. Mandl, T.: Text mining und data minig (2013) 0.00
    0.0022672918 = product of:
      0.018138334 = sum of:
        0.018138334 = product of:
          0.054415002 = sum of:
            0.054415002 = weight(_text_:t in 713) [ClassicSimilarity], result of:
              0.054415002 = score(doc=713,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.43524727 = fieldWeight in 713, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.078125 = fieldNorm(doc=713)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
  12. Matson, L.D.; Bonski, D.J.: Do digital libraries need librarians? (1997) 0.00
    0.002149892 = product of:
      0.017199136 = sum of:
        0.017199136 = product of:
          0.034398273 = sum of:
            0.034398273 = weight(_text_:22 in 1737) [ClassicSimilarity], result of:
              0.034398273 = score(doc=1737,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.125 = coord(1/8)
    
    Date
    22.11.1998 18:57:22
  13. Lusti, M.: Data Warehousing and Data Mining : Eine Einführung in entscheidungsunterstützende Systeme (1999) 0.00
    0.002149892 = product of:
      0.017199136 = sum of:
        0.017199136 = product of:
          0.034398273 = sum of:
            0.034398273 = weight(_text_:22 in 4261) [ClassicSimilarity], result of:
              0.034398273 = score(doc=4261,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.125 = coord(1/8)
    
    Date
    17. 7.2002 19:22:06
  14. Amir, A.; Feldman, R.; Kashi, R.: ¬A new and versatile method for association generation (1997) 0.00
    0.002149892 = product of:
      0.017199136 = sum of:
        0.017199136 = product of:
          0.034398273 = sum of:
            0.034398273 = weight(_text_:22 in 1270) [ClassicSimilarity], result of:
              0.034398273 = score(doc=1270,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.125 = coord(1/8)
    
    Source
    Information systems. 22(1997) nos.5/6, S.333-347
  15. Hofstede, A.H.M. ter; Proper, H.A.; Van der Weide, T.P.: Exploiting fact verbalisation in conceptual information modelling (1997) 0.00
    0.0018811554 = product of:
      0.015049243 = sum of:
        0.015049243 = product of:
          0.030098487 = sum of:
            0.030098487 = weight(_text_:22 in 2908) [ClassicSimilarity], result of:
              0.030098487 = score(doc=2908,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.125 = coord(1/8)
    
    Source
    Information systems. 22(1997) nos.5/6, S.349-385
  16. Brückner, T.; Dambeck, H.: Sortierautomaten : Grundlagen der Textklassifizierung (2003) 0.00
    0.0018138335 = product of:
      0.014510668 = sum of:
        0.014510668 = product of:
          0.043532003 = sum of:
            0.043532003 = weight(_text_:t in 2398) [ClassicSimilarity], result of:
              0.043532003 = score(doc=2398,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.34819782 = fieldWeight in 2398, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0625 = fieldNorm(doc=2398)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
  17. Lackes, R.; Tillmanns, C.: Data Mining für die Unternehmenspraxis : Entscheidungshilfen und Fallstudien mit führenden Softwarelösungen (2006) 0.00
    0.0016124189 = product of:
      0.012899351 = sum of:
        0.012899351 = product of:
          0.025798703 = sum of:
            0.025798703 = weight(_text_:22 in 1383) [ClassicSimilarity], result of:
              0.025798703 = score(doc=1383,freq=2.0), product of:
                0.11113391 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.031735957 = 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.125 = coord(1/8)
    
    Date
    22. 3.2008 14:46:06
  18. Baumgartner, R.: Methoden und Werkzeuge zur Webdatenextraktion (2006) 0.00
    0.0015871043 = product of:
      0.012696834 = sum of:
        0.012696834 = product of:
          0.0380905 = sum of:
            0.0380905 = weight(_text_:t in 5808) [ClassicSimilarity], result of:
              0.0380905 = score(doc=5808,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.30467308 = fieldWeight in 5808, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=5808)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    Source
    Semantic Web: Wege zur vernetzten Wissensgesellschaft. Hrsg.: T. Pellegrini, u. A. Blumauer
  19. Huvila, I.: Mining qualitative data on human information behaviour from the Web (2010) 0.00
    0.0015871043 = product of:
      0.012696834 = sum of:
        0.012696834 = product of:
          0.0380905 = sum of:
            0.0380905 = weight(_text_:t in 4676) [ClassicSimilarity], result of:
              0.0380905 = score(doc=4676,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.30467308 = fieldWeight in 4676, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=4676)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    
    Source
    Information und Wissen: global, sozial und frei? Proceedings des 12. Internationalen Symposiums für Informationswissenschaft (ISI 2011) ; Hildesheim, 9. - 11. März 2011. Hrsg.: J. Griesbaum, T. Mandl u. C. Womser-Hacker
  20. Mandl, T.: Text Mining und Data Mining (2023) 0.00
    0.0015871043 = product of:
      0.012696834 = sum of:
        0.012696834 = product of:
          0.0380905 = sum of:
            0.0380905 = weight(_text_:t in 774) [ClassicSimilarity], result of:
              0.0380905 = score(doc=774,freq=2.0), product of:
                0.12502089 = queryWeight, product of:
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.031735957 = queryNorm
                0.30467308 = fieldWeight in 774, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.9394085 = idf(docFreq=2338, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=774)
          0.33333334 = coord(1/3)
      0.125 = coord(1/8)
    

Years

Languages

  • e 24
  • d 13

Types