Approximating Proximity to Fast and Robust Distance-Based Clustering

Approximating Proximity to Fast and Robust Distance-Based Clustering

Vladimir Estivill-Castro (University of Newcastle, Australia) and Michael Houle (University of Sydney, Australia)
Copyright: © 2002 |Pages: 21
DOI: 10.4018/978-1-930708-25-9.ch002
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

Distance-based clustering results in optimization problems that typically are NP-hard or NP-complete and for which only approximate solutions are obtained. For the large instances emerging in data mining applications, the search for high-quality approximate solutions in the presence of noise and outliers is even more challenging. We exhibit fast and robust clustering methods that rely on the careful collection of proximity information for use by hill-climbing search strategies. The proximity information gathered approximates the nearest neighbor information produced using traditional, exact, but expensive methods. The proximity information is then used to produce fast approximations of robust objective optimization functions, and/or rapid comparison of two feasible solutions. These methods have been successfully applied for spatial and categorical data to surpass well-established methods such as k-MEANS in terms of the trade-off between quality and complexity.

Complete Chapter List

Search this Book:
Reset