Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

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

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available Center-based l1-clustering method
EN
In this paper, we consider the l1-clustering problem for a finite data-point set which should be partitioned into k disjoint nonempty subsets. In that case, the objective function does not have to be either convex or differentiable, and generally it may have many local or global minima. Therefore, it becomes a complex global optimization problem. A method of searching for a locally optimal solution is proposed in the paper, the convergence of the corresponding iterative process is proved and the corresponding algorithm is given. The method is illustrated by and compared with some other clustering methods, especially with the l2-clustering method, which is also known in the literature as a smooth k-means method, on a few typical situations, such as the presence of outliers among the data and the clustering of incomplete data. Numerical experiments show in this case that the proposed l1-clustering algorithm is faster and gives significantly better results than the l2-clustering algorithm.
PL
W pracy przedstawiono wyniki klasyfikowania sygnałów drgań podłoża, wywołanych ruchem pojazdów o różnej masie I konstrukcji. Analizę przedstawionych wyników obliczeń przeprowadzono w celu wskazania najkorzystniejszej metody grupowania sygnałów, którą można wykorzystać w procesie identyfikowania pojazdu.
EN
This paper presents result of initial calculations of classifying ground vibration signals caused by vehicle movement. Analysis of presented calculations results was performed in order to show the most profitable grouping method, which could be use in process of identification.
3
Content available remote An varepsilon-Insensitive Approach to Fuzzy Clustering
EN
Fuzzy clustering can be helpful in finding natural vague boundaries in data. The fuzzy c-means method is one of the most popular clustering methods based on minimization of a criterion function. However, one of the greatest disadvantages of this method is its sensitivity to the presence of noise and outliers in the data. The present paper introduces a new varepsilon-insensitive Fuzzy C-Means (varepsilonFCM) clustering algorithm. As a special case, this algorithm includes the well-known Fuzzy C-Medians method (FCMED). The performance of the new clustering algorithm is experimentally compared with the Fuzzy C-Means (FCM) method using synthetic data with outliers and heavy-tailed, overlapped groups of the data.
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ć.