By Topic

Study on Regional Division Based on Self-Adaptive FCM Clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Shengdong Li ; Chinese Inf. Process. Res. Center, Beijing Inf. Sci. & Technol. Univ., Beijing, China ; Xueqiang Lv ; Feng Ling ; Shuicai Shi

Through researching and analyzing self-adaptive strategy and fuzzy C-means (FCM) clustering algorithm, we put them together to form a self-adaptive FCM clustering algorithm. It is a good solution to the problem of local optimum as well as sensitivity to the initial value for the traditional FCM clustering algorithm. Finally, the new algorithm has been used in the regional division of police patrols in a city. In the division of the region, it has been proved by experiments that the sum of distance between a police vehicle and each possible accident scene can achieve the minimum value, which shows a significant effect of police patrols. And through the improved dijkstra algorithm to calculate shortest path length between a police vehicle and an accident scene, it proves that a police vehicle in the division of the region arrives at an accident scene within three minutes after accepting the warnings, whose proportion is 90.2%.

Published in:

Biomedical Engineering and Computer Science (ICBECS), 2010 International Conference on

Date of Conference:

23-25 April 2010