Skip Navigation

The Computer Journal 2000 43(2):107-120; doi:10.1093/comjnl/43.2.107
© 2000 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Murtagh, F.
Right arrow Articles by Berry, M. W.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Overcoming the Curse of Dimensionality in Clustering by Means of the Wavelet Transform

Fionn Murtagh1, Jean-Luc Starck2 and Michael W. Berry3

1 School of Computer Science, The Queen's University of Belfast, Belfast BT7 1NN, Northern Ireland Email: f.murtagh@qub.ac.uk 2 CEA/DSM/DAPNIA, F-91191 Gif-sur-Yvette cedex, France 3 Ayres Hall 114, Department of Computer Science, University of Tennessee, TN 37996-1301, USA

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.


Received 11 December, 1998. Revised 14 November, 1999.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.