Linh Hoang Tran
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Linh Hoang Tran has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Trang Hoang
Faculty of Electrical and Electronics Engineering, Ho Chi Minh City University of Technology (HCMUT), Ho Chi Minh City, Vietnam
3 shared publications - Le Trung Hieu
IC Design Lab at Hochiminh City University of Technology, Vietnam
2 shared publications - Addison Gronquist
Portland State University
1 shared publication - Ben Schaeffer
Portland State University
1 shared publication - Loc Hoang Tran
John von Neumann Institute VNU-HCM Ho Chi Minh City Vietnam
1 shared publication - Marek Perkowski
Portland State University
1 shared publication
Latest Publications
- Open Access
- 1 January 2016
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 6 (1) , 71-75
Disease Gene Prioritization and the Novel Un-normalized Graph (p-) Laplacian Ranking Methods
The biological motivated problem that we want to solve in this paper is to predict the new members of a partially known set of genes involved in specific disease (i.e. disease gene prioritization). In this problem, we are given a core set of genes (i.e. the queries) involved in the specific disease. However, the biologist experts do not know whether this core set is complete or not. Our objective is to find more potential members of this core set by ranking genes in gene-gene interaction network. One of the solutions to this problem is the random walk on graphs method. However, the random walk on graphs method is not the current state of the art network-based method solving bioinformatics problem. In this paper, the novel un-normalized graph (p-) Laplacian based ranking method will be developed based on the un-normalized graph p-Laplacian operator definitions such as the curvature operator of graph (i.e. the un-normalized graph 1-Laplacian operator) and will be used to solve the disease gene prioritization problem. The results from experiments shows that the un-normalized graph p-Laplacian ranking methods are at least as good as the current state of the art network-based ranking method (p=2).
- 1 January 2016
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 6 (1) , 71-75
Open AccessDisease Gene Prioritization and the Novel Un-normalized Graph (p-) Laplacian Ranking Methods
The biological motivated problem that we want to solve in this paper is to predict the new members of a partially known set of genes involved in specific disease (i.e. disease gene prioritization). In this problem, we are given a core set of genes (i.e. the queries) involved in the specific disease. However, the biologist experts do not know whether this core set is complete or not. Our objective is to find more potential members of this core set by ranking genes in gene-gene interaction network. One of the solutions to this problem is the random walk on graphs method. However, the random walk on graphs method is not the current state of the art network-based method solving bioinformatics problem. In this paper, the novel un-normalized graph (p-) Laplacian based ranking method will be developed based on the un-normalized graph p-Laplacian operator definitions such as the curvature operator of graph (i.e. the un-normalized graph 1-Laplacian operator) and will be used to solve the disease gene prioritization problem. The results from experiments shows that the un-normalized graph p-Laplacian ranking methods are at least as good as the current state of the art network-based ranking method (p=2).
- 1 December 2015
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 5 (6) , 462-466
Combinatorial and Random Walk Hypergraph Laplacian EigenmapsCombinatorial and Random Walk Hypergraph Laplacian Eigenmaps
- 1 December 2015
- Published by EJournal Publishing in International Journal of Machine Learning and Computing
- Vol. 5 (6) , 462-466
Combinatorial and Random Walk Hypergraph Laplacian EigenmapsCombinatorial and Random Walk Hypergraph Laplacian Eigenmaps
- 24 January 2015
- Published by Springer Nature
- p. 254-263
Un-normlized and Random Walk Hypergraph Laplacian Un-supervised Learning
- 24 January 2015
- Published by Springer Nature
- p. 254-263
Un-normlized and Random Walk Hypergraph Laplacian Un-supervised Learning
- 6 December 2014
- Published by Springer Nature
- p. 111-128
Synthesis of Reversible Circuits Based on EXORs of Products of EXORs
- 6 December 2014
- Published by Springer Nature
- p. 111-128
Synthesis of Reversible Circuits Based on EXORs of Products of EXORs