An efficient construction and application usefulness of rectangle greedy covers
作者：
Highlights：
• Efficient construction methods of a rectangle greedy cover (RGC) are developed.
• The relation between frequent itemsets and exclusive positive subsets is made clear.
• Direct approach is faster than enumeration approach to construct an RGC.
• Empirical classification accuracy of an RGC is comparable to that of SVM.
• The DNF rules obtained by an RGC are shown to be more readable than those by C4.5.
摘要
Highlights•Efficient construction methods of a rectangle greedy cover (RGC) are developed.•The relation between frequent itemsets and exclusive positive subsets is made clear.•Direct approach is faster than enumeration approach to construct an RGC.•Empirical classification accuracy of an RGC is comparable to that of SVM.•The DNF rules obtained by an RGC are shown to be more readable than those by C4.5.
论文关键词：Greedy cover,Axis-parallel hyperrectangle,Classification,Data mining
论文评审过程：Received 12 April 2012, Revised 22 September 2012, Accepted 17 September 2013, Available online 23 September 2013.
论文官网地址：https://doi.org/10.1016/j.patcog.2013.09.008
