Sciweavers

2600 search results - page 92 / 520
» Clustering with or without the Approximation
Sort
View
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
15 years 7 months ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
NIPS
2007
15 years 2 months ago
The Generalized FITC Approximation
We present an efficient generalization of the sparse pseudo-input Gaussian process (SPGP) model developed by Snelson and Ghahramani [1], applying it to binary classification pro...
Andrew Naish-Guzman, Sean B. Holden
SIAMSC
2008
108views more  SIAMSC 2008»
15 years 1 months ago
A Nine Point Scheme for the Approximation of Diffusion Operators on Distorted Quadrilateral Meshes
A nine point scheme is presented for discretizing diffusion operators on distorted quadrilateral meshes. The advantage of this method is that highly distorted meshes can be used wi...
Zhiqiang Sheng, Guangwei Yuan
AAAI
2004
15 years 2 months ago
Discriminating Among Word Meanings by Identifying Similar Contexts
Word sense discrimination is an unsupervised clustering problem, which seeks to discover which instances of a word/s are used in the same meaning. This is done strictly based on i...
Amruta Purandare, Ted Pedersen
ICIP
2003
IEEE
15 years 6 months ago
Automatically organizing digital photographs using time and content
We present similarity-based methods to cluster digital photos by time and image content. This approach is general, unsupervised, and makes minimal assumptions regarding the struct...
Matthew L. Cooper, Jonathan Foote, Andreas Girgens...