Fast clustering with sparse data
US6556958B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 23, 1999 |
| Grant date | Apr 29, 2003 |
| Priority date | — |
| Expiry date | Apr 23, 2019 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY10S707/99942
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Efficient data modeling utilizing sparse representation of a data set. In one embodiment, a computer-implemented method such that a data set is first input. The data set has a plurality of records. Each record has at least one attribute, where each attribute has a default value. The method stores a sparse representation of each record, such that the value of each attribute of the record is stored only if the value of the attribute varies from the default value. A data model is then generated, utilizing the sparse representation, and the model is output. The generation of the data model in one embodiment is in accordance with the Expectation Maximization (EM) algorithm.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.