Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add gmm unique clusters initialization #65

Merged
merged 3 commits into from
Jul 30, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
39 changes: 27 additions & 12 deletions src/localsearch/gmm.jl
Original file line number Diff line number Diff line change
Expand Up @@ -111,6 +111,23 @@ function GMMResult(n::Integer, clusters::AbstractVector{<:AbstractVector{<:Real}
return result
end

function initialize!(result::GMMResult, data::AbstractMatrix{<:Real}, indices::AbstractVector{<:Integer}; verbose::Bool = false)
n, d = size(data)
k = length(indices)

for i in 1:k
for j in 1:d
result.clusters[i][j] = data[indices[i], j]
end
end

if verbose
print_initial_clusters(indices)
end

return nothing
end

function estimate_gaussian_parameters(
gmm::GMM,
data::AbstractMatrix{<:Real},
Expand Down Expand Up @@ -373,15 +390,7 @@ function fit(gmm::GMM, data::AbstractMatrix{<:Real}, initial_clusters::AbstractV
@assert k > 0
@assert n >= k

for i in 1:k
for j in 1:d
result.clusters[i][j] = data[initial_clusters[i], j]
end
end

if gmm.verbose
print_initial_clusters(initial_clusters)
end
initialize!(result, data, initial_clusters, verbose = gmm.verbose)

fit!(gmm, data, result)

Expand Down Expand Up @@ -418,13 +427,19 @@ result = fit(gmm, data, k)
function fit(gmm::GMM, data::AbstractMatrix{<:Real}, k::Integer)::GMMResult
n, d = size(data)

result = GMMResult(d, n, k)
if n == 0
return GMMResult(d, n, k)
return result
end

@assert d > 0
@assert k > 0
@assert n >= k

initial_clusters = StatsBase.sample(gmm.rng, 1:n, k, replace = false)
return fit(gmm, data, initial_clusters)
unique_data, indices = sample_unique_data(gmm.rng, data, k)
initialize!(result, unique_data, indices, verbose = gmm.verbose)

fit!(gmm, data, result)

return result
end
31 changes: 22 additions & 9 deletions src/localsearch/kmedoids.jl
Original file line number Diff line number Diff line change
Expand Up @@ -90,6 +90,20 @@ function KmedoidsResult(n::Integer, clusters::AbstractVector{<:Integer})
return result
end

function initialize!(result::KmedoidsResult, indices::AbstractVector{<:Integer}; verbose::Bool = false)
k = length(indices)

for i in 1:k
result.clusters[i] = indices[i]
end

if verbose
print_initial_clusters(indices)
end

return nothing
end

@doc """
fit!(
kmedoids::Kmedoids,
Expand Down Expand Up @@ -241,13 +255,7 @@ function fit(kmedoids::Kmedoids, distances::AbstractMatrix{<:Real}, initial_clus
@assert k > 0
@assert n >= k

for i in 1:k
result.clusters[i] = initial_clusters[i]
end

if kmedoids.verbose
print_initial_clusters(initial_clusters)
end
initialize!(result, initial_clusters, verbose = kmedoids.verbose)

fit!(kmedoids, distances, result)

Expand Down Expand Up @@ -285,13 +293,18 @@ result = fit(kmedoids, distances, k)
function fit(kmedoids::Kmedoids, distances::AbstractMatrix{<:Real}, k::Integer)::KmedoidsResult
n = size(distances, 1)

result = KmedoidsResult(n, k)
if n == 0
return KmedoidsResult(n, k)
return result
end

@assert k > 0
@assert n >= k

initial_clusters = StatsBase.sample(kmedoids.rng, 1:n, k, replace = false)
return fit(kmedoids, distances, initial_clusters)
initialize!(result, initial_clusters, verbose = kmedoids.verbose)

fit!(kmedoids, distances, result)

return result
end
5 changes: 3 additions & 2 deletions src/localsearch/ksegmentation.jl
Original file line number Diff line number Diff line change
Expand Up @@ -88,11 +88,12 @@ end
function fit(ksegmentation::Ksegmentation, data::AbstractMatrix{<:Real}, k::Integer)::KsegmentationResult
n, d = size(data)

result = KsegmentationResult(d, n, k)
if n == 0
return KsegmentationResult(d, n, k)
return result
end

result = KsegmentationResult(d, n, k)
fit!(ksegmentation, data, result)

return result
end
Loading