<jupyter_start><jupyter_text>The above plot shows that the best accuracy for KNN algorithm is obtained for **n_neighbors = 5**<jupyter_code>fig, ax = plt.subplots()
ax.plot(num_cpu_list, training_times, 'ro')
ax.set_xlim([0, len(num_cpu_list)+1])

#plt.axis([0, len(num_cpu_list)+1, 0, max(training_times)+1])
plt.title("Search time vs #CPU Cores")
plt.xlabel("#CPU Cores")
plt.ylabel("search time [s]")
plt.show()<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.16441441441441443, 'fraction_numerical': 0.015765765765765764, 'mean_word_length': 8.081632653061224, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '1', 'dir': 'jupyter-structured-clean-dedup', 'id': '3845', 'license': 'MIT', 'n_tokens_mistral': 185, 'n_tokens_neox': 176, 'n_words': 38, 'path': 'notebooks/pawel_ueb01/03_Cross_validation_and_grid_search_bielski.ipynb', 'repo_name': 'hhain/sdap17', 'size': '444'}