Please use this identifier to cite or link to this item: https://rfos.fon.bg.ac.rs/handle/123456789/1633
Full metadata record
DC FieldValueLanguage
dc.creatorMilošević, Pavle
dc.creatorPetrović, Bratislav
dc.creatorJeremić, Veljko
dc.date.accessioned2023-05-12T11:06:16Z-
dc.date.available2023-05-12T11:06:16Z-
dc.date.issued2017
dc.identifier.issn0957-4174
dc.identifier.urihttps://rfos.fon.bg.ac.rs/handle/123456789/1633-
dc.description.abstractThe purpose of this paper is to introduce a novel similarity measure of intuitionistic fuzzy sets (IFSs). The proposed measure is based on the equivalence relation in the IFS-IBA approach. Due to the logic based background, this measure compares IFS from a different viewpoint than the standard measures, emphasizing comprehension of intuitionism. The IFS-IBA similarity measure has a solid mathematical background and can be combined with various IF aggregation operators. Additionally, we define IFS-IBA distance function as a complement of IFS-IBA similarity. Both IFS-IBA similarity and distance functions may have different realizations that are easy to interpret. Hence, the measures are offering great descriptive power and the ability to model various problems. The benefits of the proposed measure are illustrated on the problem of pattern recognition and classification within k-NN algorithm. Finally, we show that the proposed measure is appropriate for IF hierarchical clustering on the problem of clustering Serbian medium-sized companies according to their financial ratios. Results obtained using the IFS -IBA measure are clear-cut and more meaningful compared to a standard IF distances regardless of the I-fuzzification method used.en
dc.publisherPergamon-Elsevier Science Ltd, Oxford
dc.rightsrestrictedAccess
dc.sourceExpert Systems with Applications
dc.subjectSimilarity measureen
dc.subjectIntuitionistic fuzzy setsen
dc.subjectInterpolative Boolean algebraen
dc.subjectIFS-IBA approachen
dc.subjectClusteringen
dc.subjectClassificationen
dc.titleIFS-IBA similarity measure in machine learning algorithmsen
dc.typearticle
dc.rights.licenseARR
dc.citation.epage305
dc.citation.other89: 296-305
dc.citation.rankaM21
dc.citation.spage296
dc.citation.volume89
dc.identifier.doi10.1016/j.eswa.2017.07.048
dc.identifier.rcubconv_1962
dc.identifier.scopus2-s2.0-85026648469
dc.identifier.wos000411420200024
dc.type.versionpublishedVersion
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairetypearticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:Radovi istraživača / Researchers’ publications
Show simple item record

SCOPUSTM   
Citations

22
checked on Nov 17, 2025

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.