twitter graph

twitter graph

Comments

Post a Comment

Popular posts from this blog

Difference between Batch Gradient Descent and Stochastic Gradient Descent

Image
  Difference between Batch Gradient Descent and Stochastic Gradient Descent In order to train a Linear Regression model, we have to learn some model parameters such as feature weights and bias terms. An approach to do the same is Gradient Descent which is an iterative optimization algorithm capable of tweaking the model parameters by minimizing the cost function over the train data. It is a complete algorithm i.e it is guaranteed to find the global minimum (optimal solution) given there is enough time and the learning rate is not very high. Two Important variants of Gradient Descent which are widely used in Linear Regression as well as Neural networks are Batch Gradient Descent and Stochastic Gradient Descent(SGD).  Batch Gradient Descent:  Batch Gradient Descent involves calculations over the full training set at each step as a result of which it is very slow on very large training data. Thus, it becomes very computationally expensive to do Batch GD. However, this is gre...
Read more

INTRODUCTION TO STATISTICS

 UNIT 1 INTRODUCTION TO STATISTICS Structure 1.0 Introduction 1.1 Objectives 1.2 Meaning of Statistics 1.2.1 Statistics in Singular Sense 1.2.2 Statistics in Plural Sense 1.2.3 Definition of Statistics 1.3 Types of Statistics 1.3.1 On the Basis of Function 1.3.2 On the Basis of Distribution of Data 1.4 Scope and Use of Statistics 1.5 Limitations of Statistics 1.6 Distrust and Misuse of Statistics 1.7 Let Us Sum Up 1.8 Unit End Questions 1.9 Glossary 1.10 Suggested Readings 1.0 INTRODUCTION The word statistics has different meaning to different persons. Knowledge of statistics is applicable in day to day life in different ways. In daily life it means general calculation of items, in railway statistics means the number of trains operating, number of passenger’s freight etc. and so on. Thus statistics is used by people to take decision about the problems on the basis of different type of quantitative and qualitative information available to them. However, in behavioural sciences, the ...
Read more

The connected components

Image
  3 The connected components   Molloy and Reed [1995] showed that for a random graph with vertices of degree i, where   are non-negative values which sum to 1, the giant component emerges when So long as the maximum degree is less than   They also show that almost surely there is no giant component when and maximum degree less than Here we compute Q for our graphs. We are thus led to consider the value   which is a solution to If We first summarize the results here: 1.    When   the random graph a. s. has no giant component. When   there is almost surely a unique giant component. 2.    When     almost surely the second largest components have size   there is almost surely a component of size x. 3.       When   almost surely the second largest components are of size For any   there is almost surely a component of size x. 4.      When   th...
Read more