Bipartite graph representation of multiple decision table classifiers

  • Authors:
  • Kazuya Haraguchi;Seok-Hee Hong;Hiroshi Nagamochi

  • Affiliations:
  • Faculty of Science and Engineering, Ishinomaki Senshu University, Japan;School of Information Technologies, University of Sydney, Australia;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Japan

  • Venue:
  • SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we consider the two-class classification problem, a significant issue in machine learning. From a given set of positive and negative samples, the problem asks to construct a classifier that predicts the classes of future samples with high accuracy. For this problem, we have studied a new visual classifier in our previous works, which is constructed as follows: We first create several decision tables and extract a bipartite graph structure (called an SE-graph) between the given set of samples and the set of created decision tables.We then draw the bipartite graph as a two-layered drawing by using an edge crossing minimization technique, and the resulting drawing acts as a visual classifier. We first describe our background and philosophy on such a visual classifier, and then consider improving its classification accuracy. We demonstrate the effectiveness of our methodology by computational studies using benchmark data sets, where the new classifier outperforms our older version, and is competitive even with such standard classifiers as C4.5 or LibSVM.