Bøger af Aris Gkoulalas-Divanis

Privacy and security risks arising from the application of different data miningtechniques to large institutional data repositories have been solely investigated by anew research domain, the so-called privacy preserving data mining. Association rulehiding is a new technique on data mining, which studies the problem of hiding sensitiveassociation rules from within the data. Association Rule Hiding for Data Mining addresses the optimization problem of"e;hiding"e; sensitive association rules which due to its combinatorial nature admitsa number of heuristic solutions that will be proposed and presented in this book. Exact solutions of increased time complexity that have been proposed recently arealso presented as well as a number of computationally efficient (parallel) approachesthat alleviate time complexity problems, along with a discussion regarding unsolvedproblems and future directions. Specific examples are provided throughout this bookto help the reader study, assimilate and appreciate the important aspects of this challengingproblem. Association Rule Hiding for Data Mining is designed for researchers, professorsand advanced-level students in computer science studying privacy preserving datamining, association rule mining, and data mining. This book is also suitable forpractitioners working in this industry.

This book constitutes the refereed proceedings of the International ECML/PKDD Workshop on Privacy and Security Issues in Data Mining and Machine Learning, PSDML 2010, held in Barcelona, Spain, in September 2010.The 11 revised full papers presented were carefully reviewed and selected from 21 submissions. The papers range from data privacy to security applications, focusing on detecting malicious behavior incomputer systems.

Privacy and security risks arising from the application of different data mining techniques to large institutional data repositories have been solely investigated by a new research domain, the so-called privacy preserving data mining. Association rule hiding is a new technique on data mining, which studies the problem of hiding sensitive association rules from within the data. Association Rule Hiding for Data Mining addresses the optimization problem of "hiding" sensitive association rules which due to its combinatorial nature admits a number of heuristic solutions that will be proposed and presented in this book. Exact solutions of increased time complexity that have been proposed recently are also presented as well as a number of computationally efficient (parallel) approaches that alleviate time complexity problems, along with a discussion regarding unsolved problems and future directions. Specific examples are provided throughout this book to help the reader study, assimilate and appreciate the important aspects of this challenging problem. Association Rule Hiding for Data Mining is designed for researchers, professors and advanced-level students in computer science studying privacy preserving data mining, association rule mining, and data mining. This book is also suitable for practitioners working in this industry.