Guide-linked quiz · Medium Level

Binning and Discretization Quiz

Tests equal-width and quantile bins, target-informed cut points, information loss, and the approximation used by histogram-based tree learners.

Related guide pathsBinning And Discretization
Question 1 of 8

For a highly skewed income feature, how do equal-width and quantile binning place their boundaries differently?

Preview every question8 questions

Answers and explanations appear as you take the quiz.

  1. For a highly skewed income feature, how do equal-width and quantile binning place their boundaries differently?
    • Equal-width binning divides the range into equal-size intervals, while quantile binning chooses boundaries so each bin has roughly the same number of data points
    • Equal-width binning uses the target label, quantile binning does not
    • They are two names for the same method
    • Quantile binning can only be applied to categorical variables
  2. What distinguishes supervised binning from equal-width or quantile binning?
    • It requires no data at all
    • It can only produce two bins
    • It chooses bin boundaries using the target label to best separate outcomes
    • It is identical to equal-width binning but renamed
  3. When equal-width bins are applied to a skewed feature, what distribution of sample counts can result?
    • It always requires supervised labels
    • Some bins can end up nearly empty while others are overcrowded if the data isn't uniformly distributed
    • It cannot be computed for numeric variables
    • It is more computationally expensive than quantile binning
  4. How can binning let a linear model capture a non-linear relationship between a variable and the outcome?
    • By removing the variable from the model entirely
    • By converting the linear model into a decision tree
    • By requiring the variable to be normally distributed
    • By giving each bin its own coefficient, effectively creating a step-function relationship
  5. After two values are mapped to the same bin, what detail can the model no longer distinguish from that feature?
    • It increases the computational cost of every model
    • Values within the same bin become indistinguishable to the model
    • It requires collecting more training data
    • It removes the target variable from the dataset
  6. What misconception about tree-based models and binning does the guide correct?
    • That modern gradient boosting algorithms already handle continuous splits internally and often don't need pre-binning as feature engineering
    • That binning is required to train any tree model
    • That trees cannot use continuous variables at all
    • That binning always improves tree model accuracy
  7. In a histogram-based tree learner, what does using a finite set of feature bins mainly trade?
    • To make the model more interpretable to humans
    • To comply with financial regulations
    • To replace the need for a loss function
    • As a computational speed optimization that approximates continuous splits with a fixed number of buckets
  8. Why might a credit-scorecard team choose explicit risk bands even though no universal rule requires binning?
    • Because every credit regulation mandates equal-width bins
    • To preserve every exact value for the model
    • To communicate or review a coarse risk grouping more easily
    • Because binning guarantees higher predictive accuracy

Keep testing yourself

More quizzes picked for your level.

View all quizzes