liveBook · Manning

Classifier

As explained in Effective Data Analysis

A classification problem is a prediction task whose outcome is one of a set of discrete classes or categories.

A classifier predicts which category a data point belongs to using one or more predictors. Its outcome is discrete—such as “purchased” or “not purchased”—rather than a continuous value such as a price. Choose classification when the decision calls for a category; use regression when it calls for a continuous prediction. section 9.1.1 section 9.4

Table 9.1 Classes of models, their purposes, and examples
Class
Purpose
Example
Regression
Predict outcomes represented with continuous data
Predicting student test scores
Classification
Predict outcomes represented with categorical data
Predict which students will graduate on time
Clustering
Identify underlying patterns and natural “groups” in the data
Find clusters of student performance across classes
Dimension reduction
Identify shared variance among predictors to simplify model input
Find 2 underlying components to represent scores in 12 classes
Survival analysis
Predict the time until an event occurs
Predict the time to withdraw from an intensive graduate curriculum

The model-class comparison places classification beside regression and clustering, making the choice of method depend on the outcome needed. section 9.1.1

Categorizing support tickets

A support team needs to assign each ticket a priority—Low, Medium, or High—and a type, such as Billing or Delivery, before routing work. A supervised classifier is one candidate; a keyword-based rules system is another. An estimate that 20 keywords cover 60% of tickets is not a tested accuracy result. Compare the approaches on correct categorization and manual work saved, and check whether the system has unintended negative effects on groups of customers. section 8.2.2

Predicting trial conversion

A marketing team can use predicted conversion likelihood to tailor engagement emails. One workflow prepares training and test sets, tries logistic regression and tree-based models such as random forest, and evaluates out-of-sample predictions with accuracy, precision, recall, and AUC. In the reported iteration, those measures were 84%, 74%, 65%, and 0.76, respectively. Hourly predictions were then made available through a data-warehouse table linked to customer IDs. section 9.3.2

How Effective Data Analysis covers it

How deep it goes
Defines classification against regression and illustrates model selection, testing, metrics, and deployment without deriving classifier internals.
Examples
Uses support-ticket priority and type, student graduation, and free-trial conversion as categorical prediction examples.
What it assumes
Introduces categorical outcomes by contrasting them with continuous outcomes, while using predictors without deriving fitting algorithms.
What you can do after
Evaluate/understand it by comparing classification with rules and testing out-of-sample predictions before operational use.
How it connects
Connects classification to regression, rules-based systems, logistic regression, random forests, and out-of-sample evaluation.

Also explained in

Compare how 31 books explain classifier →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Effective Data Analysis. The section links point to the parts of the book it draws on.