Andrew W. Moore (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

93 Dan Pelleg, Andrew W. Moore: Dependency trees in sub-linear time and bounded memory. VLDB J. 15(3): 250-262 (2006)

73 Dan Pelleg, Andrew W. Moore: Active Learning for Anomaly and Rare-Category Detection. NIPS 2004

57 Dan Pelleg, Andrew W. Moore: Using Tarjan's Red Rule for Fast Dependency Tree Construction. NIPS 2002: 801-808

52 Dan Pelleg, Andrew W. Moore: Mixtures of Rectangles: Interpretable Soft Clustering. ICML 2001: 401-408

44 Dan Pelleg, Andrew W. Moore: X-means: Extending K-means with Efficient Estimation of the Number of Clusters. ICML 2000: 727-734

35 Dan Pelleg, Andrew W. Moore: Accelerating Exact k-means Algorithms with Geometric Reasoning. KDD 1999: 277-281

Selection of 6 from 135 records - Andrew W. Moore has 130 coauthors

Last update 2012-09-10 CET by the DBLP Team —

Content released under the ODC-BY 1.0 license — See also our legal information page

93		Dan Pelleg, Andrew W. Moore: Dependency trees in sub-linear time and bounded memory. VLDB J. 15(3): 250-262 (2006)
73		Dan Pelleg, Andrew W. Moore: Active Learning for Anomaly and Rare-Category Detection. NIPS 2004
57		Dan Pelleg, Andrew W. Moore: Using Tarjan's Red Rule for Fast Dependency Tree Construction. NIPS 2002: 801-808
52		Dan Pelleg, Andrew W. Moore: Mixtures of Rectangles: Interpretable Soft Clustering. ICML 2001: 401-408
44		Dan Pelleg, Andrew W. Moore: X-means: Extending K-means with Efficient Estimation of the Number of Clusters. ICML 2000: 727-734
35		Dan Pelleg, Andrew W. Moore: Accelerating Exact k-means Algorithms with Geometric Reasoning. KDD 1999: 277-281