Shared bicycle, as a green means of transportation, is very popular among people and it is an important way for many people to travel daily. In recent years, with the increasing scale and frequency of bike sharing system, the unbalanced use of shared bicycle has a great impact on the users' experience, which is one of the main problems faced by current system operators. of Division of the traffic area can not only provide a new idea for solving the problem of unbalanced bike usage, but also provide a theoretical and practical basis for the planning, layout, construction, operation and scientific dispatching of shared bicycle system. However, there are few clear methods to study the partition method of shared dispatching area. To solve this problem, based on historical bicycle data, traffic station data, we analyze the rules of shared bicycle space-time characteristics and propose a method of dividing shared bicycle dispatching areas by combining K-medoids clustering, association rules and total demand constraint adjustment. We evaluate our approach on the New York City (NYC Citi Bike) bicycle sharing system and show the advantages of our approach for Large-scale station-level dispatching area optimization (beyond baseline approaches).