A semantic graph-based keyword extraction model using ranking method on big social data

被引:9
作者
Devika, R. [1 ]
Subramaniyaswamy, V [1 ]
机构
[1] SASTRA Deemed Univ, Sch Comp, Thanjavur, India
关键词
Online social network; Semantic graph; Keyword extraction; Graph-based model; Ranking methods; IDENTIFICATION;
D O I
10.1007/s11276-019-02128-x
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Identification of an influential node is essential to control Online Social Networks. It is a crucial task with various kinds of real-time usages such as information retrieval and recommendation, instinctive keyword indexing, viral marketing, instinctive classification, and filtering. Existing graph-based methods consider only numeric measures such as centrality, degree, and betweenness for keyword extraction. In this research, a relatively effective method called Semantic graph-based Keyword Extraction Method (SKEM) from Twitter using ranking methods is proposed. In the proposed model, the exhaustive preprocessing is carried out, and a semantic graph-based model has been constructed. The numeric graph metrics are then used to weigh the nodes of the semantic graph. Page Rank algorithm is applied to arrange the nodes, and the top ten nodes that are found to be very relevant and effectively represent the most influential node. Combining both semantic as well as numeric graph metrics, it greatly enhances the quality of keywords extracted. The extensive preprocessing enhances the quality of the input and minimizes the noise in the input. The keywords extracted by the proposed model have been more relevant and meaningful. The performance of the proposed SKEM model is validated with real-time tweets of Twitter API. The experimental results are confirmed that the proposed method is achieving high performance in terms of precision, recall, and F-measure.
引用
收藏
页码:5447 / 5459
页数:13
相关论文
共 28 条
[1]   A keyword extraction method from twitter messages represented as graphs [J].
Abilhoa, Willyan D. ;
de Castro, Leandro N. .
APPLIED MATHEMATICS AND COMPUTATION, 2014, 240 :308-325
[2]   Unsupervised Keyword Extraction Using the GoW Model and Centrality Scores [J].
Batziou, Elissavet ;
Gialampoukidis, Ilias ;
Vrochidis, Stefanos ;
Antoniou, Ioannis ;
Kompatsiaris, Ioannis .
INTERNET SCIENCE, 2017, 10673 :344-351
[3]  
Beliga S., 2014, CEUR P WORKSHOP SURF, V1310, P1
[4]  
Beliga S, 2015, J INF ORGAN SCI, V39, P1
[5]   NE-Rank: A Novel Graph-based Keyphrase Extraction in Twitter [J].
Bellaachia, Abdelghani ;
Al-Dhelaan, Mohammed .
2012 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2012), VOL 1, 2012, :372-379
[6]   Centrality for graphs with numerical attributes [J].
Benyahia, Oualid ;
Largeron, Christine .
PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), 2015, :1348-1353
[7]   A graph based keyword extraction model using collective node weight [J].
Biswas, Saroj Kr. ;
Bordoloi, Monali ;
Shreya, Jacob .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 97 :51-59
[8]  
Boudin F., 2013, INT JOINT C NATURAL, P834
[9]  
Bougouin Adrien, 2013, IJCNLP, P543
[10]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117