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.
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.
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.
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.
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
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ć.