Improved algorithm of cluster analysis with the application of potential codes
Keywords:
cluster analysis, potential codes, method of dynamic kernelsAbstract
There had been suggested the algorithm for clusterization of large size of data sample, the description of which can be presented in different features spaces, with the application of potential codes. Its derivation is based on the idea of cluster analysis according to method of dynamic kernels. An algorithm foresees preliminary determination of clusters centres and the formation of kernels from a few selective points, with further forming of complete cluster by the search of kernels set and attributing to them the sample vectors in a way, which allows to get clusters minimizing the criterion of fitting of distances and their grades between the points of space. An algorithm is tested on a standard iris data file.Downloads
-
PDF (Українська)
Downloads: 100
Abstract views: 97
Published
2010-11-12
How to Cite
[1]
M. M. Bykov, D. Y. Balkhovskyi, and A. Raimi, “Improved algorithm of cluster analysis with the application of potential codes”, Вісник ВПІ, no. 6, pp. 198–201, Nov. 2010.
Issue
Section
Information technologies and computer sciences
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
