Temat: heuristic possibilistic clustering - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: A new heuristic possibilistic clustering algorithm for feature selection
Autorzy:: Kacprzyk, J.
Owsinski, J. W.
Viattchenin, D. A.
Powiązania:: https://bibliotekanauki.pl/articles/384599.pdf
Data publikacji:: 2014
Wydawca:: Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:: feature selection
fuzzy correlation measure
possibilistic clustering
heuristic possibilistic clustering
fuzzy cluster
Opis:: The paper deals with the problem of selection of the most informative features. A new effective and efficient heuristic possibilistic clustering algorithm for feature selection is proposed. First, a brief description of basic concepts of the heuristic approach to possibilistic clustering is provided. A technique of initial data preprocessing is described and a fuzzy correlation measure is considered. The new algorithm is described and then illustrated on the well-known Iris data set benchmark and the results obtained are compared with those by using the conventional, well-known and widely employed method of principal component analysis (PCA). Conclusions and suggestions for future research are given.
Źródło:: Journal of Automation Mobile Robotics and Intelligent Systems; 2014, 8, 2; 40-46
1897-8649
2080-2145
Pojawia się w:: Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Reducing the number of paths in a minimized project-network with given bounds on the durations of activities
Autorzy:: Viattchenin, D.
Powiązania:: https://bibliotekanauki.pl/articles/406450.pdf
Data publikacji:: 2015
Wydawca:: Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:: project-network
dominant path
heuristic possibilistic clustering
interval-valued data
stationary clustering structure
typical point
Opis:: This paper deals in a preliminary way with the problem of selecting the smallest possible number of dominant paths in a minimized project-network with given bounds on the permissible values of the durations of activities. For this purpose, a classification technique is proposed. This technique is based on a heuristic possibilistic clustering of interval-valued data. The basic concepts of heuristic possibilistic clustering are defined and methods for preprocessing interval-valued data are described. An illustrative example is considered in detail and some conclusions are formulated.
Źródło:: Operations Research and Decisions; 2015, 25, 4; 71-87
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja