Search (79 results, page 1 of 4)

  • × theme_ss:"Automatisches Klassifizieren"
  1. Hotho, A.; Bloehdorn, S.: Data Mining 2004 : Text classification by boosting weak learners based on terms and concepts (2004) 0.18 
    0.18475257 = product of:
  0.27712885 = sum of:
    0.05651486 = product of:
      0.16954458 = sum of:
        0.16954458 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
          0.16954458 = score(doc=562,freq=2.0), product of:
            0.30167106 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.035582762 = queryNorm
            0.56201804 = fieldWeight in 562, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=562)
      0.33333334 = coord(1/3)
    0.036606483 = weight(_text_:t in 562) [ClassicSimilarity], result of:
      0.036606483 = score(doc=562,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.26114836 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.16954458 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.16954458 = score(doc=562,freq=2.0), product of:
        0.30167106 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.035582762 = queryNorm
        0.56201804 = fieldWeight in 562, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.046875 = fieldNorm(doc=562)
    0.014462919 = product of:
      0.028925838 = sum of:
        0.028925838 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
          0.028925838 = score(doc=562,freq=2.0), product of:
            0.12460477 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035582762 = queryNorm
            0.23214069 = fieldWeight in 562, 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=562)
      0.5 = coord(1/2)
  0.6666667 = coord(4/6)
    Content
    Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.
    Date
    8. 1.2013 10:22:32
  2. Lindholm, J.; Schönthal, T.; Jansson , K.: Experiences of harvesting Web resources in engineering using automatic classification (2003) 0.02 
    0.020722773 = product of:
  0.06216832 = sum of:
    0.048808645 = weight(_text_:t in 4088) [ClassicSimilarity], result of:
      0.048808645 = score(doc=4088,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.34819782 = fieldWeight in 4088, 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=4088)
    0.013359673 = product of:
      0.04007902 = sum of:
        0.04007902 = weight(_text_:k in 4088) [ClassicSimilarity], result of:
          0.04007902 = score(doc=4088,freq=2.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.31552678 = fieldWeight in 4088, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0625 = fieldNorm(doc=4088)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)
  3. Reiner, U.: Automatische DDC-Klassifizierung bibliografischer Titeldatensätze der Deutschen Nationalbibliografie (2009) 0.02 
    0.020115245 = product of:
  0.12069147 = sum of:
    0.12069147 = sum of:
      0.10140758 = weight(_text_:intelligenz in 3284) [ClassicSimilarity], result of:
        0.10140758 = score(doc=3284,freq=8.0), product of:
          0.20204939 = queryWeight, product of:
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.035582762 = queryNorm
          0.501895 = fieldWeight in 3284, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.03125 = fieldNorm(doc=3284)
      0.019283893 = weight(_text_:22 in 3284) [ClassicSimilarity], result of:
        0.019283893 = score(doc=3284,freq=2.0), product of:
          0.12460477 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.035582762 = queryNorm
          0.15476047 = fieldWeight in 3284, 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=3284)
  0.16666667 = coord(1/6)
    Abstract
    Das Klassifizieren von Objekten (z. B. Fauna, Flora, Texte) ist ein Verfahren, das auf menschlicher Intelligenz basiert. In der Informatik - insbesondere im Gebiet der Künstlichen Intelligenz (KI) - wird u. a. untersucht, inweit Verfahren, die menschliche Intelligenz benötigen, automatisiert werden können. Hierbei hat sich herausgestellt, dass die Lösung von Alltagsproblemen eine größere Herausforderung darstellt, als die Lösung von Spezialproblemen, wie z. B. das Erstellen eines Schachcomputers. So ist "Rybka" der seit Juni 2007 amtierende Computerschach-Weltmeistern. Inwieweit Alltagsprobleme mit Methoden der Künstlichen Intelligenz gelöst werden können, ist eine - für den allgemeinen Fall - noch offene Frage. Beim Lösen von Alltagsproblemen spielt die Verarbeitung der natürlichen Sprache, wie z. B. das Verstehen, eine wesentliche Rolle. Den "gesunden Menschenverstand" als Maschine (in der Cyc-Wissensbasis in Form von Fakten und Regeln) zu realisieren, ist Lenat's Ziel seit 1984. Bezüglich des KI-Paradeprojektes "Cyc" gibt es CycOptimisten und Cyc-Pessimisten. Das Verstehen der natürlichen Sprache (z. B. Werktitel, Zusammenfassung, Vorwort, Inhalt) ist auch beim intellektuellen Klassifizieren von bibliografischen Titeldatensätzen oder Netzpublikationen notwendig, um diese Textobjekte korrekt klassifizieren zu können. Seit dem Jahr 2007 werden von der Deutschen Nationalbibliothek nahezu alle Veröffentlichungen mit der Dewey Dezimalklassifikation (DDC) intellektuell klassifiziert.
    Date
    22. 1.2010 14:41:24
  4. Pfeffer, M.: Automatische Vergabe von RVK-Notationen mittels fallbasiertem Schließen (2009) 0.02 
    0.017496921 = product of:
  0.10498153 = sum of:
    0.10498153 = sum of:
      0.07605569 = weight(_text_:intelligenz in 3051) [ClassicSimilarity], result of:
        0.07605569 = score(doc=3051,freq=2.0), product of:
          0.20204939 = queryWeight, product of:
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.035582762 = queryNorm
          0.37642127 = fieldWeight in 3051, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.046875 = fieldNorm(doc=3051)
      0.028925838 = weight(_text_:22 in 3051) [ClassicSimilarity], result of:
        0.028925838 = score(doc=3051,freq=2.0), product of:
          0.12460477 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.035582762 = queryNorm
          0.23214069 = fieldWeight in 3051, 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=3051)
  0.16666667 = coord(1/6)
    Abstract
    Klassifikation von bibliografischen Einheiten ist für einen systematischen Zugang zu den Beständen einer Bibliothek und deren Aufstellung unumgänglich. Bislang wurde diese Aufgabe von Fachexperten manuell erledigt, sei es individuell nach einer selbst entwickelten Systematik oder kooperativ nach einer gemeinsamen Systematik. In dieser Arbeit wird ein Verfahren zur Automatisierung des Klassifikationsvorgangs vorgestellt. Dabei kommt das Verfahren des fallbasierten Schließens zum Einsatz, das im Kontext der Forschung zur künstlichen Intelligenz entwickelt wurde. Das Verfahren liefert für jedes Werk, für das bibliografische Daten vorliegen, eine oder mehrere mögliche Klassifikationen. In Experimenten werden die Ergebnisse der automatischen Klassifikation mit der durch Fachexperten verglichen. Diese Experimente belegen die hohe Qualität der automatischen Klassifikation und dass das Verfahren geeignet ist, Fachexperten bei der Klassifikationsarbeit signifikant zu entlasten. Auch die nahezu vollständige Resystematisierung eines Bibliothekskataloges ist - mit gewissen Abstrichen - möglich.
    Date
    22. 8.2009 19:51:28
  5. Golub, K.; Hamon, T.; Ardö, A.: Automated classification of textual documents based on a controlled vocabulary in engineering (2007) 0.02 
    0.015542081 = product of:
  0.04662624 = sum of:
    0.036606483 = weight(_text_:t in 1461) [ClassicSimilarity], result of:
      0.036606483 = score(doc=1461,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.26114836 = fieldWeight in 1461, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.046875 = fieldNorm(doc=1461)
    0.010019755 = product of:
      0.030059265 = sum of:
        0.030059265 = weight(_text_:k in 1461) [ClassicSimilarity], result of:
          0.030059265 = score(doc=1461,freq=2.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.23664509 = fieldWeight in 1461, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=1461)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)
  6. Sojka, P.; Lee, M.; Rehurek, R.; Hatlapatka, R.; Kucbel, M.; Bouche, T.; Goutorbe, C.; Anghelache, R.; Wojciechowski, K.: Toolset for entity and semantic associations : Final Release (2013) 0.02 
    0.015542081 = product of:
  0.04662624 = sum of:
    0.036606483 = weight(_text_:t in 1057) [ClassicSimilarity], result of:
      0.036606483 = score(doc=1057,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.26114836 = fieldWeight in 1057, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.046875 = fieldNorm(doc=1057)
    0.010019755 = product of:
      0.030059265 = sum of:
        0.030059265 = weight(_text_:k in 1057) [ClassicSimilarity], result of:
          0.030059265 = score(doc=1057,freq=2.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.23664509 = fieldWeight in 1057, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=1057)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)
  7. Fagni, T.; Sebastiani, F.: Selecting negative examples for hierarchical text classification: An experimental comparison (2010) 0.01 
    0.012951734 = product of:
  0.0388552 = sum of:
    0.030505402 = weight(_text_:t in 4101) [ClassicSimilarity], result of:
      0.030505402 = score(doc=4101,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.21762364 = fieldWeight in 4101, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4101)
    0.008349796 = product of:
      0.025049387 = sum of:
        0.025049387 = weight(_text_:k in 4101) [ClassicSimilarity], result of:
          0.025049387 = score(doc=4101,freq=2.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.19720423 = fieldWeight in 4101, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4101)
      0.33333334 = coord(1/3)
  0.33333334 = coord(2/6)
    Abstract
    Hierarchical text classification (HTC) approaches have recently attracted a lot of interest on the part of researchers in human language technology and machine learning, since they have been shown to bring about equal, if not better, classification accuracy with respect to their "flat" counterparts while allowing exponential time savings at both learning and classification time. A typical component of HTC methods is a "local" policy for selecting negative examples: Given a category c, its negative training examples are by default identified with the training examples that are negative for c and positive for the categories which are siblings of c in the hierarchy. However, this policy has always been taken for granted and never been subjected to careful scrutiny since first proposed 15 years ago. This article proposes a thorough experimental comparison between this policy and three other policies for the selection of negative examples in HTC contexts, one of which (BEST LOCAL (k)) is being proposed for the first time in this article. We compare these policies on the hierarchical versions of three supervised learning algorithms (boosting, support vector machines, and naïve Bayes) by performing experiments on two standard TC datasets, REUTERS-21578 and RCV1-V2.
  8. Ardö, A.; Koch, T.: Automatic classification applied to full-text Internet documents in a robot-generated subject index (1999) 0.01 
    0.012202161 = product of:
  0.07321297 = sum of:
    0.07321297 = weight(_text_:t in 382) [ClassicSimilarity], result of:
      0.07321297 = score(doc=382,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.5222967 = fieldWeight in 382, 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=382)
  0.16666667 = coord(1/6)
  9. Zhu, W.Z.; Allen, R.B.: Document clustering using the LSI subspace signature model (2013) 0.01 
    0.010605882 = product of:
  0.031817645 = sum of:
    0.017354727 = product of:
      0.052064177 = sum of:
        0.052064177 = weight(_text_:k in 690) [ClassicSimilarity], result of:
          0.052064177 = score(doc=690,freq=6.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.40988132 = fieldWeight in 690, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=690)
      0.33333334 = coord(1/3)
    0.014462919 = product of:
      0.028925838 = sum of:
        0.028925838 = weight(_text_:22 in 690) [ClassicSimilarity], result of:
          0.028925838 = score(doc=690,freq=2.0), product of:
            0.12460477 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035582762 = queryNorm
            0.23214069 = fieldWeight in 690, 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=690)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Abstract
    We describe the latent semantic indexing subspace signature model (LSISSM) for semantic content representation of unstructured text. Grounded on singular value decomposition, the model represents terms and documents by the distribution signatures of their statistical contribution across the top-ranking latent concept dimensions. LSISSM matches term signatures with document signatures according to their mapping coherence between latent semantic indexing (LSI) term subspace and LSI document subspace. LSISSM does feature reduction and finds a low-rank approximation of scalable and sparse term-document matrices. Experiments demonstrate that this approach significantly improves the performance of major clustering algorithms such as standard K-means and self-organizing maps compared with the vector space model and the traditional LSI model. The unique contribution ranking mechanism in LSISSM also improves the initialization of standard K-means compared with random seeding procedure, which sometimes causes low efficiency and effectiveness of clustering. A two-stage initialization strategy based on LSISSM significantly reduces the running time of standard K-means procedures.
    Date
    23. 3.2013 13:22:36
  10. Braun, T.: Dokumentklassifikation durch Clustering (o.J.) 0.01 
    0.010168468 = product of:
  0.061010804 = sum of:
    0.061010804 = weight(_text_:t in 1671) [ClassicSimilarity], result of:
      0.061010804 = score(doc=1671,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.43524727 = fieldWeight in 1671, 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=1671)
  0.16666667 = coord(1/6)
  11. Yi, K.: Automatic text classification using library classification schemes : trends, issues and challenges (2007) 0.01 
    0.00952104 = product of:
  0.02856312 = sum of:
    0.011689715 = product of:
      0.035069145 = sum of:
        0.035069145 = weight(_text_:k in 2560) [ClassicSimilarity], result of:
          0.035069145 = score(doc=2560,freq=2.0), product of:
            0.12702256 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.035582762 = queryNorm
            0.27608594 = fieldWeight in 2560, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2560)
      0.33333334 = coord(1/3)
    0.016873404 = product of:
      0.03374681 = sum of:
        0.03374681 = weight(_text_:22 in 2560) [ClassicSimilarity], result of:
          0.03374681 = score(doc=2560,freq=2.0), product of:
            0.12460477 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.035582762 = queryNorm
            0.2708308 = fieldWeight in 2560, 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=2560)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)
    Date
    22. 9.2008 18:31:54
  12. Liu, R.-L.: Context-based term frequency assessment for text classification (2010) 0.01 
    0.0086282315 = product of:
  0.051769387 = sum of:
    0.051769387 = weight(_text_:t in 3331) [ClassicSimilarity], result of:
      0.051769387 = score(doc=3331,freq=4.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.36931956 = fieldWeight in 3331, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.046875 = fieldNorm(doc=3331)
  0.16666667 = coord(1/6)
    Abstract
    Automatic text classification (TC) is essential for the management of information. To properly classify a document d, it is essential to identify the semantics of each term t in d, while the semantics heavily depend on context (neighboring terms) of t in d. Therefore, we present a technique CTFA (Context-based Term Frequency Assessment) that improves text classifiers by considering term contexts in test documents. The results of the term context recognition are used to assess term frequencies of terms, and hence CTFA may easily work with various kinds of text classifiers that base their TC decisions on term frequencies, without needing to modify the classifiers. Moreover, CTFA is efficient, and neither huge memory nor domain-specific knowledge is required. Empirical results show that CTFA successfully enhances performance of several kinds of text classifiers on different experimental data.
  13. Koch, T.: Nutzung von Klassifikationssystemen zur verbesserten Beschreibung, Organisation und Suche von Internetressourcen (1998) 0.01 
    0.008134775 = product of:
  0.048808645 = sum of:
    0.048808645 = weight(_text_:t in 1030) [ClassicSimilarity], result of:
      0.048808645 = score(doc=1030,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.34819782 = fieldWeight in 1030, 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=1030)
  0.16666667 = coord(1/6)
  14. Koch, T.; Ardö, A.: Automatic classification of full-text HTML-documents from one specific subject area : DESIRE II D3.6a, Working Paper 2 (2000) 0.01 
    0.008134775 = product of:
  0.048808645 = sum of:
    0.048808645 = weight(_text_:t in 1667) [ClassicSimilarity], result of:
      0.048808645 = score(doc=1667,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.34819782 = fieldWeight in 1667, 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=1667)
  0.16666667 = coord(1/6)
  15. Brückner, T.; Dambeck, H.: Sortierautomaten : Grundlagen der Textklassifizierung (2003) 0.01 
    0.008134775 = product of:
  0.048808645 = sum of:
    0.048808645 = weight(_text_:t in 2398) [ClassicSimilarity], result of:
      0.048808645 = score(doc=2398,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = 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.16666667 = coord(1/6)
  16. Pfister, J.: Clustering von Patent-Dokumenten am Beispiel der Datenbanken des Fachinformationszentrums Karlsruhe (2006) 0.01 
    0.008134775 = product of:
  0.048808645 = sum of:
    0.048808645 = weight(_text_:t in 5976) [ClassicSimilarity], result of:
      0.048808645 = score(doc=5976,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.34819782 = fieldWeight in 5976, 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=5976)
  0.16666667 = coord(1/6)
    Source
    Effektive Information Retrieval Verfahren in Theorie und Praxis: ausgewählte und erweiterte Beiträge des Vierten Hildesheimer Evaluierungs- und Retrievalworkshop (HIER 2005), Hildesheim, 20.7.2005. Hrsg.: T. Mandl u. C. Womser-Hacker
  17. Jersek, T.: Automatische DDC-Klassifizierung mit Lingo : Vorgehensweise und Ergebnisse (2012) 0.01 
    0.008134775 = product of:
  0.048808645 = sum of:
    0.048808645 = weight(_text_:t in 122) [ClassicSimilarity], result of:
      0.048808645 = score(doc=122,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.34819782 = fieldWeight in 122, 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=122)
  0.16666667 = coord(1/6)
  18. Koch, T.: Experiments with automatic classification of WAIS databases and indexing of WWW : some results from the Nordic WAIS/WWW project (1994) 0.01 
    0.007117927 = product of:
  0.042707562 = sum of:
    0.042707562 = weight(_text_:t in 7209) [ClassicSimilarity], result of:
      0.042707562 = score(doc=7209,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.30467308 = fieldWeight in 7209, 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=7209)
  0.16666667 = coord(1/6)
  19. Koch, T.; Vizine-Goetz, D.: Automatic classification and content navigation support for Web services : DESIRE II cooperates with OCLC (1998) 0.01 
    0.007117927 = product of:
  0.042707562 = sum of:
    0.042707562 = weight(_text_:t in 1568) [ClassicSimilarity], result of:
      0.042707562 = score(doc=1568,freq=2.0), product of:
        0.14017504 = queryWeight, product of:
          3.9394085 = idf(docFreq=2338, maxDocs=44218)
          0.035582762 = queryNorm
        0.30467308 = fieldWeight in 1568, 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=1568)
  0.16666667 = coord(1/6)
  20. Pfeffer, M.: Automatische Vergabe von RVK-Notationen anhand von bibliografischen Daten mittels fallbasiertem Schließen (2007) 0.01 
    0.006337974 = product of:
  0.038027845 = sum of:
    0.038027845 = product of:
      0.07605569 = sum of:
        0.07605569 = weight(_text_:intelligenz in 558) [ClassicSimilarity], result of:
          0.07605569 = score(doc=558,freq=2.0), product of:
            0.20204939 = queryWeight, product of:
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.035582762 = queryNorm
            0.37642127 = fieldWeight in 558, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.046875 = fieldNorm(doc=558)
      0.5 = coord(1/2)
  0.16666667 = coord(1/6)
    Abstract
    Klassifikation von bibliografischen Einheiten ist für einen systematischen Zugang zu den Beständen einer Bibliothek und deren Aufstellung unumgänglich. Bislang wurde diese Aufgabe von Fachexperten manuell erledigt, sei es individuell nach einer selbst entwickelten Systematik oder kooperativ nach einer gemeinsamen Systematik. In dieser Arbeit wird ein Verfahren zur Automatisierung des Klassifikationsvorgangs vorgestellt. Dabei kommt das Verfahren des fallbasierten Schließens zum Einsatz, das im Kontext der Forschung zur künstlichen Intelligenz entwickelt wurde. Das Verfahren liefert für jedes Werk, für das bibliografische Daten vorliegen, eine oder mehrere mögliche Klassifikationen. In Experimenten werden die Ergebnisse der automatischen Klassifikation mit der durch Fachexperten verglichen. Diese Experimente belegen die hohe Qualität der automatischen Klassifikation und dass das Verfahren geeignet ist, Fachexperten bei der Klassifikationsarbeit signifikant zu entlasten. Auch die nahezu vollständige Resystematisierung eines Bibliothekskataloges ist - mit gewissen Abstrichen - möglich.

Authors

Years

Languages

  • e 64
  • d 14
  • a 1
  • More… Less…

Types

  • a 65
  • el 15
  • r 2
  • x 2
  • More… Less…

Themes