基本概念

Apr 15, 20150 likes668 views

Joe Suzuki

実験数学3 (学部3年) Rの基本概念 2015年4月13日(月)

R言語超初心者
1. 基本概念
大阪大学理学部数学科実験数学 3
担当: 鈴木譲
2015年4月13日

この章の内容
1. クラスとオブジェクト
2. クラス numeric
3. クラス logical
4. クラス character
5. オブジェクトの代入
6. クラスの変換
7. 数値関数

クラスとオブジェクト
上記3クラスに入るオブジェクトの取り扱いを学ぶ
クラス性質要素 (オブジェクト)
Numeric 数値 1, -3, 13.2, 7.2e-10, -0.667
logical 論理値 TRUE, FALSE, NA
character 文字列 “interesting”, “How are you?”, “-1.28”
クラス: 同じ性質をもった値の集合
オブジェクト: そのクラスの要素

クラス numeric
1+2 3
1-2 -1
2*3 6
4/5 0.8
2^3 8
(1+2*3)/5^2 0.28
is.numeric (1+2*3)/5^2) TRUE
sqrt(-3) NaN
class(NaN) numeric
pi 3.141593
sin(pi/6) 0.5
tan(pi/4) 1

クラス logical
1==2 FALSE
1<=2 TRUE
1>=2 FALSE
1!=2 TRUE
1>2 FALSE
1<2 TRUE
1==2||1>2 FALSE
1>2&&1<2 FALSE
is.logical(1>2) TRUE
Is.logical (NA) TRUE NAは、値が欠損していることを意味する

