![]() If it is zero, the algorithm computes the eigenvectors for all features, \(r = p\). The number of principal components \(r\). If it is true, the directions of the eigenvectors must be deterministic. Specifies whether the algorithm applies the sign-flip technique. Can be task :: dim_reduction.ĭescriptor( std :: int64_t component_count = 0)Ĭreates a new instance of the class with the given component_count property value. ![]() Task – Tag-type that specifies type of the problem to solve. ![]() Method – Tag-type that specifies an implementation of algorithm. Basic_statistics_dense_batch.cpp column_accessor_homogen.cpp connected_components_batch.cpp cor_dense_batch.cpp cov_dense_batch.cpp csr_accessor.cpp dbscan_brute_force_batch.cpp df_cls_dense_batch.cpp df_reg_dense_batch.cpp directed_graph.cpp graph_service_functions.cpp jaccard_batch.cpp jaccard_batch_app.cpp kmeans_init_dense.cpp kmeans_lloyd_dense_batch.cpp knn_cls_brute_force_dense_batch.cpp knn_cls_kd_tree_dense_batch.cpp knn_search_brute_force_dense_batch.cpp linear_kernel_dense_batch.cpp linear_regression_dense_batch.cpp logloss_dense_batch.cpp louvain_batch.cpp pca_dense_batch.cpp pca_precomputed_dense_batch.cpp polynomial_kernel_dense_batch.cpp rbf_kernel_dense_batch.cpp shortest_paths_batch.cpp sigmoid_kernel_dense_batch.cpp subgraph_isomorphism_batch.cpp svm_multi_class_thunder_csr_batch.cpp svm_multi_class_thunder_dense_batch.cpp svm_nu_cls_thunder_csr_batch.cpp svm_nu_cls_thunder_dense_batch.cpp svm_nu_reg_thunder_csr_batch.cpp svm_nu_reg_thunder_dense_batch.cpp svm_reg_thunder_csr_batch.cpp svm_reg_thunder_dense_batch.cpp svm_two_class_smo_csr_batch.cpp svm_two_class_smo_dense_batch.cpp svm_two_class_thunder_csr_batch.cpp svm_two_class_thunder_dense_batch.cpp triangle_counting_batch.cppĪll types and functions in this section are declared in the oneapi::dal::pca namespace and be available via inclusion of the oneapi/dal/algo/pca.hpp header file.įloat – The floating-point type that the algorithm uses for intermediate computations. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |