TextRank Algorithm Research Articles

ONTO-TDM domain ontology population for a specific discipline

Ontologies play a vital role in organizing and constructing knowledge across various domains, enabling effective knowledge management and sharing. The development of domain-specific ontologies, such as the ONTO-TDM ontology for teaching domain modeling, is essential for providing a comprehensive and standardized representation of knowledge within a given discipline. However, to maximize the usefulness and relevance of such ontologies, it is crucial to automate their population with domain-specific information, reducing manual work and ensuring scalability. This paper presents a novel method for ontology population by extracting and integrating relevant information from diverse sources. The method combines the TextRank algorithm with Word2Vec to enhance keyword extraction, capturing both semantic meaning and textual importance. Keywords are then annotated and used to train a machine learning classifier, which aids in integrating new instances into the ontology. Experiments show that the proposed method achieves a precision of 63.33%, a recall of 61.29% and an F1-score of 62.28%, significantly improving keyword extraction and ontology population accuracy compared to existing methods. This validates the method’s effectiveness in semi-automatically extracting relevant instances from diverse data sources, enhancing the efficiency and accuracy of ontology population, and advancing automated knowledge management in domain-specific contexts.

Fast Hybrid Approach for Thai News Summarization

News summarization presents a significant challenge in Natural Language Processing (NLP). Lengthy news articles not only consume valuable time but also lead to confusion regarding key points. The ideal news summarization should swiftly produce a succinct summary while retaining the essence of the information conveyed by the news writer. While intelligent chatbots like ChatGPT and Gemini offer user-friendly text summarization, their embedded Large Language Model (LLM) cannot be downloaded for private use. Moreover, implementing them in a business process can be expensive, both in terms of pay-per-use costs and response time. The objective of this research is to develop a private Thai news summarization that effectively extracts sentences encapsulating the main idea and abstractly summarizes them. The proposed model consists of two components. The first extracts a contiguous region containing important sentences using the TextRank algorithm, while the second employs the finetuned mBART as an LLM to generate the abstractive summary from the previously extracted sentences. In other words, the proposed model extracts an important news region before passing it to mBART. This approach produces a news summary with key information and a syntactic style akin to the natural Thai language. We evaluate the summarization quality by ROUGE scores and BERTScore (precision, recall, and F1-score). The evaluation metrics Experimental results on the ThaiSum dataset show relatively high ROUGE scores and BERTScore for the proposed model compared to most of the other approaches. Furthermore, it significantly reduces the runtime, keeping it within a reasonable limit.

Keyword Extraction in Arabic and English using Page Rank Algorithm

This paper shows a comparison in applying TextRank algorithm for keyword extraction to English and Arabic Text. TextRank algorithm is applied by constructing a graph whose vertices that are formed by candidate words extracted from the title and the abstract of the given Arabic and English after applying a tagging filter to that text to decide the importance of vertices within that graph.

Optimized automated testing: test case generation and maintenance using latent semantic analysis-based TextRank and particle swarm optimization algorithms

Software development would have to include automated testing to ensure the finished product and performs as intended. However, the process of Test Case Generation and Maintenance can be time-consuming and error-prone, especially when manual methods are used. This research proposes a new approach to improve the efficiency and accuracy of automated testing using latent semantic analysis (LSA)-based TextRank (TR) and particle swarm optimization (PSO) algorithms. The study aims to evaluate the effectiveness of these algorithms in generating and optimizing test cases based on requirements analysis. To retrieve key information from the criteria, methods including text classification (TC), named entity recognition (NER), and sentiment analysis (SA) are used to evaluate the text. Test cases are then generated using LSA-based TR for text summarization and PSO for optimization. The aim of this work is to identify any limitations that need to be addressed and to evaluate the overall efficiency and accuracy of automated testing (AT) using proposed algorithms. The results of this research are expected to have important implications for the software industry, helps to improve the overall efficiency and accuracy of AT. The findings could guide future research that led to the creation of more advanced and effective tools for AT.

Adjusted TextRank for keyword extraction in petrochemical project correspondence documents

A large petrochemical construction project is typically executed by multiple parties, all bound by contract agreement. During the execution phase, issues and problems may arise because the work details are not clearly specified in the contractual agreement. These issues are formally communicated and documented through written correspondence letters. By identifying important keywords within these formal letters, a comprehensive narrative of the project, including its associated issues, can be identified and analyzed. In this research, we introduce an adjusted TextRank algorithm that integrates external features from the Indonesian FastText language model and term frequency-inverse document frequency (TF-IDF) scores to identify important keywords within a dataset of correspondence letters of petrochemical projects. This enhancement involves refining phrase detection, semantic relationship estimation between words, and part-of-speech (POS) identification for words or phrases. Our results show that the proposed adjustments result in improved evaluation scores compared to the baseline standard TextRank and standard TF-IDF, respectively by 24.1% and 25% in terms of F-1 scores.

