sklearn raise ImportError('[joblib] Attempting to do parallel computing n_jobs > 1 windows
2016-04-28 11:01
627 查看
在windows下面运行 sklearn 中的代码，如果遇到 并行执行 n_jobs > 1 就会出现：
raise ImportError(‘[joblib] Attempting to do parallel computing ’
ImportError: [joblib] Attempting to do parallel computing without protecting your import on a system that does not support forking. To use parallel-computing in a script, you must protect your main loop using “if name == ‘main‘”. Please see the joblib documentation on Parallel for more information
这个错误
解决：
把所有的代码方到
if name == ‘main’
中就可以了
raise ImportError(‘[joblib] Attempting to do parallel computing ’
ImportError: [joblib] Attempting to do parallel computing without protecting your import on a system that does not support forking. To use parallel-computing in a script, you must protect your main loop using “if name == ‘main‘”. Please see the joblib documentation on Parallel for more information
这个错误
解决：
把所有的代码方到
if name == ‘main’
中就可以了
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- hdu 5029 Relief grain 树链剖分+线段树
- hdu 1021 - Fibonacci Again
- 利用UltraISO刻录光盘启动盘
- 如何通过aix通过端口号查到进程号
- idea+genymotion，wait for adb
- VS报错 error LNK2005: _DllMain@12 已经在 MSVCRTD.lib(dllmain.obj) 中定义
- 基于BootStarp的Dailog
- Ecplise打开xml文件时报Failed to create the part's controls错误
- 用Java开源项目JOONE实现人工智能编程
- Style input element to fill remaining width of its container
- 并查集
- 基于BootStarp的Dailog
- mybaits 插入数据时 如果是日期类型 一定要指明
- replication factor: 1 larger than available brokers: 0 问题解决方案
- UVA 10245 The Closest Pair Problem【分治】
- UVA 10245 The Closest Pair Problem【分治】
- UVA 10245 The Closest Pair Problem【分治】
- 【BZOJ3670】[Noi2014]动物园【KMP】【fail树】
- 219. Contains Duplicate II
- leetcode 217. Contains Duplicate