東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Graph kernels and applications in bi...

Alvarez Vega, Marco.

FindBook

Google Book

Amazon

博客來

Graph kernels and applications in bioinformatics.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph kernels and applications in bioinformatics./
作者:	Alvarez Vega, Marco.
面頁冊數:	110 p.
附註:	Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: 3699.
Contained By:	Dissertation Abstracts International73-06B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3495239
ISBN:	9781267184672

Graph kernels and applications in bioinformatics.
Alvarez Vega, Marco.

Graph kernels and applications in bioinformatics. - 110 p.

Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: 3699.

Thesis (Ph.D.)--Utah State University, 2012.

In recent years, machine learning has emerged as an important discipline. However, despite the popularity of machine learning techniques, data in the form of discrete structures are not fully exploited. For example, when data appear as graphs, the common choice is the transformation of such structures into feature vectors. This procedure, though convenient, does not always effectively capture topological relationships inherent to the data; therefore, the power of the learning process may be insufficient. In this context, the use of kernel functions for graphs arises as an attractive way to deal with such structured objects.

ISBN: 9781267184672Subjects--Topical Terms:

626642
Computer Science.

Graph kernels and applications in bioinformatics.
LDR:03506nam a2200313 4500 001 1968278
005 20141203120929.5
008 150210s2012 ||||||||||||||||| ||eng d
020 $a 9781267184672
035 $a (MiAaPQ)AAI3495239
035 $a AAI3495239
040 $a MiAaPQ $c MiAaPQ
100 1 $a Alvarez Vega, Marco. $3 2105421
245 1 0 $a Graph kernels and applications in bioinformatics.
300 $a 110 p.
500 $a Source: Dissertation Abstracts International, Volume: 73-06, Section: B, page: 3699.
500 $a Advisers: Xiaojun Qi; Changhui Yan.
502 $a Thesis (Ph.D.)--Utah State University, 2012.
520 $a In recent years, machine learning has emerged as an important discipline. However, despite the popularity of machine learning techniques, data in the form of discrete structures are not fully exploited. For example, when data appear as graphs, the common choice is the transformation of such structures into feature vectors. This procedure, though convenient, does not always effectively capture topological relationships inherent to the data; therefore, the power of the learning process may be insufficient. In this context, the use of kernel functions for graphs arises as an attractive way to deal with such structured objects.
520 $a On the other hand, several entities in computational biology applications, such as gene products or proteins, may be naturally represented by graphs. Hence, the demanding need for algorithms that can deal with structured data poses the question of whether the use of kernels for graphs can outperform existing methods to solve specific computational biology problems. In this dissertation, we address the challenges involved in solving two specific problems in computational biology, in which the data are represented by graphs.
520 $a First, we propose a novel approach for protein function prediction by modeling proteins as graphs. For each of the vertices in a protein graph, we propose the calculation of evolutionary profiles, which are derived from multiple sequence alignments from the amino acid residues within each vertex. We then use a shortest path graph kernel in conjunction with a support vector machine to predict protein function. We evaluate our approach under two instances of protein function prediction, namely, the discrimination of proteins as enzymes, and the recognition of DNA binding proteins. In both cases, our proposed approach achieves better prediction performance than existing methods.
520 $a Second, we propose two novel semantic similarity measures for proteins based on the gene ontology. The first measure directly works on the gene ontology by combining the pairwise semantic similarity scores between sets of annotating terms for a pair of input proteins. The second measure estimates protein semantic similarity using a shortest path graph kernel to take advantage of the rich semantic knowledge contained within ontologies. Our comparison with other methods shows that our proposed semantic similarity measures are highly competitive and the latter one outperforms state-of-the-art methods. Furthermore, our two methods are intrinsic to the gene ontology, in the sense that they do not rely on external sources to calculate similarities.
590 $a School code: 0241.
650 4 $a Computer Science. $3 626642
650 4 $a Biology, Bioinformatics. $3 1018415
690 $a 0984
690 $a 0715
710 2 $a Utah State University. $b Computer Science. $3 1032121
773 0 $t Dissertation Abstracts International $g 73-06B.
790 $a 0241
791 $a Ph.D.
792 $a 2012
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3495239