AN ENHANCED PRIVACY RULE BASED MODEL FOR FILTERING UNPREFERRED MESSAGES
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2014, Vol 5, Issue 6
Abstract
The online social networks (OSN) offers proficient message controls that are posted on their private space in order to avoid un-preferred content displayed to users. But, OSN provides a low supportive and flexibility to the private message in the user’s own space. Most of the existing works on OSN presents a system to facilitate user by discarding the messages posted on their private wall. The existing works also develops flexible rule based system with the filtering criteria to post only useful messages on their walls for user satisfaction. The machine learning based classifier presents involuntarily labeling of messages that support content based filtering. Moreover, OSN filters the message content based on message originator relationship and characteristics. OSN offer the rule layer with classification module with the semantics for filtering policy to improve the domain. The drawback of existing work is that filters did not concern about the user privacy demand. The provisions for the feedbacks on the online learning as well as the nomenclature of the users in the black list are not mentioned. Hence, the challenge lies in establishing better filtering technique. The proposed work is user privacy concerned social proximity rules to develop an efficient filter for open social network. Proximity rule estimation (PRE) provides private and verifiable proximity computation based on polynomial secure share. PRE address the user privacy concern by getting the feedback forms from the user for friend-like nomenclature. Proposed PRE is able to discover the potential friends with the preferred message exchange between them using relational privacy index. And also helps to identify a variety of possible attack messages by analyzing real traces. Additionally, PRE develops novel solution for secure proximity estimation and allows user to identify the acceptable messages that are listed in their social network space. Proposed work intends in fulfilling user privacy needs and demands in designing OSN filters. The adequate numbers are given for the privacy feedbacks on the online learning and the user nomenclature are exclusively inserted in the black list for classification of filter rules. Experimental evaluations are conducted to prove the better performance of PRE in terms of attack density, minimum execution time and less memory space utilized.
Authors and Affiliations
N. Gomathivani , Prof. K. Akilandeswari
STUDY OF SERVER LOAD BALANCING TECHNIQUES
One of the critical scheduling problems in distributed computing environment is load balancing on a cluster of replicated servers which face a constant pressure of increased network traffic and diverse load levels. The k...
PEER TO PEER ASSOCIATION IN CONTENT DISTRIBUTION NETWORK
The troublesome issue of method associated implementing an economical law for load reconciliation in Content Delivery Networks (CDNs). We have a tendency to tend to base our proposal on a correct study of a CDN system, d...
A Review of Cyber Security Techniques for Critical Infrastructure Protection
Security is the most important aspect of any infrastructure. Infrastructure may be of private organization or government organization and the economy of the nation depends on this infrastructure. A no. of approaches have...
Transition Bandwidth Analysis of Infinite Impulse Response Filters
Infinite impulse response (IIR) is a property applying to many linear time-invariant systems. Digital filters are the common example of linear time invariant systems. Systems with this property are called IIR systems or...
Modified Booth Dadda Multiplier using Carry Look ahead adder Design and Implementation
This paper proposes a novel 8X8 bit Modified Booth Dadda Multiplier architecture which is an improved version of Modified Booth Wallace Multiplier. The idea involves the generation of partial products using Modified Boot...