Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

CB-SVM Algorithm: Outline

  • Construct two CF-trees from positive and negative data sets independently
    • Need one scan of the data set
  • Train an SVM from the centroids of the root entries
  • De-cluster the entries near the boundary into the next level
    • The children entries de-clustered from the parent entries are accumulated into the training set with the non-declustered parent entries
  • Train an SVM again from the centroids of the entries in the training set
  • Repeat until nothing is accumulated

Speaker notes:

Content Tools


There are currently no sources for this slide.