Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2013 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) 2013
DOI: 10.1109/fuzz-ieee.2013.6622449
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzy membership functions based on point-to-polygon distance evaluation

Abstract: In this paper, a new approach is presented for the evaluation of membership functions in fuzzy clustering algorithms. Starting from the geometrical representation of clusters by polygons, the fuzzy membership is evaluated through a suited point-to-polygon distance estimation. Three different methods are proposed, either by using the geometrical properties of clusters in the data space or by using Gaussian or coneshaped kernel functions. They differ from the basic trade-off between computational complexity and … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
9
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
6
2

Relationship

4
4

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 20 publications
0
9
0
Order By: Relevance
“…In [24], an early application of this approach has been investigated, considering the Min-Max clustering algorithm with the aim to verify that the proposed MF might be a useful alternative to the Min-Max original one. The results proved that the suggested MF evaluation is worthy and useful when dealing with clustering tasks.…”
Section: The Adopted Membership Functionsmentioning
confidence: 99%
“…In [24], an early application of this approach has been investigated, considering the Min-Max clustering algorithm with the aim to verify that the proposed MF might be a useful alternative to the Min-Max original one. The results proved that the suggested MF evaluation is worthy and useful when dealing with clustering tasks.…”
Section: The Adopted Membership Functionsmentioning
confidence: 99%
“…Classification is a supervised modelling problem that, in many different applications, tries to determine the class of a new observed element by using a set of a priori established class labels [43,44]. Classification generally requires selecting a set of features representing the data, building up a model representing the data space (features space) and the different regions of decision, determining a suited metric for evaluating the similarity/dissimilarity amongst patterns [45].…”
Section: The Dust Classification Approachmentioning
confidence: 99%
“…The proposed classifier establishes a set of fuzzy MFs to associate the patterns of each motion to the corresponding class. The used MFs, based on the geometrical representation of the data and point-to-polygon distance evaluation, have been presented in [34]. These MFs are constructed by taking regular polygons which cover all the patterns of each class and H kernel functions on both the vertices and the centroid of the corresponding polygon.…”
Section: The Proposed Fuzzy Motion Classifiermentioning
confidence: 99%
“…The system utilizes the geometrically unconstrained fuzzy membership functions previously discussed in [34]- [36]. The flexible shape of the membership function can effectively manage the motion class overlapping problem which is aggravated by stroke patients' irregular performance.…”
Section: Introductionmentioning
confidence: 99%