Jan-Ming Ho

Dr. Jan-Ming Ho

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 March 2021 in Applied Intelligence
Verified
Journal Article
Open access
PDF file
MWMu-En Wu
Mu-En Wu
JSJia-Hao Syu
Jia-Hao Syu
Jerry Chun-Wei LinJerry Chun-Wei Lin
Jerry Chun-Wei Lin
JHJan-Ming Ho
Jan-Ming Ho
Portfolio management involves position sizing and resource allocation. Traditional and generic portfolio strategies require forecasting of future stock prices as model inputs, which is not a trivial task since those values are difficult to obtain in the real-world applications. To overcome the above limitations and provide a better solution for portfolio management, we developed a Portfolio Management System (PMS) using reinforcement learning with two neural networks (CNN and RNN). A novel reward function involving Sharpe ratios is also proposed to evaluate the performance of the developed systems. Experimental results indicate that the PMS with the Sharpe ratio reward function exhibits outstanding performance, increasing return by 39.0% and decreasing drawdown by 13.7% on average compared to the reward function of trading return. In addition, the proposed model is more suitable for the construction of a reinforcement learning portfolio, but has 1.98 times more drawdown risk than the . Among the conducted datasets, the PMS outperforms the benchmark strategies in TW50 and traditional stocks, but is inferior to a benchmark strategy in the financial dataset. The PMS is profitable, effective, and offers lower investment risk among almost all datasets. The novel reward function involving the Sharpe ratio enhances performance, and well supports resource-allocation for empirical stock trading.

17 April 2010 in Marine Biotechnology
Verified
Journal Article
Closed access
PDF file
JLJiann-Horng Leu
Jiann-Horng Leu
SCShu-Hwa Chen
Shu-Hwa Chen
YWYu-Bin Wang
Yu-Bin Wang
YCYen-Chen Chen
Yen-Chen Chen
SSSheng-Yao Su
Sheng-Yao Su
CLChu-Fang Lo
Chu-Fang Lo

18 April 2019 in BMC Genomics
Verified
Journal Article
Open access
PDF file
LYLi-An Yang
Li-An Yang
YCYu-Jung Chang
Yu-Jung Chang
SCShu-Hwa Chen
Shu-Hwa Chen
CLChung-Yen Lin
Chung-Yen Lin
JHJan-Ming Ho
Jan-Ming Ho
With the rapid increase in genome sequencing projects for non-model organisms, numerous genome assemblies are currently in progress or available as drafts, but not made available as satisfactory, usable genomes. Data quality assessment of genome assemblies is gaining importance not only for people who perform the assembly/re-assembly processes, but also for those who attempt to use assemblies as maps in downstream analyses. Recent studies of the quality control, quality evaluation/ assessment of genome assemblies have focused on either quality control of reads before assemblies or evaluation of the assemblies with respect to their contiguity and correctness. However, correctness assessment depends on a reference and is not applicable for de novo assembly projects. Hence, development of methods providing both post-assembly and pre-assembly quality assessment reports for examining the quality/correctness of de novo assemblies and the input reads is worth studying. We present SQUAT, an efficient tool for both pre-assembly and post-assembly quality assessment of de novo genome assemblies. The pre-assembly module of SQUAT computes quality statistics of reads and presents the analysis in a well-designed interface to visualize the distribution of high- and poor-quality reads in a portable HTML report. The post-assembly module of SQUAT provides read mapping analytics in an HTML format. We categorized reads into several groups including uniquely mapped reads, multiply mapped, unmapped reads; for uniquely mapped reads, we further categorized them into perfectly matched, with substitutions, containing clips, and the others. We carefully defined the poorly mapped (PM) reads into several groups to prevent the underestimation of unmapped reads; indeed, a high PM% would be a sign of a poor assembly that requires researchers’ attention for further examination or improvements before using the assembly. Finally, we evaluate SQUAT with six datasets, including the genome assemblies for eel, worm, mushroom, and three bacteria. The results show that SQUAT reports provide useful information with details for assessing the quality of assemblies and reads. The SQUAT software with links to both its docker image and the on-line manual is freely available at https://github.com/luke831215/SQUAT .

