具有逻辑回归的素数标识符
Prime numbers identifier with logistic regression
是否可以使用逻辑回归来识别素数？
我正在尝试使用预定义的数据库编号和分类（1 = Prime，0 = Not Prime）来投影一个具有监督逻辑回归的系统，使用此数据我希望计算机使用这种类型的算法来识别其他数字没有在 DB 上分类，
有可能吗，或者我正在尝试做一些不可能的事情？
鉴于正确的网络配置和足够的时间，我不知道为什么不可能。
看起来 others have had success with different models 你可能会从他们那里得到更好的主意：
Early success on prime number testing via artificial networks is presented in A Compositional Neural-network Solution to Prime-number Testing, László Egri, Thomas R. Shultz, 2006. The knowledge-based cascade-correlation (KBCC) network approach showed the most promise, although the practicality of this approach is eclipsed by other prime detection algorithms that usually begin by checking the least significant bit, immediately reducing the search by half, and then searching based other theorems and heuristics up to (‾‾√). However the work was continued with Knowledge Based Learning with KBCC, Shultz et. al. 2006.
是否可以使用逻辑回归来识别素数？ 我正在尝试使用预定义的数据库编号和分类（1 = Prime，0 = Not Prime）来投影一个具有监督逻辑回归的系统，使用此数据我希望计算机使用这种类型的算法来识别其他数字没有在 DB 上分类， 有可能吗，或者我正在尝试做一些不可能的事情？
鉴于正确的网络配置和足够的时间，我不知道为什么不可能。
看起来 others have had success with different models 你可能会从他们那里得到更好的主意：
Early success on prime number testing via artificial networks is presented in A Compositional Neural-network Solution to Prime-number Testing, László Egri, Thomas R. Shultz, 2006. The knowledge-based cascade-correlation (KBCC) network approach showed the most promise, although the practicality of this approach is eclipsed by other prime detection algorithms that usually begin by checking the least significant bit, immediately reducing the search by half, and then searching based other theorems and heuristics up to (‾‾√). However the work was continued with Knowledge Based Learning with KBCC, Shultz et. al. 2006.