R. Visakh
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
R. Visakh has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- K. A. Abdul Nazeer
Department of Computer Science and Engineering, National Institute of Technology Calicut, Calicut 673601, Kerala, India
3 shared publications B. Mohammed Siyad
Dept. of Computer Science and Engg National Institute of Technology Calicut, Kerala - 673 601, India
1 shared publicationBabu P. Uday
Rajagiri School of Engineering & Technology, Kochi, India
1 shared publicationK. A. Abdul Nazeer
Dept. of Computer Science and Engg National Institute of Technology Calicut, Kerala - 673 601, India
1 shared publicationTintu Devasia
1 shared publication
Latest Publications
- 1 February 2018
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 72, 87-95
DEEPAligner: Deep encoding of pathways to align epigenetic signatures
- 1 February 2018
- Published by Elsevier in Computational Biology and Chemistry
- Vol. 72, 87-95
DEEPAligner: Deep encoding of pathways to align epigenetic signatures
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Disease prediction using optimal feature selection from epigenetic data
Epigenetic changes are identified to correlate with gene expression changes among numerous diseases including cancer. Although integrated data analysis tools are available, a quantitative model that precisely predicts the diseases from epigenetic information is still in its infancy. In this paper, a data mining approach is presented for predicting a disease using the most relevant genes (treated as features) associated with it. A few existing feature selection methods have been applied independently and their results combined to form a fused feature set. For selecting the optimal set of genes from them, a genetic algorithm based evolutionary approach is proposed. They have been applied to a classifier for recognizing the disease from a set of reference samples. A key observation from our analysis is that the optimization using genetic algorithm gives better prediction accuracy than the existing methods. Hence the proposed optimal fusion based feature selection can be effectively applied for better disease diagnosis and prognosis.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Disease prediction using optimal feature selection from epigenetic data
Epigenetic changes are identified to correlate with gene expression changes among numerous diseases including cancer. Although integrated data analysis tools are available, a quantitative model that precisely predicts the diseases from epigenetic information is still in its infancy. In this paper, a data mining approach is presented for predicting a disease using the most relevant genes (treated as features) associated with it. A few existing feature selection methods have been applied independently and their results combined to form a fused feature set. For selecting the optimal set of genes from them, a genetic algorithm based evolutionary approach is proposed. They have been applied to a classifier for recognizing the disease from a set of reference samples. A key observation from our analysis is that the optimization using genetic algorithm gives better prediction accuracy than the existing methods. Hence the proposed optimal fusion based feature selection can be effectively applied for better disease diagnosis and prognosis.
- 1 July 2016
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 76, 160-167
Identifying epigenetically dysregulated pathways from pathway–pathway interaction networks
- 1 July 2016
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 76, 160-167
Identifying epigenetically dysregulated pathways from pathway–pathway interaction networks
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 423-426
Integrating Encryption Technique in Authentication of Multicast Protocol for Ad-Hoc Networks
Ad-hoc networks are infrastructure-less and without central administration control, minimal configuration and quick deployment make ad-hoc networks suitable for emergency situations like natural disasters or military conflicts. These applications require multicast data transmissions and the data has to be securely passed through the network to the intended receivers. The techniques that are applied for security should also prevent an opponent from learning the contents of these transmissions. Several authentication protocols have been proposed to improve the security of multicast traffic. But not much work has been done on transmitting the data securely in multicast traffic. In the proposed method symmetric encryption is applied to provide confidentiality along with message authentication codes. The performance of various symmetric algorithms such as AES, DES, 3DES and blowfish to the proposed method is analyzed. Simulation results are given to demonstrate the effectiveness of each algorithm.
- 1 August 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 423-426
Integrating Encryption Technique in Authentication of Multicast Protocol for Ad-Hoc Networks
Ad-hoc networks are infrastructure-less and without central administration control, minimal configuration and quick deployment make ad-hoc networks suitable for emergency situations like natural disasters or military conflicts. These applications require multicast data transmissions and the data has to be securely passed through the network to the intended receivers. The techniques that are applied for security should also prevent an opponent from learning the contents of these transmissions. Several authentication protocols have been proposed to improve the security of multicast traffic. But not much work has been done on transmitting the data securely in multicast traffic. In the proposed method symmetric encryption is applied to provide confidentiality along with message authentication codes. The performance of various symmetric algorithms such as AES, DES, 3DES and blowfish to the proposed method is analyzed. Simulation results are given to demonstrate the effectiveness of each algorithm.
- 1 November 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 224-229
Using Self-Organizing Maps in constrained ensemble clustering framework
Clustering is a predominant data mining task which attempts to partition a group of unlabelled data instances into distinct clusters. The clusters so obtained will have maximum intra-cluster similarity and minimum inter-cluster similarity. Several clustering techniques have been proposed in literature, which includes stand-alone as well as ensemble clustering techniques. Most of them lack robustness and suffer from an important drawback that they cannot effectively visualize clustering results to help knowledge discovery and constructive learning. Recently, clustering techniques via visualization of data have been proposed. These rely on building a Self Organizing Map (SOM) originally proposed by Kohonen. Even though Kohonen SOM preserves topology of the input data, it is widely observed that the clustering accuracy achieved by SOM is poor. To perform robust and accurate clustering using SOM, a cluster ensemble framework based on input constraints is proposed in this paper. Cluster ensemble is a set of clustering solutions obtained as a result of individual clustering on subsets of the original high-dimensional data. The final consensus matrix is fed to a neural network which transforms the input data to a lower-dimensional output map. The map clearly depicts the distribution of input data instances into clusters.
- 1 November 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21647143,p. 224-229
Using Self-Organizing Maps in constrained ensemble clustering framework
Clustering is a predominant data mining task which attempts to partition a group of unlabelled data instances into distinct clusters. The clusters so obtained will have maximum intra-cluster similarity and minimum inter-cluster similarity. Several clustering techniques have been proposed in literature, which includes stand-alone as well as ensemble clustering techniques. Most of them lack robustness and suffer from an important drawback that they cannot effectively visualize clustering results to help knowledge discovery and constructive learning. Recently, clustering techniques via visualization of data have been proposed. These rely on building a Self Organizing Map (SOM) originally proposed by Kohonen. Even though Kohonen SOM preserves topology of the input data, it is widely observed that the clustering accuracy achieved by SOM is poor. To perform robust and accurate clustering using SOM, a cluster ensemble framework based on input constraints is proposed in this paper. Cluster ensemble is a set of clustering solutions obtained as a result of individual clustering on subsets of the original high-dimensional data. The final consensus matrix is fed to a neural network which transforms the input data to a lower-dimensional output map. The map clearly depicts the distribution of input data instances into clusters.