Faceted Browser
4 document(s) found.
Order by:
Open this query in the query search page
|
Filters:
| 1-4 of 4
Alexander Gray
Document Type: Person
Tags: Auton Fast Classifiers, Statistical Data Mining for Astrophysics, K Nearest Neighbor, Astrostatistics, Cached Sufficient Statistics, Clustering, Memory-based Learning, Efficient Statistical Algorithms, Life Science Data Mining, Locally Weighted Learning, Kernel Density Estimation, Bayesian Networks, Kd-trees and Ball-trees, Mixture Models, Optimization Alex's fascinations in early grade school were Legos, breaking ciphers, and drawing human anatomy. After studying Applied Math and Computer Science at Berkeley, he resisted a job offer to do Hollywood special effects and ended up working at NASA's Jet Propulsion Laboratory for six years developi...
Andrew Moore
Document Type: Person
Tags: Link Analysis, Auton Fast Classifiers, Statistical Data Mining for Astrophysics, Cached Sufficient Statistics, Efficient Statistical Algorithms, Spatial Statistics, Life Science Data Mining, Logistic Regression, Locally Weighted Learning, GDA, AD-trees, Bayesian Networks, Kernel Density Estimation, Kd-trees and Ball-trees, Mixture Models, WSARE, Reinforcement Learning, Active Learning, Markov Decision Processes, K Nearest Neighbor, Astrostatistics, Clustering, Memory-based Learning, Biosurveillance, Applications, Optimization, Association Rules Andrew began his career writing video-games for an obscure British personal computer. He rapidly became a thousandaire and retired to academia, where he received a PhD from the University of Cambridge in 1991. He researched robot learning as a Post-doc working with Chris Atkeson, and then moved ...
Efficient Algorithms for Non-Parametric Clustering with Clutter
Document Type: Paper
Tags: Biosurveillance, Statistical Data Mining for Astrophysics, Astrostatistics, Clustering, Kernel Density Estimation, Efficient Statistical Algorithms, Memory-based Learning, Kd-trees and Ball-trees Detecting and counting overdensities in data is a common problem in the physical and geographic sciences. One of the most successful of recent algorithms for the counting version of the problem was introduced by Cuevas, Febrero and Fraiman [Cuevas et al., 2000], which will be referred to as the ...
Rapid Evaluation of Multiple Density Models
Document Type: Paper
Tags: Statistical Data Mining for Astrophysics, Cached Sufficient Statistics, Astrostatistics, Kernel Density Estimation, Efficient Statistical Algorithms, Memory-based Learning, Kd-trees and Ball-trees When highly-accurate and/or assumption-free density estimation is needed, nonparametric methods are often called upon - most notably the popular kernel density estimation (KDE) method. However, the practitioner is instantly faced with the formidable computational cost of KDE for appreciable data...
|
![[delete]](/resources/skins/auton/images/facet_filter_delete.gif)
![[desc]](/resources/skins/auton/images/facet_sort_asc_active.gif)
![[asc]](/resources/skins/auton/images/facet_sort_asc.gif)