Skip to main content
Book cover

Association Rule Hiding for Data Mining

  • Book
  • © 2010

Overview

  • This book is among the pioneer efforts regarding the development of Association Rule Hiding
  • Provides examples throughout this book to help the reader study, assimilate and appreciate the important aspects of this challenging problem
  • Covers closely related problems (inverse frequent itemset mining, data reconstruction approaches, etc.), unsolved problems and future directions
  • Includes supplementary material: sn.pub/extras

Part of the book series: Advances in Database Systems (ADBS, volume 41)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (21 chapters)

  1. Fundamental Concepts

  2. Fundamental Concepts

  3. Heuristic Approaches

  4. Border Based Approaches

  5. Exact Hiding Approaches

Keywords

About this book

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 in data mining, which studies the problem of hiding sensitive association rules from within the data.

Association Rule Hiding for Data Mining addresses the problem of "hiding" sensitive association rules, and introduces a number of heuristic solutions. Exact solutions of increased time complexity that have been proposed recently are presented, as well as a number of computationally efficient (parallel) approaches that alleviate time complexity problems, along with a thorough discussion regarding closely related problems (inverse frequent item set mining, data reconstruction approaches, etc.). Unsolved problems, future directions and 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.

Authors and Affiliations

  • , Information Analytics Lab, IBM Research GmbH - Zurich, Rueschlikon, Switzerland

    Aris Gkoulalas-Divanis

  • , Department of Computer and, University of Thessaly, Volos, Greece

    Vassilios S. Verykios

Bibliographic Information

Publish with us