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.

Static Discretization of Quantitative Attributes

  • Discretized prior to mining using concept hierarchy.
  • Numeric values are replaced by ranges
  • In relational database, finding all frequent k-predicate sets will require k or k+1 table scans
  • Data cube is well suited for mining
  • The cells of an n-dimensional
    • cuboid correspond to the
    • predicate sets
  • Mining from data cubescan be much faster

Speaker notes:

Content Tools


There are currently no sources for this slide.