Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
An introduction of statistical learning
Search
Nakamura, Ryotaro
June 28, 2017
Science
0
42
An introduction of statistical learning
Nakamura, Ryotaro
June 28, 2017
Tweet
Share
More Decks by Nakamura, Ryotaro
See All by Nakamura, Ryotaro
Duct for beginners.
nryotaro
0
4.1k
Learn Go in 15 minutes
nryotaro
0
36
Seven architectural patterns
nryotaro
1
100
Improving Performance with Parallel Programming
nryotaro
0
52
Other Decks in Science
See All in Science
学術講演会中央大学学員会府中支部
tagtag
0
300
統計的因果探索: 背景知識とデータにより因果仮説を探索する
sshimizu2006
4
990
データマイニング - ウェブとグラフ
trycycle
PRO
0
160
システム数理と応用分野の未来を切り拓くロードマップ・エンターテインメント(スポーツ)への応用 / Applied mathematics for sports entertainment
konakalab
1
380
06_浅井雄一郎_株式会社浅井農園代表取締役社長_紹介資料.pdf
sip3ristex
0
600
論文紹介 音源分離:SCNET SPARSE COMPRESSION NETWORK FOR MUSIC SOURCE SEPARATION
kenmatsu4
0
290
KH Coderチュートリアル(スライド版)
koichih
1
45k
データベース02: データベースの概念
trycycle
PRO
2
890
Accelerated Computing for Climate forecast
inureyes
PRO
0
120
baseballrによるMLBデータの抽出と階層ベイズモデルによる打率の推定 / TokyoR118
dropout009
1
550
Agent開発フレームワークのOverviewとW&B Weaveとのインテグレーション
siyoo
0
320
How To Buy, Verified Venmo Accounts in 2025 This year
usaallshop68
2
250
Featured
See All Featured
Facilitating Awesome Meetings
lara
55
6.5k
Speed Design
sergeychernyshev
32
1.1k
Building Flexible Design Systems
yeseniaperezcruz
328
39k
"I'm Feeling Lucky" - Building Great Search Experiences for Today's Users (#IAC19)
danielanewman
229
22k
Visualizing Your Data: Incorporating Mongo into Loggly Infrastructure
mongodb
48
9.6k
How To Stay Up To Date on Web Technology
chriscoyier
790
250k
The Success of Rails: Ensuring Growth for the Next 100 Years
eileencodes
46
7.6k
Thoughts on Productivity
jonyablonski
69
4.8k
Writing Fast Ruby
sferik
628
62k
Fantastic passwords and where to find them - at NoRuKo
philnash
51
3.4k
Building a Modern Day E-commerce SEO Strategy
aleyda
43
7.5k
Designing Dashboards & Data Visualisations in Web Apps
destraynor
231
53k
Transcript
ػցֶशษڧձ ୈ 1 ճ தଜ ྒྷଠ June 13, 2017
Table of contents Supervised Learning 1. Classification 2. Perceptron 3.
Regression Unsupervised Learning 4. Clustering 1
ࠓͷඪ ࣍ճҎ߱ʹֶͿΞϧΰϦζϜͷ֓ཁΛΔ ΞϧΰϦζϜͱద༻ྫ ΞϧΰϦζϜ ద༻ྫ ྨ εύϜϝʔϧఆ ճؼੳ ച্༧ଌ ΫϥελϦϯά
ը૾ͷݮ৭ॲཧ 2
ύϥϝτϦοΫ๏ ϞσϧʢࣜʣΛԾఆ͠ɼϞσϧͷ࠷దͳύϥϝλΛֶश͢Δ ύϥϝτϦοΫ๏ͷखॱ 1. σʔλͷ༧ଌϞσϧΛԾఆ 2. Ϟσϧͷύϥϝλͷ ධՁج४ΛܾΊΔ 3. ύϥϝλΛܾΊΔ
0.0 0.2 0.4 0.6 0.8 1.0 −0.2 0.0 0.2 0.4 0.6 0.8 1.0 Ұ࣍ؔͷϞσϧͷύϥϝλௐ 3
Classification
ྨ Ϋϥεʹྨ͞ΕͨطଘσʔλΛݩʹ৽نσʔλΛྨ͢Δ ΞϧΰϦζϜ • ύʔηϓτϩϯ • ϩδεςΟοΫճؼ 4
Perceptron
ύʔηϓτϩϯ, Ϟσϧ ઢܗͳϞσϧ f Λઃఆ͢Δ f (x, y) = w0
+ w1x + w2y f (x, y) > 0 ⇒ t = +1 f (x, y) < 0 ⇒ t = −1 −20 −10 0 10 20 30 x −30 −20 −10 0 10 20 y t = +1 t = -1 ଐੑ t = ±1 Λͭσʔλ܈ ઢ্ͷ (x′, y′) f (x′, y′) = 0 ΛΈͨ͢ 5
ύʔηϓτϩϯ, ධՁج४ʢޡࠩؔʣ ޡࠩؔ E ͕࠷খʹͳΔ wi ΛٻΊΔ E = N
∑ i=1 {− (w0 + w1x + w2y) ti } = N ∑ i=1 (−f (xi , yi )ti ) • N σʔλ • ޡྨͩͱ −f (xi , yi )ti > 0 −20 −10 0 10 20 30 x −30 −20 −10 0 10 20 y t = +1 t = -1 ଐੑ t = ±1 Λͭσʔλ܈ 6
ϩδεςΟοΫճؼ, Ϟσϧ ύʔηϓτϩϯͱಉ͘͡ઢܗϞσϧ f Λઃఆ͢Δ f (x, y) = w0
+ w1x + w2y f (x, y) > 0 ⇒ t = +1 f (x, y) < 0 ⇒ t = −1 −30 −20 −10 0 10 20 30 x −20 −15 −10 −5 0 5 10 15 20 y t = +1 t = -1 f (x, y) ͕૿Ճ͢Δ͖ 7
ϩδεςΟοΫճؼ, Ϟσϧ ͨͩ͠ɼ|f | ͕େ͖͍΄Ͳ t Ͱ͋Δ͕֬ߴ͍ͱ͢Δ ϩδεςΟοΫؔ σ (α)
= 1 1 + e−α Λಋೖ͠ɼ (x′, y′) ͕ t = 1 Ͱ͋Δ֬Λ 0 < σ ( f ( x′, y′ )) < 1 ͱ͢Δ −4 −3 −2 −1 0 1 2 3 4 α 0.0 0.2 0.4 0.6 0.8 1.0 σ (α) ϩδεςΟοΫؔͷάϥϑ 8
ϩδεςΟοΫճؼ, ධՁج४ʢ࠷ਪఆʣ ܇࿅σʔλ͕ಘΒΕΔ֬ P Λ࠷େʹ͢Δ wi ΛٻΊΔ p(x, y) =
σ(x0 + w1x + w2y) P = N ∏ i p (xi , yi )tn {1 − p (xi , yi )}1−tn ܇࿅σʔλ࠷ൃੜ͕֬ߴ͍σʔλͰ͋ΔͱԾఆ͍ͯ͠Δ 9
Regression
ճؼੳ, ϞσϧͱධՁج४ʢ࠷খೋʣ σʔλ͕ M ࣍ଟ߲ࣜ f ʹै͏ͱͯ͠ɼೋޡࠩ ED Λ࠷খʹ͢Δ ύϥϝλ
wi ΛબͿ f (x) = M ∑ m=0 wmxm ED = 1 2 N ∑ n=1 {f (xn) − tn}2 0 2 4 6 8 10 −15 −10 −5 0 5 ground truth degree 3 degree 4 degree 5 training points M ∈ {3, 4, 5} ͷଟ߲ࣜۙࣅྫ 10
Clustering
k ฏۉ๏ σʔλؒͷڑΛٻΊɼσʔλΛ k ݸͷΫϥελʹ͚Δ −2 −1 0 1 2
3 0 1 2 3 4 5 σʔλू߹ −2 −1 0 1 2 3 0 1 2 3 4 5 cluster 1 cluster 2 cluster 3 centroids k = 3 ͷΫϥελ Ϋϥελ͝ͱʹදσʔλΛܾΊɼදͷۙ͘ͷσʔλू߹Ͱ ΫϥελΛ࡞Δ 11
k ฏۉ๏ͷΞϧΰϦζϜ ೖྗ: σʔλू߹ D = { x(1), x(2), ·
· · , x(|D|) } : Ϋϥελ k ແ࡞ҝʹ m1, m2 · · · , mk ΛܾΊΔ until ऩଋ foreach x(i) ∈ D cmax = arg max c sim ( x(i), mc ) σʔλू߹ͷׂ insert x(i)into cmax end foreach ∀c, mc = 1 |c| ∑ x(i)∈c x(i) දϕΫτϧΛ࠶ܭࢉ end until 12