In this paper, continuous action-set learning automata (CALA) is used to solve the dynamic clustering problem. This paper proposed a new method to automatically find an action-set for each automaton. The space complexity of the proposed method is efficient. ACCALA could find the correct number of clusters and produced compact and well-separated clusters. ACCALA could determines the accurate number of segments successfully.