Skip to main content
Cross Validated

Return to Answer

Merge of two posts.
Source Link
user88
user88

I think it is possible to introduce the new set of data periodically by assigning its initial value with the interpolated value of its neighbor while the possible set of neighbor for each new data point could be the points in the triangle that data point resides in.

I think what is more important is the order of assigning the initial values for this set of data point since the data point that is closer to CSO will be updated first. To determine the closeness of data point to CSO, we can use Euclidean distance, weighted link or both.

Note: something to think about

  1. Data point that lie outside the contour of current data set.

  2. The number of update recurring. The data point tends to converge to CSO as the number of update increases. This can cause saturation problem. To solve this problem, subsidizing current data points or levitating new data points is necessary.

I think it is possible to introduce the new set of data periodically by assigning its initial value with the interpolated value of its neighbor while the possible set of neighbor for each new data point could be the points in the triangle that data point resides in.

I think what is more important is the order of assigning the initial values for this set of data point since the data point that is closer to CSO will be updated first. To determine the closeness of data point to CSO, we can use Euclidean distance, weighted link or both.

I think it is possible to introduce the new set of data periodically by assigning its initial value with the interpolated value of its neighbor while the possible set of neighbor for each new data point could be the points in the triangle that data point resides in.

I think what is more important is the order of assigning the initial values for this set of data point since the data point that is closer to CSO will be updated first. To determine the closeness of data point to CSO, we can use Euclidean distance, weighted link or both.

Note: something to think about

  1. Data point that lie outside the contour of current data set.

  2. The number of update recurring. The data point tends to converge to CSO as the number of update increases. This can cause saturation problem. To solve this problem, subsidizing current data points or levitating new data points is necessary.

Post Migrated Here from math.stackexchange.com (revisions)
Source Link
Phichet
Phichet

I think it is possible to introduce the new set of data periodically by assigning its initial value with the interpolated value of its neighbor while the possible set of neighbor for each new data point could be the points in the triangle that data point resides in.

I think what is more important is the order of assigning the initial values for this set of data point since the data point that is closer to CSO will be updated first. To determine the closeness of data point to CSO, we can use Euclidean distance, weighted link or both.