Microaggregation is a disclosure control method used to protect microdata. We introduce a local search method and employ it in an iterated local search algorithm for the NP-hard minimum information loss microaggregation problem. Experimental results ...

Microaggregation is a disclosure limitation method that provides security through k-anonymity by modifying data before release but does not allow suppression of data. We define the microaggregation problem with suppression (MPS) to accommodate data suppression, ...

Given a graph with positive edge weights and a positive integer m, the Constrained Forest Problem (CFP) problem seeks a minimum-weight spanning subgraph each of whose components contains at least m vertices. Such a subgraph ...

The NP-hard microaggregation problem seeks a partition of data points into groups of minimum specified size k, so as to minimize the sum of the squared euclidean distances of every point to its group's centroid. ...

Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorithm that produces solutions that are at least as good ...

We present a genetic algorithm for selecting centers to seed the popular k-means method for clustering. Using a novel crossover operator that exchanges neighboring centers, our GA identifies superior partitions using both benchmark and large ...

The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means seeks a set of k-cluster centers so as ...

The constrained forest problem seeks a minimum-weight spanning forest in an undirected edge-weighted graph such that each tree spans at least a specified number of vertices. We present a structured class of greedy heuristics for ...

The constrained forest problem seeks a minimum-weight spanning forest in an undirected edge-weighted graph such that each tree spans at least a specified number of vertices. We present a greedy heuristic for this NP-hard problem, ...

This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. The problem is motivated by microaggregation, a disclosure limitation technique in which similar records are aggregated ...

The paper presents a method for generating and displaying wireframe approximations to surfaces of constant value (or iso-surfaces). Input to the method is a data grid, a volume decomposition with each of whose vertices is ...

Algorithms for manipulating three-dimensional cell complexes are seldom implemented due to the lack of a suitable data structure for representing them. Such a data structure is proposed here along with the primitive operations necessary to ...

The goal of this book is to explore the principle ideas of object-oriented programming using the Java programming language. It begins teaching the object-oriented power of Java by relying on textual commands instead of emphasizing ...

This book provides an accessible introduction to methods in computational geometry and computer graphics. It emphasizes the efficient object-oriented implemenation of geometric methods with useable C++ code for all methods discussed.