Abstract
Social media has been the game changer of this generation much like telephony was for the previous. The amount of information available on this platform is huge. This information if extracted and analyzed, can be an immensely helpful source of news and latest developments around the world. As a source and sink of information, it is much faster than traditional news channels and media platforms. This paper uses Twitter data to extract keywords and then sequence them to give useful information. Keywords are extracted from graph constructed from users’ posts by heaviest k-subgraph problem. We then proposed a method to sequence extracted keywords in a particular order to get some meaningful information by using Edmonds’ algorithm.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Letsios, M., Balalau, O.D., Danisch, M., Orsini, E., Sozio, M.: Finding heaviest k- subgraphs and events in social media. In: 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW), Barcelona, pp. 113–120 (2016)
Angel, A., Koudas, N., Sarkas, N., Srivastava, D., Svendsen, M., Tirthapura, S.: Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J. 23(2), 175–199 (2014)
Edmonds, J.: Optimum branchings. J. Res. Nat. Bur. Stand. 71B, 233–240 (1967)
Ohsawa, Y., Benson, N.E., Yachida, M.: KeyGraph: automatic indexing by co-occurrence graph based on building construction metaphor. In: Proceedings of the Advances in Digital Libraries Conference, ADL ’98, p. 12, Washington, DC, USA (1998)
Palshikar, G.K.: Keyword extraction from a single document using centrality measures. Pattern Recogn. Mach. Intell. LNCS 4815, 503–510 (2007)
Tsatsaronis, G., Varlamis, I., Nørvag, K.: SemanticRank: ranking keywords and sentences using semantic graphs. In: Proceedings of the 23rd International Conference on Computational Linguistics, pp. 1074–1082, Beijing, China (2010)
Abilhoa, W.D., de Castro, L.N.: A keyword extraction method from twitter messages represented as graphs. Appl. Math. Comput. 240, 308–325 (2014)
Litvak, M., Last, M., Aizenman, H., Gobits, I., Kandel, A.: DegExt—a language-independent graph-based keyphrase extractor. In: Advances in Intelligent Web Mastering—3, vol. 86, pp. 121–130. AISC (2011)
Turney, P.D.: Learning to extract keyphrases from text. Technical Report ERB-1057, National Research Council of Canada, Institute for Information Technology, 1999
Mihalcea, R., Tarau, P.: TextRank: bringing order into texts. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP 2004), pp. 104–411, Barcelona, Spain, July 2004
Zhou, Z., Zou, X., Lv, X., Hu, J.: Research on weighted complex network based keywords extraction. Chin. Lex. Semant. LNCS 8229, 442–452 (2013)
Lahiri, S., Choudhury, S.R., Caragea, C.: Keyword and keyphrase extraction using centrality measures on collocation networks, Cornell University Library (2014). arXiv:1401.6571
Xu, S., Guo, J., Chen, X.: Extracting topic keywords from Sina Weibo text sets. In: 2016 International Conference on Audio, Language and Image Processing (ICALIP), Shanghai, pp. 668–673 (2016)
Suzek, Tugba: Using latent semantic analysis for automated keyword extraction from large document corpora. Turkish J. Electr. Eng. Comput. Sci. 25, 1784–1794 (2017). https://doi.org/10.3906/elk-1511-203
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Singh, H., Kumar, M., Aggarwal, P. (2018). Extraction and Sequencing of Keywords from Twitter. In: Satapathy, S., Tavares, J., Bhateja, V., Mohanty, J. (eds) Information and Decision Sciences. Advances in Intelligent Systems and Computing, vol 701. Springer, Singapore. https://doi.org/10.1007/978-981-10-7563-6_19
Download citation
DOI: https://doi.org/10.1007/978-981-10-7563-6_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7562-9
Online ISBN: 978-981-10-7563-6
eBook Packages: EngineeringEngineering (R0)