1 / 13

Trustworthy knowledge diffusion model based on risk discovery on peer-to-peer networks

Trustworthy knowledge diffusion model based on risk discovery on peer-to-peer networks. Authors: Jason J. Jung Source: Expert Systems with Applications, vol. 36, pp. 7123-7128, 2009. Speaker: Shu-Fen Chiou( 邱淑芬 ). Outline. Introduction Proposed method Recommendation flow

acton-sparks
Télécharger la présentation

Trustworthy knowledge diffusion model based on risk discovery on peer-to-peer networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Trustworthy knowledge diffusion model based on risk discovery on peer-to-peer networks Authors: Jason J. Jung Source: Expert Systems with Applications, vol. 36, pp. 7123-7128, 2009. Speaker: Shu-Fen Chiou(邱淑芬)

  2. Outline • Introduction • Proposed method • Recommendation flow • Detecting malicious nodes • Experimental results • Conclusions • Comments

  3. Introduction • Recommendation sharing • B like the computer information, when A owning a PCnews.doc, he wants to suggest B to download it. • High rating presents the item has more correlation from B. <x, rating information> A B x:PCnews.doc interest: computer information

  4. Problem interest: computer information (invoker) True recommendation A B True recommendation False recommendation C True recommendation Malicious node True recommendation E D True recommendation

  5. Requirements • Good recommendation propagation process • Detect malicious peer

  6. Recommendation flow

  7. Recommendation flow (interest x) (invoker) A B C E D

  8. Detecting malicious nodes

  9. Experimental results

  10. Two main drawbacks • Batch process • Assumed the majority of neighbors is fair and trustworthy

  11. Conclusions • Attempting to model ‘‘word-of-mouth” recommendation propagation process in real world. • Filtering out the noisy (malicious) recommendation.

  12. 優缺點 • 優點:方法簡單。 • 缺點: • How to know the peer’s favorite items? • Only using recommendation to decide the malicious is not enough. • The performance in this paper is not good.

  13. 未來研究方向 • Not only using one item, using multiple items to decide whether exists malicious peer with a fix time. • Add the reputation matrix for every peer.

More Related