인천 관광지의 속성별 평가를 위한 딥러닝 기반 감성분석

This study applied the IPA(importance-performance analysis) methodology to unstructured text data to evaluate tourists' satisfaction levels with Incheon attractions. Focusing on attractions within the maintenance and improvement-needed areas identified by IPA, it extracted key positive and negative keywords and sentences directly from tourists' opinions. By applying a text-based approach to evolving IPA research, this exploratory study assessed the concrete satisfaction and dissatisfaction elements felt by tourists. The study limited its scope to 15 Incheon attractions and analyzed 114,007 sentences from Naver blogs written by tourists. Satisfaction levels were derived through deep learning sentiment analysis of the text, while the importance of each attraction was determined by the TF-IDF(term frequency-inverse document frequency) ratio of the attraction names in the text categorized by attributes such as attraction, transportation, activities, and food/drink. Key positive and negative keywords and sentences were extracted using the TextRank algorithm, focusing on attractions in the maintenance and improvementneeded areas. The findings reveal that experiential elements of attractions act as differentiating factors, while their absence can provoke negative reactions from tourists. Moreover, content reflecting local culture and history, the development of family-friendly experiential attractions, parking space expansion, and food service improvements emerged as crucial elements for attraction development.

Graphs in clusters: a hybrid approach to unsupervised extractive long document summarization using language models

Effective summarization of long documents is a challenging task. When addressing this challenge, Graph and Cluster-Based methods stand out as effective unsupervised solutions. Graph-Based Unsupervised methods are widely employed for summarization due to their success in identifying relationships within documents. Cluster-Based methods excel in minimizing redundancy by grouping similar content together before generating a concise summary. Therefore, this paper merges Cluster-Based and Graph-Based methods by applying language models for Unsupervised Extractive Summarization of long documents. The approach simultaneously extracts key information while minimizing redundancy. First, we use BERT-based sentence embeddings to create sentence clusters using k-means clustering and select the optimum number of clusters using the elbow method to ensure that sentences are categorized based on their semantic similarities. Then, the TextRank algorithm is employed within each cluster to rank sentences based on their importance and representativeness. Finally, the total similarity score of the graph is used to rank the clusters and eliminate less important sentence groups. Our method achieves comparable or better summary quality and reduced redundancy compared to both individual Cluster-Based and Graph-Based methods, as well as other supervised and Unsupervised baseline models across diverse datasets.

DEVELOPING A COMPREHENSIVE LIVE NEWS AGGREGATOR: INTEGRATING REAL-TIME DATA SOURCES FOR ENHANCED INFORMATION ACCESSIBILITY

Abstract—News Aggregator is simply an online software which collects new stories and events around the world from various sources all in one place. News aggregator plays a very important role in reducing time consumption, as all of the news that would be explored through more than one website will be placed only in a single location. Also, summarizing this aggregated content absolutely will save reader’s time. A proposed technique used called the TextRank algorithm that showed promising results for summarization. This paper presents the main goal of this project which is developing a news aggregator able to aggregate relevant articles of a certain input keyword or key-phrase. Summarizing the relevant articles after enhancing the text to give the reader understandable and efficient summary. Index Term : News aggregator; text summarization; text enhancement; TextRank algorithm

EASESUM: an online abstractive and extractive text summarizer using deep learning technique

<div align="center"><table width="590" border="1" cellspacing="0" cellpadding="0"><tbody><tr><td valign="top" width="387"><p class="CM12">Large volumes of information are generated daily, making it challenging to manage such information. This is due to redundancy and the type of data available, most of which needs to be more structured and increases the amount of search time. Text summarization systems are considered a real solution to this vast amount of data because they are used for document compression and reduction. Text summarization keeps the relevant information and eliminates the text's non-relevant parts. This study uses two types of summarizers: Extractive Text summarizers and Abstractive text summarizers. The Text Rank Algorithm was used to implement the Extractive summarizer, while Bi-directional Recurrent Neural Network (RNN) was used to implement the Abstractive text summarizer. To improve the quality of summaries produced, word embedding was also used. For the evaluation of the summarizers, the ROUGE evaluation system was used. ROUGE contrasts summaries created by hand versus those created automatically. ROUGE examination of the produced summary revealed the superiority of human-produced summaries over those generated automatically. For this paper, a summarizer was implemented as a Web Application. The average ROUGE recall score ranging from 30.00 to 60.00 for abstractive summarizer and 0.75 to 0.82 for extractive text showed an encouraging result.</p></td></tr></tbody></table></div>

