Search (16 results, page 1 of 1)

Atanassova, I.; Bertin, M.; Larivière, V.: On the composition of scientific abstracts (2016) 0.05
```
0.050388 = sum of:
  0.029912626 = product of:
    0.119650505 = sum of:
      0.119650505 = weight(_text_:authors in 3028) [ClassicSimilarity], result of:
        0.119650505 = score(doc=3028,freq=8.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.50368255 = fieldWeight in 3028, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.0390625 = fieldNorm(doc=3028)
    0.25 = coord(1/4)
  0.020475375 = product of:
    0.04095075 = sum of:
      0.04095075 = weight(_text_:i in 3028) [ClassicSimilarity], result of:
        0.04095075 = score(doc=3028,freq=2.0), product of:
          0.1965379 = queryWeight, product of:
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.05210816 = queryNorm
          0.20836058 = fieldWeight in 3028, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.7717297 = idf(docFreq=2765, maxDocs=44218)
            0.0390625 = fieldNorm(doc=3028)
    0.5 = coord(1/2)
```
Abstract

Purpose - Scientific abstracts reproduce only part of the information and the complexity of argumentation in a scientific article. The purpose of this paper provides a first analysis of the similarity between the text of scientific abstracts and the body of articles, using sentences as the basic textual unit. It contributes to the understanding of the structure of abstracts. Design/methodology/approach - Using sentence-based similarity metrics, the authors quantify the phenomenon of text re-use in abstracts and examine the positions of the sentences that are similar to sentences in abstracts in the introduction, methods, results and discussion structure, using a corpus of over 85,000 research articles published in the seven Public Library of Science journals. Findings - The authors provide evidence that 84 percent of abstract have at least one sentence in common with the body of the paper. Studying the distributions of sentences in the body of the articles that are re-used in abstracts, the authors show that there exists a strong relation between the rhetorical structure of articles and the zones that authors re-use when writing abstracts, with sentences mainly coming from the beginning of the introduction and the end of the conclusion. Originality/value - Scientific abstracts contain what is considered by the author(s) as information that best describe documents' content. This is a first study that examines the relation between the contents of abstracts and the rhetorical structure of scientific articles. The work might provide new insight for improving automatic abstracting tools as well as information retrieval approaches, in which text organization and structure are important features.
Wu, Y.-f.B.; Li, Q.; Bot, R.S.; Chen, X.: Finding nuggets in documents : a machine learning approach (2006) 0.03
```
0.032606155 = sum of:
  0.014956313 = product of:
    0.059825253 = sum of:
      0.059825253 = weight(_text_:authors in 5290) [ClassicSimilarity], result of:
        0.059825253 = score(doc=5290,freq=2.0), product of:
          0.23755142 = queryWeight, product of:
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.05210816 = queryNorm
          0.25184128 = fieldWeight in 5290, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.558814 = idf(docFreq=1258, maxDocs=44218)
            0.0390625 = fieldNorm(doc=5290)
    0.25 = coord(1/4)
  0.01764984 = product of:
    0.03529968 = sum of:
      0.03529968 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
        0.03529968 = score(doc=5290,freq=2.0), product of:
          0.1824739 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05210816 = 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.5 = coord(1/2)
```
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

Advances in automatic text summarization (1999) 0.02

