DPClass: An Effective but Concise Discriminative Patterns-Based Classification Framework.
Pattern-based classification was originally proposed to improve the accuracy using selected frequent patterns, where many efforts were paid to prune a huge number of non-discriminative frequent patterns. On the other hand, tree-based models have shown strong abilities on many classification tasks since they can easily build high-order interactions between different features and also handle both numerical and categorical features as well as high dimensional features. By taking the advantage of both modeling methodologies, we propose a natural and effective way to resolve pattern-based classification by adopting discriminative patterns which are the prefix paths from root to nodes in tree-based models (e.g., random forest). Moreover, we further compress the number of discriminative patterns by selecting the most effective pattern combinations that fit into a generalized linear model. As a result, our discriminative pattern-based classification framework (DPClass) could perform as good as previous state-of-the-art algorithms, provide great interpretability by utilizing only very limited number of discriminative patterns, and predict new data extremely fast. More specifically, in our experiments, DPClass could gain even better accuracy by only using top-20 discriminative patterns. The framework so generated is very concise and highly explanatory to human experts.
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA.
Jingbo
J
Shang
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA.
Wenzhu
W
Tong
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA.
Jian
J
Peng
Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL, USA.
Jiawei
J
Han