Material Detail

Exploring the space of coding matrix classifiers for hierarchical multiclass text categorization

Exploring the space of coding matrix classifiers for hierarchical multiclass text categorization

This video was recorded at Slovenian KDD Conference on Data Mining and Data Warehouses (SiKDD), Ljubljana 2011. One of the ways of approaching a multiclass classification problem is to transform it into several two-class (binary) classification problems. An ensemble of binary classifiers is trained for these tasks and their predictions are combined using a voting method into predictions for the original multiclass problem. Each of the new binary problems uses some of the original classes as positive training data, some classes as negative training data and the remaining classes (if any) are not used at all. The relationship between classes (of the original problem) and binary classifiers can be concisely represented by a matrix called the coding matrix. In this paper we explore some of the statistical properties of the space of coding matrix based classifiers in the context of a small hierarchical multiclass learning problem.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Exploring the space of coding matrix classifiers for hierarchical multiclass text categorization
People who viewed this also viewed

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.