Search (114 results, page 1 of 6)

  • × theme_ss:"Automatisches Abstracting"
  1. Pinto, M.: Engineering the production of meta-information : the abstracting concern (2003) 0.03 
    0.029648896 = product of:
  0.044473343 = sum of:
    0.008254958 = weight(_text_:a in 4667) [ClassicSimilarity], result of:
      0.008254958 = score(doc=4667,freq=2.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.17835285 = fieldWeight in 4667, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=4667)
    0.036218386 = product of:
      0.108655155 = sum of:
        0.108655155 = weight(_text_:29 in 4667) [ClassicSimilarity], result of:
          0.108655155 = score(doc=4667,freq=4.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.7694941 = fieldWeight in 4667, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.109375 = fieldNorm(doc=4667)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Date
    27.11.2005 18:29:55
    Source
    Journal of information science. 29(2003) no.5, S.405-418
    Type
    a
  2. Kim, H.H.; Kim, Y.H.: Generic speech summarization of transcribed lecture videos : using tags and their semantic relations (2016) 0.03 
    0.028675942 = product of:
  0.04301391 = sum of:
    0.0065923743 = weight(_text_:a in 2640) [ClassicSimilarity], result of:
      0.0065923743 = score(doc=2640,freq=10.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.14243183 = fieldWeight in 2640, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2640)
    0.036421537 = product of:
      0.054632302 = sum of:
        0.02743957 = weight(_text_:29 in 2640) [ClassicSimilarity], result of:
          0.02743957 = score(doc=2640,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.19432661 = fieldWeight in 2640, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2640)
        0.027192732 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
          0.027192732 = score(doc=2640,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.19345059 = fieldWeight in 2640, 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=2640)
      0.6666667 = coord(2/3)
  0.6666667 = coord(2/3)
    Abstract
    We propose a tag-based framework that simulates human abstractors' ability to select significant sentences based on key concepts in a sentence as well as the semantic relations between key concepts to create generic summaries of transcribed lecture videos. The proposed extractive summarization method uses tags (viewer- and author-assigned terms) as key concepts. Our method employs Flickr tag clusters and WordNet synonyms to expand tags and detect the semantic relations between tags. This method helps select sentences that have a greater number of semantically related key concepts. To investigate the effectiveness and uniqueness of the proposed method, we compare it with an existing technique, latent semantic analysis (LSA), using intrinsic and extrinsic evaluations. The results of intrinsic evaluation show that the tag-based method is as or more effective than the LSA method. We also observe that in the extrinsic evaluation, the grand mean accuracy score of the tag-based method is higher than that of the LSA method, with a statistically significant difference. Elaborating on our results, we discuss the theoretical and practical implications of our findings for speech video summarization and retrieval.
    Date
    22. 1.2016 12:29:41
    Type
    a
  3. Goh, A.; Hui, S.C.: TES: a text extraction system (1996) 0.02 
    0.018563211 = product of:
  0.027844816 = sum of:
    0.013342028 = weight(_text_:a in 6599) [ClassicSimilarity], result of:
      0.013342028 = score(doc=6599,freq=16.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.28826174 = fieldWeight in 6599, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=6599)
    0.01450279 = product of:
      0.04350837 = sum of:
        0.04350837 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
          0.04350837 = score(doc=6599,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.30952093 = fieldWeight in 6599, 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=6599)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    With the onset of the information explosion arising from digital libraries and access to a wealth of information through the Internet, the need to efficiently determine the relevance of a document becomes even more urgent. Describes a text extraction system (TES), which retrieves a set of sentences from a document to form an indicative abstract. Such an automated process enables information to be filtered more quickly. Discusses the combination of various text extraction techniques. Compares results with manually produced abstracts
    Date
    26. 2.1997 10:22:43
    Type
    a
  4. Salton, G.; Allan, J.; Buckley, C.; Singhal, A.: Automatic analysis, theme generation, and summarization of machine readable texts (1994) 0.02 
    0.017754544 = product of:
  0.026631813 = sum of:
    0.008338767 = weight(_text_:a in 1949) [ClassicSimilarity], result of:
      0.008338767 = score(doc=1949,freq=4.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.18016359 = fieldWeight in 1949, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.078125 = fieldNorm(doc=1949)
    0.018293047 = product of:
      0.05487914 = sum of:
        0.05487914 = weight(_text_:29 in 1949) [ClassicSimilarity], result of:
          0.05487914 = score(doc=1949,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.38865322 = fieldWeight in 1949, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.078125 = fieldNorm(doc=1949)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Date
    16. 8.1998 12:30:29
    Type
    a
  5. Robin, J.; McKeown, K.: Empirically designing and evaluating a new revision-based model for summary generation (1996) 0.02 
    0.01737155 = product of:
  0.026057325 = sum of:
    0.011554535 = weight(_text_:a in 6751) [ClassicSimilarity], result of:
      0.011554535 = score(doc=6751,freq=12.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.24964198 = fieldWeight in 6751, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=6751)
    0.01450279 = product of:
      0.04350837 = sum of:
        0.04350837 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
          0.04350837 = score(doc=6751,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.30952093 = fieldWeight in 6751, 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=6751)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Presents a system for summarizing quantitative data in natural language, focusing on the use of a corpus of basketball game summaries, drawn from online news services, to empirically shape the system design and to evaluate the approach. Initial corpus analysis revealed characteristics of textual summaries that challenge the capabilities of current language generation systems. A revision based corpus analysis was used to identify and encode the revision rules of the system. Presents a quantitative evaluation, using several test corpora, to measure the robustness of the new revision based model
    Date
    6. 3.1997 16:22:15
    Type
    a
  6. Craven, T.C.: ¬A phrase flipper for the assistance of writers of abstracts and other text (1995) 0.02 
    0.016788159 = product of:
  0.025182236 = sum of:
    0.010547799 = weight(_text_:a in 4897) [ClassicSimilarity], result of:
      0.010547799 = score(doc=4897,freq=10.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.22789092 = fieldWeight in 4897, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=4897)
    0.014634437 = product of:
      0.04390331 = sum of:
        0.04390331 = weight(_text_:29 in 4897) [ClassicSimilarity], result of:
          0.04390331 = score(doc=4897,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.31092256 = fieldWeight in 4897, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0625 = fieldNorm(doc=4897)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Describes computerized tools for computer assisted abstracting. FlipPhr is a Microsoft Windows application program that rearranges (flips) phrases or other expressions in accordance with rules in a grammar. The flipping may be invoked with a single keystroke from within various Windows application programs that allow cutting and pasting of text. The user may modify the grammar to provide for different kinds of flipping
    Date
    17. 8.1996 10:29:59
    Type
    a
  7. Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996) 0.02 
    0.015958019 = product of:
  0.023937028 = sum of:
    0.009434237 = weight(_text_:a in 6974) [ClassicSimilarity], result of:
      0.009434237 = score(doc=6974,freq=8.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.20383182 = fieldWeight in 6974, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0625 = fieldNorm(doc=6974)
    0.01450279 = product of:
      0.04350837 = sum of:
        0.04350837 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
          0.04350837 = score(doc=6974,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.30952093 = fieldWeight in 6974, 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=6974)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Describes the application of weighting strategies to model uncertainties and probabilities in automatic abstracting systems, particularly in the concept selection phase. The weights were originally assigned in an ad hoc manner and were then refined by manual analysis of the results. The new method attempts to derive a more systematic methods and performs this using a genetic algorithm
    Source
    Information retrieval: new systems and current research. Proceedings of the 16th Research Colloquium of the British Computer Society Information Retrieval Specialist Group, Drymen, Scotland, 22-23 Mar 94. Ed.: R. Leon
    Type
    a
  8. Sweeney, S.; Crestani, F.; Losada, D.E.: 'Show me more' : incremental length summarisation using novelty detection (2008) 0.01 
    0.012906259 = product of:
  0.019359387 = sum of:
    0.010212863 = weight(_text_:a in 2054) [ClassicSimilarity], result of:
      0.010212863 = score(doc=2054,freq=24.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.22065444 = fieldWeight in 2054, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=2054)
    0.009146524 = product of:
      0.02743957 = sum of:
        0.02743957 = weight(_text_:29 in 2054) [ClassicSimilarity], result of:
          0.02743957 = score(doc=2054,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.19432661 = fieldWeight in 2054, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2054)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    The paper presents a study investigating the effects of incorporating novelty detection in automatic text summarisation. Condensing a textual document, automatic text summarisation can reduce the need to refer to the source document. It also offers a means to deliver device-friendly content when accessing information in non-traditional environments. An effective method of summarisation could be to produce a summary that includes only novel information. However, a consequence of focusing exclusively on novel parts may result in a loss of context, which may have an impact on the correct interpretation of the summary, with respect to the source document. In this study we compare two strategies to produce summaries that incorporate novelty in different ways: a constant length summary, which contains only novel sentences, and an incremental summary, containing additional sentences that provide context. The aim is to establish whether a summary that contains only novel sentences provides sufficient basis to determine relevance of a document, or if indeed we need to include additional sentences to provide context. Findings from the study seem to suggest that there is only a minimal difference in performance for the tasks we set our users and that the presence of contextual information is not so important. However, for the case of mobile information access, a summary that contains only novel information does offer benefits, given bandwidth constraints.
    Date
    29. 7.2008 19:35:12
    Type
    a
  9. Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007) 0.01 
    0.012525296 = product of:
  0.018787943 = sum of:
    0.0079108495 = weight(_text_:a in 948) [ClassicSimilarity], result of:
      0.0079108495 = score(doc=948,freq=10.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.1709182 = fieldWeight in 948, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=948)
    0.010877093 = product of:
      0.032631278 = sum of:
        0.032631278 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.032631278 = score(doc=948,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.23214069 = fieldWeight in 948, 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=948)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    In recent years, there has been increased interest in topic-focused multi-document summarization. In this task, automatic summaries are produced in response to a specific information request, or topic, stated by the user. The system we have designed to accomplish this task comprises four main components: a generic extractive summarization system, a topic-focusing component, sentence simplification, and lexical expansion of topic words. This paper details each of these components, together with experiments designed to quantify their individual contributions. We include an analysis of our results on two large datasets commonly used to evaluate task-focused summarization, the DUC2005 and DUC2006 datasets, using automatic metrics. Additionally, we include an analysis of our results on the DUC2006 task according to human evaluation metrics. In the human evaluation of system summaries compared to human summaries, i.e., the Pyramid method, our system ranked first out of 22 systems in terms of overall mean Pyramid score; and in the human evaluation of summary responsiveness to the topic, our system ranked third out of 35 systems.
    Type
    a
  10. Uyttendaele, C.; Moens, M.-F.; Dumortier, J.: SALOMON: automatic abstracting of legal cases for effective access to court decisions (1998) 0.01 
    0.012428179 = product of:
  0.01864227 = sum of:
    0.005837137 = weight(_text_:a in 495) [ClassicSimilarity], result of:
      0.005837137 = score(doc=495,freq=4.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.12611452 = fieldWeight in 495, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=495)
    0.012805132 = product of:
      0.038415395 = sum of:
        0.038415395 = weight(_text_:29 in 495) [ClassicSimilarity], result of:
          0.038415395 = score(doc=495,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.27205724 = fieldWeight in 495, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0546875 = fieldNorm(doc=495)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    The SALOMON project summarises Belgian criminal cases in order to improve access to the large number of existing and future cases. A double methodology was used when developing SALOMON: the cases are processed by employing additional knowledge to interpret structural patterns and features on the one hand and by way of occurrence statistics of index terms on the other. SALOMON performs an initial categorisation and structuring of the cases and subsequently extracts the most relevant text units of the alleged offences and of the opinion of the court. The SALOMON techniques do not themselves solve any legal questions, but they do guide the use effectively towards relevant texts
    Date
    17. 7.1996 14:16:29
    Type
    a
  11. Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006) 0.01 
    0.0122581795 = product of:
  0.01838727 = sum of:
    0.009323024 = weight(_text_:a in 5290) [ClassicSimilarity], result of:
      0.009323024 = score(doc=5290,freq=20.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.20142901 = fieldWeight in 5290, product of:
          4.472136 = tf(freq=20.0), with freq of:
            20.0 = termFreq=20.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5290)
    0.009064244 = product of:
      0.027192732 = sum of:
        0.027192732 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
          0.027192732 = score(doc=5290,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.19345059 = fieldWeight in 5290, 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=5290)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Document keyphrases provide a concise summary of a document's content, offering semantic metadata summarizing a document. They can be used in many applications related to knowledge management and text mining, such as automatic text summarization, development of search engines, document clustering, document classification, thesaurus construction, and browsing interfaces. Because only a small portion of documents have keyphrases assigned by authors, and it is time-consuming and costly to manually assign keyphrases to documents, it is necessary to develop an algorithm to automatically generate keyphrases for documents. This paper describes a Keyphrase Identification Program (KIP), which extracts document keyphrases by using prior positive samples of human identified phrases to assign weights to the candidate keyphrases. The logic of our algorithm is: The more keywords a candidate keyphrase contains and the more significant these keywords are, the more likely this candidate phrase is a keyphrase. KIP's learning function can enrich the glossary database by automatically adding new identified keyphrases to the database. KIP's personalization feature will let the user build a glossary database specifically suitable for the area of his/her interest. The evaluation results show that KIP's performance is better than the systems we compared to and that the learning function is effective.
    Date
    22. 7.2006 17:25:48
    Type
    a
  12. Kannan, R.; Ghinea, G.; Swaminathan, S.: What do you wish to see? : A summarization system for movies based on user preferences (2015) 0.01 
    0.011361206 = product of:
  0.017041808 = sum of:
    0.009724589 = weight(_text_:a in 2683) [ClassicSimilarity], result of:
      0.009724589 = score(doc=2683,freq=34.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.21010503 = fieldWeight in 2683, product of:
          5.8309517 = tf(freq=34.0), with freq of:
            34.0 = termFreq=34.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.03125 = fieldNorm(doc=2683)
    0.0073172185 = product of:
      0.021951655 = sum of:
        0.021951655 = weight(_text_:29 in 2683) [ClassicSimilarity], result of:
          0.021951655 = score(doc=2683,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.15546128 = fieldWeight in 2683, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.03125 = fieldNorm(doc=2683)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Video summarization aims at producing a compact version of a full-length video while preserving the significant content of the original video. Movie summarization condenses a full-length movie into a summary that still retains the most significant and interesting content of the original movie. In the past, several movie summarization systems have been proposed to generate a movie summary based on low-level video features such as color, motion, texture, etc. However, a generic summary, which is common to everyone and is produced based only on low-level video features will not satisfy every user. As users' preferences for the summary differ vastly for the same movie, there is a need for a personalized movie summarization system nowadays. To address this demand, this paper proposes a novel system to generate semantically meaningful video summaries for the same movie, which are tailored to the preferences and interests of a user. For a given movie, shots and scenes are automatically detected and their high-level features are semi-automatically annotated. Preferences over high-level movie features are explicitly collected from the user using a query interface. The user preferences are generated by means of a stored-query. Movie summaries are generated at shot level and scene level, where shots or scenes are selected for summary skim based on the similarity measured between shots and scenes, and the user's preferences. The proposed movie summarization system is evaluated subjectively using a sample of 20 subjects with eight movies in the English language. The quality of the generated summaries is assessed by informativeness, enjoyability, relevance, and acceptance metrics and Quality of Perception measures. Further, the usability of the proposed summarization system is subjectively evaluated by conducting a questionnaire survey. The experimental results on the performance of the proposed movie summarization approach show the potential of the proposed system.
    Date
    25. 1.2016 18:45:29
    Type
    a
  13. Oh, H.; Nam, S.; Zhu, Y.: Structured abstract summarization of scientific articles : summarization using full-text section information (2023) 0.01 
    0.011242965 = product of:
  0.016864447 = sum of:
    0.0078002024 = weight(_text_:a in 889) [ClassicSimilarity], result of:
      0.0078002024 = score(doc=889,freq=14.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.1685276 = fieldWeight in 889, product of:
          3.7416575 = tf(freq=14.0), with freq of:
            14.0 = termFreq=14.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=889)
    0.009064244 = product of:
      0.027192732 = sum of:
        0.027192732 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
          0.027192732 = score(doc=889,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.19345059 = fieldWeight in 889, 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=889)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    The automatic summarization of scientific articles differs from other text genres because of the structured format and longer text length. Previous approaches have focused on tackling the lengthy nature of scientific articles, aiming to improve the computational efficiency of summarizing long text using a flat, unstructured abstract. However, the structured format of scientific articles and characteristics of each section have not been fully explored, despite their importance. The lack of a sufficient investigation and discussion of various characteristics for each section and their influence on summarization results has hindered the practical use of automatic summarization for scientific articles. To provide a balanced abstract proportionally emphasizing each section of a scientific article, the community introduced the structured abstract, an abstract with distinct, labeled sections. Using this information, in this study, we aim to understand tasks ranging from data preparation to model evaluation from diverse viewpoints. Specifically, we provide a preprocessed large-scale dataset and propose a summarization method applying the introduction, methods, results, and discussion (IMRaD) format reflecting the characteristics of each section. We also discuss the objective benchmarks and perspectives of state-of-the-art algorithms and present the challenges and research directions in this area.
    Date
    22. 1.2023 18:57:12
    Type
    a
  14. Wang, S.; Koopman, R.: Embed first, then predict (2019) 0.01 
    0.010912072 = product of:
  0.016368108 = sum of:
    0.007221584 = weight(_text_:a in 5400) [ClassicSimilarity], result of:
      0.007221584 = score(doc=5400,freq=12.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.15602624 = fieldWeight in 5400, product of:
          3.4641016 = tf(freq=12.0), with freq of:
            12.0 = termFreq=12.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5400)
    0.009146524 = product of:
      0.02743957 = sum of:
        0.02743957 = weight(_text_:29 in 5400) [ClassicSimilarity], result of:
          0.02743957 = score(doc=5400,freq=2.0), product of:
            0.14120336 = queryWeight, product of:
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.040140964 = queryNorm
            0.19432661 = fieldWeight in 5400, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5176873 = idf(docFreq=3565, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5400)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    Automatic subject prediction is a desirable feature for modern digital library systems, as manual indexing can no longer cope with the rapid growth of digital collections. It is also desirable to be able to identify a small set of entities (e.g., authors, citations, bibliographic records) which are most relevant to a query. This gets more difficult when the amount of data increases dramatically. Data sparsity and model scalability are the major challenges to solving this type of extreme multilabel classification problem automatically. In this paper, we propose to address this problem in two steps: we first embed different types of entities into the same semantic space, where similarity could be computed easily; second, we propose a novel non-parametric method to identify the most relevant entities in addition to direct semantic similarities. We show how effectively this approach predicts even very specialised subjects, which are associated with few documents in the training set and are more problematic for a classifier.
    Date
    29. 9.2019 12:18:42
    Type
    a
  15. Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023) 0.01 
    0.010437746 = product of:
  0.015656618 = sum of:
    0.0065923743 = weight(_text_:a in 1012) [ClassicSimilarity], result of:
      0.0065923743 = score(doc=1012,freq=10.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.14243183 = fieldWeight in 1012, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1012)
    0.009064244 = product of:
      0.027192732 = sum of:
        0.027192732 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
          0.027192732 = score(doc=1012,freq=2.0), product of:
            0.14056681 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.040140964 = queryNorm
            0.19345059 = fieldWeight in 1012, 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=1012)
      0.33333334 = coord(1/3)
  0.6666667 = coord(2/3)
    Abstract
    With the wide application of keyphrases in many Information Retrieval (IR) and Natural Language Processing (NLP) tasks, automatic keyphrase prediction has been emerging. However, these statistically important phrases are contributing increasingly less to the related tasks because the end-to-end learning mechanism enables models to learn the important semantic information of the text directly. Similarly, keyphrases are of little help for readers to quickly grasp the paper's main idea because the relationship between the keyphrase and the paper is not explicit to readers. Therefore, we propose to generate keyphrases with specific functions for readers to bridge the semantic gap between them and the information producers, and verify the effectiveness of the keyphrase function for assisting users' comprehension with a user experiment. A controllable keyphrase generation framework (the CKPG) that uses the keyphrase function as a control code to generate categorized keyphrases is proposed and implemented based on Transformer, BART, and T5, respectively. For the Computer Science domain, the Macro-avgs of , , and on the Paper with Code dataset are up to 0.680, 0.535, and 0.558, respectively. Our experimental results indicate the effectiveness of the CKPG models.
    Date
    22. 6.2023 14:55:20
    Type
    a
  16. Hobson, S.P.; Dorr, B.J.; Monz, C.; Schwartz, R.: Task-based evaluation of text summarization using Relevance Prediction (2007) 0.00 
    0.004251953 = product of:
  0.01275586 = sum of:
    0.01275586 = weight(_text_:a in 938) [ClassicSimilarity], result of:
      0.01275586 = score(doc=938,freq=26.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.27559727 = fieldWeight in 938, product of:
          5.0990195 = tf(freq=26.0), with freq of:
            26.0 = termFreq=26.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=938)
  0.33333334 = coord(1/3)
    Abstract
    This article introduces a new task-based evaluation measure called Relevance Prediction that is a more intuitive measure of an individual's performance on a real-world task than interannotator agreement. Relevance Prediction parallels what a user does in the real world task of browsing a set of documents using standard search tools, i.e., the user judges relevance based on a short summary and then that same user - not an independent user - decides whether to open (and judge) the corresponding document. This measure is shown to be a more reliable measure of task performance than LDC Agreement, a current gold-standard based measure used in the summarization evaluation community. Our goal is to provide a stable framework within which developers of new automatic measures may make stronger statistical statements about the effectiveness of their measures in predicting summary usefulness. We demonstrate - as a proof-of-concept methodology for automatic metric developers - that a current automatic evaluation measure has a better correlation with Relevance Prediction than with LDC Agreement and that the significance level for detected differences is higher for the former than for the latter.
    Type
    a
  17. Díaz, A.; Gervás, P.: User-model based personalized summarization (2007) 0.00 
    0.004085145 = product of:
  0.012255435 = sum of:
    0.012255435 = weight(_text_:a in 952) [ClassicSimilarity], result of:
      0.012255435 = score(doc=952,freq=24.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.26478532 = fieldWeight in 952, product of:
          4.8989797 = tf(freq=24.0), with freq of:
            24.0 = termFreq=24.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=952)
  0.33333334 = coord(1/3)
    Abstract
    The potential of summary personalization is high, because a summary that would be useless to decide the relevance of a document if summarized in a generic manner, may be useful if the right sentences are selected that match the user interest. In this paper we defend the use of a personalized summarization facility to maximize the density of relevance of selections sent by a personalized information system to a given user. The personalization is applied to the digital newspaper domain and it used a user-model that stores long and short term interests using four reference systems: sections, categories, keywords and feedback terms. On the other side, it is crucial to measure how much information is lost during the summarization process, and how this information loss may affect the ability of the user to judge the relevance of a given document. The results obtained in two personalization systems show that personalized summaries perform better than generic and generic-personalized summaries in terms of identifying documents that satisfy user preferences. We also considered a user-centred direct evaluation that showed a high level of user satisfaction with the summaries.
    Type
    a
  18. Abdi, A.; Idris, N.; Alguliev, R.M.; Aliguliyev, R.M.: Automatic summarization assessment through a combination of semantic and syntactic information for intelligent educational systems (2015) 0.00 
    0.003911229 = product of:
  0.011733686 = sum of:
    0.011733686 = weight(_text_:a in 2681) [ClassicSimilarity], result of:
      0.011733686 = score(doc=2681,freq=22.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.25351265 = fieldWeight in 2681, product of:
          4.690416 = tf(freq=22.0), with freq of:
            22.0 = termFreq=22.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046875 = fieldNorm(doc=2681)
  0.33333334 = coord(1/3)
    Abstract
    Summary writing is a process for creating a short version of a source text. It can be used as a measure of understanding. As grading students' summaries is a very time-consuming task, computer-assisted assessment can help teachers perform the grading more effectively. Several techniques, such as BLEU, ROUGE, N-gram co-occurrence, Latent Semantic Analysis (LSA), LSA_Ngram and LSA_ERB, have been proposed to support the automatic assessment of students' summaries. Since these techniques are more suitable for long texts, their performance is not satisfactory for the evaluation of short summaries. This paper proposes a specialized method that works well in assessing short summaries. Our proposed method integrates the semantic relations between words, and their syntactic composition. As a result, the proposed method is able to obtain high accuracy and improve the performance compared with the current techniques. Experiments have displayed that it is to be preferred over the existing techniques. A summary evaluation system based on the proposed method has also been developed.
    Type
    a
  19. Craven, T.C.: Presentation of repeated phrases in a computer-assisted abstracting tool kit (2001) 0.00 
    0.0038914247 = product of:
  0.011674274 = sum of:
    0.011674274 = weight(_text_:a in 3667) [ClassicSimilarity], result of:
      0.011674274 = score(doc=3667,freq=4.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.25222903 = fieldWeight in 3667, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=3667)
  0.33333334 = coord(1/3)
    Type
    a
  20. Yusuff, A.: Automatisches Indexing and Abstracting : Grundlagen und Beispiele (2002) 0.00 
    0.0038914247 = product of:
  0.011674274 = sum of:
    0.011674274 = weight(_text_:a in 1577) [ClassicSimilarity], result of:
      0.011674274 = score(doc=1577,freq=4.0), product of:
        0.04628442 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.040140964 = queryNorm
        0.25222903 = fieldWeight in 1577, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.109375 = fieldNorm(doc=1577)
  0.33333334 = coord(1/3)
    Imprint
    Potsdam : Fachhochschule, FB A-B-D

Authors

Years

Languages

  • e 95
  • d 17
  • chi 2
  • More… Less…

Types

  • a 109
  • m 2
  • el 1
  • r 1
  • s 1
  • x 1
  • More… Less…

Themes

Subjects