19 research outputs found

    Keyphrase distance analysis technique from news articles as a feature for keyphrase extraction: An unsupervised approach

    Get PDF
    Due to the rapid expansion of information and online sources, automatic keyphrase extraction remains an important and challenging problem in the field of current study. The use of keyphrases is extremely beneficial for many tasks, including information retrieval (IR) systems and natural language processing (NLP). It is essential to extract the features of those keyphrases for extracting the most significant keyphrases as well as summarizing the texts to the highest standard. In order to analyze the distance between keyphrases in news articles as a feature of keyphrases, this research proposed a region-based unsupervised keyphrase distance analysis (KDA) technique. The proposed method is broken down into eight steps: gathering data, data preprocessing, data processing, searching keyphrases, distance calculation, averaging distance, curve plotting, and lastly, the curve fitting technique. The proposed approach begins by gathering two distinct datasets containing the news items, which are then used in the data preprocessing step, which makes use of a few preprocessing techniques. This preprocessed data is then employed in the data processing phase, where it is routed to the keyphrase searching, distance computation, and distance averaging phases. Finally, the curve fitting method is used after applying a curve plotting analysis. These two benchmark datasets are then used to evaluate and test the performance of the proposed approach. The proposed approach is then contrasted with different approaches to show how effective, advantageous, and significant it is. The results of the evaluation also proved that the proposed technique considerably improved the efficiency of keyphrase extraction techniques. It produces an F1-score value of 96.91% whereas its present keyphrases are 94.55%

    Keyphrases Frequency Analysis from Research Articles: A Region-Based Unsupervised Novel Approach

    Get PDF
    Due to the advancement of technology and the exponential proliferation of digital sources and textual data, the extraction of high-quality keyphrases and the summarizing of content at a high standard has become increasingly difficult in current research. Extracting high-quality keyphrases and summing texts at a high level demands the use of keyphrase frequency as a feature for keyword extraction, which is becoming more popular. This article proposed a novel unsupervised keyphrase frequency analysis (KFA) technique for feature extraction of keyphrases that is corpus-independent, domain-independent, language-agnostic, and length-free documents, and can be used by supervised and unsupervised algorithms. This proposed technique has five essential phases: data acquisition; data pre-processing; statistical methodologies; curve plotting analysis; and curve fitting technique. First, the technique begins by collecting five different datasets from various sources and then feeding those datasets into the data pre-processing phase using text pre-processing techniques. The preprocessed data is then transmitted to the region-based statistical process, followed by the curve plotting phase, and finally, the curve fitting approach. Afterward, the proposed technique is tested and assessed using five (5) standard datasets. Then, the proposed technique is compared with our recommended systems to prove its efficacy, benefits, and significance. Finally, the experimental findings indicate that the proposed technique effectively analyses the keyphrase frequency from articles and delivers the keyphrase frequency of 70.63% in 1st region and 10.74% in 2nd region of the total present keyphrase frequency

    A New Unsupervised Technique to Analyze the Centroid and Frequency of Keyphrases from Academic Articles

    Get PDF
    Automated keyphrase extraction is crucial for extracting and summarizing relevant information from a variety of publications in multiple domains. However, the extraction of good-quality keyphrases and the summarising of information to a good standard have become extremely challenging in recent research because of the advancement of technology and the exponential development of digital sources and textual information. Because of this, the usage of keyphrase features for keyphrase extraction techniques has recently gained tremendous popularity. This paper proposed a new unsupervised region-based keyphrase centroid and frequency analysis technique, named the KCFA technique, for keyphrase extraction as a feature. Data/datasets collection, data pre-processing, statistical methodologies, curve plotting analysis, and curve fitting technique are the five main processes in the proposed technique. To begin, the technique collects multiple datasets from diverse sources, which are then input into the data pre-processing step by utilizing some text pre-processing processes. Afterward, the region-based statistical methodologies receive the pre-processed data, followed by the curve plotting examination and, lastly, the curve fitting technique. The proposed technique is then tested and evaluated using ten (10) best-accessible benchmark datasets from various disciplines. The proposed approach is then compared to our available methods to demonstrate its efficacy, advantages, and importance. Lastly, the results of the experiment show that the proposed method works well to analyze the centroid and frequency of keyphrases from academic articles. It provides a centroid of 706.66 and a frequency of 38.95% in the first region, 2454.21 and 7.98% in the second region, for a total frequency of 68.11

    On secrecy performance of mixed generalized Gamma and MƔlaga RF-FSO variable gain relaying channel

    Get PDF
    The emergence of an array of new wireless networks has led researchers to evaluate the prospect of utilizing the physical properties of the wireless medium in order to design secure systems. In this paper, the physical layer secrecy performance of a mixed radio frequency-free space optical (RF-FSO) system with variable gain relaying scheme is investigated in the presence of an eavesdropper. We assume that the eavesdropper can wiretap the transmitted confidential data from the RF link only. It is further assumed that the main and eavesdropper RF links are modeled as generalized Gamma (GG) fading channel, and the free space optical (FSO) link experiences MƔlaga turbulence with pointing error impairment. Our primary concern is to protect this confidential information from being wiretapped. Besides pointing error, the atmospheric turbulence and two types of detection techniques (i.e. heterodyne detection and intensity modulation with direct detection) are also taken into consideration. Utilizing amplify-and-forward (AF) scheme, the novel mathematical closed-form expressions for average secrecy capacity, lower bound of secrecy outage probability, and strictly positive secrecy capacity are derived. As both the links (RF and FSO) undergo generalized fading channels, the derived expressions are also general. We present a unification of some existing works utilizing the proposed model to better clarify the novelty of this work. Finally, all the derived expressions are justified via Monte-Carlo simulations

    An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks

    No full text
    Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster headā€™s role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranksā€™ information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime

    Blockchain Security Attacks, Challenges, and Solutions for the Future Distributed IoT Network

    No full text
    Blockchain technology is becoming increasingly attractive to the next generation, as it is uniquely suited to the information era. Blockchain technology can also be applied to the Internet of Things (IoT). The advancement of IoT technology in various domains has led to substantial progress in distributed systems. Blockchain concept requires a decentralized data management system for storing and sharing the data and transactions in the network. This paper discusses the blockchain concept and relevant factors that provide a detailed analysis of potential security attacks and presents existing solutions that can be deployed as countermeasures to such attacks. This paper also includes blockchain security enhancement solutions by summarizing key points that can be exploited to develop various blockchain systems and security tools that counter security vulnerabilities. Finally, the paper discusses open issues relating to and future research directions of blockchain-IoT systems

    CoAR: Congestion-Aware Routing Protocol for Low Power and Lossy Networks for IoT Applications

    No full text
    The IPv6 routing protocol for low power and lossy networks (RPL) was designed to satisfy the requirements of a wide range of Internet of Things (IoT) applications, including industrial and environmental monitoring. In most scenarios, different from an ordinary environment, the industrial monitoring system under emergency scenarios needs to not only periodically collect the information from the sensing region, but also respond rapidly to some unusual situations. In the monitoring system, particularly when an event occurs in the sensing region, a surge of data generated by the sensors may lead to congestion at parent node as data packets converge towards the root. Congestion problem degrades the network performance that has an impact on quality of service. To resolve this problem, we propose a congestion-aware routing protocol (CoAR) which utilizes the selection of an alternative parent to alleviate the congestion in the network. The proposed mechanism uses a multi-criteria decision-making approach to select the best alternative parent node within the congestion by combining the multiple routing metrics. Moreover, the neighborhood index is used as the tie-breaking metric during the parent selection process when the routing score is equal. In order to determine the congestion, CoAR adopts the adaptive congestion detection mechanism based on the current queue occupancy and observation of present and past traffic trends. The proposed protocol has been tested and evaluated in different scenarios in comparison with ECRM and RPL. The simulation results show that CoAR is capable of dealing successfully with congestion in LLNs while preserving the required characteristics of the IoT applications

    An Eccentricity Based Data Routing Protocol with Uniform Node Distribution in 3D WSN

    No full text
    Due to nonuniform node distribution, the energy consumption of nodes are imbalanced in clustering-based wireless sensor networks (WSNs). It might have more impact when nodes are deployed in a three-dimensional (3D) environment. In this regard, we propose the eccentricity based data routing (EDR) protocol in a 3D WSN with uniform node distribution. It includes network partitions called 3D subspaces/clusters of equal member nodes, an energy-efficient routing centroid (RC) nodes election and data routing algorithm. The RC nodes election conducts in a quasi-static nature until a certain period unlike the periodic cluster heads election of typical clustering-based routing. It not only reduces the energy consumption of nodes during the election phase, but also in intra-communication. At the same time, the routing algorithm selects a forwarding node in such a way that balances the energy consumption among RC nodes and reduces the number of hops towards the sink. The simulation results validate and ensure the performance supremacy of the EDR protocol compared to existing protocols in terms of various metrics such as steady state and network lifetime in particular. Meanwhile, the results show the EDR is more robust in uniform node distribution compared to nonuniform

    Use of Machine Learning in Air Pollution Research: A Bibliographic Perspective

    No full text
    This research is an attempt to examine the recent status and development of scientific studies on the use of machine learning algorithms to model air pollution challenges. This study uses the Web of Science database as a primary search engine and covers over 900 highly peer-reviewed articles in the period 1990ā€“2022. Papers published on these topics were evaluated using the VOSViewer and biblioshiny software to identify and visualize significant authors, key trends, nations, research publications, and journals working on these issues. The findings show that research grew exponentially after 2012. Based on the survey, ā€œparticulate matterā€ is the highly occurring keyword, followed by ā€œpredictionā€. Papers published by Chinese researchers have garnered the most citations (2421), followed by papers published in the United States of America (2256), and England (722). This study assists scholars, professionals, and global policymakers in understanding the current status of the research contribution on ā€œair pollution and machine learningā€ as well as identifying the relevant areas for future research
    corecore