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ę "comparison" wg kryterium: Temat


Wyświetlanie 1-6 z 6
Tytuł:
The limit of inconsistency reduction in pairwise comparisons
Autorzy:
Koczkodaj, W. W.
Szybowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/330335.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
pairwise comparison
inconsistency reduction
convergence limit
decision making
porównanie parami
redukcja niezgodności
granica konwergencji
podejmowanie decyzji
Opis:
This study provides a proof that the limit of a distance-based inconsistency reduction process is a matrix induced by the vector of geometric means of rows when a distance-based inconsistent pairwise comparisons matrix is transformed into a consistent PC matrix by stepwise inconsistency reduction in triads. The distance-based inconsistency indicator was defined by Koczkodaj (1993) for pairwise comparisons. Its convergence was analyzed in 1996 (regretfully, with an incomplete proof) and finally completed in 2010. However, there was no interpretation provided for the limit of convergence despite its considerable importance. This study also demonstrates that the vector of geometric means and the right principal eigenvector are linearly independent for the pairwise comparisons matrix size greater than three, although both vectors are identical (when normalized) for a consistent PC matrix of any size.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 721-729
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On a matching distance between rooted phylogenetic trees
Autorzy:
Bogdanowicz, D.
Giaro, K.
Powiązania:
https://bibliotekanauki.pl/articles/330090.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
phylogenetic tree
phylogenetic tree metric
phylogenetic tree comparison
matching cluster distance
matching split distance
drzewo filogenetyczne
Opis:
The Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach based on a minimum-weight perfect matching in bipartite graphs, the values of similarity between clusters are transformed to the final MC-score of the dissimilarity of trees. The analyzed properties give insight into the structure of the metric space generated by MC, its relations with the Matching Split (MS) distance of unrooted trees and asymptotic behavior of the expected distance between binary n-leaf trees selected uniformly in both MC and MS [...].
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 3; 669-684
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A comparison of Jacobian-based methods of inverse kinematics for serial robot manipulators
Autorzy:
Dulęba, I.
Opałka, M.
Powiązania:
https://bibliotekanauki.pl/articles/330786.pdf
Data publikacji:
2013
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
serial manipulator
inverse kinematics
Jacobian method
comparison
applications
manipulator szeregowy
kinematyka odwrotna
metoda Jacobiego
porównanie
zastosowania
Opis:
The objective of this paper is to present and make a comparative study of several inverse kinematics methods for serial manipulators, based on the Jacobian matrix. Besides the well-known Jacobian transpose and Jacobian pseudo-inverse methods, three others, borrowed from numerical analysis, are presented. Among them, two approximation methods avoid the explicit manipulability matrix inversion, while the third one is a slightly modified version of the Levenberg–Marquardt method (mLM). Their comparison is based on the evaluation of a short distance approaching the goal point and on their computational complexity. As the reference method, the Jacobian pseudo-inverse is utilized. Simulation results reveal that the modified Levenberg–Marquardt method is promising, while the first order approximation method is reliable and requires mild computational costs. Some hints are formulated concerning the application of Jacobian-based methods in practice.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2013, 23, 2; 373-382
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A linearization-based hybrid approach for 3D reconstruction of objects in a single image
Autorzy:
Kotan, Muhammed
Öz, Cemil
Kahraman, Abdulgani
Powiązania:
https://bibliotekanauki.pl/articles/2055171.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
3D reconstruction
shape from shading
shape recovery
image comparison
surface inspection
rekonstrukcja 3D
odzyskiwanie kształtu
porównywanie obrazów
inspekcja powierzchni
Opis:
The shape-from-shading (SFS) technique uses the pattern of shading in images in order to obtain 3D view information. By virtue of their ease of implementation, linearization-based SFS algorithms are frequently used in the literature. In this study, Fourier coefficients of central differences obtained from gray-level images are employed, and two basic linearization-based algorithms are combined. By using the functionally generated surfaces and 3D reconstruction datasets, the hybrid algorithm is compared with linearization-based approaches. Five different evaluation metrics are applied on recovered depth maps and the corresponding gray-level images. The results on defective sample surfaces are also included to show the effect of the algorithm on surface reconstruction. The proposed method can prevent erroneous estimates on object boundaries and produce satisfactory 3D reconstruction results in a low number of iterations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 3; 501--513
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonparametric statistical analysis for multiple comparison of machine learning regression algorithms
Autorzy:
Trawiński, B.
Smętek, M.
Telec, Z.
Lasota, T.
Powiązania:
https://bibliotekanauki.pl/articles/331296.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
test statystyczny nieparametryczny
regresja statystyczna
sieć neuronowa
wielokrotne testy porównawcze
machine learning
nonparametric statistical tests
statistical regression
neural network
multiple comparison tests
Opis:
In the paper we present some guidelines for the application of nonparametric statistical tests and post-hoc procedures devised to perform multiple comparisons of machine learning algorithms. We emphasize that it is necessary to distinguish between pairwise and multiple comparison tests. We show that the pairwise Wilcoxon test, when employed to multiple comparisons, will lead to overoptimistic conclusions. We carry out intensive normality examination employing ten different tests showing that the output of machine learning algorithms for regression problems does not satisfy normality requirements. We conduct experiments on nonparametric statistical tests and post-hoc procedures designed for multiple 1 x N and N x N comparisons with six different neural regression algorithms over 29 benchmark regression data sets. Our investigation proves the usefulness and strength of multiple comparison statistical procedures to analyse and select machine learning algorithms.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 867-881
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks
Autorzy:
Klęsk, P.
Powiązania:
https://bibliotekanauki.pl/articles/929593.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
estymacja regresji
walidacja krzyżowa
teoria uczenia się
generalizacja
teoria statystyczna
regression estimation
model comparison
complexity selection
cross-validation
generalization
statistical learning theory
generalization bounds
structural risk minimization
Opis:
Two known approaches to complexity selection are taken under consideration: n-fold cross-validation and structural risk minimization. Obviously, in either approach, a discrepancy between the indicated optimal complexity (indicated as the minimum of a generalization error estimate or a bound) and the genuine minimum of unknown true risks is possible. In the paper, this problem is posed in a novel quantitative way. We state and prove theorems demonstrating how one can calculate pessimistic probabilities of discrepancy between these minima for given for given conditions of an experiment. The probabilities are calculated in terms of all relevant constants: the sample size, the number of cross-validation folds, the capacity of the set of approximating functions and bounds on this set. We report experiments carried out to validate the results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 3; 525-544
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-6 z 6

    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