Graph coloring and ACO based summarization for social networks

• Published in: Expert systems with applications Vol. 74; pp. 115 - 126
• Main Authors: Mosa, Mohamed Atef, Hamouda, Alaa, Marei, Mahmoud
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 15.05.2017; Elsevier BV
• Subjects: Algorithms; Ant colony optimization; Color; Coloring; Digital media; Falling; Graph coloring; Local search; Messages; Optimization algorithms; Search process; Short text summarization; Social networks; Studies; Text mining; Text mining; Ant colony optimization; Local search; Social networks; Graph coloring; Short text summarization
• ISSN: 0957-4174; 1873-6793
• DOI: 10.1016/j.eswa.2017.01.010

•An unconventional GR-ACO-LS-STS for short text summarization it is proposed.•The mechanism relies on graph coloring mixed with Ant colony optimization and local search.•The mechanism was found more efficient than the other traditional algorithms. Due to the increasing popularity of contents of social media platforms, the number of posts and messages is steadily increasing. A huge amount of data is generated daily as an outcome of the interactions between fans of the networking platforms. It becomes extremely troublesome to find the most relevant, interactive information for the subscribers. The aim of this work is to enable the users to get a powerful brief of comments without reading the entire list. This paper opens up a new field of short text summarization (STS) predicated on a hybrid ant colony optimization coming with a mechanism of local search, called ACO-LS-STS, to produce an optimal or near-optimal summary. Initially, the graph coloring algorithm, called GC-ISTS, was employed before to shrink the solution area of ants to small sets. Evidently, the main purpose of using the GC algorithm is to make the search process more facilitated, faster and prevents the ants from falling into the local optimum. First, the dissimilar comments are assembled together into the same color, at the same time preserving the information ratio as for an original list of comment. Subsequently, activating the ACO-LS-STS algorithm, which is a novel technique concerning the extraction of the most interactive comments from each color in a parallel form. At the end, the best summary is picked from the best color. This problem is formalized as an optimization problem utilizing GC and ACO-LS to generate the optimal solution. Eventually, the proposed algorithm was evaluated and tested over a collection of Facebook messages with their associated comments. Indeed, it was found that the proposed algorithm has an ability to capture a good solution that is guaranteed to be near optimal and had realized notable performance in comparison with traditional document summarization algorithms.