<p>Recent years have witnessed the rapid growth of social network services. Real-world social networks are huge and changing over time. Consequently, the problems in this area have become more complex. Community detection is one of the most important problems in social networks. A good community can be defined as a group of nodes that are highly connected to each other and loosely connected to the nodes outside the community. Regarding the fact that social networks are huge in size, having complete information about the whole network is almost impossible. As a result, the problem of local community detection has become more popular in recent years. However, the problem of community detection in dynamic networks is well-investigated, the local community detection is not widely addressed by researchers in dynamic networks. In this paper, a dynamic local community detection algorithm is proposed. The purpose of the proposed algorithm is to explore the network as fast as possible and detect communities as well. Experimental results show that the proposed algorithm discovers the unknown parts of networks faster than similar algorithms. Also, the detected communities by the proposed algorithm outperform that of the compared algorithm in different snapshots.</p>