References
- D. Greene, and P. Cunningham, “Practical solutions to the problem of diagonal dominance in kernel document clustering,” in Proc. 23rd International Conference on Machine Learning (ICML’06). ACM Press, 2006, pp. 377–84.
- A. Hulth, “Improved automatic keyword extraction given more linguistic knowledge,” in Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing, 2003, pp. 216–23.
- A. R. Aronson, et al., “The nlm indexing initiative,” in Proceedings of the AMIA Symposium. American Medical Informatics Association, 2000, pp. 17.
- K. Sparck Jones, “A statistical interpretation of term specificity and its application in retrieval,” Journal of Documentation, Vol. 28, no. 1, pp. 11–21, 1972.
- B. Das, S. Pal, S. K. Mondal, D. Dalui, and S. K. Shome, “Automatic keyword extraction from any text document using n-gram rigid collocation,” Int. J. Soft Comput. Eng.(IJSCE), Vol. 3, no. 2, pp. 238–42, 2013.
- K. Zhang, H. Xu, J. Tang, and J. Li, “Keyword extraction using support vector machine,” in International Conference on Web-Age Information Management. Springer, 2006, pp. 85–96.
- Y.-N. Chen, Y. Huang, H.-Y. Lee, and L.-S. Lee, “Unsupervised two-stage keyword extraction from spoken documents by topic coherence and support vector machine,” in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2012, pp. 5041–4.
- Y. Zhang, M. Tuo, Q. Yin, L. Qi, X. Wang, and T. Liu, “Keywords extraction with deep neural network model,” Neurocomputing, Vol. 383, pp. 113–21, 2020.
- P. D. Turney, “Learning algorithms for keyphrase ex-traction,” Info. Retrieval, Vol. 2, no. 4, pp. 303–36, 2000.
- R. Ostling, and G. Grigonyte, “Transparent text quality assessment with convolutional neural networks,” in Proceedings of the 12th Workshop on Innovative Use of NLP for Building Educational Applications, 2017, pp. 282–6.
- P. J. Tierney, “A qualitative analysis framework using natural language processing and graph theory,” Int. Rev. Res. Open and Distrib. Learning, Vol. 13, no. 5, pp. 173–89, 2012.
- G. Ercan, and I. Cicekli, “Using lexical chains for key-word extraction,” Inf. Process. Manag., Vol. 43, no. 6, pp. 1705–14, 2007.
- R. Mihalcea, and P. Tarau, “Textrank: Bringing order into text,” in Proceedings of the 2004 Conference on Empirical Methods in Natural Language Processing, 2004, pp. 404–11.
- W. D. Abilhoa, and L. N. De Castro, “A keyword ex-traction method from twitter messages represented as graphs,” Appl. Math. Comput., Vol. 240, pp. 308–25, 2014.
- M. Litvak, M. Last, H. Aizenman, I. Gobits, and A. Kandel, “Degext—a language-independent graph-based keyphrase extractor,” in Advances in Intelligent Web Mastering–3. Springer, 2011, pp. 121–30.
- C. Florescu, and C. Caragea, “A position-biased pager-ank algorithm for keyphrase extraction,” in Thirty-First AAAI Conference on Artificial Intelligence, 2017.
- S. Duari, and V. Bhatnagar, “Scake: Semantic connectivity aware keyword extraction,” Inf. Sci. (Ny), Vol. 477, pp. 100–17, 2019.
- Y. Ying, T. Qingping, X. Qinzheng, Z. Ping, and L. Panpan, “A graph-based approach of automatic keyphrase extraction,” Procedia. Comput. Sci., Vol. 107, pp. 248–55, 2017.
- N. Hafiene, W. Karoui, and L. B. Romdhane, “Influential nodes detection in dynamic social networks: A survey,” Expert. Syst. Appl., Vol. 159, pp. 113642, 2020.
- G. Rossetti, and R. Cazabet, “Community discovery in dynamic networks: A survey,” ACM Comput. Surv. (CSUR), Vol. 51, no. 2, pp. 1–37, 2018.
- S. Muhuri, S. Chakraborty, and S. N. Chakraborty, “Extracting social network and character categorization from bengali literature,” IEEE Trans. on Comput. Soc. Sys., Vol. 5, no. 2, pp. 371–81, 2018.
- S. Muhuri, S. Chakraborty, and S. K. Setua, “Differentiate the game maker in any soccer match based on social network approach,” IEEE Trans. on Comput. Soc. Sys., Vol. 7, no. 6, pp. 1399–408, 2020.
- S. Yan, Y. Jia, and X. Wang. “Overlapping community detection in temporal text networks,” arXiv preprint arXiv:2101.05137, 2021.
- M. E. Newman, “Analysis of weighted networks,” Physical Review E, Vol. 70, no. 5, pp. 056131, 2004.
- L. C. Freeman, “Centrality in social networks conceptual clarification,” Soc. Networks., Vol. 1, no. 3, pp. 215–39, 1978.
- H. Kim, and R. Anderson, “Temporal node centrality in complex networks,” Physical Review E, Vol. 85, no. 2, pp. 026107, 2012.
- T. Opsahl, F. Agneessens, and J. Skvoretz, “Node centrality in weighted networks: Generalizing degree and shortest paths,” Soc. Networks., Vol. 32, no. 3, pp. 245–51, 2010.
- E. E. Santos, J. Korah, V. Murugappan, and S. Subramanian, “Efficient anytime anywhere algorithms for closeness centrality in large and dynamic graphs,” in 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2016, pp. 1821–30.
- A. Barrat, M. Barthelemy, R. Pastor-Satorras, and A. Vespignani, “The architecture of complex weighted networks,” Proc. Natl. Acad. Sci. U.S.A., Vol. 101, no. 11, pp. 3747–52, 2004.
- D. J. Watts, and S. H. Strogatz, “Collective dynamics of ‘small-world’ networks,” Nature, Vol. 393, no. 6684, pp. 440–2, 1998.
- S. Robertson, “Understanding inverse document frequency: On theoretical arguments for idf,” J. Doc., Vol. 60, no. 5, pp. 503–20, 2004.
- S. Das, S. Muhuri, S. Chakraborty, and S. Biswas, “Graph based keyword extraction for similarity identification among born-digital news contents,” in 2020 11th International Conference on Computing, Communication and Networking Technologies (ICCCNT). IEEE, 2020, pp. 1–7.
- P. Willett, “The porter stemming algorithm: Then and now,” Program, Vol. 40, no. 3, pp. 219–23, 2006.