Sciweavers

728 search results - page 63 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
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
1997
ACM
103views Data Mining» more  KDD 1997»
14 years 9 hour ago
Fast Committee Machines for Regression and Classification
In many data mining applications we are given a set of training examples and asked to construct a regression machine or a classifier that has low prediction error or low error rat...
Harris Drucker
PRL
2010
205views more  PRL 2010»
13 years 2 months ago
Mining outliers with faster cutoff update and space utilization
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
Chi-Cheong Szeto, Edward Hung
VLDB
1998
ACM
312views Database» more  VLDB 1998»
14 years 2 days ago
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
Gholamhosein Sheikholeslami, Surojit Chatterjee, A...
CINQ
2004
Springer
131views Database» more  CINQ 2004»
14 years 1 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...