東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Machine learning and bioinformatics.

Kim, Hyunsoo.

FindBook

Google Book

Amazon

博客來

Machine learning and bioinformatics.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Machine learning and bioinformatics./
作者:	Kim, Hyunsoo.
面頁冊數:	258 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3002.
Contained By:	Dissertation Abstracts International65-06B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137178
ISBN:	0496843684

Machine learning and bioinformatics.
Kim, Hyunsoo.

Machine learning and bioinformatics. - 258 p.

Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3002.

Thesis (Ph.D.)--University of Minnesota, 2004.

For many applications where expensive updating of transactions is frequently required, it is desirable to develop incremental and decremental machine learning algorithms, which can efficiently compute the updated decision function when data points are appended or deleted. An incremental and decremental kernel discriminant analysis (KDA) and an incremental and decremental least squares support vector machine (SVM) have been introduced. The proposed incremental and decremental KDA avoids updating the computationally expensive eigenvalue decomposition (EVD), which would be necessary when we wish to design an incremental and decremental classifier by KDA based on the EVD.

ISBN: 0496843684Subjects--Topical Terms:

626642
Computer Science.

Machine learning and bioinformatics.
LDR:03353nmm 2200325 4500 001 1838454
005 20050526083756.5
008 130614s2004 eng d
020 $a 0496843684
035 $a (UnM)AAI3137178
035 $a AAI3137178
040 $a UnM $c UnM
100 1 $a Kim, Hyunsoo. $3 1926872
245 1 0 $a Machine learning and bioinformatics.
300 $a 258 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3002.
500 $a Adviser: Haesun Park.
502 $a Thesis (Ph.D.)--University of Minnesota, 2004.
520 $a For many applications where expensive updating of transactions is frequently required, it is desirable to develop incremental and decremental machine learning algorithms, which can efficiently compute the updated decision function when data points are appended or deleted. An incremental and decremental kernel discriminant analysis (KDA) and an incremental and decremental least squares support vector machine (SVM) have been introduced. The proposed incremental and decremental KDA avoids updating the computationally expensive eigenvalue decomposition (EVD), which would be necessary when we wish to design an incremental and decremental classifier by KDA based on the EVD.
520 $a 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 the gene expression data. The local least squares imputation method (LLSimpute) has been proposed, which exploits local similarity structures in the data as well as least squares optimization process. The proposed LLSimpute method shows the best performance among imputation methods tested on various data sets and percentages of missing values. The identification of discriminant genes is also one of the most fundamental steps in microarray gene expression data analysis to suggest representative genes to be explored in medical research. A multiclass gene selection method based on generalized linear discriminant analysis has been designed for classification of cancer subtypes. Four genes are proposed for subtype classification of leukemia, which yield only one misclassification during leave-one-out cross validation (LOOCV), and nine genes are suggested for subtype classification of small round blue cell tumor, which produce complete classification in the LOOCV test. Furthermore, a three-stage framework for gene expression data analysis regarding continuous phenotypes has been introduced by L 1-norm support vector regression as well.
520 $a Finally, a protein secondary structure prediction method, i.e., SVMpsi, has been developed to improve the current level of prediction accuracy of SVM approach by incorporating PSI-BLAST PSSM profiles. For the first time, SVM has been successfully applied to protein solvent accessibility prediction with a three-dimensional local descriptor as an intermediate step for the prediction of protein tertiary structure.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
650 4 $a Biophysics, Medical. $3 1017681
650 4 $a Biology, Biostatistics. $3 1018416
650 4 $a Artificial Intelligence. $3 769149
690 $a 0984
690 $a 0760
690 $a 0308
690 $a 0800
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 65-06B.
790 1 0 $a Park, Haesun, $e advisor
790 $a 0130
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137178