bananas

<code>bananas</code> generates a dataset with two classes separated by a nonlinear boundary.

Various clustering algorithms that produce a credal partition,
i.e., a set of Dempster-Shafer mass functions representing the membership of objects
to clusters. The mass functions quantify the cluster-membership uncertainty of the
objects. The algorithms are: Evidential c-Means, Relational Evidential c-Means,
Constrained Evidential c-Means, Evidential Clustering, Constrained Evidential
Clustering, Evidential K-nearest-neighbor-based Clustering, Bootstrap Model-Based
Evidential Clustering, Belief Peak Evidential Clustering, Neural-Network-based
Evidential Clustering.

Thierry Denoeux

evclust

Evidential Clustering

bananas function

<dl><dt>n</dt>
<dd>Number of observations.</dd>
<dt>r</dt>
<dd>Radius of the two half circles (default: 5).</dd>
<dt>s</dt>
<dd>Standard deviation of noise (default 1).</dd></dl>

Arguments

Author

Generation of "bananas" datasets — bananas

<dl>

<dt>n</dt>
<dd>Number of observations.</dd>


<dt>r</dt>
<dd>Radius of the two half circles (default: 5).</dd>


<dt>s</dt>
<dd>Standard deviation of noise (default 1).</dd>

</dl>

bananas: Generation of "bananas" datasets

Description

Usage

Value

Arguments

Author

Details

References

See Also

Examples