Commit 1e226858 authored by Daniel García's avatar Daniel García
Browse files

Update README.md

parent d187c2c6
All code relating to the specific experiments conducted on the data published in https://lbd.udc.es/research/real-life-HAR-dataset.
Note that each script is coded in a Slurm way to be executed as a job array, limited to 250 tasks at a time (in our case). The parameters for every script would be as follows:
'windowSize_overlap_dataset' featureSet slurmArrayTaskId [firstOrLast250]
- 'windowSize_overlap_dataset' featureSet slurmArrayTaskId [firstOrLast250]
Each parameter could take the following values:
- WindowSize = [20, 30, 40, 50, 60, 70, 80, 90]
- Overlap = [19.0, 29.0, 39.0, 49.0, 59.0, 69.0, 79.0, 89.0]
- Each value corresponds to one and only one of the previous window sizes.
- Dataset = [1, 2]
2 - Complete dataset (all sensors)
1 - Dataset without gyroscope
- 2 - Complete dataset (all sensors)
- 1 - Dataset without gyroscope
- FeatureSet = [0, 1]
0 - Initial feature set (basic)
1 - Proposed feature set (more complex)
- 0 - Initial feature set (basic)
- 1 - Proposed feature set (more complex)
- SlurmArrayTaskId = [1-10] or [1-250]
Each task corresponds to one of the initial folds done in the experiments (1-10).
For the non-deterministic algorithms (RF and MLP, in this case), we need to do at least 50 experiments to bypass its random behaviour (1-250, two times).
- Each task corresponds to one of the initial folds done in the experiments (1-10).
- For the non-deterministic algorithms (RF and MLP, in this case), we need to do at least 50 experiments to bypass its random behaviour (1-250, two times).
- FirstOrLast250 = [0, 1]
This is only needed for the non-deterministic algorithms, due to the 250 task limit we had.
- This is only needed for the non-deterministic algorithms, due to the 250 task limit we had.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment