9
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Sentence Embedding Based Semantic Clustering Approach for Discussion Thread Summarization

      1 , 1 , 2 , 3 , 4 , 5 , 1
      Complexity
      Hindawi Limited

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Huge data on the web come from discussion forums, which contain millions of threads. Discussion threads are a valuable source of knowledge for Internet users, as they have information about numerous topics. The discussion thread related to single topic comprises a huge number of reply posts, which makes it hard for the forum users to scan all the replies and determine the most relevant replies in the thread. At the same time, it is also hard for the forum users to manually summarize the bulk of reply posts in order to get the gist of discussion thread. Thus, automatically extracting the most relevant replies from discussion thread and combining them to form a summary are a challenging task. With this motivation behind, this study has proposed a sentence embedding based clustering approach for discussion thread summarization. The proposed approach works in the following fashion: At first, word2vec model is employed to represent reply sentences in the discussion thread through sentence embeddings/sentence vectors. Next, K-medoid clustering algorithm is applied to group semantically similar reply sentences in order to reduce the overlapping reply sentences. Finally, different quality text features are utilized to rank the reply sentences in different clusters, and then the high-ranked reply sentences are picked out from all clusters to form the thread summary. Two standard forum datasets are used to assess the effectiveness of the suggested approach. Empirical results confirm that the proposed sentence based clustering approach performed superior in comparison to other summarization methods in the context of mean precision, recall, and F-measure.

          Related collections

          Most cited references16

          • Record: found
          • Abstract: not found
          • Article: not found

          FCM: The fuzzy c-means clustering algorithm

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            An efficient k-means clustering algorithm: analysis and implementation

              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              LexRank: Graph-based Lexical Centrality as Salience in Text Summarization

              We introduce a stochastic graph-based method for computing relative importance of textual units for Natural Language Processing. We test the technique on the problem of Text Summarization (TS). Extractive TS relies on the concept of sentence salience to identify the most important sentences in a document or set of documents. Salience is typically defined in terms of the presence of particular important words or in terms of similarity to a centroid pseudo-sentence. We consider a new approach, LexRank, for computing sentence importance based on the concept of eigenvector centrality in a graph representation of sentences. In this model, a connectivity matrix based on intra-sentence cosine similarity is used as the adjacency matrix of the graph representation of sentences. Our system, based on LexRank ranked in first place in more than one task in the recent DUC 2004 evaluation. In this paper we present a detailed analysis of our approach and apply it to a larger data set including data from earlier DUC evaluations. We discuss several methods to compute centrality using the similarity graph. The results show that degree-based methods (including LexRank) outperform both centroid-based methods and other systems participating in DUC in most of the cases. Furthermore, the LexRank with threshold method outperforms the other degree-based techniques including continuous LexRank. We also show that our approach is quite insensitive to the noise in the data that may result from an imperfect topical clustering of documents.
                Bookmark

                Author and article information

                Contributors
                Journal
                Complexity
                Complexity
                Hindawi Limited
                1076-2787
                1099-0526
                August 25 2020
                August 25 2020
                : 2020
                : 1-11
                Affiliations
                [1 ]Department of Computer Science, Islamia College Peshawar, Peshawar, KP, Pakistan
                [2 ]Institute of Computing, Kohat University of Science and Technology, Kohat, Pakistan
                [3 ]Department of Computer and Information Science, Faculty of Science and Technology, University of Macau, Macau, China
                [4 ]Department of Information Technology, College of Computers and Information Technology, Taif University, Taif 21944, Saudi Arabia
                [5 ]Department of Computer Science, College of Computers and Information Technology, Taif University, Taif 21944, Saudi Arabia
                Article
                10.1155/2020/4750871
                c0032faa-18d4-4c57-be5c-aefdf3790b4e
                © 2020

                http://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article