International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 107 - Issue 18 |
Published: December 2014 |
Authors: Dmitri A. Viattchenin, Aliaksandr Yaroma, Aliaksandr Damaratski |
![]() |
Dmitri A. Viattchenin, Aliaksandr Yaroma, Aliaksandr Damaratski . A Novel Direct Relational Heuristic Algorithm of Possibilistic Clustering. International Journal of Computer Applications. 107, 18 (December 2014), 15-21. DOI=10.5120/18850-0381
@article{ 10.5120/18850-0381, author = { Dmitri A. Viattchenin,Aliaksandr Yaroma,Aliaksandr Damaratski }, title = { A Novel Direct Relational Heuristic Algorithm of Possibilistic Clustering }, journal = { International Journal of Computer Applications }, year = { 2014 }, volume = { 107 }, number = { 18 }, pages = { 15-21 }, doi = { 10.5120/18850-0381 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2014 %A Dmitri A. Viattchenin %A Aliaksandr Yaroma %A Aliaksandr Damaratski %T A Novel Direct Relational Heuristic Algorithm of Possibilistic Clustering%T %J International Journal of Computer Applications %V 107 %N 18 %P 15-21 %R 10.5120/18850-0381 %I Foundation of Computer Science (FCS), NY, USA
The paper deals with the problem of a heuristic approach to possibilistic clustering. The approach is based on the concept of allotment among fuzzy clusters. The paper provides the description of basic definitions of the heuristic approach to possibilistic clustering. A new parameter for algorithms is introduced and a new relational algorithm for unknown number of fuzzy clusters is proposed. An illustrative example of application of the proposed algorithm to Tamura's portrait data set is considered. Preliminary conclusions are formulated.