Skip to content
New issue

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

无监督还是有监督? #35

Open
littlejiajia opened this issue Jul 13, 2020 · 3 comments
Open

无监督还是有监督? #35

littlejiajia opened this issue Jul 13, 2020 · 3 comments

Comments

@littlejiajia
Copy link

代码用了标签来计算损失,可见该方法应该是有监督,为什么题目中还用到cluster等关键词?以及对比实验还与典型无监督方法,例如:K-means等比较?

@unofang
Copy link

unofang commented Sep 21, 2020

对,这也是我的问题。我不太了解GCN,但我想作为CNN的一种,是需要训练的。然后我用了他们训练过的model去预测我自己的数据,也有可能是我没操作对,但最后出来的结果不太理想。

@liupengcnu
Copy link

对,这也是我的问题。我不太了解GCN,但我想作为CNN的一种,是需要训练的。然后我用了他们训练过的model去预测我自己的数据,也有可能是我没操作对,但最后出来的结果不太理想。
请问一下你的knn_graph.npy是怎么构建的哈,可以提供一下你的代码吗

@FDuiv
Copy link

FDuiv commented Feb 5, 2021

可以看看这篇文章Learning to Cluster Faces on an Affinity Graph,有监督和聚类应该是不能共存的吧?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants