Search (96 results, page 1 of 5)

  • × theme_ss:"Automatisches Indexieren"
  1. Benson, A.C.: Image descriptions and their relational expressions : a review of the literature and the issues (2015) 0.07 
    0.07103619 = product of:
  0.14207238 = sum of:
    0.10090631 = weight(_text_:description in 1867) [ClassicSimilarity], result of:
      0.10090631 = score(doc=1867,freq=4.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.43587846 = fieldWeight in 1867, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.046875 = fieldNorm(doc=1867)
    0.04116606 = weight(_text_:26 in 1867) [ClassicSimilarity], result of:
      0.04116606 = score(doc=1867,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.23410915 = fieldWeight in 1867, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.046875 = fieldNorm(doc=1867)
  0.5 = coord(2/4)
    Abstract
    Purpose - The purpose of this paper is to survey the treatment of relationships, relationship expressions and the ways in which they manifest themselves in image descriptions. Design/methodology/approach - The term "relationship" is construed in the broadest possible way to include spatial relationships ("to the right of"), temporal ("in 1936," "at noon"), meronymic ("part of"), and attributive ("has color," "has dimension"). The intentions of these vaguely delimited categories with image information, image creation, and description in libraries and archives is complex and in need of explanation. Findings - The review brings into question many generally held beliefs about the relationship problem such as the belief that the semantics of relationships are somehow embedded in the relationship term itself and that image search and retrieval solutions can be found through refinement of word-matching systems. Originality/value - This review has no hope of systematically examining all evidence in all disciplines pertaining to this topic. It instead focusses on a general description of a theoretical treatment in Library and Information Science.
    Date
    24. 5.2015 19:26:43
  2. Ward, M.L.: ¬The future of the human indexer (1996) 0.05 
    0.04579494 = product of:
  0.09158988 = sum of:
    0.071351536 = weight(_text_:description in 7244) [ClassicSimilarity], result of:
      0.071351536 = score(doc=7244,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.3082126 = fieldWeight in 7244, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.046875 = fieldNorm(doc=7244)
    0.020238347 = product of:
      0.040476695 = sum of:
        0.040476695 = weight(_text_:22 in 7244) [ClassicSimilarity], result of:
          0.040476695 = score(doc=7244,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.23214069 = fieldWeight in 7244, 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=7244)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Considers the principles of indexing and the intellectual skills involved in order to determine what automatic indexing systems would be required in order to supplant or complement the human indexer. Good indexing requires: considerable prior knowledge of the literature; judgement as to what to index and what depth to index; reading skills; abstracting skills; and classification skills, Illustrates these features with a detailed description of abstracting and indexing processes involved in generating entries for the mechanical engineering database POWERLINK. Briefly assesses the possibility of replacing human indexers with specialist indexing software, with particular reference to the Object Analyzer from the InTEXT automatic indexing system and using the criteria described for human indexers. At present, it is unlikely that the automatic indexer will replace the human indexer, but when more primary texts are available in electronic form, it may be a useful productivity tool for dealing with large quantities of low grade texts (should they be wanted in the database)
    Date
    9. 2.1997 18:44:22
  3. Lepsky, K.; Vorhauer, J.: Lingo - ein open source System für die Automatische Indexierung deutschsprachiger Dokumente (2006) 0.04 
    0.040936273 = product of:
  0.081872545 = sum of:
    0.05488808 = weight(_text_:26 in 3581) [ClassicSimilarity], result of:
      0.05488808 = score(doc=3581,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.31214553 = fieldWeight in 3581, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.0625 = fieldNorm(doc=3581)
    0.026984464 = product of:
      0.05396893 = sum of:
        0.05396893 = weight(_text_:22 in 3581) [ClassicSimilarity], result of:
          0.05396893 = score(doc=3581,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.30952093 = fieldWeight in 3581, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0625 = fieldNorm(doc=3581)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Date
    24. 3.2006 12:22:02
    Source
    ABI-Technik. 26(2006) H.1, S.18-28
  4. Kasprzik, A.: Voraussetzungen und Anwendungspotentiale einer präzisen Sacherschließung aus Sicht der Wissenschaft (2018) 0.04 
    0.03581924 = product of:
  0.07163848 = sum of:
    0.048027072 = weight(_text_:26 in 5195) [ClassicSimilarity], result of:
      0.048027072 = score(doc=5195,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.27312735 = fieldWeight in 5195, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5195)
    0.023611406 = product of:
      0.04722281 = sum of:
        0.04722281 = weight(_text_:22 in 5195) [ClassicSimilarity], result of:
          0.04722281 = score(doc=5195,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.2708308 = fieldWeight in 5195, 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=5195)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Große Aufmerksamkeit richtet sich im Moment auf das Potential von automatisierten Methoden in der Sacherschließung und deren Interaktionsmöglichkeiten mit intellektuellen Methoden. In diesem Kontext befasst sich der vorliegende Beitrag mit den folgenden Fragen: Was sind die Anforderungen an bibliothekarische Metadaten aus Sicht der Wissenschaft? Was wird gebraucht, um den Informationsbedarf der Fachcommunities zu bedienen? Und was bedeutet das entsprechend für die Automatisierung der Metadatenerstellung und -pflege? Dieser Beitrag fasst die von der Autorin eingenommene Position in einem Impulsvortrag und der Podiumsdiskussion beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
    Date
    26. 3.2019 19:08:50
  5. Franke-Maier, M.: Anforderungen an die Qualität der Inhaltserschließung im Spannungsfeld von intellektuell und automatisch erzeugten Metadaten (2018) 0.04 
    0.03581924 = product of:
  0.07163848 = sum of:
    0.048027072 = weight(_text_:26 in 5344) [ClassicSimilarity], result of:
      0.048027072 = score(doc=5344,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.27312735 = fieldWeight in 5344, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5344)
    0.023611406 = product of:
      0.04722281 = sum of:
        0.04722281 = weight(_text_:22 in 5344) [ClassicSimilarity], result of:
          0.04722281 = score(doc=5344,freq=2.0), product of:
            0.17436278 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04979191 = queryNorm
            0.2708308 = fieldWeight in 5344, 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=5344)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    Spätestens seit dem Deutschen Bibliothekartag 2018 hat sich die Diskussion zu den automatischen Verfahren der Inhaltserschließung der Deutschen Nationalbibliothek von einer politisch geführten Diskussion in eine Qualitätsdiskussion verwandelt. Der folgende Beitrag beschäftigt sich mit Fragen der Qualität von Inhaltserschließung in digitalen Zeiten, wo heterogene Erzeugnisse unterschiedlicher Verfahren aufeinandertreffen und versucht, wichtige Anforderungen an Qualität zu definieren. Dieser Tagungsbeitrag fasst die vom Autor als Impulse vorgetragenen Ideen beim Workshop der FAG "Erschließung und Informationsvermittlung" des GBV am 29. August 2018 in Kiel zusammen. Der Workshop fand im Rahmen der 22. Verbundkonferenz des GBV statt.
    Date
    26. 3.2019 19:05:38
  6. Klinger, K.-H.: Automatische Inhaltserschließung einer Volltextdatenbank : Machbarkeitsstudie am Beispiel der FAZ (1994) 0.03 
    0.02744404 = product of:
  0.10977616 = sum of:
    0.10977616 = weight(_text_:26 in 2766) [ClassicSimilarity], result of:
      0.10977616 = score(doc=2766,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.62429106 = fieldWeight in 2766, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.125 = fieldNorm(doc=2766)
  0.25 = coord(1/4)
    Date
    9.12.1995 17:26:17
  7. Weidenbach, N.: Werkzeuge zur Evaluierung und Optimierung von Regeln zur Automatischen Indexierung : Anwendungssystementwicklung (1994) 0.03 
    0.02744404 = product of:
  0.10977616 = sum of:
    0.10977616 = weight(_text_:26 in 2768) [ClassicSimilarity], result of:
      0.10977616 = score(doc=2768,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.62429106 = fieldWeight in 2768, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.125 = fieldNorm(doc=2768)
  0.25 = coord(1/4)
    Date
    9.12.1995 17:26:17
  8. Milstead, J.L.: Thesauri in a full-text world (1998) 0.02 
    0.02211583 = product of:
  0.08846332 = sum of:
    0.08846332 = sum of:
      0.054732744 = weight(_text_:access in 2337) [ClassicSimilarity], result of:
        0.054732744 = score(doc=2337,freq=6.0), product of:
          0.16876608 = queryWeight, product of:
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.04979191 = queryNorm
          0.3243113 = fieldWeight in 2337, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.389428 = idf(docFreq=4053, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2337)
      0.03373058 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
        0.03373058 = score(doc=2337,freq=2.0), product of:
          0.17436278 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.04979191 = queryNorm
          0.19345059 = fieldWeight in 2337, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2337)
  0.25 = coord(1/4)
    Abstract
    Despite early claims to the contemporary, thesauri continue to find use as access tools for information in the full-text environment. Their mode of use is changing, but this change actually represents an expansion rather than a contrdiction of their utility. Thesauri and similar vocabulary tools can complement full-text access by aiding users in focusing their searches, by supplementing the linguistic analysis of the text search engine, and even by serving as one of the tools used by the linguistic engine for its analysis. While human indexing contunues to be used for many databases, the trend is to increase the use of machine aids for this purpose. All machine-aided indexing (MAI) systems rely on thesauri as the basis for term selection. In the 21st century, the balance of effort between human and machine will change at both input and output, but thesauri will continue to play an important role for the foreseeable future
    Date
    22. 9.1997 19:16:05
    Source
    Visualizing subject access for 21st century information resources: Papers presented at the 1997 Clinic on Library Applications of Data Processing, 2-4 Mar 1997, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign. Ed.: P.A. Cochrane et al
  9. Donahue, J.; Hendricks, L.A.; Guadarrama, S.; Rohrbach, M.; Venugopalan, S.; Saenko, K.; Darrell, T.: Long-term recurrent convolutional networks for visual recognition and description (2014) 0.02 
    0.021022148 = product of:
  0.08408859 = sum of:
    0.08408859 = weight(_text_:description in 1873) [ClassicSimilarity], result of:
      0.08408859 = score(doc=1873,freq=4.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.36323205 = fieldWeight in 1873, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1873)
  0.25 = coord(1/4)
    Abstract
    Models based on deep convolutional networks have dominated recent image interpretation tasks; we investigate whether models which are also recurrent, or "temporally deep", are effective for tasks involving sequences, visual and otherwise. We develop a novel recurrent convolutional architecture suitable for large-scale visual learning which is end-to-end trainable, and demonstrate the value of these models on benchmark video recognition tasks, image description and retrieval problems, and video narration challenges. In contrast to current models which assume a fixed spatio-temporal receptive field or simple temporal averaging for sequential processing, recurrent convolutional models are "doubly deep" in that they can be compositional in spatial and temporal "layers". Such models may have advantages when target concepts are complex and/or training data are limited. Learning long-term dependencies is possible when nonlinearities are incorporated into the network state updates. Long-term RNN models are appealing in that they directly can map variable-length inputs (e.g., video frames) to variable length outputs (e.g., natural language text) and can model complex temporal dynamics; yet they can be optimized with backpropagation. Our recurrent long-term models are directly connected to modern visual convnet models and can be jointly trained to simultaneously learn temporal dynamics and convolutional perceptual representations. Our results show such models have distinct advantages over state-of-the-art models for recognition or generation which are separately defined and/or optimized.
  10. Lepsky, K.: Automatische Indexierung in der Inhaltserschließung (1998) 0.02 
    0.02058303 = product of:
  0.08233212 = sum of:
    0.08233212 = weight(_text_:26 in 1283) [ClassicSimilarity], result of:
      0.08233212 = score(doc=1283,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.4682183 = fieldWeight in 1283, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.09375 = fieldNorm(doc=1283)
  0.25 = coord(1/4)
    Date
    11.12.2015 11:37:26
  11. Anderson, J.D.; Pérez-Carballo, J.: ¬The nature of indexing: how humans and machines analyze messages and texts for retrieval : Part I: Research and the nature of human indexing (2001) 0.02 
    0.02058303 = product of:
  0.08233212 = sum of:
    0.08233212 = weight(_text_:26 in 3136) [ClassicSimilarity], result of:
      0.08233212 = score(doc=3136,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.4682183 = fieldWeight in 3136, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.09375 = fieldNorm(doc=3136)
  0.25 = coord(1/4)
    Date
    25.12.2007 15:26:27
  12. Junger, U.: Möglichkeiten und Probleme automatischer Erschließungsverfahren in Bibliotheken : Bericht vom KASCADE-Workshop in der Universitäts- und Landesbibliothek Düsseldorf (1999) 0.02 
    0.02058303 = product of:
  0.08233212 = sum of:
    0.08233212 = weight(_text_:26 in 3645) [ClassicSimilarity], result of:
      0.08233212 = score(doc=3645,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.4682183 = fieldWeight in 3645, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.09375 = fieldNorm(doc=3645)
  0.25 = coord(1/4)
    Date
    23.10.1996 17:26:29
  13. Dresler, W.: Semi-automatische Indexierungssoftware : Möglichkeiten und Grenzen am Beispiel von g.a.d.t.1 (1998) 0.02 
    0.02058303 = product of:
  0.08233212 = sum of:
    0.08233212 = weight(_text_:26 in 4272) [ClassicSimilarity], result of:
      0.08233212 = score(doc=4272,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.4682183 = fieldWeight in 4272, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.09375 = fieldNorm(doc=4272)
  0.25 = coord(1/4)
    Date
    26. 9.2005 19:40:08
  14. Cui, H.; Boufford, D.; Selden, P.: Semantic annotation of biosystematics literature without training examples (2010) 0.02 
    0.017837884 = product of:
  0.071351536 = sum of:
    0.071351536 = weight(_text_:description in 3422) [ClassicSimilarity], result of:
      0.071351536 = score(doc=3422,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.3082126 = fieldWeight in 3422, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.046875 = fieldNorm(doc=3422)
  0.25 = coord(1/4)
    Abstract
    This article presents an unsupervised algorithm for semantic annotation of morphological descriptions of whole organisms. The algorithm is able to annotate plain text descriptions with high accuracy at the clause level by exploiting the corpus itself. In other words, the algorithm does not need lexicons, syntactic parsers, training examples, or annotation templates. The evaluation on two real-life description collections in botany and paleontology shows that the algorithm has the following desirable features: (a) reduces/eliminates manual labor required to compile dictionaries and prepare source documents; (b) improves annotation coverage: the algorithm annotates what appears in documents and is not limited by predefined and often incomplete templates; (c) learns clean and reusable concepts: the algorithm learns organ names and character states that can be used to construct reusable domain lexicons, as opposed to collection-dependent patterns whose applicability is often limited to a particular collection; (d) insensitive to collection size; and (e) runs in linear time with respect to the number of clauses to be annotated.
  15. Gil-Leiva, I.: SISA-automatic indexing system for scientific articles : experiments with location heuristics rules versus TF-IDF rules (2017) 0.02 
    0.017837884 = product of:
  0.071351536 = sum of:
    0.071351536 = weight(_text_:description in 3622) [ClassicSimilarity], result of:
      0.071351536 = score(doc=3622,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.3082126 = fieldWeight in 3622, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.046875 = fieldNorm(doc=3622)
  0.25 = coord(1/4)
    Abstract
    Indexing is contextualized and a brief description is provided of some of the most used automatic indexing systems. We describe SISA, a system which uses location heuristics rules, statistical rules like term frequency (TF) or TF-IDF to obtain automatic or semi-automatic indexing, depending on the user's preference. The aim of this research is to ascertain which rules (location heuristics rules or TF-IDF rules) provide the best indexing terms. SISA is used to obtain the automatic indexing of 200 scientific articles on fruit growing written in Portuguese. It uses, on the one hand, location heuristics rules founded on the value of certain parts of the articles for indexing such as titles, abstracts, keywords, headings, first paragraph, conclusions and references and, on the other, TF-IDF rules. The indexing is then evaluated to ascertain retrieval performance through recall, precision and f-measure. Automatic indexing of the articles with location heuristics rules provided the best results with the evaluation measures.
  16. Matthews, P.; Glitre, K.: Genre analysis of movies using a topic model of plot summaries (2021) 0.02 
    0.017837884 = product of:
  0.071351536 = sum of:
    0.071351536 = weight(_text_:description in 412) [ClassicSimilarity], result of:
      0.071351536 = score(doc=412,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.3082126 = fieldWeight in 412, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.046875 = fieldNorm(doc=412)
  0.25 = coord(1/4)
    Abstract
    Genre plays an important role in the description, navigation, and discovery of movies, but it is rarely studied at large scale using quantitative methods. This allows an analysis of how genre labels are applied, how genres are composed and how these ingredients change, and how genres compare. We apply unsupervised topic modeling to a large collection of textual movie summaries and then use the model's topic proportions to investigate key questions in genre, including recognizability, mapping, canonicity, and change over time. We find that many genres can be quite easily predicted by their lexical signatures and this defines their position on the genre landscape. We find significant genre composition changes between periods for westerns, science fiction and road movies, reflecting changes in production and consumption values. We show that in terms of canonicity, canonical examples are often at the high end of the topic distribution profile for the genre rather than central as might be predicted by categorization theory.
  17. Salton, G.: Another look at automatic text-retrieval systems (1986) 0.02 
    0.017152525 = product of:
  0.0686101 = sum of:
    0.0686101 = weight(_text_:26 in 1356) [ClassicSimilarity], result of:
      0.0686101 = score(doc=1356,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.3901819 = fieldWeight in 1356, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.078125 = fieldNorm(doc=1356)
  0.25 = coord(1/4)
    Footnote
    Bezugnahme auf: Blair, D.C.: An evaluation of retrieval effectiveness for a full-text document-retrieval system. Comm. ACM 28(1985) S.280-299. - Vgl. auch: Blair, D.C.: Full text retrieval ... Int. Class. 13(1986) S.18-23; Blair, D.C., M.E. Maron: full-text information retrieval ... Inf. Proc. Man. 26(1990) S.437-447.
  18. Olsgaard, J.N.; Evans, E.J.: Improving keyword indexing (1981) 0.02 
    0.017152525 = product of:
  0.0686101 = sum of:
    0.0686101 = weight(_text_:26 in 4996) [ClassicSimilarity], result of:
      0.0686101 = score(doc=4996,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.3901819 = fieldWeight in 4996, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.078125 = fieldNorm(doc=4996)
  0.25 = coord(1/4)
    Date
    26. 2.1996 16:49:13
  19. Anderson, J.D.; Pérez-Carballo, J.: ¬The nature of indexing: how humans and machines analyze messages and texts for retrieval : Part II: Machine indexing, and the allocation of human versus machine effort (2001) 0.02 
    0.017152525 = product of:
  0.0686101 = sum of:
    0.0686101 = weight(_text_:26 in 368) [ClassicSimilarity], result of:
      0.0686101 = score(doc=368,freq=2.0), product of:
        0.17584132 = queryWeight, product of:
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.04979191 = queryNorm
        0.3901819 = fieldWeight in 368, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.5315237 = idf(docFreq=3516, maxDocs=44218)
          0.078125 = fieldNorm(doc=368)
  0.25 = coord(1/4)
    Date
    25.12.2007 15:26:50
  20. Vinyals, O.; Toshev, A.; Bengio, S.; Erhan, D.: Show and tell : a neural image caption generator (2014) 0.01 
    0.014864903 = product of:
  0.05945961 = sum of:
    0.05945961 = weight(_text_:description in 1869) [ClassicSimilarity], result of:
      0.05945961 = score(doc=1869,freq=2.0), product of:
        0.23150103 = queryWeight, product of:
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.04979191 = queryNorm
        0.25684384 = fieldWeight in 1869, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.64937 = idf(docFreq=1149, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1869)
  0.25 = coord(1/4)
    Abstract
    Automatically describing the content of an image is a fundamental problem in artificial intelligence that connects computer vision and natural language processing. In this paper, we present a generative model based on a deep recurrent architecture that combines recent advances in computer vision and machine translation and that can be used to generate natural sentences describing an image. The model is trained to maximize the likelihood of the target description sentence given the training image. Experiments on several datasets show the accuracy of the model and the fluency of the language it learns solely from image descriptions. Our model is often quite accurate, which we verify both qualitatively and quantitatively. For instance, while the current state-of-the-art BLEU-1 score (the higher the better) on the Pascal dataset is 25, our approach yields 59, to be compared to human performance around 69. We also show BLEU-1 score improvements on Flickr30k, from 56 to 66, and on SBU, from 19 to 28. Lastly, on the newly released COCO dataset, we achieve a BLEU-4 of 27.7, which is the current state-of-the-art.

Authors

Years

Languages

  • e 65
  • d 26
  • f 2
  • ja 1
  • nl 1
  • ru 1
  • More… Less…

Types

  • a 82
  • el 8
  • x 6
  • m 3
  • d 1
  • s 1
  • More… Less…

Themes

Classifications