Sciweavers

62 search results - page 7 / 13
» On Empirical Meaning of Randomness with Respect to a Real Pa...
Sort
View
NIPS
1996
13 years 9 months ago
Radial Basis Function Networks and Complexity Regularization in Function Learning
In this paper we apply the method of complexity regularization to derive estimation bounds for nonlinear function estimation using a single hidden layer radial basis function netwo...
Adam Krzyzak, Tamás Linder
ICDAR
2003
IEEE
14 years 1 months ago
Towards a Ptolemaic Model for OCR
In style-constrained classification often there are only a few samples of each style and class, and the correspondences between styles in the training set and the test set are un...
Sriharsha Veeramachaneni, George Nagy
AMAI
2004
Springer
14 years 1 months ago
Using the Central Limit Theorem for Belief Network Learning
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...
Ian Davidson, Minoo Aminian
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
14 years 19 days ago
Coincidence Detection: A Fast Method for Discovering Higher-Order Correlations in Multidimensional Data
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
Evan W. Steeg, Derek A. Robinson, Ed Willis
CVIU
2007
113views more  CVIU 2007»
13 years 8 months ago
Primal sketch: Integrating structure and texture
This article proposes a generative image model, which is called ‘‘primal sketch,’’ following Marr’s insight and terminology. This model combines two prominent classes of...
Cheng-en Guo, Song Chun Zhu, Ying Nian Wu