J4 ›› 2010, Vol. 45 ›› Issue (9): 14-19.

• Articles • Previous Articles     Next Articles

Privacy preserving attribute reduction based on conditional information entropy over vertically partitioned multi-decision tables

YE Ming-quan1,2, HU Xue-gang1,  WU Chang-rong3   

  1. 1. Institute of Computer and Information, Hefei University of Technology, Hefei 230009, Anhui, China;
    2. Computer Staff Room, Wannan Medical College, WuHu 241002, Anhui, China;
    3. Institute of Mathematics and Computer, Anhui Normal University, WuHu 241002, Anhui, China
  • Received:2010-06-13 Online:2010-09-16 Published:2010-10-12

Abstract:

A privacy-preserving set intersection cardinality computation protocol based on semi-trusted third party and commutative encryption is developed, which can be used to slove the privacy-preserving computational problems, such as information entropy computation and conditional information entropy computation. A privacy-preserving attribute reduction algorithm based on conditional information entropy for the vertically partitioned multi-decision tables is proposed.The algorithm can compute globally valid attribute reduction using the attribute reduction idea based on information viewpoint of Rough set theory, which can get accurate attribute reduction effect in the premise of no sharing of private information among participators. Analysis results show the proposed algorithm is efficient.

Key words: attribute reduction; privacy preserving; secure multi-party computation; Rough set; conditional information entropy

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!