A New Security Model In P2P Network Based On Rough Set And Bayesian Learner

A new security management model based on Rough set and Bayesian learner is proposed in the paper. The model focuses on finding out malicious nodes and getting them under control. The degree of dissatisfaction (DoD) is defined as the probability that a node belongs to the malicious node set. Based on...

Full description

Saved in:
Bibliographic Details
Published in:KSII transactions on Internet and information systems 2012-09, Vol.6 (9), p.2370-2387
Main Authors: Wang, Hai-Sheng, Gui, Xiao-Lin
Format: Article
Language:Korean
Subjects:
Bayesian learner
Degree of Dissatisfaction
Information entropy
Rough set
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 2387
container_issue 9
container_start_page 2370
container_title KSII transactions on Internet and information systems
container_volume 6
creator Wang, Hai-Sheng
Gui, Xiao-Lin
description A new security management model based on Rough set and Bayesian learner is proposed in the paper. The model focuses on finding out malicious nodes and getting them under control. The degree of dissatisfaction (DoD) is defined as the probability that a node belongs to the malicious node set. Based on transaction history records local DoD (LDoD) is calculated. And recommended DoD (RDoD) is calculated based on feedbacks on recommendations (FBRs). According to the DoD, nodes are classified and controlled. In order to improve computation accuracy and efficiency of the probability, we employ Rough set combined with Bayesian learner. For the reason that in some cases, the corresponding probability result can be determined according to only one or two attribute values, the Rough set module is used; And in other cases, the probability is computed by Bayesian learner. Compared with the existing trust model, the simulation results demonstrate that the model can obtain higher examination rate of malicious nodes and achieve the higher transaction success rate.
format article
fullrecord <record><control><sourceid>kiss_kisti</sourceid><recordid>TN_cdi_kisti_ndsl_JAKO201203939215896</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><kiss_id>3532953</kiss_id><sourcerecordid>3532953</sourcerecordid><originalsourceid>FETCH-LOGICAL-k506-6b05050beef1af9db7549b8798a702497f022499251a2343123e690eacabcd523</originalsourceid><addsrcrecordid>eNpNj01LxDAQhosouKz7C7zk4rGQTJqkOdbFj3WrXXTvJW2mGlqz0nRZ-u8NKCLv4RlmHgbes2TBtJKpAqXO_82XySoE11AGOcgszxfJtiAveCJv2B5HN83k-WBxIBtPdrCLl-l0GHtyawJaUnnyeji-f0R5IoW3cT1jcMaTEs3ocbxKLjozBFz9cpns7-_268e0rB4266JMe0FlKhsqYhrEjplO20aJTDe50rlRFDKtOgoRGgQzwDPOgKPUFE1rmtYK4Mvk5udt78Lkam_DUD8V2wpiLco118BErmX0rv-8UH-N7tOMc80FBy04_wZ4ok-e</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A New Security Model In P2P Network Based On Rough Set And Bayesian Learner</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Wang, Hai-Sheng ; Gui, Xiao-Lin</creator><creatorcontrib>Wang, Hai-Sheng ; Gui, Xiao-Lin</creatorcontrib><description>A new security management model based on Rough set and Bayesian learner is proposed in the paper. The model focuses on finding out malicious nodes and getting them under control. The degree of dissatisfaction (DoD) is defined as the probability that a node belongs to the malicious node set. Based on transaction history records local DoD (LDoD) is calculated. And recommended DoD (RDoD) is calculated based on feedbacks on recommendations (FBRs). According to the DoD, nodes are classified and controlled. In order to improve computation accuracy and efficiency of the probability, we employ Rough set combined with Bayesian learner. For the reason that in some cases, the corresponding probability result can be determined according to only one or two attribute values, the Rough set module is used; And in other cases, the probability is computed by Bayesian learner. Compared with the existing trust model, the simulation results demonstrate that the model can obtain higher examination rate of malicious nodes and achieve the higher transaction success rate.</description><identifier>ISSN: 1976-7277</identifier><identifier>EISSN: 1976-7277</identifier><language>kor</language><publisher>한국인터넷정보학회</publisher><subject>Bayesian learner ; Degree of Dissatisfaction ; Information entropy ; Rough set</subject><ispartof>KSII transactions on Internet and information systems, 2012-09, Vol.6 (9), p.2370-2387</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,315,786,790,891</link.rule.ids></links><search><creatorcontrib>Wang, Hai-Sheng</creatorcontrib><creatorcontrib>Gui, Xiao-Lin</creatorcontrib><title>A New Security Model In P2P Network Based On Rough Set And Bayesian Learner</title><title>KSII transactions on Internet and information systems</title><addtitle>KSII Transactions on Internet and Information Systems (TIIS)</addtitle><description>A new security management model based on Rough set and Bayesian learner is proposed in the paper. The model focuses on finding out malicious nodes and getting them under control. The degree of dissatisfaction (DoD) is defined as the probability that a node belongs to the malicious node set. Based on transaction history records local DoD (LDoD) is calculated. And recommended DoD (RDoD) is calculated based on feedbacks on recommendations (FBRs). According to the DoD, nodes are classified and controlled. In order to improve computation accuracy and efficiency of the probability, we employ Rough set combined with Bayesian learner. For the reason that in some cases, the corresponding probability result can be determined according to only one or two attribute values, the Rough set module is used; And in other cases, the probability is computed by Bayesian learner. Compared with the existing trust model, the simulation results demonstrate that the model can obtain higher examination rate of malicious nodes and achieve the higher transaction success rate.</description><subject>Bayesian learner</subject><subject>Degree of Dissatisfaction</subject><subject>Information entropy</subject><subject>Rough set</subject><issn>1976-7277</issn><issn>1976-7277</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNpNj01LxDAQhosouKz7C7zk4rGQTJqkOdbFj3WrXXTvJW2mGlqz0nRZ-u8NKCLv4RlmHgbes2TBtJKpAqXO_82XySoE11AGOcgszxfJtiAveCJv2B5HN83k-WBxIBtPdrCLl-l0GHtyawJaUnnyeji-f0R5IoW3cT1jcMaTEs3ocbxKLjozBFz9cpns7-_268e0rB4266JMe0FlKhsqYhrEjplO20aJTDe50rlRFDKtOgoRGgQzwDPOgKPUFE1rmtYK4Mvk5udt78Lkam_DUD8V2wpiLco118BErmX0rv-8UH-N7tOMc80FBy04_wZ4ok-e</recordid><startdate>20120926</startdate><enddate>20120926</enddate><creator>Wang, Hai-Sheng</creator><creator>Gui, Xiao-Lin</creator><general>한국인터넷정보학회</general><scope>HZB</scope><scope>Q5X</scope><scope>JDI</scope></search><sort><creationdate>20120926</creationdate><title>A New Security Model In P2P Network Based On Rough Set And Bayesian Learner</title><author>Wang, Hai-Sheng ; Gui, Xiao-Lin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-k506-6b05050beef1af9db7549b8798a702497f022499251a2343123e690eacabcd523</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>kor</language><creationdate>2012</creationdate><topic>Bayesian learner</topic><topic>Degree of Dissatisfaction</topic><topic>Information entropy</topic><topic>Rough set</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Hai-Sheng</creatorcontrib><creatorcontrib>Gui, Xiao-Lin</creatorcontrib><collection>KISS(한국학술정보)</collection><collection>Korean Studies Information Service System (KISS) B-Type</collection><collection>KoreaScience</collection><jtitle>KSII transactions on Internet and information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Hai-Sheng</au><au>Gui, Xiao-Lin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A New Security Model In P2P Network Based On Rough Set And Bayesian Learner</atitle><jtitle>KSII transactions on Internet and information systems</jtitle><addtitle>KSII Transactions on Internet and Information Systems (TIIS)</addtitle><date>2012-09-26</date><risdate>2012</risdate><volume>6</volume><issue>9</issue><spage>2370</spage><epage>2387</epage><pages>2370-2387</pages><issn>1976-7277</issn><eissn>1976-7277</eissn><notes>Korean Society for Internet Information</notes><notes>KISTI1.1003/JNL.JAKO201203939215896</notes><abstract>A new security management model based on Rough set and Bayesian learner is proposed in the paper. The model focuses on finding out malicious nodes and getting them under control. The degree of dissatisfaction (DoD) is defined as the probability that a node belongs to the malicious node set. Based on transaction history records local DoD (LDoD) is calculated. And recommended DoD (RDoD) is calculated based on feedbacks on recommendations (FBRs). According to the DoD, nodes are classified and controlled. In order to improve computation accuracy and efficiency of the probability, we employ Rough set combined with Bayesian learner. For the reason that in some cases, the corresponding probability result can be determined according to only one or two attribute values, the Rough set module is used; And in other cases, the probability is computed by Bayesian learner. Compared with the existing trust model, the simulation results demonstrate that the model can obtain higher examination rate of malicious nodes and achieve the higher transaction success rate.</abstract><pub>한국인터넷정보학회</pub><tpages>18</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1976-7277
ispartof KSII transactions on Internet and information systems, 2012-09, Vol.6 (9), p.2370-2387
issn 1976-7277
1976-7277
language kor
recordid cdi_kisti_ndsl_JAKO201203939215896
source EZB-FREE-00999 freely available EZB journals
subjects Bayesian learner
Degree of Dissatisfaction
Information entropy
Rough set
title A New Security Model In P2P Network Based On Rough Set And Bayesian Learner
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-09-22T23%3A26%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-kiss_kisti&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20New%20Security%20Model%20In%20P2P%20Network%20Based%20On%20Rough%20Set%20And%20Bayesian%20Learner&rft.jtitle=KSII%20transactions%20on%20Internet%20and%20information%20systems&rft.au=Wang,%20Hai-Sheng&rft.date=2012-09-26&rft.volume=6&rft.issue=9&rft.spage=2370&rft.epage=2387&rft.pages=2370-2387&rft.issn=1976-7277&rft.eissn=1976-7277&rft_id=info:doi/&rft_dat=%3Ckiss_kisti%3E3532953%3C/kiss_kisti%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-k506-6b05050beef1af9db7549b8798a702497f022499251a2343123e690eacabcd523%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_kiss_id=3532953&rfr_iscdi=true