Dan Pelleg
Postdoctoral Fellow
Tags
Active Learning, Applications, Astrostatistics, Bayesian Networks, Cached Sufficient Statistics, Clustering, Efficient Statistical Algorithms, Kd-trees and Ball-trees, Mixture Models, Statistical Data Mining for Astrophysics
Papers
-
Dependency Trees in Sub-linear Time and Bounded Memory
(2006)
Efficient learning of dependency trees for huge datasets. -
Active Learning for Anomaly and Rare-Category Detection
(2004)
How to use active learning in a real-life scenario. -
Using Tarjan's Red Rule for Fast Dependency Tree Construction
(2002)
Very fast growth of dependency trees. -
Mixtures of Rectangles: Interpretable Soft Clustering
(2001)
A mixture model that is easily readable by humans. -
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
(2000)
Extension to popular K-means, where the number of clusters K is also estimated. -
Accelerating Exact k-means Algorithms with Geometric Reasoning (Extended version)
(1999)
This is an extended version of the KDD99 paper. -
Accelerating Exact k-means Algorithms with Geometric Reasoning
(1999)
Using cached counts and a different kind of search operator during k-means updates, with no approximation