Search (184 results, page 1 of 10)

  • × 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.27 
    0.2656926 = product of:
  0.5313852 = sum of:
    0.03902899 = product of:
      0.11708697 = sum of:
        0.11708697 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
          0.11708697 = score(doc=562,freq=2.0), product of:
            0.20833312 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.024573348 = 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.017349645 = weight(_text_:web in 562) [ClassicSimilarity], result of:
      0.017349645 = score(doc=562,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.21634221 = fieldWeight in 562, 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=562)
    0.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = 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.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = 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.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = 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.11708697 = weight(_text_:2f in 562) [ClassicSimilarity], result of:
      0.11708697 = score(doc=562,freq=2.0), product of:
        0.20833312 = queryWeight, product of:
          8.478011 = idf(docFreq=24, maxDocs=44218)
          0.024573348 = 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.006658699 = product of:
      0.019976096 = sum of:
        0.019976096 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
          0.019976096 = score(doc=562,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = 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.33333334 = coord(1/3)
  0.5 = coord(7/14)
    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. Classification, automation, and new media : Proceedings of the 24th Annual Conference of the Gesellschaft für Klassifikation e.V., University of Passau, March 15 - 17, 2000 (2002) 0.04 
    0.04205236 = product of:
  0.19624433 = sum of:
    0.025042059 = weight(_text_:web in 5997) [ClassicSimilarity], result of:
      0.025042059 = score(doc=5997,freq=6.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.3122631 = fieldWeight in 5997, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
    0.005916231 = weight(_text_:information in 5997) [ClassicSimilarity], result of:
      0.005916231 = score(doc=5997,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.13714671 = fieldWeight in 5997, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
    0.16528603 = weight(_text_:kongress in 5997) [ClassicSimilarity], result of:
      0.16528603 = score(doc=5997,freq=16.0), product of:
        0.16122791 = queryWeight, product of:
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.024573348 = queryNorm
        1.0251701 = fieldWeight in 5997, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          6.5610886 = idf(docFreq=169, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5997)
  0.21428572 = coord(3/14)
    Abstract
    Given the huge amount of information in the internet and in practically every domain of knowledge that we are facing today, knowledge discovery calls for automation. The book deals with methods from classification and data analysis that respond effectively to this rapidly growing challenge. The interested reader will find new methodological insights as well as applications in economics, management science, finance, and marketing, and in pattern recognition, biology, health, and archaeology.
    Content
    Data Analysis, Statistics, and Classification.- Pattern Recognition and Automation.- Data Mining, Information Processing, and Automation.- New Media, Web Mining, and Automation.- Applications in Management Science, Finance, and Marketing.- Applications in Medicine, Biology, Archaeology, and Others.- Author Index.- Subject Index.
    RSWK
    Datenanalyse / Kongress / Passau <2000>
    Automatische Klassifikation / Kongress / Passau <2000>
    Data Mining / Kongress / Passau <2000>
    World Wide Web / Wissensorganisation / Kongress / Passau <2000>
    Subject
    Datenanalyse / Kongress / Passau <2000>
    Automatische Klassifikation / Kongress / Passau <2000>
    Data Mining / Kongress / Passau <2000>
    World Wide Web / Wissensorganisation / Kongress / Passau <2000>
  3. Panyr, J.: Vektorraum-Modell und Clusteranalyse in Information-Retrieval-Systemen (1987) 0.02 
    0.023321735 = product of:
  0.10883476 = sum of:
    0.06281855 = weight(_text_:indexierung in 2322) [ClassicSimilarity], result of:
      0.06281855 = score(doc=2322,freq=2.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.47534537 = fieldWeight in 2322, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.0625 = fieldNorm(doc=2322)
    0.011593399 = weight(_text_:information in 2322) [ClassicSimilarity], result of:
      0.011593399 = score(doc=2322,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.2687516 = fieldWeight in 2322, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0625 = fieldNorm(doc=2322)
    0.03442281 = weight(_text_:retrieval in 2322) [ClassicSimilarity], result of:
      0.03442281 = score(doc=2322,freq=6.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.46309367 = fieldWeight in 2322, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0625 = fieldNorm(doc=2322)
  0.21428572 = coord(3/14)
    Abstract
    Ausgehend von theoretischen Indexierungsansätzen wird das klassische Vektorraum-Modell für automatische Indexierung (mit dem Trennschärfen-Modell) erläutert. Das Clustering in Information-Retrieval-Systemem wird als eine natürliche logische Folge aus diesem Modell aufgefaßt und in allen seinen Ausprägungen (d.h. als Dokumenten-, Term- oder Dokumenten- und Termklassifikation) behandelt. Anschließend werden die Suchstrategien in vorklassifizierten Dokumentenbeständen (Clustersuche) detailliert beschrieben. Zum Schluß wird noch die sinnvolle Anwendung der Clusteranalyse in Information-Retrieval-Systemen kurz diskutiert
  4. Panyr, J.: Automatische Indexierung und Klassifikation (1983) 0.02 
    0.023308197 = product of:
  0.16315737 = sum of:
    0.1256371 = weight(_text_:indexierung in 7692) [ClassicSimilarity], result of:
      0.1256371 = score(doc=7692,freq=8.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.95069075 = fieldWeight in 7692, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.0625 = fieldNorm(doc=7692)
    0.03752027 = weight(_text_:frankfurt in 7692) [ClassicSimilarity], result of:
      0.03752027 = score(doc=7692,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.36736545 = fieldWeight in 7692, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0625 = fieldNorm(doc=7692)
  0.14285715 = coord(2/14)
    Abstract
    Im Beitrag wird zunächst eine terminologische Klärung und Gliederung für drei Indexierungsmethoden und weitere Begriffe, die Konsistenzprobleme bei intellektueller Indexierung betreffen, unternommen. Zur automatichen Indexierung werden Extraktionsmethoden erläutert und zur Automatischen Klassifikation (Clustering) und Indexierung zwei Anwendungen vorgestellt. Eine enge Kooperation zwischen den Befürwortern der intellektuellen und den Entwicklern von automatischen Indexierungsverfahren wird empfohlen
    Imprint
    Frankfurt : Indeks
  5. Oberhauser, O.: Automatisches Klassifizieren : Entwicklungsstand - Methodik - Anwendungsbereiche (2005) 0.02 
    0.021539494 = product of:
  0.060310584 = sum of:
    0.012521029 = weight(_text_:web in 38) [ClassicSimilarity], result of:
      0.012521029 = score(doc=38,freq=6.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.15613155 = fieldWeight in 38, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.01953125 = fieldNorm(doc=38)
    0.027762137 = weight(_text_:indexierung in 38) [ClassicSimilarity], result of:
      0.027762137 = score(doc=38,freq=4.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.21007496 = fieldWeight in 38, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.01953125 = fieldNorm(doc=38)
    0.0020917035 = weight(_text_:information in 38) [ClassicSimilarity], result of:
      0.0020917035 = score(doc=38,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.048488684 = fieldWeight in 38, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.01953125 = fieldNorm(doc=38)
    0.006210631 = weight(_text_:retrieval in 38) [ClassicSimilarity], result of:
      0.006210631 = score(doc=38,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.08355226 = fieldWeight in 38, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.01953125 = fieldNorm(doc=38)
    0.011725084 = weight(_text_:frankfurt in 38) [ClassicSimilarity], result of:
      0.011725084 = score(doc=38,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.114801705 = fieldWeight in 38, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.01953125 = fieldNorm(doc=38)
  0.35714287 = coord(5/14)
    Abstract
    Automatisches Klassifizieren von Textdokumenten bedeutet die maschinelle Zuordnung jeweils einer oder mehrerer Notationen eines vorgegebenen Klassifikationssystems zu natürlich-sprachlichen Texten mithilfe eines geeigneten Algorithmus. In der vorliegenden Arbeit wird in Form einer umfassenden Literaturstudie ein aktueller Kenntnisstand zu den Ein-satzmöglichkeiten des automatischen Klassifizierens für die sachliche Erschliessung von elektronischen Dokumenten, insbesondere von Web-Ressourcen, erarbeitet. Dies betrifft zum einen den methodischen Aspekt und zum anderen die in relevanten Projekten und Anwendungen gewonnenen Erfahrungen. In methodischer Hinsicht gelten heute statistische Verfahren, die auf dem maschinellen Lernen basieren und auf der Grundlage bereits klassifizierter Beispieldokumente ein Modell - einen "Klassifikator" - erstellen, das zur Klassifizierung neuer Dokumente verwendet werden kann, als "state-of-the-art". Die vier in den 1990er Jahren an den Universitäten Lund, Wolverhampton und Oldenburg sowie bei OCLC (Dublin, OH) durchgeführten "grossen" Projekte zum automatischen Klassifizieren von Web-Ressourcen, die in dieser Arbeit ausführlich analysiert werden, arbeiteten allerdings noch mit einfacheren bzw. älteren methodischen Ansätzen. Diese Projekte bedeuten insbesondere aufgrund ihrer Verwendung etablierter bibliothekarischer Klassifikationssysteme einen wichtigen Erfahrungsgewinn, selbst wenn sie bisher nicht zu permanenten und qualitativ zufriedenstellenden Diensten für die Erschliessung elektronischer Ressourcen geführt haben. Die Analyse der weiteren einschlägigen Anwendungen und Projekte lässt erkennen, dass derzeit in den Bereichen Patent- und Mediendokumentation die aktivsten Bestrebungen bestehen, Systeme für die automatische klassifikatorische Erschliessung elektronischer Dokumente im laufenden operativen Betrieb einzusetzen. Dabei dominieren jedoch halbautomatische Systeme, die menschliche Bearbeiter durch Klassifizierungsvorschläge unterstützen, da die gegenwärtig erreichbare Klassifizierungsgüte für eine Vollautomatisierung meist noch nicht ausreicht. Weitere interessante Anwendungen und Projekte finden sich im Bereich von Web-Portalen, Suchmaschinen und (kommerziellen) Informationsdiensten, während sich etwa im Bibliothekswesen kaum nennenswertes Interesse an einer automatischen Klassifizierung von Büchern bzw. bibliographischen Datensätzen registrieren lässt. Die Studie schliesst mit einer Diskussion der wichtigsten Projekte und Anwendungen sowie einiger im Zusammenhang mit dem automatischen Klassifizieren relevanter Fragestellungen und Themen.
    Footnote
    Zum Inhalt Auf einen kurzen einleitenden Abschnitt folgt eine Einführung in die grundlegende Methodik des automatischen Klassifizierens. Oberhauser erklärt hier Begriffe wie Einfach- und Mehrfachklassifizierung, Klassen- und Dokumentzentrierung, und geht danach auf die hauptsächlichen Anwendungen der automatischen Klassifikation von Textdokumenten, maschinelle Lernverfahren und Techniken der Dimensionsreduktion bei der Indexierung ein. Zwei weitere Unterkapitel sind der Erstellung von Klassifikatoren und den Methoden für deren Auswertung gewidmet. Das Kapitel wird abgerundet von einer kurzen Auflistung einiger Softwareprodukte für automatisches Klassifizieren, die sowohl kommerzielle Software, als auch Projekte aus dem Open-Source-Bereich umfasst. Der Hauptteil des Buches ist den großen Projekten zur automatischen Erschließung von Webdokumenten gewidmet, die von OCLC (Scorpion) sowie an den Universitäten Lund (Nordic WAIS/WWW, DESIRE II), Wolverhampton (WWLib-TOS, WWLib-TNG, Old ACE, ACE) und Oldenburg (GERHARD, GERHARD II) durchgeführt worden sind. Der Autor beschreibt hier sehr detailliert - wobei der Detailliertheitsgrad unterschiedlich ist, je nachdem, was aus der Projektdokumentation geschlossen werden kann - die jeweilige Zielsetzung des Projektes, die verwendete Klassifikation, die methodische Vorgehensweise sowie die Evaluierungsmethoden und -ergebnisse. Sofern Querverweise zu anderen Projekten bestehen, werden auch diese besprochen. Der Verfasser geht hier sehr genau auf wichtige Aspekte wie Vokabularbildung, Textaufbereitung und Gewichtung ein, so dass der Leser eine gute Vorstellung von den Ansätzen und der möglichen Weiterentwicklung des Projektes bekommt. In einem weiteren Kapitel wird auf einige kleinere Projekte eingegangen, die dem für Bibliotheken besonders interessanten Thema des automatischen Klassifizierens von Büchern sowie den Bereichen Patentliteratur, Mediendokumentation und dem Einsatz bei Informationsdiensten gewidmet sind. Die Darstellung wird ergänzt von einem Literaturverzeichnis mit über 250 Titeln zu den konkreten Projekten sowie einem Abkürzungs- und einem Abbildungsverzeichnis. In der abschließenden Diskussion der beschriebenen Projekte wird einerseits auf die Bedeutung der einzelnen Projekte für den methodischen Fortschritt eingegangen, andererseits aber auch einiges an Kritik geäußert, v. a. bezüglich der mangelnden Auswertung der Projektergebnisse und des Fehlens an brauchbarer Dokumentation. So waren z. B. die Projektseiten des Projekts GERHARD (www.gerhard.de/) auf den Stand von 1998 eingefroren, zurzeit [11.07.06] sind sie überhaupt nicht mehr erreichbar. Mit einigem Erstaunen stellt Oberhauser auch fest, dass - abgesehen von der fast 15 Jahre alten Untersuchung von Larsen - »keine signifikanten Studien oder Anwendungen aus dem Bibliotheksbereich vorliegen« (S. 139). Wie der Autor aber selbst ergänzend ausführt, dürfte dies daran liegen, dass sich bibliografische Metadaten wegen des geringen Textumfangs sehr schlecht für automatische Klassifikation eignen, und dass - wie frühere Ergebnisse gezeigt haben - das übliche TF/IDF-Verfahren nicht für Katalogisate geeignet ist (ibd.).
    Die am Anfang des Werkes gestellte Frage, ob »die Techniken des automatischen Klassifizierens heute bereits so weit [sind], dass damit grosse Mengen elektronischer Dokumente [-] zufrieden stellend erschlossen werden können? « (S. 13), beantwortet der Verfasser mit einem eindeutigen »nein«, was Salton und McGills Aussage von 1983, »daß einfache automatische Indexierungsverfahren schnell und kostengünstig arbeiten, und daß sie Recall- und Precisionwerte erreichen, die mindestens genauso gut sind wie bei der manuellen Indexierung mit kontrolliertem Vokabular « (Gerard Salton und Michael J. McGill: Information Retrieval. Hamburg u.a. 1987, S. 64 f.) kräftig relativiert. Über die Gründe, warum drei der großen Projekte nicht weiter verfolgt werden, will Oberhauser nicht spekulieren, nennt aber mangelnden Erfolg, Verlagerung der Arbeit in den beteiligten Institutionen sowie Finanzierungsprobleme als mögliche Ursachen. Das größte Entwicklungspotenzial beim automatischen Erschließen großer Dokumentenmengen sieht der Verfasser heute in den Bereichen der Patentund Mediendokumentation. Hier solle man im bibliothekarischen Bereich die Entwicklung genau verfolgen, da diese »sicherlich mittelfristig auf eine qualitativ zufrieden stellende Vollautomatisierung« abziele (S. 146). Oberhausers Darstellung ist ein rundum gelungenes Werk, das zum Handapparat eines jeden, der sich für automatische Erschließung interessiert, gehört."
    Imprint
    Frankfurt a.M. : Lang
  6. Jenkins, C.: Automatic classification of Web resources using Java and Dewey Decimal Classification (1998) 0.02 
    0.019571388 = product of:
  0.068499856 = sum of:
    0.035058882 = weight(_text_:web in 1673) [ClassicSimilarity], result of:
      0.035058882 = score(doc=1673,freq=6.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.43716836 = fieldWeight in 1673, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1673)
    0.008282723 = weight(_text_:information in 1673) [ClassicSimilarity], result of:
      0.008282723 = score(doc=1673,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1920054 = fieldWeight in 1673, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1673)
    0.017389767 = weight(_text_:retrieval in 1673) [ClassicSimilarity], result of:
      0.017389767 = score(doc=1673,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.23394634 = fieldWeight in 1673, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1673)
    0.007768482 = product of:
      0.023305446 = sum of:
        0.023305446 = weight(_text_:22 in 1673) [ClassicSimilarity], result of:
          0.023305446 = score(doc=1673,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.2708308 = fieldWeight in 1673, 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=1673)
      0.33333334 = coord(1/3)
  0.2857143 = coord(4/14)
    Abstract
    The Wolverhampton Web Library (WWLib) is a WWW search engine that provides access to UK based information. The experimental version developed in 1995, was a success but highlighted the need for a much higher degree of automation. An interesting feature of the experimental WWLib was that it organised information according to DDC. Discusses the advantages of classification and describes the automatic classifier that is being developed in Java as part of the new, fully automated WWLib
    Date
    1. 8.1996 22:08:06
    Footnote
    Contribution to a special issue devoted to the Proceedings of the 7th International World Wide Web Conference, held 14-18 April 1998, Brisbane, Australia; vgl. auch: http://www7.scu.edu.au/programme/posters/1846/com1846.htm.
    Theme
    Klassifikationssysteme im Online-Retrieval
  7. Ru, C.; Tang, J.; Li, S.; Xie, S.; Wang, T.: Using semantic similarity to reduce wrong labels in distant supervision for relation extraction (2018) 0.02 
    0.018919652 = product of:
  0.06621878 = sum of:
    0.03926159 = weight(_text_:indexierung in 5055) [ClassicSimilarity], result of:
      0.03926159 = score(doc=5055,freq=2.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.29709086 = fieldWeight in 5055, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5055)
    0.004183407 = weight(_text_:information in 5055) [ClassicSimilarity], result of:
      0.004183407 = score(doc=5055,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.09697737 = fieldWeight in 5055, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5055)
    0.012421262 = weight(_text_:retrieval in 5055) [ClassicSimilarity], result of:
      0.012421262 = score(doc=5055,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 5055, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5055)
    0.01035252 = product of:
      0.031057559 = sum of:
        0.031057559 = weight(_text_:2010 in 5055) [ClassicSimilarity], result of:
          0.031057559 = score(doc=5055,freq=2.0), product of:
            0.117538005 = queryWeight, product of:
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.024573348 = queryNorm
            0.2642342 = fieldWeight in 5055, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5055)
      0.33333334 = coord(1/3)
  0.2857143 = coord(4/14)
    Abstract
    Distant supervision (DS) has the advantage of automatically generating large amounts of labelled training data and has been widely used for relation extraction. However, there are usually many wrong labels in the automatically labelled data in distant supervision (Riedel, Yao, & McCallum, 2010). This paper presents a novel method to reduce the wrong labels. The proposed method uses the semantic Jaccard with word embedding to measure the semantic similarity between the relation phrase in the knowledge base and the dependency phrases between two entities in a sentence to filter the wrong labels. In the process of reducing wrong labels, the semantic Jaccard algorithm selects a core dependency phrase to represent the candidate relation in a sentence, which can capture features for relation classification and avoid the negative impact from irrelevant term sequences that previous neural network models of relation extraction often suffer. In the process of relation classification, the core dependency phrases are also used as the input of a convolutional neural network (CNN) for relation classification. The experimental results show that compared with the methods using original DS data, the methods using filtered DS data performed much better in relation extraction. It indicates that the semantic similarity based method is effective in reducing wrong labels. The relation extraction performance of the CNN model using the core dependency phrases as input is the best of all, which indicates that using the core dependency phrases as input of CNN is enough to capture the features for relation classification and could avoid negative impact from irrelevant terms.
    Source
    Information processing and management. 54(2018) no.4, S.593-608
    Theme
    Semantisches Umfeld in Indexierung u. Retrieval
  8. Fuhr, N.: Klassifikationsverfahren bei der automatischen Indexierung (1983) 0.02 
    0.018051304 = product of:
  0.12635912 = sum of:
    0.088838845 = weight(_text_:indexierung in 7697) [ClassicSimilarity], result of:
      0.088838845 = score(doc=7697,freq=4.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.6722399 = fieldWeight in 7697, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.0625 = fieldNorm(doc=7697)
    0.03752027 = weight(_text_:frankfurt in 7697) [ClassicSimilarity], result of:
      0.03752027 = score(doc=7697,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.36736545 = fieldWeight in 7697, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0625 = fieldNorm(doc=7697)
  0.14285715 = coord(2/14)
    Abstract
    Nach einer kurzen Einführung in die Darmstädter Projekte WAI und AIR werden die folgenden Themen behandelt: Ein Ansatz zur automatischen Klassifikation. Statistische Relationen für die Klassifikation. Indexieren von Dokumenten als Spezialfall der automatischen Klassifikation. Klassifikation von Elementen der Relevanzbeschreibung. Klassifikation zur Verbesserung der Relevanzbeschreibungen. Automatische Dokumentklassifikation und Automatische Indexierung klassifizierter Dokumente. Das Projekt AIR wird in Zusammenarbeit mit der Datenbasis INKA-PHYS des Fachinformationszentrums Energie, Physik, Mathematik in Karlsruhe durchgeführt
    Imprint
    Frankfurt : Indeks
  9. Krüger, C.: Evaluation des WWW-Suchdienstes GERHARD unter besonderer Beachtung automatischer Indexierung (1999) 0.02 
    0.016558858 = product of:
  0.077274665 = sum of:
    0.020446755 = weight(_text_:web in 1777) [ClassicSimilarity], result of:
      0.020446755 = score(doc=1777,freq=4.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.25496176 = fieldWeight in 1777, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1777)
    0.03926159 = weight(_text_:indexierung in 1777) [ClassicSimilarity], result of:
      0.03926159 = score(doc=1777,freq=2.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.29709086 = fieldWeight in 1777, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1777)
    0.017566316 = weight(_text_:retrieval in 1777) [ClassicSimilarity], result of:
      0.017566316 = score(doc=1777,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.23632148 = fieldWeight in 1777, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1777)
  0.21428572 = coord(3/14)
    Abstract
    Die vorliegende Arbeit beinhaltet eine Beschreibung und Evaluation des WWW - Suchdienstes GERHARD (German Harvest Automated Retrieval and Directory). GERHARD ist ein Such- und Navigationssystem für das deutsche World Wide Web, weiches ausschließlich wissenschaftlich relevante Dokumente sammelt, und diese auf der Basis computerlinguistischer und statistischer Methoden automatisch mit Hilfe eines bibliothekarischen Klassifikationssystems klassifiziert. Mit dem DFG - Projekt GERHARD ist der Versuch unternommen worden, mit einem auf einem automatischen Klassifizierungsverfahren basierenden World Wide Web - Dienst eine Alternative zu herkömmlichen Methoden der Interneterschließung zu entwickeln. GERHARD ist im deutschsprachigen Raum das einzige Verzeichnis von Internetressourcen, dessen Erstellung und Aktualisierung vollständig automatisch (also maschinell) erfolgt. GERHARD beschränkt sich dabei auf den Nachweis von Dokumenten auf wissenschaftlichen WWW - Servern. Die Grundidee dabei war, kostenintensive intellektuelle Erschließung und Klassifizierung von lnternetseiten durch computerlinguistische und statistische Methoden zu ersetzen, um auf diese Weise die nachgewiesenen Internetressourcen automatisch auf das Vokabular eines bibliothekarischen Klassifikationssystems abzubilden. GERHARD steht für German Harvest Automated Retrieval and Directory. Die WWW - Adresse (URL) von GERHARD lautet: http://www.gerhard.de. Im Rahmen der vorliegenden Diplomarbeit soll eine Beschreibung des Dienstes mit besonderem Schwerpunkt auf dem zugrundeliegenden Indexierungs- bzw. Klassifizierungssystem erfolgen und anschließend mit Hilfe eines kleinen Retrievaltests die Effektivität von GERHARD überprüft werden.
  10. Groß, T.; Faden, M.: Automatische Indexierung elektronischer Dokumente an der Deutschen Zentralbibliothek für Wirtschaftswissenschaften : Bericht über die Jahrestagung der Internationalen Buchwissenschaftlichen Gesellschaft (2010) 0.02 
    0.015317162 = product of:
  0.07148009 = sum of:
    0.011566431 = weight(_text_:web in 4051) [ClassicSimilarity], result of:
      0.011566431 = score(doc=4051,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.14422815 = fieldWeight in 4051, 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=4051)
    0.044419423 = weight(_text_:indexierung in 4051) [ClassicSimilarity], result of:
      0.044419423 = score(doc=4051,freq=4.0), product of:
        0.13215348 = queryWeight, product of:
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.024573348 = queryNorm
        0.33611995 = fieldWeight in 4051, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.377919 = idf(docFreq=554, maxDocs=44218)
          0.03125 = fieldNorm(doc=4051)
    0.015494233 = product of:
      0.046482697 = sum of:
        0.046482697 = weight(_text_:2010 in 4051) [ClassicSimilarity], result of:
          0.046482697 = score(doc=4051,freq=7.0), product of:
            0.117538005 = queryWeight, product of:
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.024573348 = queryNorm
            0.39546952 = fieldWeight in 4051, product of:
              2.6457512 = tf(freq=7.0), with freq of:
                7.0 = termFreq=7.0
              4.7831497 = idf(docFreq=1005, maxDocs=44218)
              0.03125 = fieldNorm(doc=4051)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    Die zunehmende Verfügbarmachung digitaler Informationen in den letzten Jahren sowie die Aussicht auf ein weiteres Ansteigen der sogenannten Datenflut kumulieren in einem grundlegenden, sich weiter verstärkenden Informationsstrukturierungsproblem. Die stetige Zunahme von digitalen Informationsressourcen im World Wide Web sichert zwar jederzeit und ortsungebunden den Zugriff auf verschiedene Informationen; offen bleibt der strukturierte Zugang, insbesondere zu wissenschaftlichen Ressourcen. Angesichts der steigenden Anzahl elektronischer Inhalte und vor dem Hintergrund stagnierender bzw. knapper werdender personeller Ressourcen in der Sacherschließun schafft keine Bibliothek bzw. kein Bibliotheksverbund es mehr, weder aktuell noch zukünftig, alle digitalen Daten zu erfassen, zu strukturieren und zueinander in Beziehung zu setzen. In der Informationsgesellschaft des 21. Jahrhunderts wird es aber zunehmend wichtiger, die in der Flut verschwundenen wissenschaftlichen Informationen zeitnah, angemessen und vollständig zu strukturieren und somit als Basis für eine Wissensgenerierung wieder nutzbar zu machen. Eine normierte Inhaltserschließung digitaler Informationsressourcen ist deshalb für die Deutsche Zentralbibliothek für Wirtschaftswissenschaften (ZBW) als wichtige Informationsinfrastruktureinrichtung in diesem Bereich ein entscheidender und auch erfolgskritischer Aspekt im Wettbewerb mit anderen Informationsdienstleistern. Weil die traditionelle intellektuelle Sacherschließung aber nicht beliebig skalierbar ist - mit dem Anstieg der Zahl an Online-Dokumenten steigt proportional auch der personelle Ressourcenbedarf an Fachreferenten, wenn ein gewisser Qualitätsstandard gehalten werden soll - bedarf es zukünftig anderer Sacherschließungsverfahren. Automatisierte Verschlagwortungsmethoden werden dabei als einzige Möglichkeit angesehen, die bibliothekarische Sacherschließung auch im digitalen Zeitalter zukunftsfest auszugestalten. Zudem können maschinelle Ansätze dazu beitragen, die Heterogenitäten (Indexierungsinkonsistenzen) zwischen den einzelnen Sacherschließer zu nivellieren, und somit zu einer homogeneren Erschließung des Bibliotheksbestandes beitragen.
    Mit der Anfang 2010 begonnen Implementierung und Ergebnisevaluierung des automatischen Indexierungsverfahrens "Decisiv Categorization" der Firma Recommind soll das hier skizzierte Informationsstrukturierungsproblem in zwei Schritten gelöst werden. Kurz- bis mittelfristig soll die intellektuelle Indexierung durch ein semiautomatisches Verfahren6 unterstützt werden. Mittel- bis langfristig soll das maschinelle Verfahren, aufbauend auf einem entsprechenden Training, in die Lage versetzt werden, sowohl im Hause vorliegende Dokumente vollautomatisch zu indexieren als auch ZBW-fremde digitale Informationsressourcen zu verschlagworten bzw. zu klassifizieren, um sie in einem gemeinsamen Suchraum auffindbar machen zu können. Im Anschluss an diese Einleitung werden die ersten Ansätze maschineller Sacherschließung an der ZBW (2001-2004) und deren Ergebnisse und Problemlagen aufgezeigt. Danach werden die Rahmenbedingungen (Projektauftrag und -ziel) für eine Wiederaufnahme des Vorhabens im Jahre 2009 aufgezeigt, gefolgt von einer Darstellung der Funktionsweise der Recommind-Technologie und deren Einsatz im Rahmen der Sacherschließung von Online-Dokumenten mit einem Thesaurus. Schwerpunkt dieser Abhandlung bilden im Anschluss daran die Evaluierungsmöglichkeiten automatischer Indexierungsansätze sowie die aktuellen Ergebnisse und zentralen Erkenntnisse des Einsatzes im Kontext der ZBW. Das Fazit beschreibt die entsprechenden Schlussfolgerungen aus den erzielten Ergebnissen sowie den Ausblick auf das weitere Vorgehen.
    Source
    Bibliotheksdienst. 44(2010) H.12, S.1120-1135
    Year
    2010
  11. Möller, G.: Automatic classification of the World Wide Web using Universal Decimal Classification (1999) 0.01 
    0.014625075 = product of:
  0.06825035 = sum of:
    0.02891608 = weight(_text_:web in 494) [ClassicSimilarity], result of:
      0.02891608 = score(doc=494,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.36057037 = fieldWeight in 494, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.078125 = fieldNorm(doc=494)
    0.014491748 = weight(_text_:information in 494) [ClassicSimilarity], result of:
      0.014491748 = score(doc=494,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.3359395 = fieldWeight in 494, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=494)
    0.024842525 = weight(_text_:retrieval in 494) [ClassicSimilarity], result of:
      0.024842525 = score(doc=494,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33420905 = fieldWeight in 494, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=494)
  0.21428572 = coord(3/14)
    Imprint
    Hinskey Hill : Learned Information
    Source
    Online information 99: 23rd International Online Information Meeting, Proceedings, London, 7-9 December 1999. Ed.: D. Raitt et al
    Theme
    Klassifikationssysteme im Online-Retrieval
  12. Calado, P.; Cristo, M.; Gonçalves, M.A.; Moura, E.S. de; Ribeiro-Neto, B.; Ziviani, N.: Link-based similarity measures for the classification of Web documents (2006) 0.01 
    0.013749042 = product of:
  0.064162195 = sum of:
    0.043374117 = weight(_text_:web in 4921) [ClassicSimilarity], result of:
      0.043374117 = score(doc=4921,freq=18.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.5408555 = fieldWeight in 4921, product of:
          4.2426405 = tf(freq=18.0), with freq of:
            18.0 = termFreq=18.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
    0.008366814 = weight(_text_:information in 4921) [ClassicSimilarity], result of:
      0.008366814 = score(doc=4921,freq=8.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.19395474 = fieldWeight in 4921, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
    0.012421262 = weight(_text_:retrieval in 4921) [ClassicSimilarity], result of:
      0.012421262 = score(doc=4921,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 4921, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4921)
  0.21428572 = coord(3/14)
    Abstract
    Traditional text-based document classifiers tend to perform poorly an the Web. Text in Web documents is usually noisy and often does not contain enough information to determine their topic. However, the Web provides a different source that can be useful to document classification: its hyperlink structure. In this work, the authors evaluate how the link structure of the Web can be used to determine a measure of similarity appropriate for document classification. They experiment with five different similarity measures and determine their adequacy for predicting the topic of a Web page. Tests performed an a Web directory Show that link information alone allows classifying documents with an average precision of 86%. Further, when combined with a traditional textbased classifier, precision increases to values of up to 90%, representing gains that range from 63 to 132% over the use of text-based classification alone. Because the measures proposed in this article are straightforward to compute, they provide a practical and effective solution for Web classification and related information retrieval tasks. Further, the authors provide an important set of guidelines an how link structure can be used effectively to classify Web documents.
    Source
    Journal of the American Society for Information Science and Technology. 57(2006) no.2, S.208-221
  13. Shen, D.; Chen, Z.; Yang, Q.; Zeng, H.J.; Zhang, B.; Lu, Y.; Ma, W.Y.: Web page classification through summarization (2004) 0.01 
    0.013312589 = product of:
  0.062125415 = sum of:
    0.02891608 = weight(_text_:web in 4132) [ClassicSimilarity], result of:
      0.02891608 = score(doc=4132,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.36057037 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
    0.008366814 = weight(_text_:information in 4132) [ClassicSimilarity], result of:
      0.008366814 = score(doc=4132,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.19395474 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
    0.024842525 = weight(_text_:retrieval in 4132) [ClassicSimilarity], result of:
      0.024842525 = score(doc=4132,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33420905 = fieldWeight in 4132, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.078125 = fieldNorm(doc=4132)
  0.21428572 = coord(3/14)
    Source
    SIGIR'04: Proceedings of the 27th Annual International ACM-SIGIR Conference an Research and Development in Information Retrieval. Ed.: K. Järvelin, u.a
  14. Egbert, J.; Biber, D.; Davies, M.: Developing a bottom-up, user-based method of web register classification (2015) 0.01 
    0.013018072 = product of:
  0.060751002 = sum of:
    0.049072213 = weight(_text_:web in 2158) [ClassicSimilarity], result of:
      0.049072213 = score(doc=2158,freq=16.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.6119082 = fieldWeight in 2158, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.046875 = fieldNorm(doc=2158)
    0.0050200885 = weight(_text_:information in 2158) [ClassicSimilarity], result of:
      0.0050200885 = score(doc=2158,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.116372846 = fieldWeight in 2158, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=2158)
    0.006658699 = product of:
      0.019976096 = sum of:
        0.019976096 = weight(_text_:22 in 2158) [ClassicSimilarity], result of:
          0.019976096 = score(doc=2158,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.23214069 = fieldWeight in 2158, 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=2158)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    This paper introduces a project to develop a reliable, cost-effective method for classifying Internet texts into register categories, and apply that approach to the analysis of a large corpus of web documents. To date, the project has proceeded in 2 key phases. First, we developed a bottom-up method for web register classification, asking end users of the web to utilize a decision-tree survey to code relevant situational characteristics of web documents, resulting in a bottom-up identification of register and subregister categories. We present details regarding the development and testing of this method through a series of 10 pilot studies. Then, in the second phase of our project we applied this procedure to a corpus of 53,000 web documents. An analysis of the results demonstrates the effectiveness of these methods for web register classification and provides a preliminary description of the types and distribution of registers on the web.
    Date
    4. 8.2015 19:22:04
    Source
    Journal of the Association for Information Science and Technology. 66(2015) no.9, S.1817-1831
  15. Miyamoto, S.: Information clustering based an fuzzy multisets (2003) 0.01 
    0.012681471 = product of:
  0.059180196 = sum of:
    0.020241255 = weight(_text_:web in 1071) [ClassicSimilarity], result of:
      0.020241255 = score(doc=1071,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.25239927 = fieldWeight in 1071, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
    0.014346098 = weight(_text_:information in 1071) [ClassicSimilarity], result of:
      0.014346098 = score(doc=1071,freq=12.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.3325631 = fieldWeight in 1071, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
    0.024592843 = weight(_text_:retrieval in 1071) [ClassicSimilarity], result of:
      0.024592843 = score(doc=1071,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.33085006 = fieldWeight in 1071, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1071)
  0.21428572 = coord(3/14)
    Abstract
    A fuzzy multiset model for information clustering is proposed with application to information retrieval on the World Wide Web. Noting that a search engine retrieves multiple occurrences of the same subjects with possibly different degrees of relevance, we observe that fuzzy multisets provide an appropriate model of information retrieval on the WWW. Information clustering which means both term clustering and document clustering is considered. Three methods of the hard c-means, fuzzy c-means, and an agglomerative method using cluster centers are proposed. Two distances between fuzzy multisets and algorithms for calculating cluster centers are defined. Theoretical properties concerning the clustering algorithms are studied. Illustrative examples are given to show how the algorithms work.
    Source
    Information processing and management. 39(2003) no.2, S.195-213
  16. Khoo, C.S.G.; Ng, K.; Ou, S.: ¬An exploratory study of human clustering of Web pages (2003) 0.01 
    0.010779243 = product of:
  0.05030313 = sum of:
    0.040067296 = weight(_text_:web in 2741) [ClassicSimilarity], result of:
      0.040067296 = score(doc=2741,freq=24.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.49962097 = fieldWeight in 2741, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.03125 = fieldNorm(doc=2741)
    0.0057966993 = weight(_text_:information in 2741) [ClassicSimilarity], result of:
      0.0057966993 = score(doc=2741,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1343758 = fieldWeight in 2741, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.03125 = fieldNorm(doc=2741)
    0.0044391328 = product of:
      0.013317398 = sum of:
        0.013317398 = weight(_text_:22 in 2741) [ClassicSimilarity], result of:
          0.013317398 = score(doc=2741,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.15476047 = fieldWeight in 2741, 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=2741)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Abstract
    This study seeks to find out how human beings cluster Web pages naturally. Twenty Web pages retrieved by the Northem Light search engine for each of 10 queries were sorted by 3 subjects into categories that were natural or meaningful to them. lt was found that different subjects clustered the same set of Web pages quite differently and created different categories. The average inter-subject similarity of the clusters created was a low 0.27. Subjects created an average of 5.4 clusters for each sorting. The categories constructed can be divided into 10 types. About 1/3 of the categories created were topical. Another 20% of the categories relate to the degree of relevance or usefulness. The rest of the categories were subject-independent categories such as format, purpose, authoritativeness and direction to other sources. The authors plan to develop automatic methods for categorizing Web pages using the common categories created by the subjects. lt is hoped that the techniques developed can be used by Web search engines to automatically organize Web pages retrieved into categories that are natural to users. 1. Introduction The World Wide Web is an increasingly important source of information for people globally because of its ease of access, the ease of publishing, its ability to transcend geographic and national boundaries, its flexibility and heterogeneity and its dynamic nature. However, Web users also find it increasingly difficult to locate relevant and useful information in this vast information storehouse. Web search engines, despite their scope and power, appear to be quite ineffective. They retrieve too many pages, and though they attempt to rank retrieved pages in order of probable relevance, often the relevant documents do not appear in the top-ranked 10 or 20 documents displayed. Several studies have found that users do not know how to use the advanced features of Web search engines, and do not know how to formulate and re-formulate queries. Users also typically exert minimal effort in performing, evaluating and refining their searches, and are unwilling to scan more than 10 or 20 items retrieved (Jansen, Spink, Bateman & Saracevic, 1998). This suggests that the conventional ranked-list display of search results does not satisfy user requirements, and that better ways of presenting and summarizing search results have to be developed. One promising approach is to group retrieved pages into clusters or categories to allow users to navigate immediately to the "promising" clusters where the most useful Web pages are likely to be located. This approach has been adopted by a number of search engines (notably Northem Light) and search agents.
    Date
    12. 9.2004 9:56:22
  17. Dolin, R.; Agrawal, D.; El Abbadi, A.; Pearlman, J.: Using automated classification for summarizing and selecting heterogeneous information sources (1998) 0.01 
    0.010640248 = product of:
  0.049654488 = sum of:
    0.017349645 = weight(_text_:web in 316) [ClassicSimilarity], result of:
      0.017349645 = score(doc=316,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.21634221 = fieldWeight in 316, 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=316)
    0.01122526 = weight(_text_:information in 316) [ClassicSimilarity], result of:
      0.01122526 = score(doc=316,freq=10.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.2602176 = fieldWeight in 316, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.046875 = fieldNorm(doc=316)
    0.021079581 = weight(_text_:retrieval in 316) [ClassicSimilarity], result of:
      0.021079581 = score(doc=316,freq=4.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.2835858 = fieldWeight in 316, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=316)
  0.21428572 = coord(3/14)
    Abstract
    Information retrieval over the Internet increasingly requires the filtering of thousands of heterogeneous information sources. Important sources of information include not only traditional databases with structured data and queries, but also increasing numbers of non-traditional, semi- or unstructured collections such as Web sites, FTP archives, etc. As the number and variability of sources increases, new ways of automatically summarizing, discovering, and selecting collections relevant to a user's query are needed. One such method involves the use of classification schemes, such as the Library of Congress Classification (LCC) [10], within which a collection may be represented based on its content, irrespective of the structure of the actual data or documents. For such a system to be useful in a large-scale distributed environment, it must be easy to use for both collection managers and users. As a result, it must be possible to classify documents automatically within a classification scheme. Furthermore, there must be a straightforward and intuitive interface with which the user may use the scheme to assist in information retrieval (IR).
  18. Golub, K.: Automated subject classification of textual web documents (2006) 0.01 
    0.010410689 = product of:
  0.048583213 = sum of:
    0.02891608 = weight(_text_:web in 5600) [ClassicSimilarity], result of:
      0.02891608 = score(doc=5600,freq=8.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.36057037 = fieldWeight in 5600, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
    0.007245874 = weight(_text_:information in 5600) [ClassicSimilarity], result of:
      0.007245874 = score(doc=5600,freq=6.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.16796975 = fieldWeight in 5600, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
    0.012421262 = weight(_text_:retrieval in 5600) [ClassicSimilarity], result of:
      0.012421262 = score(doc=5600,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.16710453 = fieldWeight in 5600, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5600)
  0.21428572 = coord(3/14)
    Abstract
    Purpose - To provide an integrated perspective to similarities and differences between approaches to automated classification in different research communities (machine learning, information retrieval and library science), and point to problems with the approaches and automated classification as such. Design/methodology/approach - A range of works dealing with automated classification of full-text web documents are discussed. Explorations of individual approaches are given in the following sections: special features (description, differences, evaluation), application and characteristics of web pages. Findings - Provides major similarities and differences between the three approaches: document pre-processing and utilization of web-specific document characteristics is common to all the approaches; major differences are in applied algorithms, employment or not of the vector space model and of controlled vocabularies. Problems of automated classification are recognized. Research limitations/implications - The paper does not attempt to provide an exhaustive bibliography of related resources. Practical implications - As an integrated overview of approaches from different research communities with application examples, it is very useful for students in library and information science and computer science, as well as for practitioners. Researchers from one community have the information on how similar tasks are conducted in different communities. Originality/value - To the author's knowledge, no review paper on automated text classification attempted to discuss more than one community's approach from an integrated perspective.
  19. Bock, H.-H.: Datenanalyse zur Strukturierung und Ordnung von Information (1989) 0.01 
    0.009954749 = product of:
  0.04645549 = sum of:
    0.00585677 = weight(_text_:information in 141) [ClassicSimilarity], result of:
      0.00585677 = score(doc=141,freq=2.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.13576832 = fieldWeight in 141, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=141)
    0.03283024 = weight(_text_:frankfurt in 141) [ClassicSimilarity], result of:
      0.03283024 = score(doc=141,freq=2.0), product of:
        0.10213336 = queryWeight, product of:
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.024573348 = queryNorm
        0.32144478 = fieldWeight in 141, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.1562657 = idf(docFreq=1882, maxDocs=44218)
          0.0546875 = fieldNorm(doc=141)
    0.007768482 = product of:
      0.023305446 = sum of:
        0.023305446 = weight(_text_:22 in 141) [ClassicSimilarity], result of:
          0.023305446 = score(doc=141,freq=2.0), product of:
            0.08605168 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.024573348 = queryNorm
            0.2708308 = fieldWeight in 141, 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=141)
      0.33333334 = coord(1/3)
  0.21428572 = coord(3/14)
    Imprint
    Frankfurt : Indeks
    Pages
    S.1-22
  20. 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.009838659 = product of:
  0.045913745 = sum of:
    0.020241255 = weight(_text_:web in 7209) [ClassicSimilarity], result of:
      0.020241255 = score(doc=7209,freq=2.0), product of:
        0.08019538 = queryWeight, product of:
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.024573348 = queryNorm
        0.25239927 = fieldWeight in 7209, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.2635105 = idf(docFreq=4597, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7209)
    0.008282723 = weight(_text_:information in 7209) [ClassicSimilarity], result of:
      0.008282723 = score(doc=7209,freq=4.0), product of:
        0.04313797 = queryWeight, product of:
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.024573348 = queryNorm
        0.1920054 = fieldWeight in 7209, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.7554779 = idf(docFreq=20772, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7209)
    0.017389767 = weight(_text_:retrieval in 7209) [ClassicSimilarity], result of:
      0.017389767 = score(doc=7209,freq=2.0), product of:
        0.07433229 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.024573348 = queryNorm
        0.23394634 = fieldWeight in 7209, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7209)
  0.21428572 = coord(3/14)
    Abstract
    The Nordic WAIS/WWW project sponsored by NORDINFO is a joint project between Lund University Library and the National Technological Library of Denmark. It aims to improve the existing networked information discovery and retrieval tools Wide Area Information System (WAIS) and World Wide Web (WWW), and to move towards unifying WWW and WAIS. Details current results focusing on the WAIS side of the project. Describes research into automatic indexing and classification of WAIS sources, development of an orientation tool for WAIS, and development of a WAIS index of WWW resources

Authors

Years

Languages

  • e 150
  • d 32
  • a 1
  • chi 1
  • More… Less…

Types

  • a 158
  • el 23
  • x 6
  • m 3
  • r 2
  • s 2
  • d 1
  • More… Less…

Themes

Subjects