[問題類型]:
[問題敘述]:
最近在練習data mining 遇到一個不會解的問題 誠徵高手Consider one network “
karate", which is available in the package “igraphdata”.
> library(igraphdata)
> data(karate)
> ?karate
Using the hierarchical random graphs functions in “igraph” perform the
following tasks:
(a) Focus on the karate network. Create noisy datasets. Do this by deleting
5% of the edges randomly (track which ones they are). Perform MCMC on this
data followed by link-prediction. Are you able to predict the edges that you
deleted.
線上教學，價格可議 拜託高手解惑
請寄[email protected]
非常感謝!