Facebook IV Winner's Interview: 1st place, Peter Best (aka fakeplastictrees)

Peter Best (aka fakeplastictrees) took 1st place in Human or Robot?, our fourth Facebook recruiting competition. Finishing ahead of 984 other data scientists, Peter ignored early results from the public leaderboard and stuck to his own methodology (which involved removing select bots from the training set). In this blog, he shares what led to this winning approach and how the competition helped him grow as a data scientist.

The Basics

What was your background prior to entering this challenge?

After studying chemistry for my first degree, I worked for twenty years in quantitative asset management culminating in being a partner in my own firm. After this, I went back to university to obtain a second degree, in maths this time. Recently, I have been looking for the right project to commit to. My programming experience extends all the way back to a ZX81. Whilst I would never describe myself as a professional programmer, I seem to be able to program.

Kaggle profile for Peter Best (aka fakeplastictrees)

How did you get started competing on Kaggle?

With all my experience, I decided my area of greatest interest lay in analysing complex data. I also quickly realised that my coding skills were from the previous century and thus I opted to learn python. Perhaps the best way to learn a programming language is to actually do something in it and this led me to Kaggle.

Peter's top competition finishes

Do you have any prior experience or domain knowledge that helped you succeed in this competition?

Not really. Financial markets are somewhat like auctions and the people who work in financial markets are somewhat like bots (occasionally!), but I don’t think I used any specialist knowledge in this competition. Many examples of data analysis have similarities despite relating to completely different fields.

What made you decide to enter this competition?

The key to this competition looked like it was going to be feature engineering, something I regard as a strength. In addition, the size of the data set was small enough to manage easily on my Mac with short run times.

Let's Get Technical

What preprocessing and supervised learning methods did you use?

Most features were composed by manipulating the data in the bids database then transferring some aggregate measure into a smaller database uniquely indexed by bidder. This smaller database was then used as input to a boosted trees model.

What was your most important insight into the data?

As soon as I started doing some cross-validation on an early version of my model, I found that the statistical error on the estimate of the Area Under the ROC Curve (the evaluation metric used in the competition) was going to be quite high. This led me to undertake extensive resampling in my cross-validation to ensure my estimate of the AUC was accurate enough to base decisions upon. In addition, it suggested that the public leaderboard score was likely to be a poor guide to the eventual private leaderboard score and it was going to be much better to trust my own cross-validation. As a consequence of this I only actually submitted three entries into the competition.

Were you surprised by any of your findings?

One of the most straightforward features to envisage was simply the number of bids made by each bidder. Ex ante, one could suppose that a bot could place far more bids than the average human. When a histogram of the number of bids placed by each bot was considered, however, there was a striking anomaly. Five bots were identified as having only one bid each in the data set, which looks unusual in the distribution, as shown.

Having only one bid per bot suggests that either there are some links with other bots in the data or that they have been labelled as bots using data which we don’t know. Investigation yielded no obvious links to other bots and the latter point implies that the data from these bots won’t generalise well to a different data set. Thus, the algorithms that I used may be negatively affected by trying to learn from these bot examples. I decided then to create a solution that removed these five observations from the training data set and submitted this as one of my two selected entries. It was this entry that won the competition.

Also, note that this picture was on the home page of the competition. There are five bots! Was it a clue?

Which tools did you use?

I did everything in python, using the excellent Scikit-learn package for the boosted trees algorithm.

How did you spend your time on this competition?

I tend to flit to and fro between the two [feature engineering & machine learning] as I’m going along. I tend to start with some feature engineering, then perform some gross parameter tuning for the machine learning algorithm, then return to some more feature engineering and so on. In this competition the feature engineering took up a lot more time than the machine learning. I spent quite a lot of time lovingly hand-crafting features that didn’t improve the model in cross-validation, but this is normal for this sort of competition. Just because you think a feature will be useful doesn’t mean it will be.

What was the run time for both training and prediction of your winning solution?

Just a few minutes, though each cross-validation run took over an hour.

Words of Wisdom

What have you taken away from this competition?

Enhanced self-belief in persevering with what you know to be the correct methodology and not getting distracted by things that don’t really matter (in this competition, that meant the public leaderboard!).

Also, a realisation that even though I think my methods gave me the best chance of doing well, actually winning the competition required the cards to fall my way this time.

Do you have any advice for those just getting started in data science?

Firstly, look through the Kaggle website, especially the forums, to pick up a vast amount of good advice on how to improve your data science.

Mostly though, my advice is to just have a go, make mistakes and learn from these.

Bio

