/usr/share/octave/site/m/vlfeat/toolbox/kmeans/vl_hikmeans.m is in octave-vlfeat 0.9.17+dfsg0-6build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 | function [tree,asgn] = vl_hikmeans(data,K,nleaves)
% VL_HIKMEANS Hierachical integer K-means
% [TREE,ASGN] = VL_HIKMEANS(DATA,K,NLEAVES) applies recursive integer
% K-menas to cluster the data DATA, returing a structure TREE
% representing the clusters and a vector ASGN with the data to
% cluster assignments. The depth of the recursive partition is
% computed so that at least NLEAVES are generated.
%
% VL_HIKMEANS() is built on top of VL_IKMEANS() and requires the data to
% be of class UINT8.
%
% TREE is a structure representing the hierarchical clusters. Each
% node of the tree is also a structure with fields:
%
% DEPTH::
% Depth of the tree (only at the root node)
%
% CENTERS::
% K cluster centers
%
% SUB::
% Array of K node structures representing subtrees
% (this field is missing at leaves).
%
% ASGN is a matrix with one column per datum and height equal to the
% depth of the tree. Each column encodes the branch of the tree that
% correspond to each datum.
%
% Example::
% ASGN(:,7) = [1 5 3] means that the tree as depth equal to 3 and
% that the datum X(:,7) corresponds to the branch
% ROOT->SUB(1)->SUB(5)->SUB(3).
%
% See also: VL_HIKMEANSPUSH(), VL_HIKMEANSHIST(), VL_IKMEANS(), VL_HELP().
% Copyright (C) 2007-12 Andrea Vedaldi and Brian Fulkerson.
% All rights reserved.
%
% This file is part of the VLFeat library and is made available under
% the terms of the BSD license (see the COPYING file).
|