Hybrid Artificial Intelligent Systems

This paper deals with discovering frequent sets for quantitative association rules mining with preserved privacy. It focuses on privacy preserving on an individual level, when true individual values, e.g., values of attributes describing customers, are not revealed. Only distorted values and parameters of the distortion procedure are public. However, a miner can discover hidden knowledge, e.g., association rules, from the distorted data. In order to find frequent sets for quantitative association rules mining with preserved privacy, not only does a miner need to discretise continuous attributes, transform them into binary attributes, but also, after both discretisation and binarisation, the calculation of the distortion parameters for new attributes is necessary. Then a miner can apply either MASK (Mining Associations with Secrecy Konstraints) or MMASK (Modified MASK) to find candidates for frequent sets and estimate their supports. In this paper the methodology for calculating distortion parameters of newly created attributes after both discretisation and binarisation of attributes for quantitative association rules mining has been proposed. The new application of MMASK for finding frequent sets in discovering quantitative association rules with preserved privacy has been also presented. The application of MMASK scheme for frequent sets mining in quantitative association rules discovery on real data sets has been experimentally verified. The results of the experiments show that both MASK and MMASK can be applied in frequent sets mining for quantitative association rules with preserved privacy, however, MMASK gives better results in this task.

[1]  Alok Singh,et al.  Two metaheuristic approaches for the multiple traveling salesperson problem , 2015, Appl. Soft Comput..

[2]  T. Glenn Bailey,et al.  Reactive Tabu Search in unmanned aerial reconnaissance simulations , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[3]  Carolyn McCreary,et al.  A comparison of heuristics for scheduling DAGs on multiprocessors , 1994, Proceedings of 8th International Parallel Processing Symposium.

[4]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[5]  Saeed Parsa,et al.  An Evolutionary Approach to Task Graph Scheduling , 2007, ICANNGA.

[6]  J. A. Gromicho Dos Santos,et al.  Exact Solution of Multiple Traveling Salesman Problem , 1992 .

[7]  Gilbert Laporte,et al.  A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .

[8]  Manish Kumar,et al.  A Market-based Solution to the Multiple Traveling Salesmen Problem , 2013, J. Intell. Robotic Syst..

[9]  Nishanth Chandran,et al.  A clustering approach to solve the multiple travelling salesmen problem , 2006 .

[10]  Kenneth DeJong,et al.  Evolutionary Computational Approaches to Solving the Multiple Traveling Salesman Problem Using a Neighborhood Attractor Schema , 2002, EvoWorkshops.

[11]  T. Bektaş The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[12]  Nikbakhsh Javadian,et al.  An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems , 2011, Appl. Soft Comput..

[13]  Takao Enkawa,et al.  Competition-based neural network for the multiple travelling salesmen problem with minmax objective , 1999, Comput. Oper. Res..

[14]  Shuvra S. Bhattacharyya,et al.  A Modular Genetic Algorithm for Scheduling Task Graphs , 2003 .

[15]  Alok Singh,et al.  A new grouping genetic algorithm approach to the multiple traveling salesperson problem , 2008, Soft Comput..

[16]  Mengchu Zhou,et al.  A New Multiple Traveling Salesman Problem and Its Genetic Algorithm-Based Solution , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[17]  Ann Nowé,et al.  Multi-type ant colony system for solving the multiple traveling salesman problem. , 2012 .

[18]  Tolga Bektas,et al.  Integer linear programming formulations of multiple salesman problems and its variations , 2006, Eur. J. Oper. Res..

[19]  Edward A. Lee,et al.  Scheduling to Account for Interprocessor Communication within Interconnection-Constrained Processor Networks , 1990, International Conference on Parallel Processing.

[20]  Flávio Keidi Miyazawa,et al.  Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem , 2013, GECCO '13.

[21]  Sujian Li,et al.  An ant colony optimization algorithm for the Multiple Traveling Salesmen Problem , 2009, 2009 4th IEEE Conference on Industrial Electronics and Applications.

[22]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[23]  Vivek Sarkar,et al.  Partitioning and Scheduling Parallel Programs for Multiprocessing , 1989 .

[24]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[25]  Ilari Vallivaara,et al.  A Team ant colony optimization algorithm for the multiple travelling salesmen problem with MinMax objective , 2008 .

[26]  Marin Golub,et al.  Scheduling Multiprocessor Tasks with Genetic Algorithms , 2019 .

[27]  Pan Junjie,et al.  An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem , 2006, First International Conference on Innovative Computing, Information and Control - Volume I (ICICIC'06).

[28]  Shoudong Huang,et al.  A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms , 2013, Eur. J. Oper. Res..