Search (4 results, page 1 of 1)

0.03341625 = product of:
  0.0668325 = sum of:
    0.040692065 = weight(_text_:social in 4990) [ClassicSimilarity], result of:
      0.040692065 = score(doc=4990,freq=2.0), product of:
        0.1847249 = queryWeight, product of:
          3.9875789 = idf(docFreq=2228, maxDocs=44218)
          0.046325076 = queryNorm
        0.22028469 = fieldWeight in 4990, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.9875789 = idf(docFreq=2228, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4990)
    0.026140431 = product of:
      0.052280862 = sum of:
        0.052280862 = weight(_text_:aspects in 4990) [ClassicSimilarity], result of:
          0.052280862 = score(doc=4990,freq=2.0), product of:
            0.20938325 = queryWeight, product of:
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.046325076 = queryNorm
            0.2496898 = fieldWeight in 4990, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4990)
      0.5 = coord(1/2)
  0.5 = coord(2/4)

Abstract

Sentiment analysis has become a very important tool for analysis of social media data. There are several methods developed, covering distinct aspects of the problem and disparate strategies. However, no single technique fits well in all cases or for all data sources. Supervised approaches may be able to adapt to specific situations, but require manually labeled training, which is very cumbersome and expensive to acquire, mainly for a new application. In this context, we propose to combine several popular and effective state-of-the-practice sentiment analysis methods by means of an unsupervised bootstrapped strategy. One of our main goals is to reduce the large variability (low stability) of the unsupervised methods across different domains. The experimental results demonstrate that our combined method (aka, 10SENT) improves the effectiveness of the classification task, considering thirteen different data sets. Also, it tackles the key problem of cross-domain low stability and produces the best (or close to best) results in almost all considered contexts, without any additional costs (e.g., manual labeling). Finally, we also investigate a transfer learning approach for sentiment analysis to gather additional (unsupervised) information for the proposed approach, and we show the potential of this technique to improve our results.

0.009242038 = product of:
  0.036968153 = sum of:
    0.036968153 = product of:
      0.073936306 = sum of:
        0.073936306 = weight(_text_:aspects in 5291) [ClassicSimilarity], result of:
          0.073936306 = score(doc=5291,freq=4.0), product of:
            0.20938325 = queryWeight, product of:
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.046325076 = queryNorm
            0.35311472 = fieldWeight in 5291, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.5198684 = idf(docFreq=1308, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5291)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Abstract

Text representation models are the fundamental basis for information retrieval and text mining tasks. Although different text models have been proposed, they typically target specific task aspects in isolation, such as time efficiency, accuracy, or applicability for different scenarios. Here we present Bag of Textual Graphs (BoTG), a general text representation model that addresses these three requirements at the same time. The proposed textual representation is based on a graph-based scheme that encodes term proximity and term ordering, and represents text documents into an efficient vector space that addresses all these aspects as well as provides discriminative textual patterns. Extensive experiments are conducted in two experimental scenarios-classification and retrieval-considering multiple well-known text collections. We also compare our model against several methods from the literature. Experimental results demonstrate that our model is generic enough to handle different tasks and collections. It is also more efficient than the widely used state-of-the-art methods in textual classification and retrieval tasks, with a competitive effectiveness, sometimes with gains by large margins.

0.0039227554 = product of:
  0.015691021 = sum of:
    0.015691021 = product of:
      0.031382043 = sum of:
        0.031382043 = weight(_text_:22 in 3343) [ClassicSimilarity], result of:
          0.031382043 = score(doc=3343,freq=2.0), product of:
            0.16222252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046325076 = queryNorm
            0.19345059 = fieldWeight in 3343, 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=3343)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

16.11.2017 13:04:22

0.0039227554 = product of:
  0.015691021 = sum of:
    0.015691021 = product of:
      0.031382043 = sum of:
        0.031382043 = weight(_text_:22 in 3524) [ClassicSimilarity], result of:
          0.031382043 = score(doc=3524,freq=2.0), product of:
            0.16222252 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046325076 = queryNorm
            0.19345059 = fieldWeight in 3524, 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=3524)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

Date

16.11.2017 13:30:22