Search (4 results, page 1 of 1)

0.05325361 = product of:
  0.26626804 = sum of:
    0.26626804 = weight(_text_:5.0 in 953) [ClassicSimilarity], result of:
      0.26626804 = score(doc=953,freq=2.0), product of:
        0.48019022 = queryWeight, product of:
          8.364683 = idf(docFreq=27, maxDocs=44218)
          0.05740686 = queryNorm
        0.55450535 = fieldWeight in 953, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          8.364683 = idf(docFreq=27, maxDocs=44218)
          0.046875 = fieldNorm(doc=953)
  0.2 = coord(1/5)

Abstract

Due to a large variety of noisy information embedded in Web pages, Web-page classification is much more difficult than pure-text classification. In this paper, we propose to improve the Web-page classification performance by removing the noise through summarization techniques. We first give empirical evidence that ideal Web-page summaries generated by human editors can indeed improve the performance of Web-page classification algorithms. We then put forward a new Web-page summarization algorithm based on Web-page layout and evaluate it along with several other state-of-the-art text summarization algorithms on the LookSmart Web directory. Experimental results show that the classification algorithms (NB or SVM) augmented by any summarization approach can achieve an improvement by more than 5.0% as compared to pure-text-based classification algorithms. We further introduce an ensemble method to combine the different summarization algorithms. The ensemble summarization method achieves more than 12.0% improvement over pure-text based methods.

0.017917896 = product of:
  0.08958948 = sum of:
    0.08958948 = weight(_text_:objects in 1719) [ClassicSimilarity], result of:
      0.08958948 = score(doc=1719,freq=2.0), product of:
        0.30512154 = queryWeight, product of:
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.05740686 = queryNorm
        0.29361898 = fieldWeight in 1719, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.315071 = idf(docFreq=590, maxDocs=44218)
          0.0390625 = fieldNorm(doc=1719)
  0.2 = coord(1/5)

Abstract

Many automatic text summarization models have been developed in the last decades. Related research in information science has shown that human abstractors extract sentences for summaries based on the hierarchical structure of documents; however, the existing automatic summarization models do not take into account the human abstractor's behavior of sentence extraction and only consider the document as a sequence of sentences during the process of extraction of sentences as a summary. In general, a document exhibits a well-defined hierarchical structure that can be described as fractals - mathematical objects with a high degree of redundancy. In this article, we introduce the fractal summarization model based on the fractal theory. The important information is captured from the source document by exploring the hierarchical structure and salient features of the document. A condensed version of the document that is informatively close to the source document is produced iteratively using the contractive transformation in the fractal theory. The fractal summarization model is the first attempt to apply fractal theory to document summarization. It significantly improves the divergence of information coverage of summary and the precision of summary. User evaluations have been conducted. Results have indicated that fractal summarization is promising and outperforms current summarization techniques that do not consider the hierarchical structure of documents.

0.009333405 = product of:
  0.04666702 = sum of:
    0.04666702 = weight(_text_:22 in 948) [ClassicSimilarity], result of:
      0.04666702 = score(doc=948,freq=2.0), product of:
        0.20102905 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05740686 = 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.2 = coord(1/5)

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.

0.0077778376 = product of:
  0.03888919 = sum of:
    0.03888919 = weight(_text_:22 in 5290) [ClassicSimilarity], result of:
      0.03888919 = score(doc=5290,freq=2.0), product of:
        0.20102905 = queryWeight, product of:
          3.5018296 = idf(docFreq=3622, maxDocs=44218)
          0.05740686 = 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.2 = coord(1/5)

Date

22. 7.2006 17:25:48