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ę ""Analiza danych"" wg kryterium: Wszystkie pola


Wyświetlanie 1-5 z 5
Tytuł:
Linguistically defined clustering of data
Autorzy:
Leski, J. M.
Kotas, M. P.
Powiązania:
https://bibliotekanauki.pl/articles/329995.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
data clustering
possibility theory
linguistic rules
data analysis
grupowanie danych
teoria możliwości
analiza danych
Opis:
This paper introduces a method of data clustering that is based on linguistically specified rules, similar to those applied by a human visually fulfilling a task. The method endeavors to follow these remarkable capabilities of intelligent beings. Even for most complicated data patterns a human is capable of accomplishing the clustering process using relatively simple rules. His/her way of clustering is a sequential search for new structures in the data and new prototypes with the use of the following linguistic rule: search for prototypes in regions of extremely high data densities and immensely far from the previously found ones. Then, after this search has been completed, the respective data have to be assigned to any of the clusters whose nuclei (prototypes) have been found. A human again uses a simple linguistic rule: data from regions with similar densities, which are located exceedingly close to each other, should belong to the same cluster. The goal of this work is to prove experimentally that such simple linguistic rules can result in a clustering method that is competitive with the most effective methods known from the literature on the subject. A linguistic formulation of a validity index for determination of the number of clusters is also presented. Finally, an extensive experimental analysis of benchmark datasets is performed to demonstrate the validity of the clustering approach introduced. Its competitiveness with the state-of-the-art solutions is also shown.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 545-557
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Relative Sets and Rough Sets
Autorzy:
Mousavi, A.
Jabedar-Maralani, P.
Powiązania:
https://bibliotekanauki.pl/articles/908368.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
teoria mnogości
analiza danych
przedstawienie wiedzy
rough sets
set theory
data analysis
multi-valued logic
interval sets
knowledge representation
Opis:
In this paper, by defining a pair of classical sets as a relative set, an extension of the classical set algebra which is a counterpart of Belnap's four-valued logic is achieved. Every relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap's logic. Like truth-values of Belnap's logic, relative sets have two orderings; one is an order of inclusion and the other is an order of knowledge or information. By defining a rough set as a pair of definable sets, an integrated approach to relative sets and rough sets is obtained. With this definition, we are able to define an approximation of a rough set in an approximation space, and so we can obtain sequential approximations of a set, which is a good model of communication among agents.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 637-653
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A container ship traffic model for simulation studies
Autorzy:
Wawrzyniak, Jakub
Drozdowski, Maciej
Sanlaville, Éric
Powiązania:
https://bibliotekanauki.pl/articles/2172133.pdf
Data publikacji:
2022
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
benchmark instances
algorithm evaluation
data analysis
container ship
traffic modeling
marine logistics
instancje wzorcowe
ocena algorytmu
analiza danych
kontenerowiec
modelowanie ruchu
logistyka morska
Opis:
The aim of this paper is to develop a container ship traffic model for port simulation studies. Such a model is essential for terminal design analyses and testing the performance of optimization algorithms. This kind of studies requires accurate information about the ship stream to build test scenarios and benchmark instances. A statistical model of ship traffic is developed on the basis of container ship arrivals in eight world ports. The model provides three parameters of the arriving ships: ship size, arrival time and service time. The stream of ships is divided into classes according to vessel sizes. For each class, service time distributions and mixes of return time distributions are provided. A model of aperiodic arrivals is also proposed. Moreover, the results achieved are used to compare port specific features.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2022, 32, 4; 537--552
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A complete gradient clustering algorithm formed with kernel estimators
Autorzy:
Kulczycki, P.
Charytanowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/907781.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
analiza danych
eksploracja danych
grupowanie
metoda statystyczna
estymacja jądrowa
obliczenia numeryczne
data analysis
data mining
clustering
gradient procedures
nonparametric statistical methods
kernel estimators
numerical calculations
Opis:
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 one-element clusters-allows identifying atypical elements, which enables their elimination or possible designation to bigger clusters, thus increasing the homogeneity of the data set.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2010, 20, 1; 123-134
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
Autorzy:
Błaszczyk, J.
Karbowski, A.
Malinowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/929795.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja dynamiczna
programowanie kwadratowe sekwencyjne
różniczkowanie automatyczne
obliczenia numeryczne
analiza danych
dynamic optimization
large-scale optimization
sequential quadratic programming
nonlinear interior-point methods
object-oriented numerical computations
automatic differentiation
performance data analysis
Opis:
The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    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