Recommendations
Mean shift: An information theoretic perspective
This paper develops a new understanding of mean shift algorithms from an information theoretic perspective. We show that the Gaussian blurring mean shift (GBMS) directly minimizes the Renyi's quadratic entropy of the dataset and hence is unstable by ...
Shift rostering using decomposition: assign weekend shifts first
This paper introduces a shift rostering problem that surprisingly has not been studied in the literature: the weekend shift rostering problem. It is motivated by our experience that employees' shift preferences predominantly focus on the weekends, since ...
On convergence of epanechnikov mean shift
AAAI'18/IAAI'18/EAAI'18: Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial IntelligenceEpanechnikov Mean Shift is a simple yet empirically very effective algorithm for clustering. It localizes the centroids of data clusters via estimating modes of the probability distribution that generates the data points, using the 'optimal' Epanechnikov ...
Comments