This presentation covered the following topics:
1. Definition of Correlation and Regression
2. Meaning of Correlation and Regression
3. Types of Correlation and Regression
4. Karl Pearson's methods of correlation
5. Bivariate Grouped data method
6. Spearman's Rank correlation Method
7. Scattered diagram method
8. Interpretation of correlation coefficient
9. Lines of Regression
10. regression Equations
11. Difference between correlation and regression
12. Related examples
Correlation Analysis
Correlation Analysis
Correlation measures the relationship between two quantitative variables
Linear correlation measures if the ordered paired data follow a straight-line relationship between quantitative variables.
The correlation coefficient (r) computed from the sample data measures the strength and the direction of a linear relationship between two variables.
The range of correlation coefficient is -1 to +1. When there is no linear relationship between the two variables or only a weak relationship, the value of correlation coefficient will be close to 0.
Things to Remember
Correlation coefficient cutoff points
+0.30 to + 0.49 weak positive association.
+ 0.5 to +0.69 medium positive association.
+0.7to + 1.0 strong positive association.
- 0.5 to - 0.69 medium negative association.
- 0.7 to - 1.0 strong negative association.
- 0.30 to - 0.49 weak negative association.
0 to - 0.29 little or no association.
0 to + 0.29 little or no association.
Relationships of Linear Correlation
As x increases, no definite shift in y: no correlation.
As x increase, a definite shift in y: correlation.
Positive correlation: x increases, y increases.
Negative correlation: x increases, y decreases.
If the points exhibit some other nonlinear pattern: no linear relationship.
Example: No correlation.
As x increases, there is no definite shift in y.
Example: Positive/direct correlation.
As x increases, y also increases.
Example: Negative/indirect/inverse correlation.
As x increases, y decreases.
Coefficient of linear correlation: r, measures the strength of the linear relationship between two variables.
Pearson Correlation formula:
Note:
r = +1: perfect positive correlation
r = -1 : perfect negative correlation
Use the calculated value of the coefficient of linear correlation, r, to make an inference about the population correlation coefficient r.
Example 1: Is there a relationship between age of the children and their score on the Child Medical Fear Scale (CMFS), using the data shown in Table 1?
H0: There is no significant relationship between the age of the children and their score on the CMFS
Or
H0: r = 0
IDAge (x)CMFS (y)183129253940410275113569297825893498441011191172812647136421483715935161216171512181323191026201036
Table 1
Scattergram (Scatterplot)
Age (x) = Independent variable, CMFS (y)= Dependent variable
Correlation Coefficient
The Results:
a. Decision: Reject H0.
b. Conclusion: There is evidence to suggest that there is a significant linear relationship between the age of the child and the score on the CMFS.
Answers the question of whether there is a significant linear relationship or not
Simple Linear Regression Analysis
Linear Regression Analysis
Linear Regression analysis finds the equation of the line that predicts the dependent variable based on the independent variable.
210 190 165 150 130 115 100 90 70 60 40 25 35 6.
This presentation covered the following topics:
1. Definition of Correlation and Regression
2. Meaning of Correlation and Regression
3. Types of Correlation and Regression
4. Karl Pearson's methods of correlation
5. Bivariate Grouped data method
6. Spearman's Rank correlation Method
7. Scattered diagram method
8. Interpretation of correlation coefficient
9. Lines of Regression
10. regression Equations
11. Difference between correlation and regression
12. Related examples
Correlation Analysis
Correlation Analysis
Correlation measures the relationship between two quantitative variables
Linear correlation measures if the ordered paired data follow a straight-line relationship between quantitative variables.
The correlation coefficient (r) computed from the sample data measures the strength and the direction of a linear relationship between two variables.
The range of correlation coefficient is -1 to +1. When there is no linear relationship between the two variables or only a weak relationship, the value of correlation coefficient will be close to 0.
Things to Remember
Correlation coefficient cutoff points
+0.30 to + 0.49 weak positive association.
+ 0.5 to +0.69 medium positive association.
+0.7to + 1.0 strong positive association.
- 0.5 to - 0.69 medium negative association.
- 0.7 to - 1.0 strong negative association.
- 0.30 to - 0.49 weak negative association.
0 to - 0.29 little or no association.
0 to + 0.29 little or no association.
Relationships of Linear Correlation
As x increases, no definite shift in y: no correlation.
As x increase, a definite shift in y: correlation.
Positive correlation: x increases, y increases.
Negative correlation: x increases, y decreases.
If the points exhibit some other nonlinear pattern: no linear relationship.
Example: No correlation.
As x increases, there is no definite shift in y.
Example: Positive/direct correlation.
As x increases, y also increases.
Example: Negative/indirect/inverse correlation.
As x increases, y decreases.
Coefficient of linear correlation: r, measures the strength of the linear relationship between two variables.
Pearson Correlation formula:
Note:
r = +1: perfect positive correlation
r = -1 : perfect negative correlation
Use the calculated value of the coefficient of linear correlation, r, to make an inference about the population correlation coefficient r.
Example 1: Is there a relationship between age of the children and their score on the Child Medical Fear Scale (CMFS), using the data shown in Table 1?
H0: There is no significant relationship between the age of the children and their score on the CMFS
Or
H0: r = 0
IDAge (x)CMFS (y)183129253940410275113569297825893498441011191172812647136421483715935161216171512181323191026201036
Table 1
Scattergram (Scatterplot)
Age (x) = Independent variable, CMFS (y)= Dependent variable
Correlation Coefficient
The Results:
a. Decision: Reject H0.
b. Conclusion: There is evidence to suggest that there is a significant linear relationship between the age of the child and the score on the CMFS.
Answers the question of whether there is a significant linear relationship or not
Simple Linear Regression Analysis
Linear Regression Analysis
Linear Regression analysis finds the equation of the line that predicts the dependent variable based on the independent variable.
210 190 165 150 130 115 100 90 70 60 40 25 35 6.
Chatty Kathy - UNC Bootcamp Final Project Presentation - Final Version - 5.23...John Andrews
SlideShare Description for "Chatty Kathy - UNC Bootcamp Final Project Presentation"
Title: Chatty Kathy: Enhancing Physical Activity Among Older Adults
Description:
Discover how Chatty Kathy, an innovative project developed at the UNC Bootcamp, aims to tackle the challenge of low physical activity among older adults. Our AI-driven solution uses peer interaction to boost and sustain exercise levels, significantly improving health outcomes. This presentation covers our problem statement, the rationale behind Chatty Kathy, synthetic data and persona creation, model performance metrics, a visual demonstration of the project, and potential future developments. Join us for an insightful Q&A session to explore the potential of this groundbreaking project.
Project Team: Jay Requarth, Jana Avery, John Andrews, Dr. Dick Davis II, Nee Buntoum, Nam Yeongjin & Mat Nicholas
Techniques to optimize the pagerank algorithm usually fall in two categories. One is to try reducing the work per iteration, and the other is to try reducing the number of iterations. These goals are often at odds with one another. Skipping computation on vertices which have already converged has the potential to save iteration time. Skipping in-identical vertices, with the same in-links, helps reduce duplicate computations and thus could help reduce iteration time. Road networks often have chains which can be short-circuited before pagerank computation to improve performance. Final ranks of chain nodes can be easily calculated. This could reduce both the iteration time, and the number of iterations. If a graph has no dangling nodes, pagerank of each strongly connected component can be computed in topological order. This could help reduce the iteration time, no. of iterations, and also enable multi-iteration concurrency in pagerank computation. The combination of all of the above methods is the STICD algorithm. [sticd] For dynamic graphs, unchanged components whose ranks are unaffected can be skipped altogether.
The Building Blocks of QuestDB, a Time Series Databasejavier ramirez
Talk Delivered at Valencia Codes Meetup 2024-06.
Traditionally, databases have treated timestamps just as another data type. However, when performing real-time analytics, timestamps should be first class citizens and we need rich time semantics to get the most out of our data. We also need to deal with ever growing datasets while keeping performant, which is as fun as it sounds.
It is no wonder time-series databases are now more popular than ever before. Join me in this session to learn about the internal architecture and building blocks of QuestDB, an open source time-series database designed for speed. We will also review a history of some of the changes we have gone over the past two years to deal with late and unordered data, non-blocking writes, read-replicas, or faster batch ingestion.
06-04-2024 - NYC Tech Week - Discussion on Vector Databases, Unstructured Data and AI
Round table discussion of vector databases, unstructured data, ai, big data, real-time, robots and Milvus.
A lively discussion with NJ Gen AI Meetup Lead, Prasad and Procure.FYI's Co-Found
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Analysis insight about a Flyball dog competition team's performanceroli9797
Insight of my analysis about a Flyball dog competition team's last year performance. Find more: https://github.com/rolandnagy-ds/flyball_race_analysis/tree/main
Analysis insight about a Flyball dog competition team's performance
maths_proficency final2.pptx
1. DEPARMENT OF INFORMATION TECHNOLOGY
PROFICIENCY TEST
Engineering Mathematics -2
(100025)
Submitted To-
Dr. J K Muthele
MADHAV INSTITUTE OF TECHNOLOGY AND SCIENCE GWALIOR (M,P)
(A Govt. Aided UGC Autonomous & NAAC Accredited Institute Affiliated to RGPV, Bhopal)
Submitted by-
Niranjan Kumar Batham(0901IT211036)
Parth Joshi (0901IT211037)
Piyush Pawak(0901IT211038)
Prabhat Uikey(0901IT211039)
Prakhar Gupta(0901IT211040)
Prashant Mourya(0901IT211041)
Priyank Singh(0901IT211042)
2. Types of correlation
On the basis of
degree of
correlation
On the basis of
number of variables
On the basisof
linearity
• Positive
correlation
•Negative
correlation
•Simple
correlation
• Partialcorrelation
•Multiple
correlation
• Linear
correlation
• Non – linear
correlation
Arelationship between two variables such that a change in one variable results a change in other
variable is called correlation and such variables are called correlated.
Thus the correlation analysis is a mathematical tool which is used to measure the degree to which
are variable is linearly related to each other
CORRELATION
3. CORRELATION:-On the basis of degree of
corelation
DIRECT OR POSITIVE CORRELATION
If the increase(or decrease) in one variable results in a
corresponding increase (or decrease) in the other, the correlation
is said to be direct or positive.
DIVERSE OR NEGATIVE CORRELATION
If the increase(or decrease) in one variable results in a
corresponding decrease (or increase) in the other, the correlation
is said to be diverse or negative correlation.
4. CORRELATION:-On the basis of linearity
LINEAR CORRELATION
Arelation in which the values of two variable have a constant
ratio is called linear correlation
(or perfect correlation).
NON LINEAR CORRELATION
Arelation in which the values of two variable does not have a
constant ratio is called a non linear correlation.
5. Correlation : On the basis of number of variables
Simple correlation
Correlation is said to be simple when only two variables are analyzed.
For example :
Correlation is said to be simple when it is done between demand and supply or
we can say income and expenditure etc.
Partial correlation :
When three or more variables are considered for analysis but only two
influencing variables are studied and rest influencing variables are kept
constant.
For example :
Correlation analysis is done with demand, supply and income. Where income is
kept constant.
Multiple correlation :
In case of multiple correlation three or more variables are studied simultaneously.
For example :
Rainfall, production of rice and price of rice are studied simultaneously will be known
are multiple correlation.
6. Properties of coefficient of correlation-
(i) It is the degree of measure of correlation
(ii) The value of r(x,y) lies between -1 and 1.
(iii) If r=1, then the correlation is perfect positive.
(iv) If r= -1, then the correlation is perfect negative.
(v) If r = 0,then variables are independent ,
i.e. no correlation
(vi)Correlation coefficient is independent of change of
origin and scale.
If X and Y are random variables and
a,b,c,d are any numbers provided that a
≠0, c ≠0 ,then
r( aX+b, cY+d) = r(X,Y)
7. COVARIANCE
The covariance between two variables x and y whose n
pairs of observations are
(x1,y1),(x2,y2)……………(xn,yn)
is defined as Cov (x ,y)=
=[(x1- )(y1- )+……………..(xn- )(yn- )] /n
8. Karl Pearson’s Coefficient of
Correlation-
Correlation coefficient between two variables x and y is
denoted by r(x,y) and it is a numerical measure of
linear relationship between them.
r(x,y)=
Where r(x,y) = correlation coefficient
between x and y
σx = standard deviation of x σy =
standard deviation of y n= no. of
observations
9. RANK CORRELATION-
Let (xi ,yi) i = 1,2,3……n be the ranks of n
individuals in the group for the characteristic A and B
respectively.
Co-efficient of correlation between the ranks is called
the rank correlation co-efficient between the
characteristic A and B for that group of individuals.
r = 1-
Where di denotes the difference in ranks of the ith
individual.