クラス character
”Thank“ “Thank”
is.character(“Thank") TRUE
paste("Thank","you") “Thank you”
past0(“Mon”,”day”) “Monday”
substring("Thank", 2,4) “han”
regexpr(“day”, “Tuesday”) 5
Characterクラスを入力とする関数

オブジェクトの代入
x<-2
x
x+3
x
x<-x+4.15
x
y<- -1.28
x+y
Xに2を代入
(初期値)
ｙに-1.28を代入
(初期値)
Xにx+4.15(=6.15)を代入
(更新)
何かを代入するまでは、
xはただの記号。
何らかのクラスの値をもって
そのクラスのオブジェクトになる

クラスの変換
z<-as.numeric(2<1)
z
is.logical(z)
is.numeric(z)
as.numeric(TRUE) 1となる
as.numeric(FALSE) 0となる
as.numeric(NA) NAはNAになる
as.numeric(“17”) numericの17になる
as.logical(0) 0はFALSEで他はTRUEになる
as.logical(-5)
logical クラスを
numeric クラスに変換

数値関数
関数意味 X=1.570 (=pi/2) X=-- 0.523 (=-pi/6)
sqrt(x) 平方根 1.253314 NaN
abs(x) 絶対値 1.570796 1.047
exp(x) 指数 4.810477 0.592
log(x) 対数 0.4515827 NaN
sin(x) 正弦 0 -0.5
cos(x) 余弦 0.5 0.8660254
tan(x) 正接 Inf -0.5773503
floor(x) (絶対値の)切上げ 1 -1
trunc(x) 切下げ 1 0
round(x) 四捨五入 2 -1

データサイエンティスト養成講座で利用している教材のサンプルです。 1. 基本概念、2. ベクトル、3. 行列、配列、リスト 4. 関数とプログラミング 5. データフレーム　6. グラフィックスからなります。教材は、こうしたスライドに音声での説明が入り、さらに演習問題と採点、議論などが加わります。

Learning to automatically solve algebra word problemsNaoaki Okazaki

Jeffreys' and BDeu Priors for Model SelectionJoe Suzuki

2014 9-16Joe Suzuki

This document discusses learning Bayesian networks (BNs) with both discrete and continuous variables. It begins with an overview of learning BNs and identifying BN structures from data. It then addresses several challenges, including when the data has a density function, when it does not, and practical approaches. The document outlines computing factor scores from the data and using these scores along with structure priors to identify the optimal BN structure.

Experimental mathematics 2Joe Suzuki

This document provides an introduction and schedule for an experimental mathematics course taught by Professor Joe Suzuki of Osaka University. The course will cover introductory statistics using the R programming language over 15 classes. Students will be evaluated based on 50 problem reports submitted through the CLE system and attendance. Presentations by students on problem solutions will begin in December and provide opportunities for bonus points. The course aims to teach statistical concepts through hands-on use of R rather than theoretical explanations.

闯别蹿蹿谤别测蝉の事前确率と叠顿别耻の一致性に関する比较Joe Suzuki

2014 12-9Joe Suzuki

離散と連続の入り混じった相互情報量を推定して、SNP と遺伝子発現量の因果関係をさぐるJoe Suzuki

2014 9-26Joe Suzuki

ガイダンスJoe Suzuki

相互情报量を用いた独立性の検定Joe Suzuki

MaCaulay2 Miuraパッケージの開発と今後Joe Suzuki

OMNI-Prop: Seamless Node Classification on Arbitrary Label CorrelationYuto Yamaguchi

This document presents OMNI-Prop, a new algorithm for node classification on graphs that can handle arbitrary label correlation types. OMNI-Prop calculates variables representing the likelihood of node labels and propagates these values to achieve classification. It runs in linear time per iteration and converges on any graph. Experimental results show OMNI-Prop outperforms other methods on various datasets.

Online User Location Inference Exploiting Spatiotemporal Correlations in Soci...Yuto Yamaguchi

The document presents a new online and incremental method for inferring user home locations from social media posts. It exploits spatiotemporal correlations in social streams by extracting local words that are correlated to locations over specific time periods. The proposed Online Location Inference Method (OLIM) divides the map into regions, calculates population distributions, and updates local word distributions and user location distributions incrementally as new posts arrive. An evaluation on a Twitter dataset shows it achieves better accuracy than existing batch methods and has lower computational cost per update.

$Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$ $Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$

Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...Taiji Suzuki

The document summarizes a presentation on minimizing tensor estimation error using alternating minimization. It begins with an introduction to tensor decompositions including CP, Tucker, and tensor train decompositions. It then discusses nonparametric tensor estimation using an alternating minimization method. The method iteratively updates components while holding other components fixed, achieving efficient computation. The analysis shows that after t iterations, the estimation error is bounded by the sum of a statistical error term and an optimization error term decaying exponentially in t. Real data analysis uses the method for multitask learning.

関西狈滨笔厂+読み会発表スライドYuchi Matsuoka

The document discusses various papers on conditional density estimation and reproducing kernel Hilbert spaces, including papers by Song, Gretton, Fukumizu, and others. It presents methods for learning conditional distributions based on maximum mean discrepancy and evaluating predictive performance through conditional density estimation. The papers covered use kernels and regularization to nonparametrically estimate conditional distributions from data.

搁と笔测迟丑辞苍を比较するJoe Suzuki

搁集会蔼统数研Joe Suzuki

E-learning Development of Statistics and in Duex: Practical Approaches and Th...Joe Suzuki

This document discusses the development of e-learning courses in statistics through the Duex program. Duex is a consortium of Japanese universities and companies focused on data-related human resource development. It produces online statistics and data science courses using a low-cost, high-quality approach involving individual instructors creating video lectures using PowerPoint, scripts, and video editing software. The document outlines Duex's funding and participating institutions, and provides tips for instructors to efficiently create online video courses themselves with minimal budget and assistance from others.

分枝限定法でモデル选択の计算量を低减するJoe Suzuki

连続変量を含む条件付相互情报量の推定Joe Suzuki

E-learning Design and Development for Data Science in Osaka UniversityJoe Suzuki

This document discusses the development of e-learning courses for data science through the Kansai Data related Human Resource Development Consortium (KDC). KDC was established in 2017 with funding from the Japanese Ministry of Education and includes several universities. It aims to develop online statistics courses to make education more accessible and help train data science professionals. The document outlines KDC's goals, challenges in creating high-quality online courses, and strategies for increasing student enrollment and participation over the next five years as funding is scheduled to end.

UAI 2017Joe Suzuki

1. The document proposes a regular quotient score for Bayesian network structure learning that allows for more efficient branch-and-bound search compared to the existing BDeu score. 2. The existing BDeu score violates regularity, meaning that Markov equivalent structures do not necessarily share the same BDeu score. 3. The authors propose a regular quotient score based on Jeffreys' prior that satisfies regularity, ensuring Markov equivalent structures share the score, enabling more efficient searching during branch-and-bound learning of Bayesian network structures.

AMBN2017 サテライトワークショップJoe Suzuki

CRAN Rパッケージ BNSLの概要Joe Suzuki

Forest Learning from DataJoe Suzuki

- The document discusses estimating mutual information and using it to learn forests and Bayesian networks from data. It presents methods for estimating mutual information, finding independence between variables, and using Kruskal's and Chow-Liu algorithms to learn tree structures that approximate joint distributions. Experiments apply these methods to Asia and Alarm datasets to learn Bayesian networks.

A Bayesian Approach to Data CompressionJoe Suzuki

A Conjecture on Strongly Consistent LearningJoe Suzuki

1. The document presents a conjecture about the error probability of overestimating the true order k* when learning autoregressive moving average (ARMA) models from samples. 2. The conjecture states that if the estimated order k is greater than the true order k*, the error probability is equal to the probability that a chi-squared distributed random variable with k - k* degrees of freedom is greater than (k - k*)dn, where dn is related to the sample size n. 3. The author provides evidence that a sum of squared estimated ARMA coefficients could be chi-squared distributed, lending credibility to the conjecture.

A Generalization of the Chow-Liu Algorithm and its Applications to Artificial...Joe Suzuki

A Generalization of Nonparametric Estimation and On-Line Prediction for Stati...Joe Suzuki

This document presents a generalization of Ryabko's measure for universal coding of stationary ergodic sources. The generalization allows constructing a measure νn that achieves universal coding for sources without a density function, such as those represented by a measure μn on a measurable space. νn is defined by projecting the source onto increasing finer partitions and weighting the projections. If the Kullback-Leibler divergence between the source and weighting measure converges across partitions, νn achieves universal coding for any stationary ergodic source μn. Examples demonstrate how the approach extends Ryabko's histogram weighting to new source types.

More Related Content

Viewers also liked (8)

2014 9-26Joe Suzuki

ガイダンスJoe Suzuki

相互情报量を用いた独立性の検定Joe Suzuki

MaCaulay2 Miuraパッケージの開発と今後Joe Suzuki

OMNI-Prop: Seamless Node Classification on Arbitrary Label CorrelationYuto Yamaguchi

Online User Location Inference Exploiting Spatiotemporal Correlations in Soci...Yuto Yamaguchi

$Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$ $Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$

Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...Taiji Suzuki

関西狈滨笔厂+読み会発表スライドYuchi Matsuoka

2014 9-26Joe Suzuki

ガイダンスJoe Suzuki

相互情报量を用いた独立性の検定Joe Suzuki

MaCaulay2 Miuraパッケージの開発と今後Joe Suzuki

OMNI-Prop: Seamless Node Classification on Arbitrary Label CorrelationYuto Yamaguchi

Online User Location Inference Exploiting Spatiotemporal Correlations in Soci...Yuto Yamaguchi

$Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$ $Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...$

Minimax optimal alternating minimization \\ for kernel nonparametric tensor l...Taiji Suzuki

関西狈滨笔厂+読み会発表スライドYuchi Matsuoka

More from Joe Suzuki (20)

搁と笔测迟丑辞苍を比较するJoe Suzuki

搁集会蔼统数研Joe Suzuki

E-learning Development of Statistics and in Duex: Practical Approaches and Th...Joe Suzuki

分枝限定法でモデル选択の计算量を低减するJoe Suzuki

连続変量を含む条件付相互情报量の推定Joe Suzuki

E-learning Design and Development for Data Science in Osaka UniversityJoe Suzuki

UAI 2017Joe Suzuki

AMBN2017 サテライトワークショップJoe Suzuki

CRAN Rパッケージ BNSLの概要Joe Suzuki

Forest Learning from DataJoe Suzuki

A Bayesian Approach to Data CompressionJoe Suzuki

A Conjecture on Strongly Consistent LearningJoe Suzuki

A Generalization of the Chow-Liu Algorithm and its Applications to Artificial...Joe Suzuki

A Generalization of Nonparametric Estimation and On-Line Prediction for Stati...Joe Suzuki

研究绍介(学生向け)Joe Suzuki

Bayesian Criteria based on Universal MeasuresJoe Suzuki

The document presents Joe Suzuki's work on generalizing Bayesian criteria to settings beyond discrete or continuous distributions. It introduces generalized density functions based on Radon-Nikodym derivatives that allow defining universal measures gn approximating true densities f. These generalized densities enable extending Bayesian criteria like comparing pgnXgnY to (1-p)gXY to assess independence, to any sample space without assuming a specific form. The approach unifies Bayesian and MDL methods under a framework of universality, with various applications like Bayesian network structure learning.

MDL/Bayesian Criteria based on Universal Coding/MeasureJoe Suzuki

The Universal Measure for General Sources and its Application to MDL/Bayesian...Joe Suzuki

1) The document presents a new theory for universal coding and the MDL principle that is applicable to general sources without assuming discrete or continuous distributions. 2) It constructs a universal measure νn that satisfies certain conditions to allow generalization of universal coding and MDL. 3) This generalized framework is applied to problems that previously separated discrete and continuous cases, such as Markov order estimation using continuous data sequences and mixed discrete-continuous feature selection.

