图 书 馆
用于挖掘社交网络的可扩展协同过滤算法Scalable Collaborative Filtering Algorithms for Mining Social Networks |
|
| 课程网址: | http://videolectures.net/bsciw08_chang_scfamsn/ |
| 主讲教师: | Edward Chang |
| 开课单位: | 谷歌公司 |
| 开课时间: | 2008-12-20 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | Social networking sites such as Orkut, MySpace, Hi5, and Facebook attract billions of visits a day, surpassing the page views of Web Search. These social networking sites provide applications for individuals to establish communities, to upload and share documents/photos/videos, and to interact with other users. Take Orkut as an example. Orkut hosts millions of communities, with hundreds of communities created and tens of thousands of blogs/photos uploaded each hour. To assist users to find relevant information, it is essential to provide effective collaborative filtering tools to perform recommendations such as friend, community, and ads matching. In this talk, I will first describe both computational and storage challenges to traditional collaborative filtering algorithms brought by aforementioned information explosion. To deal with huge social graphs that expand continuously, an effective algorithm should be designed to 1) run on thousands of parallel machines for sharing storage and speeding up computation, 2) perform incremental retraining and updates for attaining online performance, and 3) fuse information of multiple sources for alleviating information sparseness. In the second part of the talk, I will present algorithms we recently developed including parallel Spectral Clustering [1], parallel PF-Growth [2], parallel combinational collaborative filtering [3], parallel LDA, parallel spectral clustering, and parallel Support Vector Machines [4]. |
| 关 键 词: | 挖掘社交网络; 可扩展性协同算法 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-10-28：lxf |
| 阅读次数: | 30 |