We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
请问这种更新方式是不是梯度下降
The text was updated successfully, but these errors were encountered:
请问是哪个算法,是非负矩阵分解吗?
Sorry, something went wrong.
对的,nmf
嗯,目标函数是最小化一个欧几里得距离,所以可以用梯度的思路去更新。https://blog.csdn.net/ACdreamers/article/details/44663421 看下这篇文章,里面提及更新算法的推导思路,可以参考一下。我当时只是按着作业要求实现了一下算法,具体还没有怎么深究。
No branches or pull requests
请问这种更新方式是不是梯度下降
The text was updated successfully, but these errors were encountered: