Skip to main content

366 Days of Data Science

Hi everyone,
   I have planned to begin '366 days of Data Science challenge' on October 10, 2019. Data Science is a hot trending word today, with applications extending to every field. Data science is all about exploring the insights of data. One can analyze a dataset and figure out hidden information, forecast an unseen feature and do much more with a given a data.
   Data science is not something new , as any other field of science it has the origin at the point when early human began to think.  The development in algorithmic thinking, processor speed, memory storage and a good communication has let to the trend today. The 366 days would not be enough to peek into the core of the Data Science, but it would be sufficient to actually scratch the surface of the giant planet to become a Data scientist.
   I have planned to share my knowledge in the form of articles on concepts, algorithms, tools, comparisons, recent trends in the field and more. Also i have planned to solve more data sets. On these days, i would be posting an article in this blog or any other website or will solve a dataset. I will post the link of my works under the hash tag '#366daysofDataScience' in my twitter handle '@Viswa161' daily.
   I believe i will contribute a significant work to encourage some aspirants like me. With three days to go i swear to keep up my promise. To constraint the path to the goal i will try  not to solve similar kinds of data and produce a substantial content. Also not to constraint more i would not share what i have planned to do in the future as this might affect my interest of a day. I hope i will enhance my knowledge in the field at the end of the challenge by many folds.With lots of hope, i wind up this article. Stay tuned to my twitter handle!
   
 
Labels:

Comments

Post a Comment

Popular posts from this blog

CodeSignal - Almost Strictly Increasing Sequence

I came across an interesting question in Code Signal.   "Given a sequence of integers as an array, determine whether it is possible to obtain a strictly increasing sequence by removing no more than one element from the array."                                                                                                         It is strictly increasing if every element in the array is greater than its successor.     For a strictly increasing sequence we can check for each element whether it is greater than the next. In that case we can come to a conclusion that this sequence is not strictly increasing. If every element is greater than the successor we get to know it is a strictly increasing.    For worst case(The sequence is strictly increasing), the algorithmic complexity is O(n).     If we use similar approach for the question, we have to remove each element and pass the sequence to the above function.      So for n elements, we use a fun
Post a Comment
Read more

Deep Learning (Goodfellow et al) - Chapter 2 review

     This chapter is the first chapter of the part - 1. This part prepares you for Deep learning and in this chapter Linear Algebra is covered. The author advice you to skip the chapter if you are already familiar with the concepts. Also it is not that you can become Gilbert Strang after reading this chapter! The chapter is so concise that what may be relevant to our future acquaintance with the book are only present here. Only at the end of the chapter some concepts author speaks on the application part. The focus is on mathematical concepts involving Linear Algebra.       Though Science and Engineering use Linear Algebra efficiently, Computer scientist have lesser experience with it. This is the motivation of the chapter and if you have experience it then author provides you with a reference (The Matrix Cookbook - Petersen and Pedersen, 2006) and waves you good bye to meet in the next chapter.      Definitions of scalar, vector, matrix and tensor are listed one by one
Post a Comment
Read more