A Data Science Central Community
The main focus of this article is on computing the point that minimizes the sum of the "distances" to n points in a d-dimensional space, called centroid or center, in the presence of outliers.
This long article has several sections.
Content
1. A related physics problem
2. Algorithm to find the centroid
3. Examples and results
4. Convergence of the algorithm
5. Interesting Contour Maps
A lot of material is presented in this article, and chances are that you will find something interesting for you, for instance about
The picture below is from the article.
Click here to read the article.
Top DSC Resources
Follow us on Twitter: @DataScienceCtrl | @AnalyticBridge
© 2021 TechTarget, Inc.
Powered by
Badges | Report an Issue | Privacy Policy | Terms of Service
Most Popular Content on DSC
To not miss this type of content in the future, subscribe to our newsletter.
Other popular resources
Archives: 2008-2014 | 2015-2016 | 2017-2019 | Book 1 | Book 2 | More
Most popular articles
You need to be a member of AnalyticBridge to add comments!
Join AnalyticBridge