18 August 2021 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
MWMu-En Wu
Mu-En Wu
JSJia-Hao Syu
Jia-Hao Syu
Jerry Chun-Wei LinJerry Chun-Wei Lin
Jerry Chun-Wei Lin
JHJan-Ming Ho
Jan-Ming Ho
Trading strategies can be divided into two categories, i.e., those with momentum characteristic and those that appear contrarian. The characteristics of trading strategies have been widely studied; however, there has been relatively little work on the characteristics of stocks. Furthermore, there is no standard approach to the classification of stocks in terms of momentum and contrarian. This article presents a fuzzy momentum contrarian uncertain characteristic system for the classification and quantification of stock characteristics. Random trading, stop-loss, and take-profit mechanisms are first used to identify characteristics, and then, a novel profitability index with a type-2 fuzzy set module is used to quantify them. In the experiments, 41 stocks on the Taiwan 50 index were deemed suitable for momentum strategies, whereas nine stocks were deemed suitable for contrarian strategies. An uphill relationship between profitability index and trading performance is observed, which produced correlation coefficients of 0.148–0.539 and a classification accuracy of 52.0–60.0%. However, the proposed system greatly improved classification performance, resulting in correlation coefficients of 0.572–0.722 with an accuracy of 63.6–84.5%. In the real-world application, the proposed system outperforms the benchmark among all datasets and increases the profitability by 1.5 times on the Taiwan 50 dataset. These results clearly demonstrate the efficiency of the proposed system in the quantification and classification of stocks suited to momentum- and contrarian-type trading strategies and also in the real-world applications.

13 December 2012 in BMC Genomics
Verified
Journal Article
Open access
YCYu-Jung Chang
Yu-Jung Chang
CCChien-Chih Chen
Chien-Chih Chen
CCChuen-Liang Chen
Chuen-Liang Chen
JHJan-Ming Ho
Jan-Ming Ho
Background: State-of-the-art high-throughput sequencers, e.g., the Illumina HiSeq series, generate sequencing reads that are longer than 150 bp up to a total of 600 Gbp of data per run. The high-throughput sequencers generate lengthier reads with greater sequencing depth than those generated by previous technologies. Two major challenges exist in using the high-throughput technology for de novo assembly of genomes. First, the amount of physical memory may be insufficient to store the data structure of the assembly algorithm, even for high-end multicore processors. Moreover, the graph-theoretical model used to capture intersection relationships of the reads may contain structural defects that are not well managed by existing assembly algorithms. Results: We developed a distributed genome assembler based on string graphs and MapReduce framework, known as the CloudBrush. The assembler includes a novel edge-adjustment algorithm to detect structural defects by examining the neighboring reads of a specific read for sequencing errors and adjusting the edges of the string graph, if necessary. CloudBrush is evaluated against GAGE benchmarks to compare its assembly quality with the other assemblers. The results show that our assemblies have a moderate N50, a low misassembly rate of misjoins, and indels of > 5 bp. In addition, we have introduced two measures, known as precision and recall, to address the issues of faithfully aligned contigs to target genomes. Compared with the assembly tools used in the GAGE benchmarks, CloudBrush is shown to produce contigs with high precision and recall. We also verified the effectiveness of the edge-adjustment algorithm using simulated datasets and ran CloudBrush on a nematode dataset using a commercial cloud. CloudBrush assembler is available at https://github.com/ice91/CloudBrush.

8 May 2018 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
SCShu-Hwa Chen
Shu-Hwa Chen
WKWen-Yu Kuo
Wen-Yu Kuo
SSSheng-Yao Su
Sheng-Yao Su
WCWei-Chun Chung
Wei-Chun Chung
JHJan-Ming Ho
Jan-Ming Ho
CLChung-Yen Lin
Chung-Yen Lin
A new emerged cancer treatment utilizes intrinsic immune surveillance mechanism that is silenced by those malicious cells. Hence, studies of tumor infiltrating lymphocyte populations (TILs) are key to the success of advanced treatments. In addition to laboratory methods such as immunohistochemistry and flow cytometry, in silico gene expression deconvolution methods are available for analyses of relative proportions of immune cell types. Herein, we used microarray data from the public domain to profile gene expression pattern of twenty-two immune cell types. Initially, outliers were detected based on the consistency of gene profiling clustering results and the original cell phenotype notation. Subsequently, we filtered out genes that are expressed in non-hematopoietic normal tissues and cancer cells. For every pair of immune cell types, we ran t-tests for each gene, and defined differentially expressed genes (DEGs) from this comparison. Equal numbers of DEGs were then collected as candidate lists and numbers of conditions and minimal values for building signature matrixes were calculated. Finally, we used v -Support Vector Regression to construct a deconvolution model. The performance of our system was finally evaluated using blood biopsies from 20 adults, in which 9 immune cell types were identified using flow cytometry. The present computations performed better than current state-of-the-art deconvolution methods. Finally, we implemented the proposed method into R and tested extensibility and usability on Windows, MacOS, and Linux operating systems. The method, MySort, is wrapped as the Galaxy platform pluggable tool and usage details are available at https://testtoolshed.g2.bx.psu.edu/view/moneycat/mysort/e3afe097e80a .