Base.axesMethod
axes(a::AbstractClusteringDifference[, d])

Access the feature and instance identifiers differences. Optionally, specify dimension d to get the identifier difference of that dimension only.

Base.axesMethod
axes(a::AbstractClustering[, d])

Access the feature and instance identifiers. Optionally, specify dimension d to get the identifiers of that dimension only.

Base.instancesMethod
instances(a::AbstractClusteringDifference)

Access the instance identifiers difference.

Base.instancesMethod
instances(a::AbstractClustering)

Access the instance identifiers.

ClusteringDifferences.backwarddiffFunction
backwarddiff(a::AbstractVector{<:AbstractClustering}, i::Int[, h::Int=1])

Compute the backward difference of the clustering at index i with step size h.

ClusteringDifferences.forwarddiffFunction
forwarddiff(a::AbstractVector{<:AbstractClustering}, i::Int[, h::Int=1])

Compute the forward difference of the clustering at index i with step size h.

ClusteringDifferences.kmeansMethod
kmeans(X::AbstractMatrix{<:Real}, r::AbstractVector{Int},
    c::AbstractVector{Int}, μ::AbstractMatrix{<:Real}; <keyword arguments>)

Cluster the data X with the $k$-means algorithm.

Keyword arguments

  • maxiter::Int=256: the number of maximum iterations.
  • dist::SemiMetric=SqEuclidean(): the distance function.
  • ϵ::AbstractFloat=1.0e-6: the absolute tolerance for convergence.
ClusteringDifferences.kmeansMethod
kmeans(X::AbstractMatrix{<:Real}, μ::AbstractMatrix{<:Real}; <keyword arguments>)

Like kmeans, but automatically generate r and c according to the size of X.