標(biāo)題: Titlebook: Artificial Neural Networks and Machine Learning -- ICANN 2012; 22nd International C Alessandro E. P. Villa,W?odzis?aw Duch,Günther Pal Conf [打印本頁] 作者: 爆發(fā) 時間: 2025-3-21 18:00
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012影響因子(影響力)
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012影響因子(影響力)學(xué)科排名
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012網(wǎng)絡(luò)公開度
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012被引頻次
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012被引頻次學(xué)科排名
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012年度引用
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012年度引用學(xué)科排名
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012讀者反饋
書目名稱Artificial Neural Networks and Machine Learning -- ICANN 2012讀者反饋學(xué)科排名
作者: 蓋他為秘密 時間: 2025-3-21 21:32
Theoretical Analysis of Function of Derivative Term in On-Line Gradient Descent Learningh as by using the natural gradient, has been proposed for speeding up the convergence. Beside this sophisticated method, ”simple method” that replace the derivative term with a constant has proposed and showed that this greatly increases convergence speed. Although this phenomenon has been analyzed 作者: 剛毅 時間: 2025-3-22 02:15 作者: 記憶 時間: 2025-3-22 05:14 作者: Goblet-Cells 時間: 2025-3-22 10:56
Electricity Load Forecasting: A Weekday-Based Approachlection using autocorrelation analysis for each day of the week and build a separate prediction model using linear regression and backpropagation neural networks. We used two years of 5-minute electricity load data for the state of New South Wales in Australia to evaluate performance. Our results sh作者: Meager 時間: 2025-3-22 15:42
Adaptive Exploration Using Stochastic Neuronsl-free temporal-difference learning using discrete actions. The advantage is in particular memory efficiency, because memorizing exploratory data is only required for starting states. Hence, if a learning problem consist of only one starting state, exploratory data can be considered as being global.作者: Tinea-Capitis 時間: 2025-3-22 21:01
Comparison of Long-Term Adaptivity for Neural Networks. Problems occur if the system dynamics change over time (concept drift). We survey different approaches to handle concept drift and to ensure good prognosis quality over long time ranges. Two main approaches - data accumulation and ensemble learning - are explained and implemented. We compare the c作者: 雪崩 時間: 2025-3-22 22:48 作者: TAP 時間: 2025-3-23 03:36
A Modified Artificial Fish Swarm Algorithm for the Optimization of Extreme Learning Machinesffer from generalization loss caused by overfitting, thereby the process of learning is highly biased. For this work we use Extreme Learning Machine which is an algorithm for training single hidden layer neural networks, and propose a novel swarm-based method for optimizing its weights and improving作者: Corral 時間: 2025-3-23 09:11 作者: DECRY 時間: 2025-3-23 12:52 作者: Trigger-Point 時間: 2025-3-23 16:26 作者: prodrome 時間: 2025-3-23 21:44 作者: anus928 時間: 2025-3-24 00:11 作者: 努力趕上 時間: 2025-3-24 05:53
Control of a Free-Falling Cat by Policy-Based Reinforcement Learningven if the dynamics are known. To this challenge, in this study, we propose a reinforcement learning (RL) approach which enables the controller to acquire an appropriate control policy even without knowing the detailed dynamics. In particular, we focus on the control problem of a free-falling cat sy作者: 表被動 時間: 2025-3-24 09:54
Gated Boltzmann Machine in Texture Modelingype of data that one can better understand by considering its local structure. For that purpose, we propose a convolutional variant of the Gaussian gated Boltzmann machine (GGBM)?[12], inspired by the co-occurrence matrix in traditional texture analysis. We also link the proposed model to a much sim作者: Assault 時間: 2025-3-24 13:42
Neural PCA and Maximum Likelihood Hebbian Learning on the GPUihood Hebbian Learning (MLHL) network designed for modern many-core graphics processing units (GPUs). The parallel implementation as well as the computational experiments conducted in order to evaluate the speedup achieved by the GPU are presented and discussed. The evaluation was done on a well-kno作者: Anticoagulants 時間: 2025-3-24 17:38 作者: Aphorism 時間: 2025-3-24 22:57 作者: 機(jī)構(gòu) 時間: 2025-3-25 02:18
https://doi.org/10.1007/978-3-642-33266-1brain-computer interface; combinatorial optimization; evolutionary algorithm; particle swarm; self-organ作者: 百靈鳥 時間: 2025-3-25 05:42 作者: 認(rèn)識 時間: 2025-3-25 09:28 作者: 獨(dú)行者 時間: 2025-3-25 13:28
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/b/image/162633.jpg作者: tic-douloureux 時間: 2025-3-25 18:35 作者: 粘連 時間: 2025-3-25 21:06 作者: 削減 時間: 2025-3-26 01:08
Effective Actions and?Anomaliesihood Hebbian Learning (MLHL) network designed for modern many-core graphics processing units (GPUs). The parallel implementation as well as the computational experiments conducted in order to evaluate the speedup achieved by the GPU are presented and discussed. The evaluation was done on a well-known artificial data set, the 2D bars data set.作者: 努力趕上 時間: 2025-3-26 05:26
Flavor chemistry and assessment,ts search space is full of crevasse-like forms having huge condition numbers; thus, it is very hard for existing methods to perform efficient search in such a space. The space also includes the structure of reducibility mapping. The paper proposes a new search method for a complex-valued MLP, which 作者: 榮幸 時間: 2025-3-26 09:49 作者: A簡潔的 時間: 2025-3-26 16:40
Flavour chemistry of fermented sausages,dth, are investigated in the framework of scaled kernels. The impact of widths of kernels on approximation of multivariable functions, generalization modelled by regularization with kernel stabilizers, and minimization of error functionals is analyzed.作者: 腫塊 時間: 2025-3-26 17:46
Historical aspects of meat fermentations,els, but rather the permutation of that set that applies to a new example (e.g., the ranking of a set of financial analysts in terms of the quality of their recommendations). In this paper, we adapt a multilayer perceptron algorithm for label ranking. We focus on the adaptation of the Back-Propagati作者: 女上癮 時間: 2025-3-26 22:47
Bacterial fermentation of meats,lection using autocorrelation analysis for each day of the week and build a separate prediction model using linear regression and backpropagation neural networks. We used two years of 5-minute electricity load data for the state of New South Wales in Australia to evaluate performance. Our results sh作者: Cholecystokinin 時間: 2025-3-27 01:36 作者: 污穢 時間: 2025-3-27 07:46 作者: Constant 時間: 2025-3-27 11:12
https://doi.org/10.1007/978-3-642-83425-7in order to modify the hypothesis space, and to speed-up learning and processing times. We study two kinds of filters that are known to be computationally efficient in feed-forward processing: fused convolution/sub-sampling filters, and separable filters. We compare the complexity of the back-propag作者: 顯示 時間: 2025-3-27 15:57 作者: OVER 時間: 2025-3-27 20:26 作者: 遭受 時間: 2025-3-28 00:35
https://doi.org/10.1007/978-3-319-48646-8s work has focused on uncovering connections among scalar random variables. We generalize existing methods to apply to collections of multi-dimensional random ., focusing on techniques applicable to linear models. The performance of the resulting algorithms is evaluated and compared in simulations, 作者: POINT 時間: 2025-3-28 03:25 作者: 乳汁 時間: 2025-3-28 08:22 作者: obsession 時間: 2025-3-28 13:16
Effective Actions and?Anomalieser space the parameters of the model are represented by fewer parameters, and hence training can be faster. After training, the parameters of the model can be generated from the parameters in compressed parameter space. We show that for supervised learning, learning the parameters of a model in comp作者: 硬化 時間: 2025-3-28 15:00 作者: 貴族 時間: 2025-3-28 22:23
Functional Non-perturbative Methodsype of data that one can better understand by considering its local structure. For that purpose, we propose a convolutional variant of the Gaussian gated Boltzmann machine (GGBM)?[12], inspired by the co-occurrence matrix in traditional texture analysis. We also link the proposed model to a much sim作者: institute 時間: 2025-3-29 01:24 作者: INTER 時間: 2025-3-29 06:39 作者: Palpitation 時間: 2025-3-29 08:46 作者: PLIC 時間: 2025-3-29 11:41
Some Comparisons of Networks with Radial and Kernel Unitsdth, are investigated in the framework of scaled kernels. The impact of widths of kernels on approximation of multivariable functions, generalization modelled by regularization with kernel stabilizers, and minimization of error functionals is analyzed.作者: conformity 時間: 2025-3-29 17:06
Neural PCA and Maximum Likelihood Hebbian Learning on the GPUihood Hebbian Learning (MLHL) network designed for modern many-core graphics processing units (GPUs). The parallel implementation as well as the computational experiments conducted in order to evaluate the speedup achieved by the GPU are presented and discussed. The evaluation was done on a well-known artificial data set, the 2D bars data set.作者: 一再煩擾 時間: 2025-3-29 23:00
0302-9743 s of the 22nd International Conference on Artificial Neural Networks, ICANN 2012, held in Lausanne, Switzerland, in September 2012. The 162 papers included in the proceedings were carefully reviewed and selected from 247 submissions. They are organized in topical sections named: theoretical neural c作者: 不規(guī)則 時間: 2025-3-30 03:54
Flavor chemistry and assessment,n such a space. The space also includes the structure of reducibility mapping. The paper proposes a new search method for a complex-valued MLP, which employs both eigen vector descent and reducibility mapping, aiming to stably find excellent solutions in such a space. Our experiments showed the proposed method worked well.作者: languor 時間: 2025-3-30 07:48
Historical aspects of meat fermentations, their recommendations). In this paper, we adapt a multilayer perceptron algorithm for label ranking. We focus on the adaptation of the Back-Propagation (BP) mechanism. Six approaches are proposed to estimate the error signal that is propagated by BP. The methods are discussed and empirically evaluated on a set of benchmark problems.作者: syring 時間: 2025-3-30 11:12 作者: ARY 時間: 2025-3-30 13:45
D. M. Newns,K. Makoshi,R. Brakoognosis quality over long time ranges. Two main approaches - data accumulation and ensemble learning - are explained and implemented. We compare the concepts on artificial datasets and on industrial data from three cement production plants and analyse strengths and weaknesses of different approaches.作者: Adenocarcinoma 時間: 2025-3-30 17:49
https://doi.org/10.1007/978-3-319-48646-8l random ., focusing on techniques applicable to linear models. The performance of the resulting algorithms is evaluated and compared in simulations, which show that our methods can, in many cases, provide useful information on causal relationships even for relatively small sample sizes.作者: 冷淡一切 時間: 2025-3-30 23:09 作者: 薄膜 時間: 2025-3-31 04:50
Complex-Valued Multilayer Perceptron Search Utilizing Eigen Vector Descent and Reducibility Mappingn such a space. The space also includes the structure of reducibility mapping. The paper proposes a new search method for a complex-valued MLP, which employs both eigen vector descent and reducibility mapping, aiming to stably find excellent solutions in such a space. Our experiments showed the proposed method worked well.作者: 殺人 時間: 2025-3-31 08:19 作者: 跳脫衣舞的人 時間: 2025-3-31 10:30 作者: Juvenile 時間: 2025-3-31 15:33
Comparison of Long-Term Adaptivity for Neural Networksognosis quality over long time ranges. Two main approaches - data accumulation and ensemble learning - are explained and implemented. We compare the concepts on artificial datasets and on industrial data from three cement production plants and analyse strengths and weaknesses of different approaches.作者: Extemporize 時間: 2025-3-31 19:13
Estimating a Causal Order among Groups of Variables in Linear Modelsl random ., focusing on techniques applicable to linear models. The performance of the resulting algorithms is evaluated and compared in simulations, which show that our methods can, in many cases, provide useful information on causal relationships even for relatively small sample sizes.作者: floaters 時間: 2025-3-31 22:58
Construction of Emerging Markets Exchange Traded Funds Using Multiobjective Particle Swarm Optimisatnd market impact. Solutions obtained by vector evaluated PSO (VEPSO) are compared with those obtained by the quantum-behaved version of this algorithm (VEQPSO) and it is found the best strategy for a portfolio manager would be to use a hybrid front with contributions from both versions of the MOPSO algorithm.作者: 不感興趣 時間: 2025-4-1 05:48
Conference proceedings 2012n Lausanne, Switzerland, in September 2012. The 162 papers included in the proceedings were carefully reviewed and selected from 247 submissions. They are organized in topical sections named: theoretical neural computation; information and optimization; from neurons to neuromorphism; spiking dynamic作者: arrhythmic 時間: 2025-4-1 07:01
Simplifying ConvNets for Fast Learningation algorithm on ConvNets based on these different kinds of filters. We show that using these filters allows to reach the same level of recognition performance as with classical . for handwritten digit recognition, up to 3.3 times faster.作者: 手勢 時間: 2025-4-1 13:17
A Modified Artificial Fish Swarm Algorithm for the Optimization of Extreme Learning Machines generalization performance. The algorithm presents the basic . (AFSA) and some features from . (Crossover and Mutation) to improve the quality of the solutions during the search process. The results of the simulations demonstrated good generalization capacity from the best individuals obtained in the training phase.作者: 抵制 時間: 2025-4-1 17:04
Retracted: Robust Training of Feedforward Neural Networks Using Combined Online/Batch Quasi-Newton Tconcept. Neural network training is presented to demonstrate the validity of combined algorithm. The algorithm achieves more robust training and accurate generalization results than other quasi-Newton based training algorithms.作者: guardianship 時間: 2025-4-1 20:12 作者: GLOOM 時間: 2025-4-2 01:46 作者: 向外供接觸 時間: 2025-4-2 03:10
,Fermented meats — A world perspective,earning step is smaller than optimum value ... When it is larger than .., it decreases slower with the simple method, and the residual error is larger than with the true gradient descent method. Moreover, when there is output noise, .. is no longer optimum; thus, the simple method is not robust in noisy circumstances.
