You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+3-2Lines changed: 3 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -35,16 +35,17 @@ The following table shows the currently supported algorithms. The goal is to ex
35
35
| Supported Algorithms | Python | Scala |
36
36
| :--------------------- | :----: | :---: |
37
37
| CrossValidator | √ ||
38
+
| DBSCAN (*) | √ ||
38
39
| KMeans | √ ||
39
-
| k-NN (*)| √ ||
40
+
|approx/exact k-NN (*) | √ ||
40
41
| LinearRegression | √ ||
41
42
| LogisticRegression | √ ||
42
43
| PCA | √ | √ |
43
44
| RandomForestClassifier | √ ||
44
45
| RandomForestRegressor | √ ||
45
46
| UMAP (*) | √ ||
46
47
47
-
Note: Spark does not provide a k-Nearest Neighbors (k-NN) implementation, but it does have an [LSH-based Approximate Nearest Neighbor](https://spark.apache.org/docs/latest/ml-features.html#approximate-nearest-neighbor-search) implementation. As an alternative to PCA, we also provide a Spark API for GPU accelerated Uniform Manifold Approximation and Projection (UMAP), a non-linear dimensionality reduction algorithm in the RAPIDS cuML library.
48
+
Note: Spark does not provide a k-Nearest Neighbors (k-NN) implementation, but it does have an [LSH-based Approximate Nearest Neighbor](https://spark.apache.org/docs/latest/ml-features.html#approximate-nearest-neighbor-search) implementation. As an alternative to PCA, we also provide a Spark API for GPU accelerated Uniform Manifold Approximation and Projection (UMAP), a non-linear dimensionality reduction algorithm in the RAPIDS cuML library. As an alternative to KMeans, we also provide a Spark API for GPU accelerated Density-Based Spatial Clustering of Applications with Noise (DBSCAN), a density based clustering algorithm in the RAPIDS cuML library.
Copy file name to clipboardExpand all lines: docs/site/compatibility.md
+3-2Lines changed: 3 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -11,16 +11,17 @@ The following table shows the currently supported algorithms. The goal is to ex
11
11
| Supported Algorithms | Python | Scala |
12
12
| :--------------------- | :----: | :---: |
13
13
| CrossValidator | √ ||
14
+
| DBSCAN (*) | √ ||
14
15
| KMeans | √ ||
15
-
| k-NN (*)| √ ||
16
+
|approx/exact k-NN (*) | √ ||
16
17
| LinearRegression | √ ||
17
18
| LogisticRegression | √ ||
18
19
| PCA | √ | √ |
19
20
| RandomForestClassifier | √ ||
20
21
| RandomForestRegressor | √ ||
21
22
| UMAP (*) | √ ||
22
23
23
-
Note: Spark does not provide a k-Nearest Neighbors (k-NN) implementation, but it does have an [LSH-based Approximate Nearest Neighbor](https://spark.apache.org/docs/latest/ml-features.html#approximate-nearest-neighbor-search) implementation. As an alternative to PCA, we also provide a Spark API for GPU accelerated Uniform Manifold Approximation and Projection (UMAP), a non-linear dimensionality reduction algorithm in the RAPIDS cuML library.
24
+
Note: Spark does not provide a k-Nearest Neighbors (k-NN) implementation, but it does have an [LSH-based Approximate Nearest Neighbor](https://spark.apache.org/docs/latest/ml-features.html#approximate-nearest-neighbor-search) implementation. As an alternative to PCA, we also provide a Spark API for GPU accelerated Uniform Manifold Approximation and Projection (UMAP), a non-linear dimensionality reduction algorithm in the RAPIDS cuML library. As an alternative to KMeans, we also provide a Spark API for GPU accelerated Density-Based Spatial Clustering of Applications with Noise (DBSCAN), a density based clustering algorithm in the RAPIDS cuML library.
0 commit comments