Hewlett-packard Development Company, L.p.

Liadan O'Callaghan

Rajeev Motwani

Nina Mishra

Sudipto Guha

A technique that uses a weighted divide and conquer approach for clustering a set S of n data points to find k final centers. The technique comprises 1) partitioning the set S into P disjoint pieces S, . . . , S; 2) for each piece S, determining a set Dof k intermediate centers; 3) assigning each data point in each piece Sto the nearest one of the k intermediate centers; 4) weighting each of the k intermediate centers in each set Dby the number of points in the corresponding piece Sassigned to that center; and 5) clustering the weighted intermediate centers together to find said k final centers, the clustering performed using a specific error metric and a clustering method A.

Computer implemented scalable, incremental and parallel clustering based on weighted divide and conquer

A technique that uses a weighted divide and conquer approach for clustering a set S of n data points to find k final centers. The technique comprises 1) partitioning the set S into P disjoint pieces S , . . . , S ; 2) for each piece S , determining a set D of k intermediate centers; 3) assigning each data point in each piece S to the nearest one of the k intermediate centers; 4) weighting each of the k intermediate centers in each set D by the number of points in the corresponding piece S assigned to that center; and 5) clustering the weighted intermediate centers together to find said k final centers, the clustering performed using a specific error metric and a clustering method A.

Growing community of inventors

Mountain View, CA, United States of America

Liadan O'Callaghan