Sciweavers

136 search results - page 1 / 28
» Efficient kernel feature extraction for massive data sets
Sort
View
KDD
2006
ACM
161views Data Mining» more  KDD 2006»
14 years 5 months ago
Efficient kernel feature extraction for massive data sets
Ivor W. Tsang, András Kocsor, James T. Kwok
PVLDB
2008
182views more  PVLDB 2008»
13 years 4 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
SDM
2007
SIAM
146views Data Mining» more  SDM 2007»
13 years 6 months ago
ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets
With recent advances in sensory and mobile computing technology, enormous amounts of data about moving objects are being collected. One important application with such data is aut...
Xiaolei Li, Jiawei Han, Sangkyum Kim, Hector Gonza...
IDEAL
2009
Springer
13 years 12 months ago
Supervised Feature Extraction Using Hilbert-Schmidt Norms
We propose a novel, supervised feature extraction procedure, based on an unbiased estimator of the Hilbert-Schmidt independence criterion (HSIC). The proposed procedure can be dire...
Povilas Daniusis, Pranas Vaitkus
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 5 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...