Explore >> Select a destination


You are here

blog.42yeah.is
| | nurkiewicz.com
12.6 parsecs away

Travel
| | K-means clustering is an algorithm for partitioning data into multiple, non-overlapping buckets. For example, if you have a bunch of points in two-dimensional space, this algorithm can easily find concentrated clusters of points. To be honest, that's quite a simple task for humans. Just plot all the points on a piece of paper and find areas with higher density. For example, most of the points are located on the top-left of the plane, some at the bottom and a few at the centre-right. However, this is not ...
| | chosenperspectives.com
83.7 parsecs away

Travel
| | Visit the post for more.
| | oralytics.com
15.2 parsecs away

Travel
| | With the release of Oracle 12c (finally) now have a lot of learning to do. Oracle 12c is a different beast to what we have been used to up to now. As part of the 12c there are a number of new in-database Advanced Analytics features. These are separate to the Advanced Analytics new features...
| | resources.paperdigest.org
56.2 parsecs away

Travel
| The Conference on Neural Information Processing Systems (NIPS) is one of the top machine learning conferences in the world. Paper Digest Team analyze all papers published on NIPS in the past years, and presents the 15 most influential papers for each year. This ranking list is automatically construc