Clusters of polynomials for data points
Номер патента: EP3028139A1
Опубликовано: 08-06-2016
Автор(ы): Amir Globerson, David Lehavi, Roi LIVNI, Sagi Schein, Shai SHALEV-SHWARTZ
Принадлежит: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Опубликовано: 08-06-2016
Автор(ы): Amir Globerson, David Lehavi, Roi LIVNI, Sagi Schein, Shai SHALEV-SHWARTZ
Принадлежит: HEWLETT PACKARD ENTERPRISE DEVELOPMENT LP
Реферат: A method, system and storage device are generally directed to determining for each of a plurality of data points, a neighborhood of data points about each such data point. For each such neighborhood of data points, a projection set of polynomials is generated based on candidate polynomials. The projection set of polynomials evaluated on the neighborhood of data points is subtracted from the plurality of candidate polynomials evaluated on the neighborhood of data points to generate a subtraction matrix of evaluated resulting polynomials. The singular value decomposition of the subtraction matrix is then computed. The resulting polynomials are clustered into multiple clusters and then partitioned based on a threshold.
Clusters of polynomials for data points
Номер патента: WO2015016854A1. Автор: David Lehavi,Shai SHALEV-SHWARTZ,Sagi Schein,Amir Globerson,Roi LIVNI. Владелец: Hewlett-Packard Development Company, L.P.. Дата публикации: 2015-02-05.