Search results for " Learning"
showing 10 items of 5299 documents
Assembly Assistance System with Decision Trees and Ensemble Learning
2021
This paper presents different prediction methods based on decision tree and ensemble learning to suggest possible next assembly steps. The predictor is designed to be a component of a sensor-based assembly assistance system whose goal is to provide support via adaptive instructions, considering the assembly progress and, in the future, the estimation of user emotions during training. The assembly assistance station supports inexperienced manufacturing workers, but it can be useful in assisting experienced workers, too. The proposed predictors are evaluated on the data collected in experiments involving both trainees and manufacturing workers, as well as on a mixed dataset, and are compared …
Collaborative Systems and Environments for Future Working Life: Towards the Integration of Workers, Systems and Manufacturing Environments
2017
While the industrial sector in Europe was previously strongly based on mass production technology, it is now moving towards highly customised products and thus to lot-size-one production. The change in production paradigm is strengthened by the emerging technologies. In small- and medium-sized enterprises (SMEs), this means, for example, the increased use of modern digital manufacturing tools, new additive manufacturing processes and novel engineering intelligence solutions. As a direct result, workers need to develop new skills and competences to effective work. From an educational perspective, it is especially critical that people with few prior successful experiences with fully applying …
Health Indicator for Low-Speed Axial Bearings Using Variational Autoencoders
2020
This paper proposes a method for calculating a health indicator (HI) for low-speed axial rolling element bearing (REB) health assessment by utilizing the latent representation obtained by variational inference using Variational Autoencoders (VAEs), trained on each speed reference in the dataset. Further, versatility is added by conditioning on the speed, extending the VAE to a conditional VAE (CVAE), thereby incorporating all speeds in a single model. Within the framework, the coefficients of autoregressive (AR) models are used as features. The dimensionality reduction inherent in the proposed method lowers the need of expert knowledge to design good condition indicators. Moreover, the sugg…
Online fitted policy iteration based on extreme learning machines
2016
Reinforcement learning (RL) is a learning paradigm that can be useful in a wide variety of real-world applications. However, its applicability to complex problems remains problematic due to different causes. Particularly important among these are the high quantity of data required by the agent to learn useful policies and the poor scalability to high-dimensional problems due to the use of local approximators. This paper presents a novel RL algorithm, called online fitted policy iteration (OFPI), that steps forward in both directions. OFPI is based on a semi-batch scheme that increases the convergence speed by reusing data and enables the use of global approximators by reformulating the valu…
Bio-inspired evolutionary dynamics on complex networks under uncertain cross-inhibitory signals
2019
Given a large population of agents, each agent has three possiblechoices between option 1 or 2 or no option. The two options are equally favorable and the population has to reach consensus on one of the two options quickly and in a distributed way. The more popular an option is, the more likely it is to be chosen by uncommitted agents. Agents committed to one option can be attracted by those committed to the other option through a cross-inhibitory signal. This model originates in the context of honeybee swarms, and we generalize it to duopolistic competition and opinion dynamics. The contributions of this work include (i) the formulation of a model to explain the behavioral traits of the ho…
A Hierarchical Learning Scheme for Solving the Stochastic Point Location Problem
2012
Published version of a chapter in the book: Advanced Research in Applied Artificial Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-31087-4_78 This paper deals with the Stochastic-Point Location (SPL) problem. It presents a solution which is novel in both philosophy and strategy to all the reported related learning algorithms. The SPL problem concerns the task of a Learning Mechanism attempting to locate a point on a line. The mechanism interacts with a random environment which essentially informs it, possibly erroneously, if the unknown parameter is on the left or the right of a given point which also is the current guess. The first pioneering work […
Assembly Process Modeling Through Long Short-Term Memory
2021
This paper studies Long Short-Term Memory as a component of an adaptive assembly assistance system suggesting the next manufacturing step. The final goal is an assistive system able to help the inexperienced workers in their training stage or even experienced workers who prefer such support in their manufacturing activity. In contrast with the earlier analyzed context-based techniques, Long Short-Term Memory can be applied in unknown scenarios. The evaluation was performed on the data collected previously in an experiment with 68 participants assembling as target product a customizable modular tablet. We are interested in identifying the most accurate method of next assembly step prediction…
Extreme Learning Machines for Data Classification Tuning by Improved Bat Algorithm
2018
Single hidden layer feed forward neural networks are widely used for various practical problems. However, the training process for determining synaptic weights of such neural networks can be computationally very expensive. In this paper we propose a new learning algorithm for learning the synaptic weights of the single hidden layer feedforward neural networks in order to reduce the learning time. We propose combining the upgraded bat algorithm with the extreme learning machine. The proposed approach reduces the number of evaluations needed to train a neural network and efficiently finds optimal input weights and the hidden biases. The proposed algorithm was tested on standard benchmark clas…
Adjusted bat algorithm for tuning of support vector machine parameters
2016
Support vector machines are powerful and often used technique of supervised learning applied to classification. Quality of the constructed classifier can be improved by appropriate selection of the learning parameters. These parameters are often tuned using grid search with relatively large step. This optimization process can be done computationally more efficiently and more precisely using stochastic search metaheuristics. In this paper we propose adjusted bat algorithm for support vector machines parameter optimization and show that compared to the grid search it leads to a better classifier. We tested our approach on standard set of benchmark data sets from UCI machine learning repositor…
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…