(Enter summary)
Abstract: We review the time and storage costs of search and clustering algorithms. We exemplify these, based on case-studies in astronomy, information retrieval, visual user interfaces, chemical databases, and other areas. Sections 2 to 6 relate to nearest neighbor searching, an elemental form of clustering, and a basis for clustering algorithms to follow. Sections 7 to 11 review a number of families of clustering algorithm. Sections 12 to 14 relate to visual or image representations of data sets, from... (Update)
Cited by: More
Information Preserving Multi-Objective Feature Selection for.. - Mierswa, Wurst (2006)
(Correct)
Information Self-Organization For Knowledge Discovery - Feng, Murtagh (2000)
(Correct)
Active bibliography (related documents): More All
1.2: Locally Lifting the Curse of Dimensionality for Nearest Neighbor .. - Yianilos (1999)
(Correct)
1.2: Computational Astronomy: Current Directions And Future Perspectives - Murtagh
(Correct)
1.2: Excluded Middle Vantage Point Forests for Nearest Neighbor Search - Yianilos (1999)
(Correct)
Similar documents based on text: More All
0.3: Computer Display Control and Interaction Using Eye-Gaze - Farid, Murtagh, Starck
(Correct)
0.2: Maps of Information Spaces: Assessments from Astronomy - Poinçot, Lesteven.. (1999)
(Correct)
0.2: Multiscale Image and Data Analysis - Murtagh, Starck (1999)
(Correct)
BibTeX entry: (Update)
F. Murtagh, \Clustering massive data sets", in J. Abello, P.M. Pardalos and M.G.C. Reisende, Eds., Handbook of Massive Data Sets, Kluwer, 2000, in press. http://citeseer.ist.psu.edu/murtagh99clustering.html More
@incollection{ murtagh00clustering,
author = "F. Murtagh",
title = "Clustering massive data sets",
editor = "J. Abello, P.M. Pardalos and M.G.C. Reisende",
booktitle = "Handbook of Massive Data Sets",
publisher = "Kluwer",
year = "2000",
url = "citeseer.ist.psu.edu/murtagh99clustering.html" }
Citations (may not include all citations):
2528
Maximum likelihood from incomplete data via the EM algorithm (context) - Dempster, Laird et al. - 1977
1256
Introduction to Modern Information Retrieval (context) - Salton, McGill - 1983
837
Cambridge University Press (context) - Motwani, Raghavan - 1995
805
Algorithms for Clustering Data (context) - Jain, Dubes - 1988
475
Estimating the dimension of a model (context) - Schwarz - 1978
151
Fundamentals of Computer Algorithms (context) - Horowitz, Sahni - 1979
136
Syntactic clustering of the web (context) - Broder, Glassman et al. - 1997
118
Model-based Gaussian and non-Gaussian clustering (context) - Baneld, Raftery - 1993
80
Numerical Taxonomy (context) - Sneath, Sokal - 1973
69
Optimal expected time algorithms for closest point problems (context) - Bentley, Weide et al. - 1980
69
Graph-theoretical methods for detecting and describing Gesta.. (context) - Zahn - 1971
67
the resemblance and containment of documents
- Broder - 1998
64
A branch and bound algorithm for computing k-nearest neighbo.. (context) - Fukunaga, Narendra - 1975
46
When is nearest neighbor meaningful
- Beyer, Goldstein et al. - 1999
38
Journal of the American Statistical Association (context) - Kass, Raftery - 1995
37
Answers via model-based cluster analysis (context) - Fraley, Raftery - 1999
37
Finding minimum spanning trees (context) - Cheriton, Tarjan - 1976
37
and information retrieval (context) - Berry, Drma et al. - 1999
36
Gaussian parsimonious clustering models (context) - Celeux, Govaert - 1995
33
Note on learning rate schedules for stochastic optimization (context) - Darken, Moody - 1991
32
Very fast EM-based mixture model clustering using multiresol..
- Moore - 1998
31
Detecting features in spatial point processes with clutter v..
- Dasgupta, Raftery - 1998
28
Some methods for classication and analysis of multivariate o.. (context) - MacQueen - 1976
25
Algorithms for model-based Gaussian hierarchical clustering
- Fraley - 1999
24
Some competitive learning methods
- Fritzke
24
Towards faster stochastic gradient search (context) - Darken, Moody - 1992
23
Subquadratic approximation algorithms for clustering problem..
- Borodin, Ostrovsky et al. - 1999
22
Norms: NN Pattern Classication Techniques (context) - Dasarathy - 1991
21
Multidimensional Clustering Algorithms (context) - Murtagh - 1985
20
means algorithms with geometric reasoning (context) - Pelleg, Moore - 1999
19
An algorithm for nding best matches in logarithmic expected .. (context) - Friedman, Bentley et al. - 1977
18
Learning rate schedules for faster stochastic gradient searc..
- Darken, Chang et al. - 1992
17
Applied Combinatorics (context) - Tucker - 1980
17
A view of the EM algorithm that justies incremental (context) - Neal, Hinton - 1998
17
Nearest neighbor clutter removal for estimating features in ..
- Byers, Raftery - 1998
15
Density-based indexing for approximate nearest neighbor quer..
- Bennett, Fayyad et al. - 1999
15
Fitting straight lines to point patterns (context) - Murtagh, Raftery - 1984
14
Sparse matrix reordering schemes for browsing hypertext (context) - Berry, Hendrickson et al. - 1996
13
Image and Data Analysis: The Multiscale Approach (context) - Starck, Murtagh et al. - 1998
13
An overview of combinatorial data analysis (context) - Arabie, Hubert - 1996
12
Ecient search for approximate nearest neighbors in high-dime.. (context) - Kushilevitz, Ostrovsky et al. - 1998
11
The Kohonen self-organizing map method: an assessment (context) - Murtagh, Hern - 1995
11
An improved branch and bound algorithm for computing k-neare.. (context) - Kamgar-Parsi, Kanal - 1985
11
Non-parametric maximum likelihood estimation of features in ..
- Allard, Fraley - 1997
11
An algorithm for nding nearest neighbors (context) - Ruiz - 1986
11
Some approaches to best-match le searching (context) - Burkhard, Keller - 1973
10
Dotplot: a program for exploring self-similarity in millions..
- Church, Helfman - 1993
10
Multivariate Data Analysis (context) - Murtagh, Heck - 1987
9
Fast algorithms for constructing minimal spanning trees in c.. (context) - Bentley, Friedman - 1978
8
Nonparametric estimation of gamma-ray burst intensities usin..
- Kolaczyk - 1997
8
A technique to identify nearest neighbors (context) - Yunck - 1976
7
Cluster analysis of multivariate data: eciency vs (context) - Forgy - 1965
7
Three types of gamma-ray bursts (context) - Mukherjee, Feigelson et al. - 1998
7
The choice of reference points in best-match le searching (context) - Shapiro - 1977
7
Semantic road maps for literature searchers (context) - Doyle - 1961
6
Parallel algorithms for hierarchical clustering and cluster .. (context) - Murtagh - 1992
6
A spatial user interface to the astronomical literature (context) - cot, Lesteven et al. - 1998
5
Reducing the computational requirements of the minimum-dista.. (context) - Hodgson - 1988
5
Pattern clustering based on noise modeling in wavelet space
- Murtagh, Starck - 1998
5
Hierarchic agglomerative clustering methods for automatic do.. (context) - Griths, Robinson et al. - 1984
5
SLINK: an optimally ecient algorithm for the single link clu.. (context) - Sibson - 1973
5
Model-based cluster analysis (context) - Banerjee, Rosenfeld - 1993
5
Tree structures for high dimensionality nearest neighbor sea.. (context) - Eastman, Weiss - 1982
4
Algorithm 76: Hierarchical clustering using the minimum span.. (context) - Rohlf - 1973
4
Single link clustering algorithms (context) - Rohlf - 1982
4
The nearest neighbor problem in information retrieval: an al.. (context) - Smeaton, van Rijsbergen - 1981
4
Maps of information spaces: assessments from astronomy
- cot, Lesteven et al. - 1999
4
Ecient algorithms for nding minimum spanning trees in undire.. (context) - Gabow, Galil et al. - 1986
4
An algorithm for nding nearest neighbors (context) - Friedman, Baskett et al. - 1975
4
Overcoming the curse of dimensionality in clustering by mean..
- Murtagh, Starck et al. - 1999
4
Visualization of literatures (context) - White, McCain - 1997
3
A probabilistic minimum spanning tree algorithm
- Rohlf - 1978
3
An improved algorithm for hierarchical clustering using stro.. (context) - Tarjan - 1983
3
Reinforcement learning based on on-line EM algorithm
- Sato, Ishii - 1999
3
Strategies for ecient incremental nearest neighbor search (context) - Broder - 1990
3
Mapping the Information Landscape (context) - Inc - 1999
2
Multiscale image restoration for photon imaging systems (context) - Jammal, Bijaoui - 1999
2
algorithm for nding minimum spanning trees (context) - Yao, An et al. - 1975
2
An ecient algorithm for a complete link method (context) - Defays - 1977
2
Computer Physics Communications (context) - Guillaume, Murtagh - 1999
2
An ecient branch-and-bound nearest neighbor classier (context) - Niemann, Goppert - 1988
2
Multiscale transforms for ltering nancial data streams (context) - Zheng, Starck et al. - 1999
1
Foreword to the Special Issue on Clustering and Classication (context) - Murtagh - 1998
1
Cluster Dissection and Analysis: Theory (context) - ath - 1985
1
An ecient approximation-algorithm for fast nearest-neighbor .. (context) - Ramasubramanian, Paliwal - 1992
1
Microsoft Research Technical Report MST-TR (context) - Thiesson, Meek et al. - 1999
1
A probabilistic algorithm for nearest neighbor searching (context) - Weiss - 1981
1
Clustering large les of documents using the single-link meth.. (context) - Croft - 1977
1
Eciency of hierarchic agglomerative clustering using the ICL.. (context) - Willett - 1989
1
Model-based methods for textile fault detection (context) - Campbell, Fraley et al. - 1999
1
A review of the use of inverted les for best match searching.. (context) - Perry, Willett - 1983
1
Programme de classication hierarchique par l'algorithme de .. (context) - Juan - 1982
1
ethodes nouvelles en classication automatique des donnees t.. (context) - Bruynooghe - 1977
1
Nearest neighbor searches and the curse of dimensionality (context) - Marimont, Shapiro - 1979
1
Ecient algorithms for agglomerative hierarchical clustering .. (context) - Day, Edelsbrunner - 1984
1
An algorithm for nding nearest neighbors in constant average.. (context) - Oncina, Vidal - 1992
1
Champman and Hall (context) - Gordon - 1999
1
Clustering and Classication (context) - Arabie, Hubert et al. - 1996
1
A method for determining k-nearest neighbors (context) - Kittler - 1978
1
exact nearest neighbor algorithm for use in information retr.. (context) - Murtagh - 1982
1
Expected time complexity results for hierarchic clustering a.. (context) - Murtagh - 1983
1
Complexities of hierarchic clustering algorithms: state of t.. (context) - Murtagh - 1984
1
Similarity and dissimilarity methods for processing chemical.. (context) - Gillet, Wild et al. - 1998
1
Algorithme rapide pour la determination des k plus proches.. (context) - Richetin, Rives et al. - 1980
1
La classication hierarchique ascendante selon la methode d.. (context) - de Rham - 1980
1
Un algorithme rapide de recherche de plus proches voisins (context) - Delannoy - 1980
1
Ecient search for nearest neighbors (context) - Schreiber - 1993
1
Smithsonian Astrophysical Observatory (context) - Dobrzycki, Ebeling et al. - 1999
1
Search algorithms for numeric and quantitative data (context) - Murtagh
1
Multivariate methods for data analysis (context) - Murtagh
1
Detecting structure in two dimensions combining Voronoi tess.. (context) - Ebeling, Wiedenmann - 1993
Documents on the same site (http://www.cs.qub.ac.uk/~F.Murtagh/recent-papers.html): More
Computational Astronomy: Current Directions And Future Perspectives - Murtagh
(Correct)
Multiscale Entropy for Semantic Description of Images and.. - Starck, Murtagh, Bonnarel (2000)
(Correct)
Maps of Information Spaces: Assessments from Astronomy - Poinçot, Lesteven.. (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC