GraphLab Learning Records

GraphLab Learning Records

  1. 实现原理部分解读

    1. 与Hadoop的区别:Hadoop为什么不好,而要提出GraphLab框架
      1. Hadoop的并行化原理 v.s. GraphLab的并行化原理
      2. 运行试验对比
  2. GraphLab原理细化

  3. code reading

    collaborative filtering/als.cpp find by search "iver"

    collaborative filtering/nmf.cpp see the description

  4. 代码实现

    Affinity Propagation Clustering
    单源最短路径
    统计图的顶点的度和相同度的顶点数目

    参考文献

    Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud

GraphLab%20Learning%20Records%0A%3D%3D%3D%3D%0A%0A%0A1.%20%23%23%23%u5B9E%u73B0%u539F%u7406%u90E8%u5206%u89E3%u8BFB%0A%20%20%20%201.%20%u4E0EHadoop%u7684%u533A%u522B%uFF1AHadoop%u4E3A%u4EC0%u4E48%u4E0D%u597D%uFF0C%u800C%u8981%u63D0%u51FAGraphLab%u6846%u67B6%0A%20%20%20%20%20%20%20%202.%20Hadoop%u7684%u5E76%u884C%u5316%u539F%u7406%20v.s.%20GraphLab%u7684%u5E76%u884C%u5316%u539F%u7406%0A%20%20%20%20%20%20%20%203.%20%u8FD0%u884C%u8BD5%u9A8C%u5BF9%u6BD4%0A2.%20%23%23%23GraphLab%u539F%u7406%u7EC6%u5316%0A%0A3.%20%23%23%23code%20reading%20%20%0A%0A%20%20%20%20%5Bcollaborative%20filtering/als.cpp%5D%28https%3A//gist.github.com/irwenqiang/8432129/%29%20find%20by%20search%20%22iver%22%20%20%20%20%0A%0A%20%20%20%20%5Bcollaborative%20filtering/nmf.cpp%5D%28https%3A//gist.github.com/irwenqiang/8432313%29%20see%20the%20description%0A%0A4.%20%u4EE3%u7801%u5B9E%u73B0%20%20%0A%0A%20%20%20%20%5BAffinity%20Propagation%20Clustering%5D%28%29%20%20%0A%20%20%20%20%5B%u5355%u6E90%u6700%u77ED%u8DEF%u5F84%5D%28http%3A//blog.csdn.net/liuxuejiang158blog/article/details/8642357%29%20%20%0A%20%20%20%20%5B%u7EDF%u8BA1%u56FE%u7684%u9876%u70B9%u7684%u5EA6%u548C%u76F8%u540C%u5EA6%u7684%u9876%u70B9%u6570%u76EE%5D%28http%3A//blog.csdn.net/liuxuejiang158blog/article/details/8661483%29%0A%23%23%23%u53C2%u8003%u6587%u732E%0A%5BDistributed%20GraphLab%3A%20A%20Framework%20for%20Machine%20Learning%20and%20Data%20Mining%20in%20the%20Cloud%5D%28http%3A//arxiv.org/pdf/1204.6078.pdf%29%0A%0A


comments powered by Disqus