Google-apprecensies opnieuw bekijken

We gaan nu gradient boosting gebruiken om sentimentanalyse uit te voeren!

Weet je het app-beoordelingen-datasset uit het eerste hoofdstuk nog? We werken nu met een verwant gegevensbestand met gebruikersrecensies. Dit gegevensbestand bevat de eerste 100 meest relevante recensies voor elke app. Ons doel is om op basis van deze recensies een model te bouwen dat de Sentiment voorspelt als 'Positive', 'Neutral' of 'Negative'.

Het gegevensbestand is beschikbaar als reviews, en het doel is hier de kolom 'Sentiment'. Verken de data in de IPython Shell en selecteer daarna de juiste bewering uit de opties hieronder.

Deze oefening maakt deel uit van de cursus

Ensemblemethoden in Python

Cursus bekijken

Praktische interactieve oefening

Zet theorie om in actie met een van onze interactieve oefeningen.

Begin met trainen

Deze oefening maakt deel uit van de cursus

Ensemblemethoden in Python

SkillTag.level.advancedSkillTag.label

4.9+

Begin de cursus gratis

Do you struggle to determine which of the models you built is the best for your problem? You should give up on that, and use them all instead! In this chapter, you'll learn how to combine multiple models into one using "Voting" and "Averaging". You'll use these to predict the ratings of apps on the Google Play Store, whether or not a Pokémon is legendary, and which characters are going to die in Game of Thrones!

Exercise 1: Introduction to ensemble methods Exercise 2: Exploring Google apps data Exercise 3: Predicting the rating of an app Exercise 4: Voting Exercise 5: Choosing the best model Exercise 6: Assembling your first ensemble Exercise 7: Evaluating your ensemble Exercise 8: Averaging Exercise 9: Journey to Westeros Exercise 10: Predicting GoT deaths Exercise 11: Soft vs. hard voting

Bagging is the ensemble method behind powerful machine learning algorithms such as random forests. In this chapter you'll learn the theory behind this technique and build your own bagging models using scikit-learn.

Exercise 1: The strength of “weak” models Exercise 2: Restricted and unrestricted decision trees Exercise 3: "Weak" decision tree Exercise 4: Bootstrap aggregating Exercise 5: Training with bootstrapping Exercise 6: A first attempt at bagging Exercise 7: BaggingClassifier: nuts and bolts Exercise 8: Bagging: the scikit-learn way Exercise 9: Checking the out-of-bag score Exercise 10: Bagging parameters: tips and tricks Exercise 11: Exploring the UCI SECOM data Exercise 12: A more complex bagging model Exercise 13: Tuning bagging hyperparameters

Boosting is class of ensemble learning algorithms that includes award-winning models such as AdaBoost. In this chapter, you'll learn about this award-winning model, and use it to predict the revenue of award-winning movies! You'll also learn about gradient boosting algorithms such as CatBoost and XGBoost.

Exercise 1: De effectiviteit van geleidelijk leren Exercise 2: Kennismaking met de filmdatabase Exercise 3: Filmeigenschappen verkennen Exercise 4: Filmomzet voorspellen Exercise 5: Boosting voor voorspelde omzet Exercise 6: Adaptive boosting: bekroond model Exercise 7: Je eerste AdaBoost-model Exercise 8: Boomgebaseerde AdaBoost-regressie Exercise 9: Haal alles uit AdaBoost Exercise 10: Gradient boosting Exercise 11: Google-apprecensies opnieuw bekijken

Huidige oefening

Exercise 12: Sentimentanalyse met GBM Exercise 13: Verschillende smaken van gradient boosting Exercise 14: Filmomzet voorspellen met CatBoost Exercise 15: Boosting-wedstrijd: Light vs Extreme

Get ready to see how things stack up! In this final chapter you'll learn about the stacking ensemble method. You'll learn how to implement it using scikit-learn as well as with the mlxtend library! You'll apply stacking to predict the edibility of North American mushrooms, and revisit the ratings of Google apps with this more advanced approach.

Exercise 1: The intuition behind stacking Exercise 2: Exploring the mushroom dataset Exercise 3: Predicting mushroom edibility Exercise 4: K-nearest neighbors for mushrooms Exercise 5: Build your first stacked ensemble Exercise 6: Applying stacking to predict app ratings Exercise 7: Building the stacking classifier Exercise 8: Stacked predictions for app ratings Exercise 9: Let's mlxtend it!Exercise 10: A first attempt with mlxtend Exercise 11: Back to regression with stacking Exercise 12: Mushrooms: a matter of life or death Exercise 13: Ensembling it all together