0.020475375 = product of:
  0.04095075 = sum of:
    0.04095075 = product of:
      0.0819015 = sum of:
        0.0819015 = weight(_text_:i in 6191) [ClassicSimilarity], result of:
          0.0819015 = score(doc=6191,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.41672117 = fieldWeight in 6191, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.078125 = fieldNorm(doc=6191)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Editor: Mani, I. u. M.T. Maybury

Ercan, G.; Cicekli, I.: Using lexical chains for keyword extraction (2007) 0.01

0.014332764 = product of:
  0.028665528 = sum of:
    0.028665528 = product of:
      0.057331055 = sum of:
        0.057331055 = weight(_text_:i in 951) [ClassicSimilarity], result of:
          0.057331055 = score(doc=951,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.29170483 = fieldWeight in 951, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0546875 = fieldNorm(doc=951)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Goh, A.; Hui, S.C.: TES: a text extraction system (1996) 0.01

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 6599) [ClassicSimilarity], result of:
          0.05647949 = score(doc=6599,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 26. 2.1997 10:22:43

Robin, J.; McKeown, K.: Empirically designing and evaluating a new revision-based model for summary generation (1996) 0.01

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 6751) [ClassicSimilarity], result of:
          0.05647949 = score(doc=6751,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 6. 3.1997 16:22:15

Jones, P.A.; Bradbeer, P.V.G.: Discovery of optimal weights in a concept selection system (1996) 0.01

0.014119873 = product of:
  0.028239746 = sum of:
    0.028239746 = product of:
      0.05647949 = sum of:
        0.05647949 = weight(_text_:22 in 6974) [ClassicSimilarity], result of:
          0.05647949 = score(doc=6974,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

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

Dammeyer, A.; Jürgensen, W.; Krüwel, C.; Poliak, E.; Ruttkowski, S.; Schäfer, Th.; Sirava, M.; Hermes, T.: Videoanalyse mit DiVA (1998) 0.01
```
0.012285226 = product of:
  0.024570452 = sum of:
    0.024570452 = product of:
      0.049140904 = sum of:
        0.049140904 = weight(_text_:i in 23) [ClassicSimilarity], result of:
          0.049140904 = score(doc=23,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.25003272 = fieldWeight in 23, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.046875 = fieldNorm(doc=23)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
```
Abstract

Die Bedeutung von Videos nimmt für multimediale Systeme stetig zu. Dabei existiert eine Vielzahl von Produkten zur Betrachtung von Videos, allerdings nur wenige Ansätze, den Inhalt eines Videos zu erschließen. Das DiVA-System, welches an der Universität Bremen im Rahmen eines studentischen Projektes entwickelt wird, dient der automatischen Analyse von MPEG-I Videofilmen. Der dabei verfolgte Ansatz läßt sich in vier Phasen gliedern. Zunächst wird der Videofilm durch eine Shotanalyse in seine einzelnen Kameraeinstellungen (Shots) unterteilt. Darauf aufbauend findet eine Kamerabewegungsanalyse sowie die Erstellung von Mosaicbildern statt. Mit Methoden der künstlichen Intelligenz und der digitalen Bildverarbeitung wird das analysierte Material nach Bild- und Toninformationen ausgewertet. Das Resultat ist eine textuelle Beschreibung eines Videofilms, auf der mit Hilfe von Text-Retrieval-Systemen recherchiert werden kann
Vanderwende, L.; Suzuki, H.; Brockett, J.M.; Nenkova, A.: Beyond SumBasic : task-focused summarization with sentence simplification and lexical expansion (2007) 0.01
```
0.010589904 = product of:
  0.021179808 = sum of:
    0.021179808 = product of:
      0.042359617 = sum of:
        0.042359617 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
          0.042359617 = score(doc=948,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)
```
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.
Ouyang, Y.; Li, W.; Li, S.; Lu, Q.: Intertopic information mining for query-based summarization (2010) 0.01
```
0.010575711 = product of:
  0.021151422 = sum of:
    0.021151422 = product of:
      0.08460569 = sum of:
        0.08460569 = weight(_text_:authors in 3459) [ClassicSimilarity], result of:
          0.08460569 = score(doc=3459,freq=4.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.35615736 = fieldWeight in 3459, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3459)
      0.25 = coord(1/4)
  0.5 = coord(1/2)
```
Abstract

In this article, the authors address the problem of sentence ranking in summarization. Although most existing summarization approaches are concerned with the information embodied in a particular topic (including a set of documents and an associated query) for sentence ranking, they propose a novel ranking approach that incorporates intertopic information mining. Intertopic information, in contrast to intratopic information, is able to reveal pairwise topic relationships and thus can be considered as the bridge across different topics. In this article, the intertopic information is used for transferring word importance learned from known topics to unknown topics under a learning-based summarization framework. To mine this information, the authors model the topic relationship by clustering all the words in both known and unknown topics according to various kinds of word conceptual labels, which indicate the roles of the words in the topic. Based on the mined relationships, we develop a probabilistic model using manually generated summaries provided for known topics to predict ranking scores for sentences in unknown topics. A series of experiments have been conducted on the Document Understanding Conference (DUC) 2006 data set. The evaluation results show that intertopic information is indeed effective for sentence ranking and the resultant summarization system performs comparably well to the best-performing DUC participating systems on the same data set.

Yeh, J.-Y.; Ke, H.-R.; Yang, W.-P.; Meng, I.-H.: Text summarization using a trainable summarizer and latent semantic analysis (2005) 0.01

0.010237687 = product of:
  0.020475375 = sum of:
    0.020475375 = product of:
      0.04095075 = sum of:
        0.04095075 = weight(_text_:i in 1003) [ClassicSimilarity], result of:
          0.04095075 = score(doc=1003,freq=2.0), product of:
            0.1965379 = queryWeight, product of:
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.05210816 = queryNorm
            0.20836058 = fieldWeight in 1003, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.7717297 = idf(docFreq=2765, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1003)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Wang, W.; Hwang, D.: Abstraction Assistant : an automatic text abstraction system (2010) 0.01
```
0.008973788 = product of:
  0.017947575 = sum of:
    0.017947575 = product of:
      0.0717903 = sum of:
        0.0717903 = weight(_text_:authors in 3981) [ClassicSimilarity], result of:
          0.0717903 = score(doc=3981,freq=2.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.30220953 = fieldWeight in 3981, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046875 = fieldNorm(doc=3981)
      0.25 = coord(1/4)
  0.5 = coord(1/2)
```
Abstract

In the interest of standardization and quality assurance, it is desirable for authors and staff of access services to follow the American National Standards Institute (ANSI) guidelines in preparing abstracts. Using the statistical approach an extraction system (the Abstraction Assistant) was developed to generate informative abstracts to meet the ANSI guidelines for structural content elements. The system performance is evaluated by comparing the system-generated abstracts with the author's original abstracts and the manually enhanced system abstracts on three criteria: balance (satisfaction of the ANSI standards), fluency (text coherence), and understandability (clarity). The results suggest that it is possible to use the system output directly without manual modification, but there are issues that need to be addressed in further studies to make the system a better tool.

Kim, H.H.; Kim, Y.H.: Generic speech summarization of transcribed lecture videos : using tags and their semantic relations (2016) 0.01

0.00882492 = product of:
  0.01764984 = sum of:
    0.01764984 = product of:
      0.03529968 = sum of:
        0.03529968 = weight(_text_:22 in 2640) [ClassicSimilarity], result of:
          0.03529968 = score(doc=2640,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 1.2016 12:29:41

Oh, H.; Nam, S.; Zhu, Y.: Structured abstract summarization of scientific articles : summarization using full-text section information (2023) 0.01

0.00882492 = product of:
  0.01764984 = sum of:
    0.01764984 = product of:
      0.03529968 = sum of:
        0.03529968 = weight(_text_:22 in 889) [ClassicSimilarity], result of:
          0.03529968 = score(doc=889,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 1.2023 18:57:12

Jiang, Y.; Meng, R.; Huang, Y.; Lu, W.; Liu, J.: Generating keyphrases for readers : a controllable keyphrase generation framework (2023) 0.01

0.00882492 = product of:
  0.01764984 = sum of:
    0.01764984 = product of:
      0.03529968 = sum of:
        0.03529968 = weight(_text_:22 in 1012) [ClassicSimilarity], result of:
          0.03529968 = score(doc=1012,freq=2.0), product of:
            0.1824739 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05210816 = 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.5 = coord(1/2)
  0.5 = coord(1/2)

Date: 22. 6.2023 14:55:20

Wang, S.; Koopman, R.: Embed first, then predict (2019) 0.01
```
0.0074781566 = product of:
  0.014956313 = sum of:
    0.014956313 = product of:
      0.059825253 = sum of:
        0.059825253 = weight(_text_:authors in 5400) [ClassicSimilarity], result of:
          0.059825253 = score(doc=5400,freq=2.0), product of:
            0.23755142 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.05210816 = queryNorm
            0.25184128 = fieldWeight in 5400, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5400)
      0.25 = coord(1/4)
  0.5 = coord(1/2)
```
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.

Search (16 results, page 1 of 1)

Authors

Years

Languages

Types