The recent advances of data mining techniques are widely used for many applications in today's information world. However the misuse of these techniques may disclose the private or sensitive information which database owners do not want reveal to others. Therefore many of the researchers in knowledge hiding field have recently made efforts to preserve privacy for sensitive knowledge. In this paper, the authors propose a heuristic based algorithm named ADSRRC (Advance Decrease Support of R.H.S. item of Rule Clusters) to hide the sensitive association rules with multiple items in consequent (R.H.S) and antecedent (L.H.S). This algorithm overcomes the limitation of existing rule hiding algorithm DSRRC.