Sciweavers

104 search results - page 12 / 21
» TRIPS and TIDES: new algorithms for tree mining
Sort
View
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 9 months ago
Making k-means Even Faster
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
Greg Hamerly
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Spatio-temporal Multi-dimensional Relational Framework Trees
—The real world is composed of sets of objects that move and morph in both space and time. Useful concepts can be defined in terms of the complex interactions between the multi-...
Matthew Bodenhamer, Samuel Bleckley, Daniel Fennel...
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 9 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
KDD
1999
ACM
152views Data Mining» more  KDD 1999»
13 years 11 months ago
Applying General Bayesian Techniques to Improve TAN Induction
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
Jesús Cerquides