Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Machine learning" wg kryterium: Temat


Tytuł:
Ensembles of instance selection methods: A comparative study
Autorzy:
Blachnik, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/330413.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine learning
instance selection
ensemble methods
uczenie maszynowe
selekcja przypadków
metoda zespołowa
Opis:
Instance selection is often performed as one of the preprocessing methods which, along with feature selection, allows a significant reduction in computational complexity and an increase in prediction accuracy. So far, only few authors have considered ensembles of instance selection methods, while the ensembles of final predictive models attract many researchers. To bridge that gap, in this paper we compare four ensembles adapted to instance selection: Bagging, Feature Bagging, AdaBoost and Additive Noise. The last one is introduced for the first time in this paper. The study is based on empirical comparison performed on 43 datasets and 9 base instance selection methods. The experiments are divided into three scenarios. In the first one, evaluated on a single dataset, we demonstrate the influence of the ensembles on the compression–accuracy relation, in the second scenario the goal is to achieve the highest prediction accuracy, and in the third one both accuracy and the level of dataset compression constitute a multi-objective criterion. The obtained results indicate that ensembles of instance selection improve the base instance selection algorithms except for unstable methods such as CNN and IB3, which is achieved at the expense of compression. In the comparison, Bagging and AdaBoost lead in most of the scenarios. In the experiments we evaluate three classifiers: 1NN, kNN and SVM. We also note a deterioration in prediction accuracy for robust classifiers (kNN and SVM) trained on data filtered by any instance selection methods (including the ensembles) when compared with the results obtained when the entire training set was used to train these classifiers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 1; 151-168
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ensemble learning techniques for transmission quality classification in a Pay&Require multi-layer network
Autorzy:
Żelasko, Dariusz
Pławiak, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1838182.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Pay&Require
ensemble learning
machine learning
resource allocation
QoS
uczenie zespołowe
uczenie maszynowe
alokacja zasobu
Opis:
Due to a continuous increase in the use of computer networks, it has become important to ensure the quality of data transmission over the network. The key issue in the quality assurance is the translation of parameters describing transmission quality to a certain rating scale. This article presents a technique that allows assessing transmission quality parameters. Thanks to the application of machine learning, it is easy to translate transmission quality parameters, i.e., delay, bandwidth, packet loss ratio and jitter, into a scale understandable by the end user. In this paper we propose six new ensembles of classifiers. Each classification algorithm is combined with preprocessing, cross-validation and genetic optimization. Most ensembles utilize several classification layers in which popular classifiers are used. For the purpose of the machine learning process, we have created a data set consisting of 100 samples described by four features, and the label which describes quality. Our previous research was conducted with respect to single classifiers. The results obtained now, in comparison with the previous ones, are satisfactory—high classification accuracy is reached, along with 94% sensitivity (overall accuracy) with 6/100 incorrect classifications. The suggested solution appears to be reliable and can be successfully applied in practice.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 135-153
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Machine-learning in optimization of expensive black-box functions
Autorzy:
Tenne, Y.
Powiązania:
https://bibliotekanauki.pl/articles/330747.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
computer simulation
metamodel
classifier integration
machine learning
symulacja komputerowa
integracja klasyfikatorów
uczenie maszynowe
Opis:
Modern engineering design optimization often uses computer simulations to evaluate candidate designs. For some of these designs the simulation can fail for an unknown reason, which in turn may hamper the optimization process. To handle such scenarios more effectively, this study proposes the integration of classifiers, borrowed from the domain of machine learning, into the optimization process. Several implementations of the proposed approach are described. An extensive set of numerical experiments shows that the proposed approach improves search effectiveness.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 1; 105-118
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Comparison of prototype selection algorithms used in construction of neural networks learned by SVD
Autorzy:
Jankowski, N.
Powiązania:
https://bibliotekanauki.pl/articles/330020.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
radial basis function network
extreme learning machine
kernel method
prototype selection
machine learning
k nearest neighbours
radialna funkcja bazowa
metoda jądrowa
uczenie maszynowe
metoda k najbliższych sąsiadów
Opis:
Radial basis function networks (RBFNs) or extreme learning machines (ELMs) can be seen as linear combinations of kernel functions (hidden neurons). Kernels can be constructed in random processes like in ELMs, or the positions of kernels can be initialized by a random subset of training vectors, or kernels can be constructed in a (sub-)learning process (sometimes by k-means, for example). We found that kernels constructed using prototype selection algorithms provide very accurate and stable solutions. What is more, prototype selection algorithms automatically choose not only the placement of prototypes, but also their number. Thanks to this advantage, it is no longer necessary to estimate the number of kernels with time-consuming multiple train-test procedures. The best results of learning can be obtained by pseudo-inverse learning with a singular value decomposition (SVD) algorithm. The article presents a comparison of several prototype selection algorithms co-working with singular value decomposition-based learning. The presented comparison clearly shows that the combination of prototype selection and SVD learning of a neural network is significantly better than a random selection of kernels for the RBFN or the ELM, the support vector machine or the kNN. Moreover, the presented learning scheme requires no parameters except for the width of the Gaussian kernel.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 719-733
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GrNFS: A granular neuro-fuzzy system for regression in large volume data
Autorzy:
Siminski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2055169.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
granular computing
neuro-fuzzy system
large volume data
machine learning
przetwarzanie ziarniste
system neurorozmyty
uczenie maszynowe
Opis:
Neuro-fuzzy systems have proved their ability to elaborate intelligible nonlinear models for presented data. However, their bottleneck is the volume of data. They have to read all data in order to produce a model. We apply the granular approach and propose a granular neuro-fuzzy system for large volume data. In our method the data are read by parts and granulated. In the next stage the fuzzy model is produced not on data but on granules. In the paper we introduce a novel type of granules: a fuzzy rule. In our system granules are represented by both regular data items and fuzzy rules. Fuzzy rules are a kind of data summaries. The experiments show that the proposed granular neuro-fuzzy system can produce intelligible models even for large volume datasets. The system outperforms the sampling techniques for large volume datasets.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 3; 445--459
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Linear discriminant analysis with a generalization of the Moore–Penrose pseudoinverse
Autorzy:
Górecki, T.
Łuczak, M.
Powiązania:
https://bibliotekanauki.pl/articles/330828.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
linear discriminant analysis
Moore–Penrose pseudoinverse
machine learning
liniowa analiza dyskryminacji
pseudoodwrotność Moore–Penrose
uczenie maszynowe
Opis:
The Linear Discriminant Analysis (LDA) technique is an important and well-developed area of classification, and to date many linear (and also nonlinear) discrimination methods have been put forward. A complication in applying LDA to real data occurs when the number of features exceeds that of observations. In this case, the covariance estimates do not have full rank, and thus cannot be inverted. There are a number of ways to deal with this problem. In this paper, we propose improving LDA in this area, and we present a new approach which uses a generalization of the Moore–Penrose pseudoinverse to remove this weakness. Our new approach, in addition to managing the problem of inverting the covariance matrix, significantly improves the quality of classification, also on data sets where we can invert the covariance matrix. Experimental results on various data sets demonstrate that our improvements to LDA are efficient and our approach outperforms LDA.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 2; 463-471
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
CCR: A combined cleaning and resampling algorithm for imbalanced data classification
Autorzy:
Koziarski, M.
Woźniak, M.
Powiązania:
https://bibliotekanauki.pl/articles/329869.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine learning
classification algorithms
imbalanced data
preprocessing
oversampling
uczenie maszynowe
algorytm klasyfikacji
dane niezrównoważone
wstępne przetwarzanie danych
Opis:
Imbalanced data classification is one of the most widespread challenges in contemporary pattern recognition. Varying levels of imbalance may be observed in most real datasets, affecting the performance of classification algorithms. Particularly, high levels of imbalance make serious difficulties, often requiring the use of specially designed methods. In such cases the most important issue is often to properly detect minority examples, but at the same time the performance on the majority class cannot be neglected. In this paper we describe a novel resampling technique focused on proper detection of minority examples in a two-class imbalanced data task. The proposed method combines cleaning the decision border around minority objects with guided synthetic oversampling. Results of the conducted experimental study indicate that the proposed algorithm usually outperforms the conventional oversampling approaches, especially when the detection of minority examples is considered.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 727-736
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Machine learning techniques combined with dose profiles indicate radiation response biomarkers
Autorzy:
Papiez, Anna
Badie, Christophe
Polanska, Joanna
Powiązania:
https://bibliotekanauki.pl/articles/331077.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
machine learning
gene profiling
radiation response
multiple random validation
transcription
uczenie maszynowe
profilowanie genów
odpowiedź radiacyjna
transkrypcja
Opis:
The focus of this research is to combine statistical and machine learning tools in application to a high-throughput biological data set on ionizing radiation response. The analyzed data consist of two gene expression sets obtained in studies of radiosensitive and radioresistant breast cancer patients undergoing radiotherapy. The data sets were similar in principle; however, the treatment dose differed. It is shown that introducing mathematical adjustments in data preprocessing, differentiation and trend testing, and classification, coupled with current biological knowledge, allows efficient data analysis and obtaining accurate results. The tools used to customize the analysis workflow were batch effect filtration with empirical Bayes models, identifying gene trends through the Jonckheere–Terpstra test and linear interpolation adjustment according to specific gene profiles for multiple random validation. The application of non-standard techniques enabled successful sample classification at the rate of 93.5% and the identification of potential biomarkers of radiation response in breast cancer, which were confirmed with an independent Monte Carlo feature selection approach and by literature references. This study shows that using customized analysis workflows is a necessary step towards novel discoveries in complex fields such as personalized individual therapy.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 1; 169-178
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A rainfall forecasting method using machine learning models and its application to the Fukuoka city case
Autorzy:
Sumi, S. M.
Zaman, M. F.
Hirose, H.
Powiązania:
https://bibliotekanauki.pl/articles/331290.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
metoda wielomodelowa
przetwarzanie wstępne
rainfall forecasting
machine learning
multi model method
preprocessing
model ranking
Opis:
In the present article, an attempt is made to derive optimal data-driven machine learning methods for forecasting an average daily and monthly rainfall of the Fukuoka city in Japan. This comparative study is conducted concentrating on three aspects: modelling inputs, modelling methods and pre-processing techniques. A comparison between linear correlation analysis and average mutual information is made to find an optimal input technique. For the modelling of the rainfall, a novel hybrid multi-model method is proposed and compared with its constituent models. The models include the artificial neural network, multivariate adaptive regression splines, the k-nearest neighbour, and radial basis support vector regression. Each of these methods is applied to model the daily and monthly rainfall, coupled with a pre-processing technique including moving average and principal component analysis. In the first stage of the hybrid method, sub-models from each of the above methods are constructed with different parameter settings. In the second stage, the sub-models are ranked with a variable selection technique and the higher ranked models are selected based on the leave-one-out cross-validation error. The forecasting of the hybrid model is performed by the weighted combination of the finally selected models.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 841-854
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Data-driven models for fault detection using kernel PCA: A water distribution system case study
Autorzy:
Nowicki, A.
Grochowski, M.
Duzinkiewicz, K.
Powiązania:
https://bibliotekanauki.pl/articles/331249.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
detekcja uszkodzeń
monitorowanie
wykrywanie wycieku
machine learning
kernel PCA
fault detection
monitoring
water leakage detection
Opis:
Kernel Principal Component Analysis (KPCA), an example of machine learning, can be considered a non-linear extension of the PCA method. While various applications of KPCA are known, this paper explores the possibility to use it for building a data-driven model of a non-linear system-the water distribution system of the Chojnice town (Poland). This model is utilised for fault detection with the emphasis on water leakage detection. A systematic description of the system's framework is followed by evaluation of its performance. Simulations prove that the presented approach is both flexible and efficient.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 939-949
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
Autorzy:
Czarnowski, I.
Jędrzejowicz, P.
Powiązania:
https://bibliotekanauki.pl/articles/907819.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
redukcja danych
komputerowe uczenie się
optymalizacja
system wieloagentowy
data reduction
machine learning
A-Team
optimization
multi-agent system
Opis:
The problem considered concerns data reduction for machine learning. Data reduction aims at deciding which features and instances from the training set should be retained for further use during the learning process. Data reduction results in increased capabilities and generalization properties of the learning model and a shorter time of the learning process. It can also help in scaling up to large data sources. The paper proposes an agent-based data reduction approach with the learning process executed by a team of agents (A-Team). Several A-Team architectures with agents executing the simulated annealing and tabu search procedures are proposed and investigated. The paper includes a detailed description of the proposed approach and discusses the results of a validating experiment.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2011, 21, 1; 57-68
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A fast neural network learning algorithm with approximate singular value decomposition
Autorzy:
Jankowski, Norbert
Linowiecki, Rafał
Powiązania:
https://bibliotekanauki.pl/articles/330870.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Moore–Penrose pseudoinverse
radial basis function network
extreme learning machine
kernel method
machine learning
singular value decomposition
deep extreme learning
principal component analysis
pseudoodwrotność Moore–Penrose
radialna funkcja bazowa
maszyna uczenia ekstremalnego
uczenie maszynowe
analiza składników głównych
Opis:
The learning of neural networks is becoming more and more important. Researchers have constructed dozens of learning algorithms, but it is still necessary to develop faster, more flexible, or more accurate learning algorithms. With fast learning we can examine more learning scenarios for a given problem, especially in the case of meta-learning. In this article we focus on the construction of a much faster learning algorithm and its modifications, especially for nonlinear versions of neural networks. The main idea of this algorithm lies in the usage of fast approximation of the Moore–Penrose pseudo-inverse matrix. The complexity of the original singular value decomposition algorithm is O(mn2). We consider algorithms with a complexity of O(mnl), where l < n and l is often significantly smaller than n. Such learning algorithms can be applied to the learning of radial basis function networks, extreme learning machines or deep ELMs, principal component analysis or even missing data imputation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 3; 581-594
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Self-adaptation of parameters in a learning classifier system ensemble machine
Autorzy:
Troć, M.
Unold, O.
Powiązania:
https://bibliotekanauki.pl/articles/907767.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
komputerowe uczenie się
system klasyfikujący
sterowanie adaptacyjne
sterowanie parametryczne
machine learning
extended classifier system
self-adaptation
adaptive parameter control
Opis:
Self-adaptation is a key feature of evolutionary algorithms (EAs). Although EAs have been used successfully to solve a wide variety of problems, the performance of this technique depends heavily on the selection of the EA parameters. Moreover, the process of setting such parameters is considered a time-consuming task. Several research works have tried to deal with this problem; however, the construction of algorithms letting the parameters adapt themselves to the problem is a critical and open problem of EAs. This work proposes a novel ensemble machine learning method that is able to learn rules, solve problems in a parallel way and adapt parameters used by its components. A self-adaptive ensemble machine consists of simultaneously working extended classifier systems (XCSs). The proposed ensemble machine may be treated as a meta classifier system. A new self-adaptive XCS-based ensemble machine was compared with two other XCS-based ensembles in relation to one-step binary problems: Multiplexer, One Counts, Hidden Parity, and randomly generated Boolean functions, in a noisy version as well. Results of the experiments have shown the ability of the model to adapt the mutation rate and the tournament size. The results are analyzed in detail.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 157-174
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-label classification using error correcting output codes
Autorzy:
Kajdanowicz, T.
Kazienko, P.
Powiązania:
https://bibliotekanauki.pl/articles/331286.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
uczenie nadzorowane
metoda agregacji
struktura ramowa
machine learning
supervised learning
multilabel classification
error correcting output codes
ECOC
ensemble methods
binary relevance
framework
Opis:
A framework for multi-label classification extended by Error Correcting Output Codes (ECOCs) is introduced and empirically examined in the article. The solution assumes the base multi-label classifiers to be a noisy channel and applies ECOCs in order to recover the classification errors made by individual classifiers. The framework was examined through exhaustive studies over combinations of three distinct classification algorithms and four ECOC methods employed in the multi-label classification problem. The experimental results revealed that (i) the Bode-Chaudhuri-Hocquenghem (BCH) code matched with any multi-label classifier results in better classification quality; (ii) the accuracy of the binary relevance classification method strongly depends on the coding scheme; (iii) the label power-set and the RAkEL classifier consume the same time for computation irrespective of the coding utilized; (iv) in general, they are not suitable for ECOCs because they are not capable to benefit from ECOC correcting abilities; (v) the all-pairs code combined with binary relevance is not suitable for datasets with larger label sets.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 829-840
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge computing in IoT-enabled honeybee monitoring for the detection of Varroa destructor
Autorzy:
Wachowicz, Anna
Pytlik, Jakub
Małysiak-Mrozek, Bożena
Tokarz, Krzysztof
Mrozek, Dariusz
Powiązania:
https://bibliotekanauki.pl/articles/2172108.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Internet of Things
IoT
Varroa destructor
precision beekeeping
machine learning
image processing
edge device
Internet Rzeczy
pszczelarstwo
uczenie maszynowe
przetwarzanie obrazu
urządzenie brzegowe
Opis:
Among many important functions, bees play a key role in food production. Unfortunately, worldwide bee populations have been decreasing since 2007. One reason for the decrease of adult worker bees is varroosis, a parasitic disease caused by the Varroa destructor (V. destructor) mite. Varroosis can be quickly eliminated from beehives once detected. However, this requires them to be monitored continuously during periods of bee activity to ensure that V. destructor mites are detected before they spread and infest the entire beehive. To this end, the use of Internet of things (IoT) devices can significantly increase detection speed. Comprehensive solutions are required that can cover entire apiaries and prevent the disease from spreading between hives and apiaries. In this paper, we present a solution for global monitoring of apiaries and the detection of V. destructor mites in beehives. Our solution captures and processes video streams from camera-based IoT devices, analyzes those streams using edge computing, and constructs a global collection of cases within the cloud. We have designed an IoT device that monitors bees and detects V. destructor infestation via video stream analysis on a GPU-accelerated Nvidia Jetson Nano. Experimental results show that the detection process can be run in real time while maintaining similar efficacy to alternative approaches.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 3; 355--369
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies