Localized Ambient Solidity Separation Algorithm Based Computer User Segmentation

Abstract EN

Most of popular clustering methods typically have some strong assumptions of the dataset.

For example, the k -means implicitly assumes that all clusters come from spherical Gaussian distributions which have different means but the same covariance.

However, when dealing with datasets that have diverse distribution shapes or high dimensionality, these assumptions might not be valid anymore.

In order to overcome this weakness, we proposed a new clustering algorithm named localized ambient solidity separation (LASS) algorithm, using a new isolation criterion called centroid distance.

Compared with other density based isolation criteria, our proposed centroid distance isolation criterion addresses the problem caused by high dimensionality and varying density.

The experiment on a designed two-dimensional benchmark dataset shows that our proposed LASS algorithm not only inherits the advantage of the original dissimilarity increments clustering method to separate naturally isolated clusters but also can identify the clusters which are adjacent, overlapping, and under background noise.

Finally, we compared our LASS algorithm with the dissimilarity increments clustering method on a massive computer user dataset with over two million records that contains demographic and behaviors information.

The results show that LASS algorithm works extremely well on this computer user dataset and can gain more knowledge from it.