The International Journal of Innovative Research in Computer and Communication Engineering
The authors apply a PWS support called UPS that can adaptively simplify profiles by queries as regarding user specific privacy necessities. Their runtime simplification aims at conspicuous an equilibrium among two analytical metrics that estimate the service of personalization and the isolation danger of revealing the general outline. They present two greedy algorithms, specifically Greedy DP and Greedy IL, for runtime simplification. They also present online prediction machinery for deciding whether personalizing a query is useful.