Loading...
Please wait, while we are loading the content...
Similar Documents
An Efficient Construction and Application Usefulness of Rectangle Greedy Covers (2014)
| Content Provider | CiteSeerX |
|---|---|
| Author | Kudo, Mineichi Nakamura, Atsuyoshi Ouchi, Koji |
| Abstract | We develop efficient construction methods of a rectangle greedy cover (RGC), and evaluate its usefulness in appli-cations. An RGC is a greedy cover of the set of given positive instances by exclusive axis-parallel hyperrectangles, namely, axis-parallel hyperrectangles that exclude all the given negative instances. An RGC is expected to be a com-pact classification rule with high readability because the number of its component rectangles is expected to be small and it can be seen as a disjunctive normal form, which is one of the most readable representations for us. We propose two approaches of RGC construction: enumeration approach and direct approach. In enumeration approach, the maximal exclusive positive subsets (MEPSs) are enumerated first and then an ordinary greedy set covering is done using the enumerated MEPSs. We make clear the relation between enumeration of the maximal frequent itemsets and enumeration of the MEPSs, and convert an efficient enumeration algorithm LCMmax [1] of maximal frequent itemsets to an enumeration algorithm LCMmax.Rnaive of MEPSs. We also develop a more efficient version of LCMmax.Rnaive, or LCMmax.R, by incorporating effective dynamic reordering of instances using excluded frequency and bit-parallel exclusiveness check. In direct approach, each component MEPS of an RGC is searched not from enumerated MEPSs but directly from the dataset that consists of the remaining uncovered positive instances and the whole negative instances. We developed an algorithm called MRF that efficiently finds an maximum-sized |
| File Format | |
| Publisher Date | 2014-01-01 |
| Access Restriction | Open |
| Content Type | Text |