Peter Best is a graduate in both chemistry and mathematics. He worked for many years in the quantitative asset management industry where he performed extensive data analysis. He is currently competing in Kaggle competitions and trying to decide on his next project.

Facebook IV Winner's Interview: 1st place, Peter Best (aka fakeplastictrees)的更多相关文章

  1. CrowdFlower Winner's Interview: 1st place, Chenglong Chen

    CrowdFlower Winner's Interview: 1st place, Chenglong Chen The Crowdflower Search Results Relevance c ...

  2. How Much Did It Rain? Winner's Interview: 1st place, Devin Anzelmo

    How Much Did It Rain? Winner's Interview: 1st place, Devin Anzelmo An early insight into the importa ...

  3. Diabetic Retinopathy Winner's Interview: 1st place, Ben Graham

    Diabetic Retinopathy Winner's Interview: 1st place, Ben Graham Ben Graham finished at the top of the ...

  4. ICDM Winner's Interview: 3rd place, Roberto Diaz

    ICDM Winner's Interview: 3rd place, Roberto Diaz This summer, the ICDM 2015 conference sponsored a c ...

  5. Recruit Coupon Purchase Winner's Interview: 2nd place, Halla Yang

    Recruit Coupon Purchase Winner's Interview: 2nd place, Halla Yang Recruit Ponpare is Japan's leading ...

  6. Otto Product Classification Winner's Interview: 2nd place, Alexander Guschin ¯\_(ツ)_/¯

    Otto Product Classification Winner's Interview: 2nd place, Alexander Guschin ¯\_(ツ)_/¯ The Otto Grou ...

  7. Liberty Mutual Property Inspection, Winner's Interview: Qingchen Wang

    Liberty Mutual Property Inspection, Winner's Interview: Qingchen Wang The hugely popular Liberty Mut ...

  8. 如何在 Kaggle 首战中进入前 10%

    原文:https://dnc1994.com/2016/04/rank-10-percent-in-first-kaggle-competition/ Introduction Kaggle 是目前最 ...

  9. 【转载】如何在 Kaggle 首战中进入前 10%

    本文转载自如何在 Kaggle 首战中进入前 10% 转载仅出于个人学习收藏,侵删 Introduction 本文采用署名 - 非商业性使用 - 禁止演绎 3.0 中国大陆许可协议进行许可.著作权由章 ...

随机推荐

  1. Sencha Touch 的基础知识

    基础知识 一.要注意书写,一个字母就会让你代码跑不起来Ext.setup({ icon:'icon.png', glossOnIcon:false, tabletStartupScreen:'talb ...

  2. TopCoder SRMS 1 字符串处理问题 Java题解

    Problem Statement   Let's say you have a binary string such as the following: 011100011 One way to e ...

  3. android 16 带返回值的activity

    main.xml <LinearLayout xmlns:android="http://schemas.android.com/apk/res/android" andro ...

  4. mysql 存储过程项目小结

    1. false :0  true 1 切记 官方文档:http://dev.mysql.com/doc/refman/5.0/en/numeric-type-overview.html BOOL,  ...

  5. block没那么难(二):block和变量的内存管理

    本系列博文总结自<Pro Multithreading and Memory Management for iOS and OS X with ARC> 了解了 block的实现,我们接着 ...

  6. Java NIO 学习笔记

    为了防止无良网站的爬虫抓取文章,特此标识,转载请注明文章出处.LaplaceDemon/SJQ. http://www.cnblogs.com/shijiaqi1066/p/3344148.html ...

  7. 23、Javascript DOM

    DOM Document Object Model(文档对象模型)定义了html和xml的文档标准. DOM 节点树 <html> <head> <title>DO ...

  8. 在vSphere5.0虚拟机里的Ubuntu Server 32位安装JDK

    本机操作系统Win7 服务器用vSphere 5.0 虚拟机  在虚拟机安装了Ubuntu Server 12.04 1.首先到Oracle官网上下载jdk-7u51-linux-i586.tar.g ...

  9. 图论——读书笔记(基于BFS广度优先算法的广度优先树)

    广度优先树 对于一个图G=(V,E)在跑过BFS算法的过程中会创建一棵广度优先树. 形式化一点的表示该广度 优先树的形成过程是这样的: 对于图G=(V,E)是有向图或是无向图, 和图中的源结点s, 我 ...

  10. Typescript 团队合作的利器

    前言 在介绍Typescript 之前,我需要隆重介绍一个人: 安德斯·海尔斯伯格(Anders Hejlsberg,1960.12~),丹麦人,Turbo Pascal编译器的主要作者,Delphi ...