Automatic subspace clustering of high dimensional data for data mining applications
First Claim
Patent Images
1. A method for finding clusters of units in high-dimensional data in a database, the method comprising the steps of:
- determining dense units in selected subspaces within a data space of high-dimensional data in a database;
determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space;
determining maximal regions covering each cluster of connected dense units; and
determining a minimal cover for each cluster of connected dense units.
1 Assignment
0 Petitions
Accused Products
Abstract
A method for finding clusters of units in high-dimensional data having the steps of determining dense units in selected subspaces within a data space of the high-dimensional data, determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space, determining maximal regions covering each cluster of connected dense units, determining a minimal cover for each cluster of connected dense units, and identifying the minimal cover for each cluster of connected dense units.
268 Citations
32 Claims
-
1. A method for finding clusters of units in high-dimensional data in a database, the method comprising the steps of:
-
determining dense units in selected subspaces within a data space of high-dimensional data in a database; determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space; determining maximal regions covering each cluster of connected dense units; and determining a minimal cover for each cluster of connected dense units. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A program storage device comprising:
-
a storage area; and information stored in the storage area, the information being readable by a machine, and tangibly embodying a program of instructions executable by the machine for performing method steps for finding clusters of units in high-dimensional data of a database, the method steps comprising; determining dense units in selected subspaces within a data space of the high-dimensional data of the database; determining each cluster of dense units that are connected to other dense units in the selected subspaces within the data space; determining maximal regions covering each cluster of connected dense units; and determining a minimal cover for each cluster of connected dense units. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32)
-
Specification