RicardoSantos

SignalProcessingClusteringKMeans

Library "SignalProcessingClusteringKMeans"
K-Means Clustering Method.

nearest(point_x, point_y, centers_x, centers_y) finds the nearest center to a point and returns its distance and center index.
Parameters:
  • point_x: float, x coordinate of point.
  • point_y: float, y coordinate of point.
  • centers_x: float array, x coordinates of cluster centers.
  • centers_y: float array, y coordinates of cluster centers.
    @ returns tuple of int, float.


bisection_search(samples, value) Bissection Search
Parameters:
  • samples: float array, weights to compare.
  • value: float array, weights to compare.
Returns: int.

label_points(points_x, points_y, centers_x, centers_y) labels each point index with cluster index and distance.
Parameters:
  • points_x: float array, x coordinates of points.
  • points_y: float array, y coordinates of points.
  • centers_x: float array, x coordinates of points.
  • centers_y: float array, y coordinates of points.
Returns: tuple with int array, float array.

kpp(points_x, points_y, n_clusters) K-Means++ Clustering adapted from Andy Allinger.
Parameters:
  • points_x: float array, x coordinates of the points.
  • points_y: float array, y coordinates of the points.
  • n_clusters: int, number of clusters.
Returns: tuple with 2 arrays, float array, int array.
Pine脚本库

本着真正的TradingView精神,作者将此Pine代码以开源脚本库发布,以便我们社区的其他Pine程序员可以重用它。向作者致敬!您可以私下或在其他开源出版物中使用此库,但在出版物中重用此代码受网站规则约束。

免责声明

这些信息和出版物并不意味着也不构成TradingView提供或认可的金融、投资、交易或其它类型的建议或背书。请在使用条款阅读更多信息。

想使用这个脚本库吗?

复制以下行并将其粘贴到您的脚本中。