Sciweavers

2080 search results - page 165 / 416
» Measuring empirical computational complexity
Sort
View
JCP
2007
121views more  JCP 2007»
15 years 4 months ago
Learning by Discrimination: A Constructive Incremental Approach
Abstract— This paper presents i-AA1 , a constructive, incremental learning algorithm for a special class of weightless, self-organizing networks. In i-AA1 , learning consists of ...
Christophe G. Giraud-Carrier, Tony R. Martinez
ICMLC
2010
Springer
15 years 2 months ago
Optimization of bagging classifiers based on SBCB algorithm
: Bagging (Bootstrap Aggregating) has been proved to be a useful, effective and simple ensemble learning methodology. In generic bagging methods, all the classifiers which are trai...
Xiao-Dong Zeng, Sam Chao, Fai Wong
ICASSP
2011
IEEE
14 years 8 months ago
Global convergence of independent component analysis based on semidefinite programming relaxation
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
Shotaro Akaho, Jun Fujiki
ICASSP
2011
IEEE
14 years 8 months ago
Extensions of recurrent neural network language model
We present several modifications of the original recurrent neural network language model (RNN LM). While this model has been shown to significantly outperform many competitive l...
Tomas Mikolov, Stefan Kombrink, Lukas Burget, Jan ...
CVPR
2006
IEEE
16 years 6 months ago
Diffusion Distance for Histogram Comparison
In this paper we propose diffusion distance, a new dissimilarity measure between histogram-based descriptors. We define the difference between two histograms to be a temperature f...
Haibin Ling, Kazunori Okada