Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tomas Hrycej

dblp:03/5849 · DBLP profile ↗
← Back
14ranked-venue papers
11as first author
0since 2021 · last 2019
0009-0008-1066-5045ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 14 · 11 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 70% Learning paradigms · 30%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
bayesian network inference
0.011990
Gibbs Sampling in Bayesian Networks · Artif. Intell. 1990
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
gibbs sampling
0.011990
Gibbs Sampling in Bayesian Networks · Artif. Intell. 1990
Machine learning › Learning paradigms
unsupervised learning
0.011989
Unsupervised Learning by Backward Inhibition · IJCAI 1989

Methods — techniques the papers use, named apart from their topics

gibbs sampling · 0.0
YearPublicationVenuePosition
2019 Singular Value Decomposition and Neural Networks
Bernhard Bermeitinger, Tomas Hrycej, Siegfried Handschuh
ICANN (2)2
2007 Warranty Cost Forecast Based on Car Failure Data
abstract
A failure and warranty cost model is gained from a failure database. The model is a combination of statistical components with a multi-layer perceptron and a cross-entropy based learning rule. The model is used for forecasting warranty costs in alternative warranty condition scenarios. The estimate of forecast variance considers both the individual vehicle risk and the overall manufacturing quality fluctuation risk.
Tomas Hrycej, Matthias Grabert
IJCNN1
2006 A Data Mining Approach to the Joint Evaluation of Field and Manufacturing Data in Automotive Industry
Christian Manuel Strobel, Tomas Hrycej
PKDD2
2001 Estimates of average complexity of neurocontrol algorithms
Tomas Hrycej
Neural Networks1
2000 Logit Demand Function with Embedded Neural Network Based Utility Function
abstract
Utility of product variants is a nonlinear function of product features. Such a utility function can be represented by a multi-layer perceptron and embedded into the classical logit demand function. However, the utility (which is the output of the multi-layer perceptron to be learned) is not explicitly known. This is why the backpropagation learning rule has been extended to fit the demand function directly to observed market shares. Forecasts of market shares on the German automobile market with the help of a perceptron-based and classical logit model are compared. The perceptron-based model leads to a significant improvement of the forecast quality.
Wilm Eggert, Tomas Hrycej
IJCNN (5)2
2000 An Estimate of the Number of Samples to Convergence for Critic Algorithms
abstract
Simplified critic based neurocontrol algorithms are analyzed for expected number of samples to convergence. It is shown that there is a fundamental difference in the complexity behavior between the batch and the incremental algorithm, and between the algorithm with and without an explicit plant model. The batch algorithm using a plant model is superior to other variants.
Tomas Hrycej
IJCNN (3)1
1997 Error measure for identifying chaotic attractors
Tomas Hrycej
ESANN1
1992 Supporting supervised learning by self-organization
Tomas Hrycej
Neurocomputing1
1990 A modular architecture for efficient learning
abstract
A modular architecture for supervised learning is presented. Three ways to modularize the learning are investigated: (1) preprocessing the input by a self-organizing subnetwork to extract strong features from the data, (2) supervised feature extraction, and (3) an iterative learning cycle in which only one layer learns at a time, with the output-layer weights learned by an exact method. With this modular architecture, only a small fraction of connection weights is determined by the gradient-descent method. A series of computational experiments shows the superiority of the modular model in learning quality and speed. The author begins by considering the decomposition of a feedforward network into a feature-discovery and a supervised-learning modules, then he introduces supervised feature discovery, and finally he describes a modular backpropagation algorithm
Tomas Hrycej
IJCNN1
1990 Self-organization by delta rule
abstract
In a certain two-layer network architecture, the delta learning rule leads to a self-organization of connection weights. A formal analysis of this learning rule shows that the weight vectors ofnsecond-layer nodes converge to a rotation of the firstnprincipal components. Therefore, the delta-rule-based self-organization performs optimal encoding and decoding of data in the sense of the principal component analysis. This property of the delta learning rule has been verified by a series of computational experiments, which also showed good convergence stability of the rule. For data compression tasks, it performs substantially better than a three-layer autoassociative perceptron with linear or nonlinear hidden units
Tomas Hrycej
IJCNN1
1990 Gibbs Sampling in Bayesian Networks
Tomas Hrycej
Artif. Intell.1
1989 Unsupervised Learning by Backward Inhibition
Tomas Hrycej
IJCAI1
1988 Intelligent Backtracking with Structured Contexts
Tomas Hrycej
ECAI1
1988 Temporal Prolog
Tomas Hrycej
ECAI1