Sciweavers

137 search results - page 20 / 28
» A Generic and Extendible Multi-Agent Data Mining Framework
Sort
View
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
11 years 10 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
RAS
2007
151views more  RAS 2007»
13 years 7 months ago
Recursive scan-matching SLAM
This paper presents Scan-SLAM, a new generalisation of simultaneous localisation and mapping (SLAM). SLAM implementations based on extended Kalman filter (EKF) data fusion have t...
Juan Nieto, Tim Bailey, Eduardo Mario Nebot
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
14 years 8 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 8 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...
KDD
2002
ACM
119views Data Mining» more  KDD 2002»
14 years 8 months ago
Evaluating classifiers' performance in a constrained environment
In this paper, we focus on methodology of finding a classifier with a minimal cost in presence of additional performance constraints. ROCCH analysis, where accuracy and cost are i...
Anna Olecka