| |
| ||||||
Clustering algorithm to approximate functionsThis is a discussion on Clustering algorithm to approximate functions within the Analytic News Feeds forums, part of the Analytics category; The strategy is very easy to describe: 1. Divide the domain of your function in k sub intervals. 2. Initialize k monomials; 3. Consider the monomials as centroids of your ... |
![]() |
| | LinkBack | Thread Tools | Search this Thread | Display Modes |
| | #1 |
| Administrator | The strategy is very easy to describe: 1. Divide the domain of your function in k sub intervals. 2. Initialize k monomials; 3. Consider the monomials as centroids of your clustering algorithm. 4. Assign the points of the function to each monomial in compliance to the cluster ago. 5. Use the gradient descent to adjust the parameters of each monomial. 6. Go to 4. until the accuracy is good enough. Read the entire post at:… More blog entries from AnalyticBridge... |
| | |
![]() |
| Bookmarks |
| Thread Tools | Search this Thread |
| Display Modes | |
| |
Similar Threads | ||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Power Real Polynomial to approximate functions: The Gradient Method | admin | Analytic News Feeds | 0 | 9th December 2011 10:16 AM |
| Functions Supervisor | admin | Local SAP Job Listings | 0 | 4th October 2011 10:12 PM |
| O(n) clustering algorithm for very large, unstructured data | admin | Analytic News Feeds | 0 | 31st May 2011 04:19 PM |
| An approximate answer | admin | Analytic News Feeds | 0 | 10th September 2010 11:12 AM |
| The top 5 R functions | admin | Analytic News Feeds | 0 | 10th December 2009 03:40 AM |
| | |
| | |