Back to results
US 2003/0158853 A1Published application
Efficient recursive clustering based on a splitting function derived from successive eigen-decompostions
AssigneeIBM Corporation
InventorsUpendra V. Chaudhari, Jiri Navratil, Ganesh N. Ramaswamy
Life of this patent
Estimating the term…
Abstract
Methods and arrangements for facilitating data clustering. From a set of input data, a predetermined number of non-overlapping subsets are created. The input data is split recursively to create the subsets.
Claims21
An apparatus for facilitating data clustering, said apparatus comprising:
- an arrangement for obtaining input data;
- and
- an arrangement for creating a predetermined number of non-overlapping subsets of the input data;
- said arrangement for creating a predetermined number of non-overlapping subsets being adapted to split the input data recursively.
1 more element
A method of facilitating data clustering, said method comprising the steps of:
- obtaining input data;
- and
- creating a predetermined number of non-overlapping subsets of the input data;
- step of creating a predetermined number of non-overlapping subsets comprising splitting the input data recursively.
1 more element
A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for facilitating data clustering, said method comprising the steps of:
- obtaining input data;
- and
- creating a predetermined number of non-overlapping subsets of the input data;
- step of creating a predetermined number of non-overlapping subsets comprising splitting the input data recursively.
1 more element
Dependencies are inferred from the claim text.