Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 9

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Book reviews: ''Filtering theory with applications to fault detection, isolation, and estimation'' by Ali Saberi, Anton A. Stoorvogel and Peddapullaiah Sannuti

100%
Kulczycki P.
Control and Cybernetics
|
2008
|
tom 37
|
nr 1
237-238
2
Content available remote

Bayes sharpening of imprecise information

73%
Kulczycki P., Charytanowicz M.
International Journal of Applied Mathematics and Computer Science
|
2005
|
tom 15
|
nr 3
393-404
EN
A complete algorithm is presented for the sharpening of imprecise information, based on the methodology of kernel estimators and the Bayes decision rule, including conditioning factors. The use of the Bayes rule with a nonsymmetrical loss function enables the inclusion of different results of an under- and overestimation of a sharp value (real number), as well as minimizing potential losses. A conditional approach allows to obtain a more precise result thanks to using information entered as the assumed (e.g. current) values of conditioning factors of continuous andor binary types. The nonparametric methodology of statistical kernel estimators freed the investigated procedure from arbitrary assumptions concerning the forms of distributions characterizing both imprecise information and conditioning random variables. The concept presented here is universal and can be applied in a wide range of tasks in contemporary engineering, economics, and medicine.
3
Content available remote

An algorithm for reducing the dimension and size of a sample for data exploration procedures

73%
Kulczycki P., Łukasik S.
International Journal of Applied Mathematics and Computer Science
|
2014
|
tom 24
|
nr 1
133-149
EN
The paper deals with the issue of reducing the dimension and size of a data set (random sample) for exploratory data analysis procedures. The concept of the algorithm investigated here is based on linear transformation to a space of a smaller dimension, while retaining as much as possible the same distances between particular elements. Elements of the transformation matrix are computed using the metaheuristics of parallel fast simulated annealing. Moreover, elimination of or a decrease in importance is performed on those data set elements which have undergone a significant change in location in relation to the others. The presented method can have universal application in a wide range of data exploration problems, offering flexible customization, possibility of use in a dynamic data environment, and comparable or better performance with regards to the principal component analysis. Its positive features were verified in detail for the domain's fundamental tasks of clustering, classification and detection of atypical elements (outliers).
4
Content available remote

A complete gradient clustering algorithm formed with kernel estimators

73%
Kulczycki P., Charytanowicz M.
International Journal of Applied Mathematics and Computer Science
|
2010
|
tom 20
|
nr 1
123-134
EN
The aim of this paper is to provide a gradient clustering algorithm in its complete form, suitable for direct use without requiring a deeper statistical knowledge. The values of all parameters are effectively calculated using optimizing procedures. Moreover, an illustrative analysis of the meaning of particular parameters is shown, followed by the effects resulting from possible modifications with respect to their primarily assigned optimal values. The proposed algorithm does not demand strict assumptions regarding the desired number of clusters, which allows the obtained number to be better suited to a real data structure. Moreover, a feature specific to it is the possibility to influence the proportion between the number of clusters in areas where data elements are dense as opposed to their sparse regions. Finally, the algorithm-by the detection of oneelement clusters-allows identifying atypical elements, which enables their elimination or possible designation to bigger clusters, thus increasing the homogeneity of the data set.
5
Content available remote

Hard and soft sub-time-optimal controllers for a mechanical system with uncertain mass

59%
Kulczycki P., Wisniewski R., Kowalski P., Krawiec K.
Control and Cybernetics
|
2004
|
tom 33
|
nr 4
573-587
6
Content available remote

On the application of statistical kernel estimators for the demand-based design of a wireless data transmission system

58%
Kulczycki P., Waglowski J.
Control and Cybernetics
|
2005
|
tom 34
|
nr 4
1149-1167
7
Content available remote

An algorithm for Bayes parameter identification with quadratic asymmetrical loss function

51%
Kulczycki P., Mazgaj A.
Control and Cybernetics
|
2005
|
tom 34
|
nr 4
1127-1148
8
Content available remote

Book review: "Medical Image Understanding Technology" by R. Tadeusiewicz, M.R. Ogiela

51%
Hryniewicz O., Kulczycki P.
Control and Cybernetics
|
2004
|
tom 33
|
nr 3
525-526
9
Content available remote

Euler-Poincaré reduction of externally forced rigid body motion

44%
Wiśniewski R., Kulczycki P.
Control and Cybernetics
|
2004
|
tom 33
|
nr 2
297-310
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.