DETECTION OF ANDROID BOTNETS

In the dynamic landscape of cybersecurity, the persistent proliferation of botnets remains a formidable challenge. Conventional detection methods often grapple with elevated false positive rates and struggle to keep pace with the evolving tactics employed by malicious actors. This study delves into the domain of botnet detection, with a primary focus on refining the identification process for HTTP-based botnets. Our approach harnesses the power of K-Nearest Neighbors (KNN) and Logistic Regression algorithms, strategically amalgamating their capabilities to navigate the intricate digital terrain. Departing from prior studies, we directly confront the botnet detection challenge by synergizing two robust machine learning techniques. Through the fusion of KNN and Logistic Regression, our system achieves unparalleled accuracy and efficiency in discerning HTTP botnet activities. Furthermore, this research pioneers a groundbreaking methodology for botnet detection, centering around the innovative fusion of TFIDF and Textrank algorithms. This hybrid approach significantly bolsters the precision of information extraction and summarization. In an age inundated with vast digital datasets, our method adeptly sifts through information while furnishing concise and relevant summaries, thereby conserving invaluable time and resources. The distinctive aspect of our approach lies in its ability to swiftly adapt to emerging botnet strategies. Through extensive testing and comparative analysis against existing models, our system surpasses prior methodologies, demonstrating its proficiency in accurately identifying botnet activities while minimizing false positives. Furthermore, our solution serves as an exemplar of efficiency, facilitating prompt and effective identification of pernicious botnets that imperil data security Key Words: Botnet Detection, Cybersecurity, K-Nearest Neighbors (KNN), Logistic Regression, TFIDF, Textrank, Information Summarization, Digital Security, Malware Detection.

A Graph-Based Keyword Extraction Method for Academic Literature Knowledge Graph Construction

In this paper, we construct an academic literature knowledge graph based on the relationship between documents to facilitate the storage and research of academic literature data. Keywords are an important type of node in the knowledge graph. To solve the problem that there are no keywords in some documents for several reasons in the process of knowledge graph construction, an improved keyword extraction algorithm called TP-CoGlo-TextRank is proposed by using word frequency, position, word co-occurrence frequency, and a word embedding model. By combining the word frequency and position in the document, the importance of words is distinguished. By introducing the GloVe word-embedding model, which brings the external knowledge of documents into the TextRank algorithm, and combining the internal word co-occurrence frequency in the documents, the word-adjacency relationship is transferred non-uniformly. Finally, the words with the highest scores are combined into phrases if they are adjacent in the original text. The validity of the TP-CoGlo-TextRank algorithm is verified by experiments. On this basis, the Neo4j graph database is used to store and display the academic literature knowledge graph, to provide data support for research tasks such as text clustering, automatic summarization, and question-answering systems.

Text Intelligence Engine: ‘Unleashing the power of Summarization with Machine Learning.’

In the era of exponential growth in online data, the proliferation of online information necessitates effective strategies for text summarization to distill vast amounts of data into concise, digestible insights. This paper presents a comprehensive investigation into text summarization methodologies within the context of a Text Intelligence Engine project, with a primary emphasis on the Text Rank algorithm. Leveraging the principles of graph-based ranking, our approach harnesses the power of Text Rank to identify key concepts and generate coherent summaries. Through meticulous experimentation and rigorous evaluation, we demonstrate the robustness and effectiveness of Text Rank in extracting salient information from diverse textual sources. Furthermore, we explore the integration of Text Rank with machine learning techniques to enhance summarization performance. By elucidating the theoretical foundations and practical applications of Text Rank, this paper contributes to the advancement of text intelligence systems, offering valuable insights and guidelines for researchers and practitioners in the field. Keywords -Natural Language Processing, NLKT, Text Rank Algorithm, Supervised Learning, Random Algorithm, Text summarization, Extractive summarization, Abstractive summarization, Machine learning, SpaCy, Neural networks, Rhetorical structure theory

Knowledge fusion method of power grid model based on Seq2seq half pointer and half label method

