Automatic subspace clustering of high dimensional data for data mining applications
US6003029A · kind A · utility
197Cited by
9References
32Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 22, 1997 |
| Grant date | Dec 14, 1999 |
| Priority date | — |
| Expiry date | Aug 22, 2017 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99937
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.