The document discusses distances between data and similarity measures in data analysis. It introduces the concept of distance between data as a quantitative measure of how different two data points are, with smaller distances indicating greater similarity. Distances are useful for tasks like clustering data, detecting anomalies, data recognition, and measuring approximation errors. The most common distance measure, Euclidean distance, is explained for vectors of any dimension using the concept of norm from geometry. Caution is advised when calculating distances between data with differing scales.
* Satoshi Hara and Kohei Hayashi. Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach. AISTATS'18 (to appear).
arXiv ver.: https://arxiv.org/abs/1606.09066#
* GitHub
https://github.com/sato9hara/defragTrees
This document discusses generative adversarial networks (GANs) and their relationship to reinforcement learning. It begins with an introduction to GANs, explaining how they can generate images without explicitly defining a probability distribution by using an adversarial training process. The second half discusses how GANs are related to actor-critic models and inverse reinforcement learning in reinforcement learning. It explains how GANs can be viewed as training a generator to fool a discriminator, similar to how policies are trained in reinforcement learning.
The document discusses distances between data and similarity measures in data analysis. It introduces the concept of distance between data as a quantitative measure of how different two data points are, with smaller distances indicating greater similarity. Distances are useful for tasks like clustering data, detecting anomalies, data recognition, and measuring approximation errors. The most common distance measure, Euclidean distance, is explained for vectors of any dimension using the concept of norm from geometry. Caution is advised when calculating distances between data with differing scales.
* Satoshi Hara and Kohei Hayashi. Making Tree Ensembles Interpretable: A Bayesian Model Selection Approach. AISTATS'18 (to appear).
arXiv ver.: https://arxiv.org/abs/1606.09066#
* GitHub
https://github.com/sato9hara/defragTrees
This document discusses generative adversarial networks (GANs) and their relationship to reinforcement learning. It begins with an introduction to GANs, explaining how they can generate images without explicitly defining a probability distribution by using an adversarial training process. The second half discusses how GANs are related to actor-critic models and inverse reinforcement learning in reinforcement learning. It explains how GANs can be viewed as training a generator to fool a discriminator, similar to how policies are trained in reinforcement learning.
文献紹介:Selective Feature Compression for Efficient Activity Recognition InferenceToru Tamaki
?
Chunhui Liu, Xinyu Li, Hao Chen, Davide Modolo, Joseph Tighe; Selective Feature Compression for Efficient Activity Recognition Inference, Proceedings of the IEEE/CVF International Conference on Computer Vision (ICCV), 2021, pp. 13628-13637
https://openaccess.thecvf.com/content/ICCV2021/html/Liu_Selective_Feature_Compression_for_Efficient_Activity_Recognition_Inference_ICCV_2021_paper.html
Journal club dec24 2015 splice site prediction using artificial neural netw...Hiroya Morimoto
?
Brief introduction to artificial neural networks and the application to bioinformatics fields. And show how to utilize neural networks to predict splice sites in genome/gene sequences.
5. 果樹のゲノミックセレクション
Minamikawa MF, Nonaka K, Kaminuma E, Kajiya-Kanegae H, Onogi A, Goto S, Yoshioka T, Imai A, Hamada H, Hayashi T,
Matsumoto S, Katayose Y, Toyoda A, Fujiyama A, Nakamura Y, Shimizu T, Iwata H.
Genome-wide association study and genomic prediction in citrus: Potential of genomics-assisted breeding for fruit quality traits.
Sci Rep. 2017 Jul 5;7(1):4721.
5
17. Beagleとは?
? 2017.11.10 現在の最新版はBeagle version 4.1
? http://faculty.washington.edu/browning/beagle/beagle.html
? reference genome へのマッピングが必要
? Beagle 4.1の場合、Java version 8が必要
? 親子関係を用いて(ped argument)解析する場合は、Beagle 4.0 を使用
? 参考文献
B L Browning and S R Browning (2016).
Genotype imputation with millions of reference samples.
Am J Hum Genet 98:116-126. doi:10.1016/j.ajhg.2015.11.020
17
18. Beagleの入力ファイル
? vcfおよびvcf.gzを利用可能
? Beagleで利用するためにはGTあるいはGLのFORMATが必要
#CHROM POS ID REF ALT QUAL FILTER INFO FORMAT RTx430 Tx642
Chr01 123ss.3 C T 2256.5PASS AC=2;AF=0.043 GT:AD:DP:GQ:PL 0/0:14,0:14:33:0,33,423 0/0:143,0:143:99:0,376,5016
Chr01 284ss.6 T A 5219.94PASS AC=6;AF=0.130 GT:AD:DP:GQ:PL 0/0:14,0:14:36:0,36,491 0/0:135,0:135:99:0,370,4920
Chr01 871ss.10 C T 24370.1PASS AC=32;AF=0.696 GT:AD:DP:GQ:PL 1/1:0,10:10:24:328,24,0 0/0:88,0:88:99:0,244,3212
18
25. r/qtlによるImputation
fill.geno : 欠測を補完 methodの選択
https://www.rdocumentation.org/packages/qtl/versions/1.41-6/topics/fill.geno
imp
impute using a single simulation replicate
from sim.geno
sim.geno
argmax
Viterbi algorithm, as implemented in
argmax.geno
argmax.geno
no_dbl_XO
simply filling in missing genotypes between
markers with matching genotypes
maxmarginal
choosing (at each marker) the genotype
with maximal marginal probability
25
29. 高標高×低標高交雑に由来するトドマツ分離集団を用いた
RAD-Seqによる連鎖地図構築?QTL解析
Genetic mapping of local adaptation along the altitudinal gradient in Abies sachalinensis
Goto S, Kajiya-Kanegae H, Ishizuka W, Kitamura K, Ueno S, Hisamoto Y, Kudoh H,
Yasugi M, Nagano AJ, Iwata H
Tree Genetics & Genomes (2017) 13: 104.
https://doi.org/10.1007/s11295-017-1191-3
29
45. TASSEL Imputation
FILLIN
all types of populations but optimized for those with higher inbreeding coefficients
FSFHap
optimized for finding recombination break points in full-sib families
LD-kNNi
k-nearest neighbor genotype imputation method (for unordered markers)
45