PL
 |
EN
Ten serwis zostanie wyłączony 2025-02-11.
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 7

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  fuzzy cluster
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available A Method for Estimating the Least Number of Objects in Fuzzy Clusters
100%
Viattchenin D. A. , Yaroma A.
International Journal of Electronics and Telecommunications
|
2017
|
tom Vol. 63, No. 4
341--346
EN
The theoretical note deals with the problem of estimation of the value of the least number of objects in fuzzy clusters for following detection of the optimal number of objects in fuzzy clusters through heuristic possibilistic clustering. A technique for detecting the optimal maximal number of elements in the a priori unknown number of fuzzy clusters of the sought clustering structure is reminded and a procedure for finding the initial minimal value of the number of objects in fuzzy clusters is proposed. Numerical examples are considered and conclusions are formulated.
2
Content available Extracting fuzzy classifications rules from three - way data
88%
Kacprzyk J. , Owsinski J. W. , Viattchenin D. A.
Journal of Automation Mobile Robotics and Intelligent Systems
|
2014
|
tom Vol. 8, No. 2
47--57
EN
The paper deals in the conceptual way with the problem of extracting fuzzy classification rules from the three-way data meant in the sense of Sato and Sato [7]. A novel technique based on a heuristic method of possibilistic clustering is proposed. A description of basic concepts of a heuristic method of possibilistic clustering based on concept of an allotment is provided. A preprocessing technique for three-way data is shown. An extended method of constructing fuzzy classification rules based on clustering results is proposed. An illustrative example of the method’s application to the Sato and Sato’s data [7] is provided. An analysis of the experimental results obtained with some conclusions are given.
3
Content available A new heuristic possibilistic clustering algorithm for feature selection
88%
Kacprzyk J. , Owsinski J. W. , Viattchenin D. A.
Journal of Automation Mobile Robotics and Intelligent Systems
|
2014
|
tom Vol. 8, No. 2
40--46
EN
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.
4
Content available Automatic generation of fuzzy inference systems using heuristic possibilistic clustering
88%
Viattchenin D. A.
|
2010
|
tom Vol. 4, No. 3
36-44
EN
The interpretability and flexibility of fuzzy classification rules make them a popular basis for fuzzy controllers. Fuzzy control methods constitute a part of the areas of automation and robotics. The paper deals with the method of extracting fuzzy classification rules based on a heuristic method of possibilistic clustering. The description of basic concepts of the heuristic method of possibilistic clustering based on the allotment concept is provided. A general plan of the D-AFC(c)-algorithm is also given. A method of constructing and tuning of fuzzy rules based on clustering results is proposed. An illustrative example of the method's application to the Anderson's Iris data is carried out. An analysis of the experimental results is given and preliminary conclusions are formulated.
5
Content available remote Heuristic possibilistic clustering for detecting optimal number of elements in fuzzy clusters
88%
Viattchenin D. A.
Foundations of Computing and Decision Sciences
|
2016
|
tom Vol. 41, No. 1
45--76
EN
The paper deals with the problem of discovering fuzzy clusters with optimal number of elements in heuristic possibilistic clustering. The relational clustering procedure using a parameter that controls cluster sizes is considered and a technique for detecting the optimal number of elements in fuzzy clusters is proposed. The effectiveness of the proposed technique is illustrated through numerical examples. Experimental results are discussed and some preliminary conclusions are formulated.
6
Content available remote A new heuristic algorithm of fuzzy clustering
63%
Viattchenin D. A.
Control and Cybernetics
|
2004
|
tom Vol. 33, no 2
323-340
EN
This paper deals with a new method of fuzzy clustering. The basic concepts of the method are introduced as resulting from the consideration of the fundamental fuzzy clustering problem. The paper provides the description of the general plan of the algorithm and an illustrative example. An analysis of the experimental results of the method's application to the Anderson's Iris data is carried out. Some preliminary conclusions and the ways of prospective investigations are given.
7
Content available A direct algorithm of possibilistic clustering with partial supervision
63%
Viattchenin D.
|
2007
|
tom Vol. 1, No. 3
29-38
EN
Fuzzy clustering plays an important role in intelligent systems design and the respective methods constitute a part of the areas of automation and robotics. This paper describes a modification of a direct algorithm of possibilistic clustering that takes into account the information coming from the labeled objects. The clustering method based on the concept of allotment among fuzzy clusters is the basis of the new algorithm. The paper provides the description of basic ideas of the method and the plan of the basic version of a direct possibilistic-clustering algorithm. A plan of modification of the direct possibilistic-clustering algorithm in the presence of information from labeled objects is proposed. An illustrative example of the method's application to the Sneath and Sokal's two-dimensional data in comparison with the Gaussian-clustering method is carried out. Preliminary conclusions are formulated.
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ć.