Busy Line Analysis with Improved Association Rules Mining Algorithm for Hangzhou Public Free-Bicycle System

摘要

In China, Hangzhou is the first city to set up the Public Free-Bicycle System. There are many and many technology problems in the decision of intelligent dispatch. In this paper, we investigate the busy line of Hangzhou Public Free-Bicycle System with association rules mining algorithm. Actually, finding association rules is an important data mining problem and can be derived based on mining large frequent candidate sets. In this paper, a new procedure is proposed for efficient generating busy lines candidate set. At first, by passing over the cruel database only once, a rent-return database with entries 1 or 0 are set up. Then, the busy locations and busy lines candidate sets are obtained from the rent-return database. Finally, busy lines are mined from the busy lines candidate sets. Practice examples and comparison with the Apriori Algorithm are made on 4 rent-return databases with small, middle and large sizes from, the West Lake Scenic Zone. It is observed from the experiments that the proposed algorithm is efficient and robust.