Sciweavers

4965 search results - page 357 / 993
» A Simple Abstraction for Data Modeling
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Learning to rank using gradient descent
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these...
Christopher J. C. Burges, Tal Shaked, Erin Renshaw...
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
16 years 11 days ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan
ICPPW
2003
IEEE
16 years 1 days ago
Parallelization of Cellular Neural Networks for Image Processing on Cluster Architectures
In this paper a simple but effective approach for parallelization of cellular neural networks for image processing is developed. Digital gray-scale images were used to evaluate th...
Thomas Weishäupl, Erich Schikuta
IDA
2003
Springer
15 years 12 months ago
Guided Incremental Construction of Belief Networks
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
Charles A. Sutton, Brendan Burns, Clayton T. Morri...
FOCS
1999
IEEE
15 years 11 months ago
Learning Mixtures of Gaussians
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
Sanjoy Dasgupta