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提供或認可的金融、投資、交易或其他類型的意見或建議。請在使用條款閱讀更多資訊。

想使用這個腳本庫嗎?

複製以下行並將其黏貼到您的腳本中。