Sciweavers

881 search results - page 74 / 177
» Spectral Algorithms for Supervised Learning
Sort
View
MICAI
2004
Springer
15 years 3 months ago
Faster Proximity Searching in Metric Data
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
Edgar Chávez, Karina Figueroa
COLING
2002
14 years 9 months ago
Fine Grained Classification of Named Entities
While Named Entity extraction is useful in many natural language applications, the coarse categories that most NE extractors work with prove insufficient for complex applications ...
Michael Fleischman, Eduard H. Hovy
CORR
2012
Springer
220views Education» more  CORR 2012»
13 years 5 months ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
DAGM
2011
Springer
13 years 9 months ago
Relaxed Exponential Kernels for Unsupervised Learning
Many unsupervised learning algorithms make use of kernels that rely on the Euclidean distance between two samples. However, the Euclidean distance is optimal for Gaussian distribut...
Karim T. Abou-Moustafa, Mohak Shah, Fernando De la...
NCA
2002
IEEE
14 years 9 months ago
Comparison of Algorithmic and Machine Learning Approaches for the Automatic Fitting of Gaussian Peaks
Fitting gaussian peaks to experimental data is important in many disciplines, including nuclear spectroscopy. Nonlinear least squares fitting methods have been in use for a long t...
Radwan E. Abdel-Aal