Due to the complexity of the calculation process of the existing methods, the efficiency of data fusion of the power grid model is low. In order to improve the knowledge fusion effect of power grid model, this paper studied the knowledge fusion method of power grid model based on Seq2seq half pointer and half label method. The Text Rank algorithm is used to calculate the weight of semantic nodes of each grid model, and combined with the topological potential method, the semantic information of the grid model is extracted according to the final weight value, and the Seq2Seq semi-pointer semi-label model framework is constructed. The data of the scheduling automation system OMS and the production management system PMS are used as input. The extracted candidate mesh model semantics and the original mesh model semantics are encoded by Seq2Seq half-pointer half-label model. The semantic data of the power grid model is fused and sent to the Seq2Seq encoder. After the training is completed, the effective information is extracted from the power grid model through the Seq2Seq model to complete the knowledge fusion of the power grid model. Experimental results show that this method eliminates the redundant part of the basic attributes of each data source in the substation grid model after knowledge fusion, and the description of each basic attribute is more standardized, unified and perfect. Under different mesh model data dimensions, the support of the proposed method is all above 98%. The model trained by the proposed method tends to be stable after 120 iterations, and the precision, recall and F1 of the test set are 0.98, 0.93 and 0.91, respectively. At the same time, this method has high efficiency in the knowledge fusion processing of the power grid model, and its data processing speed is less than 160 s. The average integrity of the private data of the power grid model is 98.86%, indicating that the proposed method can better ensure the integrity of the data. Finally, compared with the application of other methods under different data amounts, the mean square error obtained by the proposed method is the smallest, indicating that the proposed method effectively improves the fusion accuracy.

Perception of good physicians in patient’s face-to-face consultations: Evidence from a Chinese platform

Abstract Objective: This article aimed to offer insights into patients’ expectations regarding the traits of physicians, with the goal of helping physicians gain a better understanding of patient needs and provide better care. Method: This study used a Python crawler script to collect patients’ comments from haodf.com, a major online consultation platform in China, to examine the expected character traits of physicians by patients. A total of 83,315 comments were obtained. We selected positive comments from patients, performed text segmentation using Jieba, and utilized the TextRank algorithm to identify high-ranking words based on the Index of Relative Importance (IRI) within these comments. To make the findings comprehensible and practical for physicians and medical educators, we utilized a word cloud to visualize the results. We classified the high-ranking words into 4 dimensions—professional competence, communication attitude, communication ability, and character traits—based on the categorization of positive physician qualities found in the relevant literature. Results: Key findings from the study included: (1) The top 23 high-ranking words for traits of good physicians (in descending order) were patient, meticulous, proficient, precise, kind, moderate, successful, gentle, rigorous, explicit, clear, effective, humorous, sincere, skilled, kindhearted, modest, awesome, practical (and not flashy), unhurried, experienced, clean, and excellent; (2) patients placed the highest value on the professional competence of physicians, followed by their communication attitude, communication ability, and character traits; (3) despite the highest IRI score for professional competence, it was exceeded by the combined scores of communication attitude and communication ability. This underscored the significance of effective communication in medical encounters. Conclusions: Drawing from these findings, recommendations are proposed for physicians and medical educators to enhance the quality of medical encounters. These suggestions include implementing narrative medicine training to improve communication awareness and skills as well as encouraging lifelong continuing medical education to maintain professional competence among practitioners. This study contributes to the establishment of positive physician-patient relationships in both telemedicine and face-to-face medical interactions.

A Novel Approach to Text Summarization Using Machine Learning

Text summarization is a key strategy in the domains of information retrieval and natural language processing (NLP). Its objective is to reduce a lengthy written document into a clearer, more succinct summary of the information it contains. When a text document is too lengthy or intricate to analyse completely, as in news stories, academic papers, or legal documents, this approach is extremely helpful. The major challenge of text summarising is to take the most important and relevant information from the original text and convey it in an understandable and concise way. In this study, extractive and abstractive summarising techniques are the two primary categories of text summary methods. The paper also presents several algorithms that have been proposed for text summarization, including TextRank, Seq2Seq, and BART. TextRank is a simple and fast algorithm that works well for short documents, Seq2Seq is a deep learning-based approach that generates high-quality summaries, and BART is a transformer-based algorithm that provides the best results on benchmark datasets. The obtained ROUGE Score after passing TextRank, BART, and Seq2SEq algorithm significant also.

Automatic Text Summarization Method Based on Improved TextRank Algorithm and K-Means Clustering

