The memory scheme is one of the most widely employed techniques in Evolutionary Algorithms for solving dynamic optimization problems. The updating strategy is a key concern for the memory scheme. Unfortunately, the existent memory updating strategies neglect the characteristics of the memory updating behaviors, and sometimes this could lead results against the original intention. In this paper, a novel updating strategy is proposed, which can adaptively update the memory according to the characteristics of the memory updating behaviors. Experiments are carried out in different kinds of dynamic environments, and the experimental results show that the proposed strategy is better than the traditional strategies.