BazEkon - The Main Library of the Cracow University of Economics

BazEkon home page

Main menu

Author
Korzeniewski Jerzy (Uniwersytet Łódzki)
Title
Propozycja nowego algorytmu wyznaczającego liczbę skupień
Proposal of New Algorithm for Determining the Number of Clusters
Source
Prace Naukowe Akademii Ekonomicznej we Wrocławiu. Taksonomia (12), 2005, nr 1076, s. 257-264, rys., bibliogr. 2 poz.
Issue title
Klasyfikacja i analiza danych - teoria i zastosowania
Keyword
Algorytmy
Algorithms
Note
summ.
Abstract
W algorytmie prezentowanym w artykule jest wykorzystywana metoda średniego przesunięcia oszacowań maksimów lokalnych funkcji gęstości wektora losowego, zaproponowana przez Comaniciu i Meera. (fragment tekstu)

The new algorithm is based on the comparison of pseudo cumulative distribution functions of a certain random variable. This variable is defined as follows. For a fixed window size we draw k different points and for every point we find the corresponding limiting point in the mean shift procedure. Then we check if the distance (e.g. Euclidean) between every pair of the limiting points is smaller than the window size. The probability of meeting this condition is the value of the pseudo cumulative distribution function at the point equal to the window size. Analogously we determine the pseudo cumulative distribution functions for different numbers k of clusters. The proper number of clusters is the one that corresponds to the last (with respect to k) curve to possess a horizontal phase at the altitude smaller than 1. (original abstract)
Accessibility
The Main Library of the Cracow University of Economics
The Library of Warsaw School of Economics
The Main Library of Poznań University of Economics and Business
Full text
Show
Bibliography
Show
  1. Gordon A.D., Classification, Chapman & Hall 1999.
  2. Comaniciu D., Meer P., Mean Shift Analysis and Applications, IEEE Int. Conf. Computer Vision (ICCV'99), Kerkyra, Greece, 1999, s. 1197-1203.
Cited by
Show
ISSN
0324-8445
1505-9332
Language
pol
Share on Facebook Share on Twitter Share on Google+ Share on Pinterest Share on LinkedIn Wyślij znajomemu