Proceedings of the 8th Conference of the European Society for Fuzzy Logic and Technology 2013
DOI: 10.2991/eusflat.2013.9
|View full text |Cite
|
Sign up to set email alerts
|

Determination of regional variants in the versification of Estonian folksongs using an interpretable fuzzy rule-based classifier

Abstract: In this paper, a method of hierarchical clustering and a selection of fuzzy classification algorithms are applied successively to the data set that contains measured characteristics of folk verses collected from 104 historical parishes of Estonia. The aim of the study is to detect the groups of parishes that are similar in terms of folk verse characteristics and to give us insight into the reasoning that the separation into these groups is based upon. The process of classification separates the initial groups … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
2
2
1

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…A class that is separated from other classes in product space is easy to classify correctly whereas high overlap of classes can make it very difficult to obtain a rule placement that would result in an accurate classifier and typically, such class distributions need to be modeled with increased level of granularity. For this purpose we employ the algorithms of rule granulation and consolidation [10] to obtain the zero-error classifiers on which to verify the performance of compression methods described in Section 4.…”
Section: Preliminary Classifiersmentioning
confidence: 99%
See 3 more Smart Citations
“…A class that is separated from other classes in product space is easy to classify correctly whereas high overlap of classes can make it very difficult to obtain a rule placement that would result in an accurate classifier and typically, such class distributions need to be modeled with increased level of granularity. For this purpose we employ the algorithms of rule granulation and consolidation [10] to obtain the zero-error classifiers on which to verify the performance of compression methods described in Section 4.…”
Section: Preliminary Classifiersmentioning
confidence: 99%
“…This procedure, however, usually creates too many rules the number of which can be substantially reduced by rule base consolidation [10]. During the consolidation, weaker rules (governing few samples) are constantly losing their samples to stronger rules (those governing many samples) and as a natural result, many of the weaker rules become obsolete.…”
Section: Preliminary Classifiersmentioning
confidence: 99%
See 2 more Smart Citations
“…The procedure for reducing the number of rules of classifiers is outlined in [29] and termed rule base consolidation. During the consolidation, weaker rules (governing few samples) are constantly losing their samples to stronger rules (those governing many samples).…”
Section: Rule Consolidationmentioning
confidence: 99%