Mercurial > hg > octave-jordi
view scripts/statistics/base/cut.m @ 7016:93c65f2a5668
[project @ 2007-10-12 06:40:56 by jwe]
author | jwe |
---|---|
date | Fri, 12 Oct 2007 06:41:26 +0000 |
parents | 34f96dd5441b |
children | a1dbe9d80eee |
line wrap: on
line source
## Copyright (C) 1996, 1997 Kurt Hornik ## ## This file is part of Octave. ## ## Octave is free software; you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 3 of the License, or (at ## your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <http://www.gnu.org/licenses/>. ## -*- texinfo -*- ## @deftypefn {Function File} {} cut (@var{x}, @var{breaks}) ## Create categorical data out of numerical or continuous data by ## cutting into intervals. ## ## If @var{breaks} is a scalar, the data is cut into that many ## equal-width intervals. If @var{breaks} is a vector of break points, ## the category has @code{length (@var{breaks}) - 1} groups. ## ## The returned value is a vector of the same size as @var{x} telling ## which group each point in @var{x} belongs to. Groups are labelled ## from 1 to the number of groups; points outside the range of ## @var{breaks} are labelled by @code{NaN}. ## @end deftypefn ## Author: KH <Kurt.Hornik@wu-wien.ac.at> ## Description: Cut data into intervals function group = cut (X, BREAKS) if (nargin != 2) print_usage (); endif if (! isvector (X)) error ("cut: X must be a vector"); endif if isscalar (BREAKS) BREAKS = linspace (min (X), max (X), BREAKS + 1); BREAKS(1) = BREAKS(1) - 1; elseif isvector (BREAKS) BREAKS = sort (BREAKS); else error ("cut: BREAKS must be a scalar or vector"); endif group = NaN * ones (size (X)); m = length (BREAKS); if any (k = find ((X >= min (BREAKS)) & (X <= max (BREAKS)))) n = length (k); group(k) = sum ((ones (m, 1) * reshape (X(k), 1, n)) > (reshape (BREAKS, m, 1) * ones (1, n))); endif endfunction