Step by step Kaggle competition tutorial

A clean and concise guide to Data Science.


Kaggle is a Data Science community where thousands of Data Scientists compete to solve complex data problems.

In this article we are going to see how to go through a Kaggle competition step by step.

The contest explored here is the San Francisco Crime Classification contest. The goal is to classify a crime occurrence knowing the time and place it happened.

Screenshot from 2016-04-10 10:06:15.png

View original post 916 more words


Standard Template Library : An Introduction

What is the Standard Template Library(STL) ?
The Standard Template Library (STL) is a software library for the C++ programming language. It provides four components called containers, iterators, algorithms and functional. STL library lies in the std namespace.

Why do we need to use the STL?
1. There is no use in inventing a wheel that has been in presence for decades.
2. STL in C++ provides humongous number of ready-made common classes, such as containers that can be used in any built and user defined type, that supports elementary operations like (such as copying and assignment).
*You should know how to write these data structures yourself. This knowledge will help you choose the best STL data structure required for your need.

Containers :
Containers are objects that store data. Inbuilt implementations of various abstract data types are available in STL.

The container manages the storage space that is allocated for its elements and provides member functions to access them, either directly or through iterators (objects with similar properties to pointers).

Most containers have at least several member functions in common, and share functionalities. Which container is the best for the particular application depends not only on the offered functionality, but also on its efficiency for different workloads.

Header file :- In most of the cases, header files of the container have their name of the of form, <containerName>. For instance the header files of vector, stack, deque are <vector>, <stack>, <deque> respectively.

Iterators :
An iterator is any object that, pointing to some element in a range of elements (such as an array or a container), has the ability to iterate through the elements of that range using a set of operators (with at least the increment (++) and dereference (*) operators).

Header file :- <iterator>
There are 5 types of iterators :-

Algorithms :
The algorithms library defines functions for a variety of purposes (e.g. searching, sorting, counting, manipulating) that operate on ranges of elements. Note that a range is defined as [first, last) where last refers to the element past the last element to inspect or modify. The exhaustive list of functions available in algorithm can be read from cplusplus reference.

Header file :- <algorithm>

Functional :
Functional provides a set of predefined class templates for function objects, including operations for arithmetic, comparisons, and logic.

Header file :- <functional>

So now that you are aware of the basic STL terminology in the coming posts we will go through the features of the most commonly used containers one by one. Don’t forget to subscribe, love, code and discuss. 🙂

Numbers and recipes at

A much awaited day, a long lost dream, finally comes to life with, a wish I had for 9 years now; has awaken only to become a reality. At last a place where I can share all my knowledge, of whatever I have. A belly that has been so full of words will finally get some peace.

I would be sharing my views on numbers, scripts, programs, movies and maybe eh humans! To start of, my favorite number is 28, the only number known to mankind that can be represented as a sum of first few prime numbers(2,3,5,7,11), first few composite numbers(4,6,8,10) and as the sum of its own proper factors(1,2,4,7,14). Fascinating.

Behold! fasten your seat-belts for the ride that is about to come! Also let us know your favorite number. 🙂