Improved Clustering Algorithm of Spatial Data Structure Based on Matlab Simulink

Article Preview

Abstract:

This paper has introduced the clustering algorithm into the model of urban tourism destination consumption structure, and has used MATLAB programming algorithm to improve the calculation model of consumption structure for tourism destination, which has obtained the spatial data model of the consumption structure. The model roundly considers the influence of geographical location, cultural factors, political factors and economic factors, and it establishes new clustering algorithm model with four coefficients, and has realized the algorithm by the use of MATLAB programming. Finally, the consumption structure of the same destination in different provinces is calculated by using the spatial system model, which has obtained the calculation curve of consumption space structure and the clustering results, and has provided technical reference for the research on consumption of urban tourism destination.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

98-102

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Ning Fu, Liyan Qiao, Xiyuan Peng. Blind recovery of mixing matrix with sparse sources based on improved K-means clustering and Hough transform. Chinese journal of electronics, 2011, 37 (4A): 92-96.

Google Scholar

[2] Yan Song, Anan Liu, Yongdong Zhang, Shouxun Lin. Method of video letter extraction based on clustering. Journal on communications, 2011, 30 (2): 136-140.

Google Scholar

[3] Yingxian Lu. Research on customer segmentation method of telecommunication enterprise . Dalian: Dalian University of Technology, 2011: 1-11.

Google Scholar

[4] Tao Zhou. Adaptive rough K-means clustering algorithm. Computer engineering and application, 2010, 46 (26): 7-10.

Google Scholar

[5] Yue Qian, Shan Feng. The system analysis for computational performance of the genetic algorithms. Chinese Journal of computers, 2011, 32 (12): 2389-2392.

Google Scholar

[6] Jiangning Wu, Qiaofeng Liu. Text similarity computing based on maximum common subgraph . Journal of the China Society for Scientific andTechnical Information, 2010, 29 (5): 785-791.

Google Scholar

[7] Peng Zhao, Qingsheng Cai, Qingyi Wang, et al. An automatic keyword extraction of Chinese document algorithm based on complex network features. Pattern recognition and artificial intelligence, 2012, 20 (6): 827-831.

Google Scholar

[8] Yang Zhao, Junzhong Ji, Wenbin Li. Combining classifiers fusion based on complex network. Science technology and engineering, 2011, (14): 3827-3830.

Google Scholar

[9] Junhua Li, Ming Li, Lihua Yuan. Clustering based on Pseudo-Parallel genetic algorithms. Pattern recognition and artificial intelligence, 2010, 22 (2): 188-194.

Google Scholar

[10] Jian Zhuang, Qingyu Yang, Haifeng Du, Dehong Yu. High efficient complex system genetic algorithm. Journal of software, 2010, 21 (11): 2790-2801.

DOI: 10.3724/sp.j.1001.2010.03673

Google Scholar

[11] Kang Wang, Xuesong Yan, Jian Jin, Zhigang Zhan. An improved genetic K-means clustering algorithm. Computer & Digital Engineering, 2010, 38 (1): 18-20.

Google Scholar

[12] Biao Wang, Chanlun Duan, Hao Wu, Yonggang Song. Research and application of rough sets and fuzzy sets. Beijing: Publishing House of electronics industry, 2011: 1-8.

Google Scholar