Haesun Park
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Haesun Park has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Hyunsoo Kim
Department of Computer Science and Engineering, University of Minnesota Twin Cities, 200 Union Street S.E., Minneapolis, MN 55455, USA
3 shared publications- Lars Eldén
Department of Mathematics, Linköping University, SE-581 83 Linköping, Sweden
3 shared publications Gene H. Golub
Computer Science Department Stanford University Gates Building 2B #280 94305-9025 Stanford CA USA
1 shared publication- Hong G. Zhao
University of Minnesota
1 shared publication - Hongyuan Zha
The Pennsylvania State University
1 shared publication J. B. Rosen
University of Minnesota
1 shared publication
Latest Publications
- Open Access
- 27 August 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (2) , 187-198
Missing value estimation for DNA microarray gene expression data: local least squares imputation
Motivation: Gene expression data often contain missing expression values. Effective missing value estimation methods are needed since many algorithms for gene expression data analysis require a complete matrix of gene array values. In this paper, imputation methods based on the least squares formulation are proposed to estimate missing values in the gene expression data, which exploit local similarity structures in the data as well as least squares optimization process. Results: The proposed local least squares imputation method (LLSimpute) represents a target gene that has missing values as a linear combination of similar genes. The similar genes are chosen by k-nearest neighbors or k coherent genes that have large absolute values of Pearson correlation coefficients. Non-parametric missing values estimation method of LLSimpute are designed by introducing an automatic k-value estimator. In our experiments, the proposed LLSimpute method shows competitive results when compared with other imputation methods for missing value estimation on various datasets and percentages of missing values in the data. Availability: The software is available at http://www.cs.umn.edu/~hskim/tools.html Contact:hpark@cs.umn.edu
- 27 August 2004
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 21 (2) , 187-198
Open AccessMissing value estimation for DNA microarray gene expression data: local least squares imputation
Motivation: Gene expression data often contain missing expression values. Effective missing value estimation methods are needed since many algorithms for gene expression data analysis require a complete matrix of gene array values. In this paper, imputation methods based on the least squares formulation are proposed to estimate missing values in the gene expression data, which exploit local similarity structures in the data as well as least squares optimization process. Results: The proposed local least squares imputation method (LLSimpute) represents a target gene that has missing values as a linear combination of similar genes. The similar genes are chosen by k-nearest neighbors or k coherent genes that have large absolute values of Pearson correlation coefficients. Non-parametric missing values estimation method of LLSimpute are designed by introducing an automatic k-value estimator. In our experiments, the proposed LLSimpute method shows competitive results when compared with other imputation methods for missing value estimation on various datasets and percentages of missing values in the data. Availability: The software is available at http://www.cs.umn.edu/~hskim/tools.html Contact:hpark@cs.umn.edu
- 27 August 2004
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 50 (1) , 1-4
2nd Special issue on matrix computations and statistics
- 27 August 2004
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 50 (1) , 1-4
2nd Special issue on matrix computations and statistics
- 12 December 2003
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 54 (3) , 557-562
Prediction of protein relative solvent accessibility with support vector machines and long‐range interaction 3D local descriptor
The prediction of protein relative solvent accessibility gives us helpful information for the prediction of tertiary structure of a protein. The SVMpsi method, which uses support vector machines (SVMs), and the position‐specific scoring matrix (PSSM) generated from PSI‐BLAST have been applied to achieve better prediction accuracy of the relative solvent accessibility. We have introduced a three‐dimensional local descriptor that contains information about the expected remote contacts by both the long‐range interaction matrix and neighbor sequences. Moreover, we applied feature weights to kernels in SVMs in order to consider the degree of significance that depends on the distance from the specific amino acid. Relative solvent accessibility based on a two state‐model, for 25%, 16%, 5%, and 0% accessibility are predicted at 78.7%, 80.7%, 82.4%, and 87.4% accuracy, respectively. Three‐state prediction results provide a 64.5% accuracy with 9%; 36% threshold. The support vector machine approach has successfully been applied for solvent accessibility prediction by considering long‐range interaction and handling unbalanced data. Proteins 2004;54:000–000.
- 12 December 2003
- Published by Wiley in Proteins: Structure, Function, and Bioinformatics
- Vol. 54 (3) , 557-562
Prediction of protein relative solvent accessibility with support vector machines and long‐range interaction 3D local descriptor
The prediction of protein relative solvent accessibility gives us helpful information for the prediction of tertiary structure of a protein. The SVMpsi method, which uses support vector machines (SVMs), and the position‐specific scoring matrix (PSSM) generated from PSI‐BLAST have been applied to achieve better prediction accuracy of the relative solvent accessibility. We have introduced a three‐dimensional local descriptor that contains information about the expected remote contacts by both the long‐range interaction matrix and neighbor sequences. Moreover, we applied feature weights to kernels in SVMs in order to consider the degree of significance that depends on the distance from the specific amino acid. Relative solvent accessibility based on a two state‐model, for 25%, 16%, 5%, and 0% accessibility are predicted at 78.7%, 80.7%, 82.4%, and 87.4% accuracy, respectively. Three‐state prediction results provide a 64.5% accuracy with 9%; 36% threshold. The support vector machine approach has successfully been applied for solvent accessibility prediction by considering long‐range interaction and handling unbalanced data. Proteins 2004;54:000–000.
- 1 December 2003
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 7 (4) , 389-394
DNA Screening, Pooling Design and Simplicial Complex
- 1 December 2003
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 7 (4) , 389-394
DNA Screening, Pooling Design and Simplicial Complex
- Open Access
- 1 August 2003
- Published by Oxford University Press (OUP) in Protein Engineering, Design and Selection
- Vol. 16 (8) , 553-560
Protein secondary structure prediction based on an improved support vector machines approach
The prediction of protein secondary structure is an important step in the prediction of protein tertiary structure. A new protein secondary structure prediction method, SVMpsi, was developed to improve the current level of prediction by incorporating new tertiary classifiers and their jury decision system, and the PSI‐BLAST PSSM profiles. Additionally, efficient methods to handle unbalanced data and a new optimization strategy for maximizing the Q3 measure were developed. The SVMpsi produces the highest published Q3 and SOV94 scores on both the RS126 and CB513 data sets to date. For a new KP480 set, the prediction accuracy of SVMpsi was Q3 = 78.5% and SOV94 = 82.8%. Moreover, the blind test results for 136 non‐redundant protein sequences which do not contain homologues of training data sets were Q3 = 77.2% and SOV94 = 81.8%. The SVMpsi results in CASP5 illustrate that it is another competitive method to predict protein secondary structure.
- 1 August 2003
- Published by Oxford University Press (OUP) in Protein Engineering, Design and Selection
- Vol. 16 (8) , 553-560
Open AccessProtein secondary structure prediction based on an improved support vector machines approach
The prediction of protein secondary structure is an important step in the prediction of protein tertiary structure. A new protein secondary structure prediction method, SVMpsi, was developed to improve the current level of prediction by incorporating new tertiary classifiers and their jury decision system, and the PSI‐BLAST PSSM profiles. Additionally, efficient methods to handle unbalanced data and a new optimization strategy for maximizing the Q3 measure were developed. The SVMpsi produces the highest published Q3 and SOV94 scores on both the RS126 and CB513 data sets to date. For a new KP480 set, the prediction accuracy of SVMpsi was Q3 = 78.5% and SOV94 = 82.8%. Moreover, the blind test results for 136 non‐redundant protein sequences which do not contain homologues of training data sets were Q3 = 77.2% and SOV94 = 81.8%. The SVMpsi results in CASP5 illustrate that it is another competitive method to predict protein secondary structure.
- 1 December 1999
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 39 (4) , 757-779
Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm
- 1 December 1999
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 39 (4) , 757-779
Low Rank Approximation of a Hankel Matrix by Structured Total Least Norm
- 1 June 1999
- Published by Springer Nature in Numerische Mathematik
- Vol. 82 (4) , 599-619
A Procrustes problem on the Stiefel manifold
- 1 June 1999
- Published by Springer Nature in Numerische Mathematik
- Vol. 82 (4) , 599-619
A Procrustes problem on the Stiefel manifold
- 1 May 1997
- Published by Springer Nature in Numerische Mathematik
- Vol. 76 (3) , 383-402
Stability analysis and fast algorithms for triangularization of Toeplitz matrices
- 1 May 1997
- Published by Springer Nature in Numerische Mathematik
- Vol. 76 (3) , 383-402
Stability analysis and fast algorithms for triangularization of Toeplitz matrices
- 1 June 1996
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (2) , 247-263
Perturbation and error analyses for block downdating of a Cholesky decomposition
- 1 June 1996
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (2) , 247-263
Perturbation and error analyses for block downdating of a Cholesky decomposition
- 1 March 1996
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (1) , 166-181
Accurate downdating of a modified Gram-Schmidt QR decomposition
- 1 March 1996
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 36 (1) , 166-181
Accurate downdating of a modified Gram-Schmidt QR decomposition