2013 IEEE 13th International Conference on Data Mining Workshops (2006)
Hong Kong, China
Dec. 18, 2006 to Dec. 22, 2006
Pai-Hsi Huang , Rutgers University
Vladimir Pavlovic , Rutgers University
Computational classification of proteins using methods such as string kernels and Fisher-SVM has demonstrated great success. However, the resulting models do not offer an immediate interpretation of the underlying biological mechanisms. In particulal; some recent studies have postulated the existence of a small subset of positions and residues in protein sequences may be suficient to discriminate among different protein classes. In this work, we propose a hybrid setting for the classiJication task. A generative model is trained as a feature extractor, followed by a sparse classifier in the extracted feature space to determine the membership of the sequence, while discovering features relevant for classification. The set of sparse biologically motivated features together with the discriminative method offer the desired biological interpretability. We apply the proposed method to a widely used dataset and show that the peqormance of our models is comparable to that of the state-ofthe- art methods. The resulting models use fewer than 10% of the original features. At the same time, the sets of critical features discovered by the model appear to be consistent with confinned biological findings.
Pai-Hsi Huang, Vladimir Pavlovic, "Sparse Logistic Classifiers for Interpretable Protien Homology Detection", 2013 IEEE 13th International Conference on Data Mining Workshops, vol. 00, no. , pp. 99-103, 2006, doi:10.1109/ICDMW.2006.152