Universal Prediction without assuming either Discrete or ContinuousJoe Suzuki

1. The document discusses universal prediction without assuming data is either discrete or continuous. It presents a method to estimate generalized density functions to achieve universal prediction for any unknown probabilistic model. 2. A key insight is that universal prediction can be achieved by estimating the ratio between the true density function and a reference measure, without needing to directly estimate the density function. This allows universal prediction for data that is neither discrete nor continuous. 3. The method involves recursively refining partitions of the sample space to estimate the density ratio. It is shown that this ratio can be estimated universally for any density function, achieving the goal of prediction without assumptions about the data type.

Bayesian network structure estimation based on the Bayesian/MDL criteria when...Joe Suzuki

搁と笔测迟丑辞苍を比较するJoe Suzuki

搁集会蔼统数研Joe Suzuki

E-learning Development of Statistics and in Duex: Practical Approaches and Th...Joe Suzuki

分枝限定法でモデル选択の计算量を低减するJoe Suzuki

连続変量を含む条件付相互情报量の推定Joe Suzuki

E-learning Design and Development for Data Science in Osaka UniversityJoe Suzuki

UAI 2017Joe Suzuki

AMBN2017 サテライトワークショップJoe Suzuki

CRAN Rパッケージ BNSLの概要Joe Suzuki

