|
| TEST_CASE_METHOD (LSHTestFixture, "LSHOutputDimensionTest", "[LSHMainTest][BindingTests]") |
| Check that output neighbors and distances have valid dimensions.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHParamValidityTest", "[LSHMainTest][BindingTests]") |
| Ensure that bucket_size, second_hash_size & number of nearest neighbors are always positive.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHModelValidityTest", "[LSHMainTest][BindingTests]") |
| Make sure only one of reference data or pre-trained model is passed.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffTablesTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different tables.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffProjectionsTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different projections.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffHashWidthTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different hash_width.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffNumProbesTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different num_probes.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffSecondHashSizeTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different second_hash_size.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHDiffBucketSizeTest", "[LSHMainTest][BindingTests]") |
| Check learning process using different bucket sizes.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHModelReuseTest", "[LSHMainTest][BindingTests]") |
| Check that saved model can be reused again.
|
|
| TEST_CASE_METHOD (LSHTestFixture, "LSHModelTrueNighborsDimTest", "[LSHMainTest][BindingTests]") |
| Make sure true_neighbors have valid dimensions.
|
|
- Author
- Manish Kumar
Test mlpackMain() of lsh_main.cpp.
mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-clause BSD license. You should have received a copy of the 3-clause BSD license along with mlpack. If not, see http://www.opensource.org/licenses/BSD-3-Clause for more information.