loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Pattern Recognition (ICPR'04) - Volume 2
An Efficient Technique for Protein Sequence Clustering and Classification
Cambridge UK
August 23-August 26
ISBN: 0-7695-2128-2
P. A. Vijaya, Indian Institute of Science, Bangalore, India
M. Narasimha Murty, Indian Institute of Science, Bangalore, India
D. K. Subramanian, Indian Institute of Science, Bangalore, India
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.
Citation:
P. A. Vijaya, M. Narasimha Murty, D. K. Subramanian, "An Efficient Technique for Protein Sequence Clustering and Classification," icpr, vol. 2, pp.447-450, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 2, 2004
Usage of this product signifies your acceptance of the Terms of Use.