Forest Learning from DataJoe Suzuki

A Bayesian Approach to Data CompressionJoe Suzuki

A Conjecture on Strongly Consistent LearningJoe Suzuki

A Generalization of the Chow-Liu Algorithm and its Applications to Artificial...Joe Suzuki

A Generalization of Nonparametric Estimation and On-Line Prediction for Stati...Joe Suzuki

研究绍介(学生向け)Joe Suzuki

Bayesian Criteria based on Universal MeasuresJoe Suzuki

MDL/Bayesian Criteria based on Universal Coding/MeasureJoe Suzuki

The Universal Measure for General Sources and its Application to MDL/Bayesian...Joe Suzuki

Universal Prediction without assuming either Discrete or ContinuousJoe Suzuki

Bayesian network structure estimation based on the Bayesian/MDL criteria when...Joe Suzuki

基本概念

1. R言語超初心者 1. 基本概念大阪大学理学部数学科実験数学 3 担当: 鈴木譲 2015年4月13日

2. この章の内容 1. クラスとオブジェクト 2. クラス numeric 3. クラス logical 4. クラス character 5. オブジェクトの代入 6. クラスの変換 7. 数値関数

3. クラスとオブジェクト上記3クラスに入るオブジェクトの取り扱いを学ぶクラス性質要素 (オブジェクト) Numeric 数値 1, -3, 13.2, 7.2e-10, -0.667 logical 論理値 TRUE, FALSE, NA character 文字列 “interesting”, “How are you?”, “-1.28” クラス: 同じ性質をもった値の集合オブジェクト: そのクラスの要素

4. クラス numeric 1+2 3 1-2 -1 2*3 6 4/5 0.8 2^3 8 (1+2*3)/5^2 0.28 is.numeric (1+2*3)/5^2) TRUE sqrt(-3) NaN class(NaN) numeric pi 3.141593 sin(pi/6) 0.5 tan(pi/4) 1

5. クラス logical 1==2 FALSE 1<=2 TRUE 1>=2 FALSE 1!=2 TRUE 1>2 FALSE 1<2 TRUE 1==2||1>2 FALSE 1>2&&1<2 FALSE is.logical(1>2) TRUE Is.logical (NA) TRUE NAは、値が欠損していることを意味する

6. クラス character ”Thank“ “Thank” is.character(“Thank") TRUE paste("Thank","you") “Thank you” past0(“Mon”,”day”) “Monday” substring("Thank", 2,4) “han” regexpr(“day”, “Tuesday”) 5 Characterクラスを入力とする関数

7. オブジェクトの代入 x<-2 x x+3 x x<-x+4.15 x y<- -1.28 x+y Xに2を代入 (初期値) ｙに-1.28を代入 (初期値) Xにx+4.15(=6.15)を代入 (更新) 何かを代入するまでは、 xはただの記号。何らかのクラスの値をもってそのクラスのオブジェクトになる

8. クラスの変換 z<-as.numeric(2<1) z is.logical(z) is.numeric(z) as.numeric(TRUE) 1となる as.numeric(FALSE) 0となる as.numeric(NA) NAはNAになる as.numeric(“17”) numericの17になる as.logical(0) 0はFALSEで他はTRUEになる as.logical(-5) logical クラスを numeric クラスに変換

9. 数値関数関数意味 X=1.570 (=pi/2) X=-- 0.523 (=-pi/6) sqrt(x) 平方根 1.253314 NaN abs(x) 絶対値 1.570796 1.047 exp(x) 指数 4.810477 0.592 log(x) 対数 0.4515827 NaN sin(x) 正弦 0 -0.5 cos(x) 余弦 0.5 0.8660254 tan(x) 正接 Inf -0.5773503 floor(x) (絶対値の)切上げ 1 -1 trunc(x) 切下げ 1 0 round(x) 四捨五入 2 -1

狠狠撸

基本概念

Recommended

More Related Content

Viewers also liked (8)

More from Joe Suzuki (20)

基本概念