Association rule mining is one of the significant research areas which explore the association between various item sets. The issue of privacy arises when several legitimate people share their data or knowledge for their mutual benefits. In case of centralized database, sensitive item sets are hidden by using association rule hiding approaches. Based on the execution time, the degree of optimality, the level of tolerance of side effects and guaranteed to get solution different association rule hiding approaches are exist. Among the commonly used approaches, heuristic approach is widely used since it guarantees to provide solution but causes some side effects. In this paper a heuristic based methodology is proposed to hide the sensitive item sets efficiently by adopting two criterions. This methodology protects private information by doing sanitization process but before participating in the sanitization process, the method analysis the side effects and select the most promising one to change so that side effects can be fully avoided or accepting few side effects which will not harm the informational accuracy.