An Efficient Technique for Protein Sequence Clustering and Classification

  • Authors:
  • P. A. Vijaya;M. Narasimha Murty;D. K. Subramanian

  • Affiliations:
  • Indian Institute of Science, Bangalore, India;Indian Institute of Science, Bangalore, India;Indian Institute of Science, Bangalore, India

  • Venue:
  • ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a technique to reduce time and space during protein sequence clustering and classification is presented. During training and testing phase, the similarity score value between a pair of sequences is determined by selecting a portion of the sequence instead of the entire sequence.It is like selecting a subset of features for sequence data sets.The experimental results of the proposed method shows that the classification accuracy (CA) using the prototypes generated/used do not degrade much but the training and testing time are reduced significantly. Thus the experimental results indicate that the similarity score need not be calculated by considering the entire length of the sequence for achieving a good CA.Even space requirement is reduced during execution phase.We have tested this using K-medians, Supervised K-medians and Nearest Neighbour Classifier (NNC) techniques.