Gregory James Hamerly  Home/Search
Context
Related
| ucsd.edu/~ghamerly/acade...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucsd.edu/~ghamerly/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: xv I (Update)
Active bibliography (related documents): More All
3.5: Alternatives to the k-Means Algorithm That Find Better.. - Hamerly, Elkan (Correct)
1.5: Thesis Proposal: High-quality automatic data clustering - Hamerly (2002) (Correct)
0.9: Learning the K in K-Means - Hamerly, Elkan (2003) (Correct)
Similar documents based on text: More All
0.1: Structures for Phase Classification - Lau, Schoenmackers, Calder (2004) (Correct)
0.1: Learning Bayesian Networks from Data Lecture 13 Lecture 13 - Kansas State University (1999) (Correct)
0.1: An Experimental Comparison of Several Clustering and.. - Melia (1998) (Correct)
BibTeX entry: (Update)
@misc{ hamerly-learning,
author = "Gregory James Hamerly",
title = "Learning Structure and Concepts in Data Through Data Clustering",
url = "citeseer.ist.psu.edu/article/hamerly03learning.html" }
Citations (may not include all citations):2528 Maximum likelihood from incomplete data via the EM algorithm (context) - Dempster, Laird et al. - 1977
1662 Neural Networks for Pattern Recognition (context) - Bishop - 1995
765 trees: a dynamic index structure for spatial searching (context) - Guttman - 1984
696 UCI repository of machine learning databases (context) - Blake, Merz - 1998
526 Information and Control (context) - Zadeh - 1965
454 Pattern Recognition with Fuzzy Objective Function Algorithms (context) - Bezdek - 1981
386 ATOM: A system for building customized program analysis tool.. (context) - Srivastava, Eustace - 1994
204 tree: An index structure for high-dimensional data (context) - Berchtold, Keim et al. - 1996
200 Projection pursuit (context) - Huber - 1985
190 Data clustering: a review - Jain, Murty et al. - 1999
134 Statistical Inference (context) - Casella, Berger - 2002
107 Technical Report CS-TR (context) - Burger, Austin et al. - 1997
91 Broad patterns of gene expression revealed by clustering ana.. (context) - Alon, Barkai et al. - 1999
91 Two algorithms for nearest-neighbor search in high dimension.. - Kleinberg - 1997
79 Automatically characterizing large scale program behavior - Sherwood, Perelman et al. - 2002
79 Automatically characterizing large scale program behavior - Sherwood, Perelman et al. - 2002
78 Mean shift: a robust approach toward feature space analysis (context) - Comaniciu, Meer - 2001
75 Gradientbased learning applied to document recognition - LeCun, eon et al. - 1998
73 Analysis of observed chaotic data (context) - Abarbanel - 1996
66 An experimental and theoretical comparison of model selectio.. - Kearns, Mansour et al. - 1995
64 IEEE Transactions on Pattern Analysis and Machine Intelligen.. (context) - Shi, Malik et al. - 2000
50 BIRCH: an ecient data clustering method for very large datab.. (context) - Zhang, Ramakrishnan et al. - 1996
49 Chaos and Fractals: New Frontiers of Science (context) - Peitgen, Jurgens et al. - 1992
45 A reference Bayesian test for nested hypotheses and its rela.. - Kass, Wasserman - 1995
43 Clustering in large graphs and matrices - Frieze, Vempala - 1999
34 An informationtheoretic analysis of hard and soft assignment.. - Kearns, Mansour et al. - 1997
33 Experiments with random projection (context) - Dasgupta - 2000
28 Some methods for classi cation and analysis of multivariate .. (context) - MacQueen - 1967
27 the surprising behavior of distance metrics in high dimensio.. - Aggarwal, Hinneburg et al. - 2001
27 Adapting the SPEC (context) - KleinOsowski, Flynn et al. - 2000
23 Time varying behavior of programs - Sherwood, Calder - 1999
22 The anchors hierarchy: Using the triangle inequality to surv.. - Moore - 2000
21 HLS: Combining statistical and symbolic simulation to guide .. - Oskin, Chong et al. - 2000
20 A note on the generation of random normal deviates (context) - Box, Muller - 1958
20 means algorithms with geometric reasoning (context) - Pelleg, Moore et al. - 1999
19 Estimating the components of a mixture of normal distributio.. (context) - Day - 1969
18 ANN: a library for approximate nearest neighbor searching - Mount, Arya - 1997
16 An empirical comparison of four initialization methods for t.. - na, Lozano et al. - 1999
14 Smarts: Accelerating microarchitecture simulation via rigoro.. - Wunderlich, Wenisch et al. - 2003
13 Choosing representative slices of program execution for micr.. - Lafage, Seznec - 2000
12 Scalability for clustering algorithms revisited - Farnstrom, Lewis et al. - 2000
12 Adaptive dimension reduction for clustering high dimensional.. - Ding, He et al. - 2002
12 Minimal subset evaluation: Rapid warm-up for simulated hardw.. - Haskins, Skadron - 2001
11 Modeling superscalar processors via statistical simulation - Nussbaum, Smith - 2001
9 Repairing faulty mixture models using density estimation - Sand, Moore - 2001
7 Neural Information Processing Systems (context) - Ng, Jordan et al. - 2002
7 Using the fractal dimension to cluster datasets - Barbar, Ping - 2000
7 Journal of Classi cation (context) - Hubert, Arabie - 1985
5 Estimating an eigenvector by the power method with a random .. (context) - Corso - 1997
5 COOLCAT: An entropy-based algorithm for categorical clusteri.. (context) - Barbar, Julia et al. - 2002
5 Computer Science Institute (context) - Likas, Vlassis et al. - 2001
4 Re ning initial points for K-Means clustering (context) - Bradley, Fayyad - 1998
4 MDL principle for robust vector quantisation (context) - Bischof, Leonardis et al. - 1999
4 and data assignment (context) - Kalton, Langley et al. - 2001
3 Reducing state loss for e ective trace sampling of superscal.. (context) - Conte, Hirsch et al. - 1996
3 means with ecient estimation of the number of clusters (context) - Pelleg, Moore et al. - 2000
3 Bayesian approaches to failure prediction for disk drives - Hamerly, Elkan - 2001
2 means algorithm (context) - Elkan, k- - 2003
2 Japanese Society for Arti cial Intelligence (context) - Freund, Schapire et al. - 1999
2 boosting in unsupervised learning (context) - Zhang, means - 2000
2 Ecient spatiotemporal grouping using the Nystrom method (context) - Fowlkes, Belongie et al. - 2001
2 Memory reference reuse latency: Accelerating sampled microar.. (context) - Haskins, Skadron - 2002
2 Fastmix clustering software (context) - Sand, Moore - 2002
2 Basic block distribution analysis to nd periodic behavior an.. (context) - Sherwood, Perelman et al. - 2001
2 a data clustering algorithm (context) - Zhang, Hsu et al. - 1999
2 An experimental comparison of modelbased clustering methods (context) - Me, David - 2001
2 means clustering algorithm (context) - Kanungo, Mount et al. - 2000
1 EDF statistics for goodness of t and some comparisons (context) - Stephens - 1974
1 D'Agostino and Michael (context) - Ralph - 1986
1 Submitted for publication (context) - Hamerly, Elkan et al. - 2003
1 Technical Report CS (context) - Sherwood, Sair et al. - 2002
1 Asymptotic results for goodness-of- t statistics with unknow.. (context) - Stephens - 1976
Documents on the same site (http://www.cs.ucsd.edu/~ghamerly/): More
Using SimPoint for Accurate and Efficient Simulation - Perelman, Hamerly, Van.. (2003) (Correct)
Alternatives to the k-Means Algorithm That Find Better.. - Hamerly, Elkan (Correct)
Bayesian Approaches to Failure Prediction for Disk Drives - Hamerly, Elkan (2001) (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