2007
DOI: 10.1109/fuzzy.2007.4295510
|View full text |Cite
|
Sign up to set email alerts
|

Prototype-less Fuzzy Clustering

Abstract: Abstract-In contrast to standard fuzzy clustering, which optimizes a set of prototypes, one for each cluster, this paper studies fuzzy clustering without prototypes. Starting from an objective function that only involves the distances between data points and the membership degrees of the data points to the different clusters, an iterative update rule is derived. The properties of the resulting algorithm are then examined, especially w.r.t. to schemes that focus on a constrained neighborhood for each data point… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0
3

Year Published

2007
2007
2019
2019

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 19 publications
0
6
0
3
Order By: Relevance
“…Furthermore it may be worthwhile to investigate other neighborhood schemes than those discussed in [7], since they may provide a simple and effective way to lower the computational costs.…”
Section: Discussionmentioning
confidence: 99%
See 4 more Smart Citations
“…Furthermore it may be worthwhile to investigate other neighborhood schemes than those discussed in [7], since they may provide a simple and effective way to lower the computational costs.…”
Section: Discussionmentioning
confidence: 99%
“…The scheme has some relation to the reformulation approach [14], which, if it is used to eliminate the update of the prototype parameters rather than the update of the membership degrees, leads to a similar, but more complex objective function, and to fuzzy k-nearest neighbors algorithms [18], from which one may also derive a candidate update rule for prototype-less fuzzy clustering. However, as discussed in [7], the latter does not lead to useful results, as it tends to equalize the membership degrees.…”
Section: The Basic Algorithmmentioning
confidence: 99%
See 3 more Smart Citations