Framework for kernel regularization with application to protein clustering.
We develop and apply a previously undescribed framework that is designed to extract information in the form of a positive definite kernel matrix from possibly crude, noisy, incomplete, inconsistent dissimilarity information between pairs of objects, obtainable in a variety of contexts. Any positive definite kernel defines a consistent set of distances, and the fitted kernel provides a set of coordinates in Euclidean space that attempts to respect the information available while controlling for complexity of the kernel. The resulting set of coordinates is highly appropriate for visualization and as input to classification and clustering algorithms. The framework is formulated in terms of a class of optimization problems that can be solved efficiently by using modern convex cone programming software. The power of the method is illustrated in the context of protein clustering based on primary sequence data. An application to the globin family of proteins resulted in a readily visualizable 3D sequence space of globins, where several subfamilies and subgroupings consistent with the literature were easily identifiable.
Lu
Fan
F
Department of Statistics, University of Wisconsin, Madison, WI 53706, USA.
Keles
Sündüz
S
Wright
Stephen J
SJ
Wahba
Grace
G
D000465:Algorithms; D000818:Animals; D001699:Biometry; D016000:Cluster Analysis; D005914:Globins / Q000737:chemistry / Q000235:genetics; D006801:Humans; D016415:Sequence Alignment / Q000706:statistics & numerical data*; D020539:Sequence Analysis, Protein / Q000706:statistics & numerical data*; D012984:Software
D005914:Globins