<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Data on Gabriel Berardi</title><link>http://www.gabriel-berardi.com/categories/data/</link><description>Recent content in Data on Gabriel Berardi</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 14 Sep 2024 00:00:00 +0000</lastBuildDate><atom:link href="http://www.gabriel-berardi.com/categories/data/index.xml" rel="self" type="application/rss+xml"/><item><title>Simple Questions, Hard Answers</title><link>http://www.gabriel-berardi.com/blog/data/2024-09-30-simple-questions-hard-answers/</link><pubDate>Sat, 14 Sep 2024 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2024-09-30-simple-questions-hard-answers/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2024-09-30-simple-questions-hard-answers/images/img1.webp"&gt;&lt;/p&gt;
&lt;p&gt;When business stakeholders ask data experts seemingly simple questions, they often expect a quick and straightforward answer. On the surface, it seems like a piece of cake. But in the messy reality of data, what appears to be a simple question can quickly turn into a multi-layered onion of a problem - each layer revealing increasing complexity and ambiguity.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Example from the insurance domain:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Let&amp;rsquo;s take a practical example from the insurance industry. A sales executive asks:&lt;/p&gt;</description></item><item><title>Data Leakage in Machine Learning</title><link>http://www.gabriel-berardi.com/blog/data/2020-12-01-data-leakage-in-machine-learning/</link><pubDate>Tue, 01 Dec 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-12-01-data-leakage-in-machine-learning/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-12-01-data-leakage-in-machine-learning/images/img1.jpg"&gt;&lt;/p&gt;
&lt;p&gt;Recently, I read a thread on Twitter about several Machine Learning papers that contained severe cases of data leakage. The authors of the papers seemed unaware of this phenomenon and
therefore trained models that performed exceptionally well. Unfortunately, this was mainly due to data leakage.&lt;/p&gt;
&lt;p&gt;Not many beginners are aware of this problem and in my opinion, not many courses emphasize this issue early enough. Therefore, I would like to tell you all the things you need to know
about data leakage and some ways to prevent it in this post.&lt;/p&gt;</description></item><item><title>Detect Forged Banknotes with a Logistic Regression</title><link>http://www.gabriel-berardi.com/blog/data/2020-09-01-detect-forged-banknotes-with-a-logistic-regression/</link><pubDate>Tue, 01 Sep 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-09-01-detect-forged-banknotes-with-a-logistic-regression/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-09-01-detect-forged-banknotes-with-a-logistic-regression/images/title.png"&gt;&lt;/p&gt;
&lt;p&gt;Counterfeit money is a real problem both for individuals and for businesses. Counterfeiters constantly find new ways and techniques to produce fake banknotes, that are essentially
indistinguishable from real money. At least for the human eye!&lt;/p&gt;
&lt;p&gt;Identifying forged banknotes is a typical example of a binary classification task in Machine Learning. If we have enough data of both real and forged banknotes, we can use this data to
train a model that can classify new banknotes as either real or fake.&lt;/p&gt;</description></item><item><title>Linear and Logistic Regression</title><link>http://www.gabriel-berardi.com/blog/data/2020-07-01-linear-and-logistic-regression/</link><pubDate>Wed, 01 Jul 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-07-01-linear-and-logistic-regression/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-07-01-linear-and-logistic-regression/images/header.png"&gt;&lt;/p&gt;
&lt;p&gt;Linear and Logistic regression are among the most elementary algorithms for supervised learning. Supervised Learning describes the situation where we deal with labelled data, which means that we have labelled inputs and a target variable.&lt;/p&gt;
&lt;p&gt;Despite the fact that both have the word &amp;ldquo;regression&amp;rdquo; in their name, only one of them is typically being used for solving regression problems!&lt;/p&gt;
&lt;p&gt;Let&amp;rsquo;s see how they work!&lt;/p&gt;
&lt;h2 id="linear-regression"&gt;Linear Regression&lt;/h2&gt;
&lt;p&gt;Linear regression is possibly the easiest, most intuitive way of making a quantitative prediction. The relationship between an independent and a dependent variable is assumed to be linear, meaning that the dependent variable can be predicted using a linear function of the independent variable. For example:&lt;/p&gt;</description></item><item><title>How to Create a Racing Bar Chart with Python</title><link>http://www.gabriel-berardi.com/blog/data/2020-05-01-racing-bar-chart/</link><pubDate>Fri, 01 May 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-05-01-racing-bar-chart/</guid><description>&lt;p&gt;After reading &lt;a href="https://towardsdatascience.com/bar-chart-race-in-python-with-matplotlib-8e687a5c8a41" target="_blank" &gt;this article&lt;/a&gt; from Pratap Vardhan with great interest, I
wanted to build my own version of a Bar Chart Race that is smoother and a bit more beautiful. The biggest improvement is the interpolation (or augmentation) of
the available data points in order to make the animation smoother.&lt;/p&gt;
&lt;p&gt;Here is the Bar Chart Race we are going to build in this article:&lt;/p&gt;
&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-05-01-racing-bar-chart/images/img1.gif"&gt;&lt;/p&gt;
&lt;p&gt;For the purpose of this demonstration, we are going to use a GDP per capita forecast dataset provided by the OECD. You can find the original dataset &lt;a href="https://www.kaggle.com/auwsom/gdp-projections-to-2060-oecd-countries-and-world" target="_blank" &gt;here&lt;/a&gt;.&lt;/p&gt;</description></item><item><title>k-Nearest Neighbors</title><link>http://www.gabriel-berardi.com/blog/data/2020-10-01-k-nearest-neighbors/</link><pubDate>Fri, 01 May 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-10-01-k-nearest-neighbors/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-10-01-k-nearest-neighbors/images/header.jpg"&gt;&lt;/p&gt;
&lt;p&gt;k-Nearest Neighbors, or k-NN as I am going to call it from now on, is one of the easiest algorithms to solve classification tasks. It can be used for regression
problems as well, but I am going to focus on the more common use case of classification in this post.&lt;/p&gt;
&lt;p&gt;In a nutshell, k-NN will assign a new data point to the class that the majority of its k neighbours in the training set belong to. Let&amp;rsquo;s use another coffee-related
example to see how that works.&lt;/p&gt;</description></item><item><title>Simple Facial Recognition with OpenCV</title><link>http://www.gabriel-berardi.com/blog/data/2020-08-01-simple-facial-recognition-with-opencv/</link><pubDate>Fri, 01 May 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-08-01-simple-facial-recognition-with-opencv/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-08-01-simple-facial-recognition-with-opencv/images/header.jpg"&gt;&lt;/p&gt;
&lt;p&gt;Have you ever seen some cool applications of computer vision tools, like this the one below?&lt;/p&gt;
&lt;p&gt;Perhaps your phone&amp;rsquo;s camera can autofocus on faces, or maybe you have uploaded a photo on a social media platform and it automatically recognized the person on the
image?&lt;/p&gt;
&lt;p&gt;These are facial recognition applications and they all rely on Machine Learning. In this post, we are going to use a very easy package called OpenCV to build our
own facial recognition program!&lt;/p&gt;</description></item><item><title>Where to eat in Munich?</title><link>http://www.gabriel-berardi.com/blog/data/2020-11-01-where-to-eat-in-munich/</link><pubDate>Fri, 01 May 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-11-01-where-to-eat-in-munich/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-11-01-where-to-eat-in-munich/images/header.jpg"&gt;&lt;/p&gt;
&lt;p&gt;I recently moved to a new city - Munich! I live in a very calm area, but soon realized that the neighbourhood is not really the best when it comes to eating
outside. So, I decided to try to analyse review data from the web to find out which area is most compelling for me and other foodies. I scraped online reviews,
cleaned the data and then visualized it on a map, showing the average rating of restaurants in different areas in Munich.&lt;/p&gt;</description></item><item><title>Scrape a Book Shop with BeautifulSoup</title><link>http://www.gabriel-berardi.com/blog/data/2020-03-01-scrape-bookshop-with-beautifulsoup/</link><pubDate>Sun, 01 Mar 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-03-01-scrape-bookshop-with-beautifulsoup/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-03-01-scrape-bookshop-with-beautifulsoup/images/title.png"&gt;&lt;/p&gt;
&lt;p&gt;Web Scraping is the automated process of extracting data from websites. This is commonly done by retrieving the HTML code of a website through a request and then extracting the information hidden in the HTML code programmatically. This is especially convenient when there is no API available to you!&lt;/p&gt;
&lt;p&gt;There has been a lot of discussion going on about the legality and ethics of Web Scraping, which I do not want to get into in this article. You can check out this Wikipedia article and this blog post, if you want to know more about that.&lt;/p&gt;</description></item><item><title>k-Means Clustering</title><link>http://www.gabriel-berardi.com/blog/data/2020-01-01-k-means-clustering/</link><pubDate>Wed, 01 Jan 2020 00:00:00 +0000</pubDate><guid>http://www.gabriel-berardi.com/blog/data/2020-01-01-k-means-clustering/</guid><description>&lt;p&gt;&lt;img loading="lazy" src="http://www.gabriel-berardi.com/blog/data/2020-01-01-k-means-clustering/images/header.jpg"&gt;&lt;/p&gt;
&lt;p&gt;The k-means algorithm is used to divide unlabeled data into categories or classes, in order to draw useful conclusions from the resulting clusters.&lt;/p&gt;
&lt;p&gt;Let&amp;rsquo;s take a look at an imaginary dataset of n = 18 observations of different coffee brands. Note that we would never actually use the k-means algorithm on such a small data set.&lt;/p&gt;
&lt;p&gt;We plot the price of the coffee vs. the rating obtained by customers:&lt;/p&gt;</description></item></channel></rss>