Automatic text summarization is to obtain a summary by compressing the text while retaining its important information. Then users can obtain the important content of the text by reading the summary. In the research literatures, the extraction summary method is widely used and is also one type of the main research methods of summary methods. However, this extraction summary method still has some problems. The selection of the initial cluster center has not been carefully determined, and the sentence redundancy summarized is high in articles with complex sentences. In order to solve the above problems, this paper proposes an automatic text summarization method based on improved TextRank algorithm and K-Means clustering. This method combines the improved BM25 model and the TextRank algorithm to calculate the BM25 similarity between sentences and obtain the TR scores of sentences. The TR scores are used to select the initial center of clustering based on similarity difference judgment and maximum judgment. The final summary is obtained by combining the cluster scores and sentence scores. The experimental results show that the proposed method in this paper has better evaluation indicators containing ROUGE-1, ROUGE-2 and ROUGE-L than other comparison algorithms including Lead-3, TextRank and MBM25EMB on the DUC2004 dataset. In conclusion, the proposed method in this paper improves the accuracy of automatic text summarization and reduce the redundancy from documents.

PENERAPAN ALGORITMA TEXTRANK DALAM MERANGKUM TEKS WORD DAN PDF

This review discusses the implementation of the TextRank algorithm for summarizing Word and PDF texts. Current technology enables rapid information growth but also raises issues regarding the lack of time to delve deeper into information. The TextRank algorithm is a web-based natural language processing method that employs an unsupervised approach and can be used to generate automatic text summaries. The search method used includes text preprocessing and the utilization of the TextRank algorithm. This article also explains how to use Google Colab and Google Drive to execute the TextRank algorithm for summarization. Steps for connecting Google Colab to Google Drive, installing Python libraries, retrieving data from Google Drive, and using the TextRank algorithm are also outlined in this article

Research on the quantitative model of the communication effect of Civic and Political Education for social platform data

Abstract Social platforms have revolutionized the lives of the public, provided a resourceful educational platform for the ideological and political education of college students, and become the distribution center of ideological and political education information and the amplifier of social opinion. In this paper, we concentrate on the dissemination of data related to ideological and political education on social platforms. We start by segmenting the text and then use the IF-IDF algorithm, the Text Rank algorithm, and the LDA theme model to process various text features. Simultaneously, we will employ a sentiment dictionary and simple Bayesian analysis, along with a convolutional neural network, to measure the impact of emotion propagation. The microblogging user’s comment data for the Civics communication emotion analysis concluded that the user group of the initial period of the Civics education activities will produce some negative emotions, while at the same time, the positive emotion has been maintaining an upward trend. While the negative emotions began to decline and slow down, the user group with the highest positive emotion reached a value of 6.35464.

Classification and Value Assessment of Sports Intangible Cultural Heritage Resources Combined with Digital Technology

Abstract This paper is dedicated to designing and constructing a knowledge ontology framework for sports intangible cultural heritage (ICH) resources, aiming to support their preservation and inheritance by integrating and mining sports ICH resources. The study includes the collection of multiple data of sports ICH from various data sources, and constructing ICH knowledge ontology using CIDOC CRM metadata reference model and seven-step method. To enrich the content of the ontology, the TextRank algorithm is used to extract textual critical information and design a domain-specific NER model for sports NRL. In addition, the study adopts the VSM vector space model for text representation and uses an improved hierarchical classification model for text categorization to improve classification accuracy. The study also explores the similarity calculation of concepts in the sports NRM ontology and proposes a semantic similarity calculation formula based on the ontology concepts. Respondents’ willingness to pay was investigated through the conditional value method (CVM) to assess the value of sports NRM tourism resources. Finally, the influencing factors of respondents’ willingness to pay were analyzed using statistical analysis and Logistic regression model, and it was found that they were mainly influenced by the degree of understanding of sports non-heritage resources and the level of education. The results of this study not only provide theoretical and methodological support for the effective integration and excavation of sports non-heritage resources and a new perspective for their protection, inheritance and sustainable development.

Summarization of Software Bug Report based on Sentence Semantic Similarity (SSBRSSS) Technique

In this work, sentence similarity between sentences of software bug report is computed. For this, two methods are utilized, Latent Semantic Analysis and Text Rank. Latent Semantic Analysis is used to compute semantic similarity between sentences of bug reports which infers deeper and hidden relation between words. From this, a pair of sentences with semantic similarity above a set threshold is selected and from one pair of sentences, only one sentence is selected. The remaining sentences are passed into TextRank algorithm and sentences with high similarity are further selected to generate a coherent summary. The proposed approach is evaluated on a newly constructed Apache Project Bug Report Corpus and existing Bug Report Corpus. The proposed approach is also compared with baseline approaches that mainly focus on only lexical similarity. The results when evaluated on Apache project Bug Report Corpus attains an average value of 80%, 72.57%, 76.05% and 76.57% in terms of precision, recall, F-score and pyramid precision respectively.