A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning

In this paper, we address the binary classification problem, in which one is given a set of observations, characterized by a number of (binary and non-binary) attributes and wants to determine which class each observation belongs to. The proposed classification algorithm is based on the Logical Analysis of Data (LAD) technique and belongs to the class of supervised learning algorithms. We introduce a novel metaheuristic-based approach for pattern generation within LAD. The key idea relies on the generation of a pool of patterns for each given observation of the training set. Such a pool is built with one or more criteria in mind (e.g., diversity, homogeneity, coverage, etc.), and is paramount in the achievement of high classification accuracy, as shown by the computational results we obtained. In addition, we address one of the major concerns of many data mining algorithms, i.e., the fine-tuning and calibration of parameters. We employ here a novel technique, called biased Random-Key Genetic Algorithm that allows the calibration of all the parameters of the algorithm in an automatic fashion, hence reducing the fine-tuning effort required and enhancing the performance of the algorithm itself. We tested the proposed approach on 10 benchmark instances from the UCI repository and we proved that the algorithm is competitive, both in terms of classification accuracy and running time.

[1]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[2]  Toshihide Ibaraki,et al.  An Implementation of Logical Analysis of Data , 2000, IEEE Trans. Knowl. Data Eng..

[3]  Andrzej Skowron,et al.  Logical Analysis of Data: Theory, Methodology and Applications , 2013 .

[4]  Thomas G. Dietterich Overfitting and undercomputing in machine learning , 1995, CSUR.

[5]  JOHANNES FÜRNKRANZ,et al.  Separate-and-Conquer Rule Learning , 1999, Artificial Intelligence Review.

[6]  Mauricio G. C. Resende,et al.  Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.

[7]  Peter L. Hammer,et al.  Modeling country risk ratings using partial orders , 2006, Eur. J. Oper. Res..

[8]  Toshihide Ibaraki,et al.  Logical analysis of data: classification with justification , 2011, Ann. Oper. Res..

[9]  Soumaya Yacout,et al.  Fault diagnosis in power transformers using multi-class logical analysis of data , 2014, J. Intell. Manuf..

[10]  Mauricio G. C. Resende,et al.  A C++application programming interface for biased random-key genetic algorithms , 2015, Optim. Methods Softw..

[11]  Kush R. Varshney,et al.  Exact Rule Learning via Boolean Compressed Sensing , 2013, ICML.

[12]  Shie Mannor,et al.  A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

[13]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[14]  Marco Caserta,et al.  A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times , 2009, Comput. Oper. Res..

[15]  Peter L. Hammer,et al.  Maximum patterns in datasets , 2008, Discret. Appl. Math..

[16]  William W. Cohen Fast Effective Rule Induction , 1995, ICML.

[17]  Janez Demsar,et al.  Statistical Comparisons of Classifiers over Multiple Data Sets , 2006, J. Mach. Learn. Res..

[18]  Wojciech Kotlowski,et al.  ENDER: a statistical framework for boosting decision rules , 2010, Data Mining and Knowledge Discovery.

[19]  G Alexe,et al.  Logical analysis of diffuse large B-cell lymphomas , 2005, Artif. Intell. Medicine.

[20]  Mauricio G. C. Resende,et al.  Automatic Tuning of GRASP with Evolutionary Path-Relinking , 2013, Hybrid Metaheuristics.

[21]  Toshihide Ibaraki,et al.  Logical analysis of numerical data , 1997, Math. Program..

[22]  Ryszard S. Michalski,et al.  Hypothesis-Driven Constructive Induction in AQ17-HCI: A Method and Experiments , 1994, Machine Learning.

[23]  Peter L. Hammer,et al.  Logical analysis of data—An overview: From combinatorial optimization to medical applications , 2006, Ann. Oper. Res..

[24]  Peter L. Hammer,et al.  Pattern-based clustering and attribute analysis , 2006, Soft Comput..

[25]  Zdzislaw Pawlak,et al.  Rough Set Theory and its Applications to Data Analysis , 1998, Cybern. Syst..

[26]  Salvatore Greco,et al.  Rough sets theory for multicriteria decision analysis , 2001, Eur. J. Oper. Res..

[27]  Dirk P. Kroese,et al.  The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning , 2004 .

[28]  Jan G. Bazan,et al.  Rough set algorithms in classification problem , 2000 .

[29]  Yoram Singer,et al.  A simple, fast, and effective rule learner , 1999, AAAI 1999.

[30]  Ian H. Witten,et al.  Data mining: practical machine learning tools and techniques, 3rd Edition , 1999 .

[31]  Peter L. Hammer,et al.  Pareto-optimal patterns in logical analysis of data , 2004, Discret. Appl. Math..

[32]  Kenneth Sörensen,et al.  Distance measures based on the edit distance for permutation-type representations , 2007, J. Heuristics.

[33]  Celso C. Ribeiro,et al.  GRASP with Path-Relinking: Recent Advances and Applications , 2005 .

[34]  Wojciech Kotlowski,et al.  Rule learning with monotonicity constraints , 2009, ICML '09.

[35]  John Shawe-Taylor,et al.  The Set Covering Machine , 2003, J. Mach. Learn. Res..

[36]  Bogdan E. Popescu,et al.  PREDICTIVE LEARNING VIA RULE ENSEMBLES , 2008, 0811.1679.

[37]  Peter L. Hammer,et al.  Spanned patterns for the logical analysis of data , 2006, Discret. Appl. Math..