Algorithm-KMeans
view release on metacpan or search on metacpan
lib/Algorithm/KMeans.pm view on Meta::CPAN
print OUTPUT "\n";
}
print OUTPUT "\n\n";
}
close OUTPUT;
my $plot;
my $hardcopy_plot;
if (!defined $pause_time) {
$plot = Graphics::GnuplotIF->new( persist => 1 );
$hardcopy_plot = Graphics::GnuplotIF->new();
$hardcopy_plot->gnuplot_cmd('set terminal png', "set output \"clustering_results.png\"");
} else {
$plot = Graphics::GnuplotIF->new();
}
$plot->gnuplot_cmd( "set noclip" );
$plot->gnuplot_cmd( "set pointsize 2" );
my $arg_string = "";
if ($visualization_data_field_width > 2) {
foreach my $i (0..$K-1) {
my $j = $i + 1;
$arg_string .= "\"$temp_file\" index $i using 1:2:3 title \"Cluster $i\" with points lt $j pt $j, ";
lib/Algorithm/KMeans.pm view on Meta::CPAN
cluster1.txt
cluster2.txt
...
...
in the directory in which you execute the module. The number of such files will
equal the number of clusters formed. All such existing files in the directory are
destroyed before any fresh ones are created. Each cluster file contains the symbolic
ID tags of the data samples in that cluster.
The module also leaves in your directory a printable `.png' file that is a point plot
of the different clusters. The name of this file is always C<clustering_results.png>.
Also, as mentioned previously, a call to C<kmeans()> in your own code will return the
clusters and the cluster centers.
=head1 REQUIRED
This module requires the following three modules:
Math::Random
Graphics::GnuplotIF
( run in 1.183 second using v1.01-cache-2.11-cpan-df04353d9ac )