Please use this identifier to cite or link to this item:
|Title:||A string grammar possibilistic-fuzzy C-medians|
|Abstract:||© 2018, Springer-Verlag GmbH Germany, part of Springer Nature. In the context of syntactic pattern recognition, we adopt the fuzzy clustering approach to classify the syntactic pattern. A syntactic pattern can be described using a string grammar. Fuzzy clustering has been shown to have better performance than hard clustering. Previously, to improve the string grammar hard C-means, we introduced a string grammar fuzzy C-medians and string grammar fuzzy-possibilistic C-medians algorithm. However, both algorithms have their own problem. Thus, in this paper, we develop a string grammar possibilistic-fuzzy C-medians algorithm. The experiments on four real data sets show that string grammar possibilistic-fuzzy C-medians has better performance than string grammar hard C-means, string grammar fuzzy C-medians, and string grammar fuzzy-possibilistic C-medians. We claim that the proposed string grammar possibilistic-fuzzy C-medians is better than the other string grammar clustering algorithms.|
|Appears in Collections:||CMUL: Journal Articles|
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.