Microsoft Technology Licensing, LLC

David Dyckman

Inbal Sagiv

Systems and methods are provided for implementing large-scale density-based clustering functionalities. In examples, a system selects, for a dataset (which may be sampled at 100% or less), an upper bound value and a lower bound value of a neighborhood radius parameter of a density-based clustering algorithm. The system identifies, using a modified ternary search algorithm, an optimal neighborhood radius parameter value, based on the upper and lower bound values, outputs the optimal neighborhood radius parameter value and/or a corresponding optimal number of clusters within the dataset. The modified ternary search algorithm leverages the near-unimodality of the neighborhood radius parameter, while selection of the upper bound value leverages a characteristic in which the neighborhood radius parameter value increases as the sampling rate decreases, and selection of the lower bound value uses ternary search that takes the number of clusters as a parameter instead of the neighborhood radius parameter.

Growing community of inventors

Bet Shemesh, Israel

David Dyckman