ex5_treecluster

这是一个关于c-cluster的技术文章,它详细地介绍了cluster的一些技术分类及算法等,是学习聚类的入门好教程.

#!/usr/perl/perl580/bin/perl 

use Algorithm::Cluster;

$|++;

$^W = 1;
use strict;

my $weight =  [ 1,1 ];

my $data =  [

	[ 1.1, 1.2 ],
	[ 1.4, 1.3 ],
	[ 1.1, 1.5 ],
	[ 2.0, 1.5 ],
	[ 1.7, 1.9 ],
	[ 1.7, 1.9 ],
	[ 5.7, 5.9 ],
	[ 5.7, 5.9 ],
	[ 3.1, 3.3 ],
	[ 5.4, 5.3 ],
	[ 5.1, 5.5 ],
	[ 5.0, 5.5 ],
	[ 5.1, 5.2 ],
];

my $mask =  [

	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
	[ 1, 1 ],
];

print "--------------[pairwise average linkage]-------\n";

my %params = (

	transpose  =>         0,
	method     =>       'a',
	dist       =>       'e',
	data       =>     $data,
	mask       =>     $mask,
	weight     =>   $weight,
);

my ($result, $linkdist);
my ($i,$j);

($result, $linkdist) = Algorithm::Cluster::treecluster(%params);

$i=0;
foreach(@{$result}) {
	printf("%3d: %3d %3d %7.3f\n",-1-$i,$_->[0],$_->[1],$linkdist->[$i]);
	++$i;
}

print "--------------[pairwise single linkage]-------\n";
$params{method} = 's';

($result, $linkdist) = Algorithm::Cluster::treecluster(%params);

$i=0;
foreach(@{$result}) {
	printf("%3d: %3d %3d %7.3f\n",-1-$i,$_->[0],$_->[1],$linkdist->[$i]);
	++$i;
}

print "--------------[pairwise centroid linkage]-------\n";
$params{method} = 'c';

($result, $linkdist) = Algorithm::Cluster::treecluster(%params);

$i=0;
foreach(@{$result}) {
	printf("%3d: %3d %3d %7.3f\n",-1-$i,$_->[0],$_->[1],$linkdist->[$i]);
	++$i;
}

print "--------------[pairwise maximum linkage]-------\n";
$params{method} = 'm';

($result, $linkdist) = Algorithm::Cluster::treecluster(%params);

$i=0;
foreach(@{$result}) {
	printf("%3d: %3d %3d %7.3f\n",-1-$i,$_->[0],$_->[1],$linkdist->[$i]);
	++$i;
}


__END__