Overcoming the curse of dimensionality in clustering by means of the wavelet transform

Fionn Murtagh, Jean Luc Starck, Michael W. Berry

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

We use a redundant wavelet transform analysis to detect clusters in high-dimensional data spaces. We overcome Bellman's `curse of dimensionality' in such problems by (i) using some canonical ordering of observation and variable (document and term) dimensions in our data, (ii) applying a wavelet transform to such canonically ordered data, (iii) modelling the noise in wavelet space, (iv) defining significant component parts of the data as opposed to insignificant or noisy component parts, and (v) reading off the resultant clusters. The overall complexity of this innovative approach is linear in the data dimensionality. We describe a number of examples and test cases, including the clustering of high-dimensional hypertext data.

Original languageEnglish
Pages (from-to)107-120
Number of pages14
JournalComputer Journal
Volume43
Issue number2
DOIs
Publication statusPublished - 1 Jan 2000
Externally publishedYes

    Fingerprint

Cite this