Anjana Pandey
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Anjana Pandey has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Sachin Goyal
Department of Information Technology, UIT, RGPV, Bhopal, India
4 shared publications - Mahesh Pawar
University Institute of Technology, Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal, India
3 shared publications - Chetan Agrawal
UIT-RGPV
2 shared publications - Garima Mathur
Sagar Institute of Science and Technology, India
2 shared publications Pawan Meena Research Scholar
University Institute of Technology, RGPV
2 shared publications- Pawan Meena
Department of Computer Science and Engineering , UIT, RGPV, Bhopal , India
1 shared publication
Latest Publications
- 25 May 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (2) , 5813-5835
A review on blockchain for DNA sequence: security issues, application in DNA classification, challenges and future trends
In biological science, the study of DNA sequences is considered an important factor because it carries the genomic details that can be used by researchers and doctors for the early prediction of disease using DNA classification. The NCBI has the world's largest database of genetic sequences, but the security of this massive amount of data is currently the greatest issue. One of the options is to encrypt these genetic sequences using blockchain technology. As a result, this paper presents a survey on healthcare data breaches, the necessity for blockchain in healthcare, and the number of research studies done in this area. In addition, the report suggests DNA sequence classification for earlier disease identification and evaluates previous work in the field.
- 25 May 2023
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 83 (2) , 5813-5835
A review on blockchain for DNA sequence: security issues, application in DNA classification, challenges and future trends
In biological science, the study of DNA sequences is considered an important factor because it carries the genomic details that can be used by researchers and doctors for the early prediction of disease using DNA classification. The NCBI has the world's largest database of genetic sequences, but the security of this massive amount of data is currently the greatest issue. One of the options is to encrypt these genetic sequences using blockchain technology. As a result, this paper presents a survey on healthcare data breaches, the necessity for blockchain in healthcare, and the number of research studies done in this area. In addition, the report suggests DNA sequence classification for earlier disease identification and evaluates previous work in the field.
- Open Access
- 14 March 2023
- Published by Springer Nature in Research Square
Graph Convolutional Networks based Non-Negative Matrix Factorization aware Community detection
Nonnegative matrix factorization (NMF) is widely used in community discovery because of its effectiveness and easy interpretability. However, most of the existing NMF-based community detection methods are linear. They cannot effectively deal with the nonlinear characteristics of complex networks, resulting in further improvement in community detection performance. Aiming at this problem, a convolution graph network (GCN) enhanced nonlinear NMF community discovery method NMFGCN is proposed. NMFGCN consists of two main modules: GCN and NMF, where GCN is used to learn network node representations, and NMF uses node representations as input to obtain network community representations. In addition, a joint optimization method is proposed to train NMFGCN, which enables NMFGCN to have nonlinear feature representation capabilities and enables GCN and NMF to promote each other and obtain better community segmentation results. Many experiments on artificial synthetic networks and entire networks show that NMFGCN is superior to current NMF-based community discovery methods , thus proving that NMFGCN can improve the performance of NMF community discovery methods. In addition, NMFGCN also outperforms Deep Walk and LINE standard graph representation learning methods.
- 14 March 2023
- Published by Springer Nature in Research Square
Open AccessGraph Convolutional Networks based Non-Negative Matrix Factorization aware Community detection
Nonnegative matrix factorization (NMF) is widely used in community discovery because of its effectiveness and easy interpretability. However, most of the existing NMF-based community detection methods are linear. They cannot effectively deal with the nonlinear characteristics of complex networks, resulting in further improvement in community detection performance. Aiming at this problem, a convolution graph network (GCN) enhanced nonlinear NMF community discovery method NMFGCN is proposed. NMFGCN consists of two main modules: GCN and NMF, where GCN is used to learn network node representations, and NMF uses node representations as input to obtain network community representations. In addition, a joint optimization method is proposed to train NMFGCN, which enables NMFGCN to have nonlinear feature representation capabilities and enables GCN and NMF to promote each other and obtain better community segmentation results. Many experiments on artificial synthetic networks and entire networks show that NMFGCN is superior to current NMF-based community discovery methods , thus proving that NMFGCN can improve the performance of NMF community discovery methods. In addition, NMFGCN also outperforms Deep Walk and LINE standard graph representation learning methods.
- Open Access
- 14 March 2023
- Published by Springer Nature in Research Square
Social Theory Aware Influence Maximization Approach for Target Community Detection
Targeted community detection is a network analysis involving identifying specific subsets or clusters of nodes (communities) within a more extensive network that are particularly relevant to a topic or phenomenon. Unlike traditional community detection methods, which aim to identify all communities within a network, targeted community detection methods focus on finding a specific community or set of communities based on some pre-defined criteria. Nevertheless, all previous effort either mainly disregards the external effect of the community or is not ”goal-based,” i.e., inappropriate for the goal request. To address this issue, we present an attribute network-oriented target community discovery technique that blends user interest preferences and community influence to mine high-quality communities associated with user preferences and have the most influence. To capture the attribute subspace weight of the possible target community and mine user preferences, the greatest k-cluster, including sample nodes, is first mined as the core of the potential target community by synthesising the node structure and attribute information. Then the fusion of the maximum k-cluster with the sample nodes is mined as the core of the potential target community. Finally, the fusion of the sample nodes defines the community’s external influence score quantifica-tion technique and combines the community quality function value with the exterior influence score. Finally, all possible target communities are ranked by their influence score. As a result, the communities with the highest overall quality become the target communities. In addition, a 2-fold pruning procedure is intended to increase the method’s performance and efficiency while calculating the attribute subspace weights of the largest k-cluster. Experimental results on synthetic and actual network datasets validate the efficiency and efficacy of the suggested strategy.
- 14 March 2023
- Published by Springer Nature in Research Square
Open AccessSocial Theory Aware Influence Maximization Approach for Target Community Detection
Targeted community detection is a network analysis involving identifying specific subsets or clusters of nodes (communities) within a more extensive network that are particularly relevant to a topic or phenomenon. Unlike traditional community detection methods, which aim to identify all communities within a network, targeted community detection methods focus on finding a specific community or set of communities based on some pre-defined criteria. Nevertheless, all previous effort either mainly disregards the external effect of the community or is not ”goal-based,” i.e., inappropriate for the goal request. To address this issue, we present an attribute network-oriented target community discovery technique that blends user interest preferences and community influence to mine high-quality communities associated with user preferences and have the most influence. To capture the attribute subspace weight of the possible target community and mine user preferences, the greatest k-cluster, including sample nodes, is first mined as the core of the potential target community by synthesising the node structure and attribute information. Then the fusion of the maximum k-cluster with the sample nodes is mined as the core of the potential target community. Finally, the fusion of the sample nodes defines the community’s external influence score quantifica-tion technique and combines the community quality function value with the exterior influence score. Finally, all possible target communities are ranked by their influence score. As a result, the communities with the highest overall quality become the target communities. In addition, a 2-fold pruning procedure is intended to increase the method’s performance and efficiency while calculating the attribute subspace weights of the largest k-cluster. Experimental results on synthetic and actual network datasets validate the efficiency and efficacy of the suggested strategy.
- 10 November 2022
- Published by Springer Nature
- p. 11-26
Process of Recognition of Plant Diseases by Using Hue Histogram, K-Means Clustering and Forward-Propagation Deep Neural Networks
- 10 November 2022
- Published by Springer Nature
- p. 11-26
Process of Recognition of Plant Diseases by Using Hue Histogram, K-Means Clustering and Forward-Propagation Deep Neural Networks
- 12 October 2022
- Published by Springer Nature
- p. 683-693
A Machine Learning Method for Customer Sentiment Analysis on Social Media
- 12 October 2022
- Published by Springer Nature
- p. 683-693
A Machine Learning Method for Customer Sentiment Analysis on Social Media
- 25 June 2022
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (10) , 13869-13885
A comprehensive tool for rapid and accurate prediction of disease using DNA sequence classifier
In the current pandemic situation where the coronavirus is spreading very fast that can jump from one human to another. Along with this, there are millions of viruses for example Ebola, SARS, etc. that can spread as fast as the coronavirus due to the mobilization and globalization of the population and are equally deadly. Earlier identification of these viruses can prevent the outbreaks that we are facing currently as well as can help in the earlier designing of drugs. Identification of disease at a prior stage can be achieved through DNA sequence classification as DNA carries most of the genetic information about organisms. This is the reason why the classification of DNA sequences plays an important role in computational biology. This paper has presented a solution in which samples collected from NCBI are used for the classification of DNA sequences. DNA sequence classification will in turn gives the pattern of various diseases; these patterns are then compared with the samples of a newly infected person and can help in the earlier identification of disease. However, feature extraction always remains a big issue. In this paper, a machine learning-based classifier and a new technique for extracting features from DNA sequences based on a hot vector matrix have been proposed. In the hot vector representation of the DNA sequence, each pair of the word is represented using a binary matrix which represents the position of each nucleotide in the DNA sequence. The resultant matrix is then given as an input to the traditional CNN for feature extraction. The results of the proposed method have been compared with 5 well-known classifiers namely Convolution neural network (CNN), Support Vector Machines (SVM), K-Nearest Neighbor (KNN) algorithm, Decision Trees, Recurrent Neural Networks (RNN) on several parameters including precision rate and accuracy and the result shows that the proposed method gives an accuracy of 93.9%, which is highest compared to other classifiers.
- 25 June 2022
- Published by Springer Nature in Journal of Ambient Intelligence and Humanized Computing
- Vol. 14 (10) , 13869-13885
A comprehensive tool for rapid and accurate prediction of disease using DNA sequence classifier
In the current pandemic situation where the coronavirus is spreading very fast that can jump from one human to another. Along with this, there are millions of viruses for example Ebola, SARS, etc. that can spread as fast as the coronavirus due to the mobilization and globalization of the population and are equally deadly. Earlier identification of these viruses can prevent the outbreaks that we are facing currently as well as can help in the earlier designing of drugs. Identification of disease at a prior stage can be achieved through DNA sequence classification as DNA carries most of the genetic information about organisms. This is the reason why the classification of DNA sequences plays an important role in computational biology. This paper has presented a solution in which samples collected from NCBI are used for the classification of DNA sequences. DNA sequence classification will in turn gives the pattern of various diseases; these patterns are then compared with the samples of a newly infected person and can help in the earlier identification of disease. However, feature extraction always remains a big issue. In this paper, a machine learning-based classifier and a new technique for extracting features from DNA sequences based on a hot vector matrix have been proposed. In the hot vector representation of the DNA sequence, each pair of the word is represented using a binary matrix which represents the position of each nucleotide in the DNA sequence. The resultant matrix is then given as an input to the traditional CNN for feature extraction. The results of the proposed method have been compared with 5 well-known classifiers namely Convolution neural network (CNN), Support Vector Machines (SVM), K-Nearest Neighbor (KNN) algorithm, Decision Trees, Recurrent Neural Networks (RNN) on several parameters including precision rate and accuracy and the result shows that the proposed method gives an accuracy of 93.9%, which is highest compared to other classifiers.
- 27 April 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (8) , 1893-1912
Comparative Analysis of Overlap Community Detection Techniques on Social Media Platform
- 27 April 2022
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 66 (8) , 1893-1912
Comparative Analysis of Overlap Community Detection Techniques on Social Media Platform
- 19 March 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (17) , 24199-24223
Fake news detection system based on modified bi-directional long short term memory
- 19 March 2022
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 81 (17) , 24199-24223
Fake news detection system based on modified bi-directional long short term memory