Regionalisation as Spatial Data Mining Problem: A Comparative Study.

International Journal of Computer Trends and Technology (IJCTT)          
© May to June Issue 2011 by IJCTT Journal
Volume-1 Issue-2                          
Year of Publication : 2011
Authors :P V V S Srinivas, Susanta K Satpathy, Lokesh K Sharma, Ajaya K Akasapu


P V V S Srinivas, Susanta K Satpathy, Lokesh K Sharma, Ajaya K Akasapu "Regionalisation as Spatial Data Mining Problem: A Comparative Study"International Journal of Computer Trends and Technology (IJCTT),V1(2):152-155 May to June Issue 2011 .ISSN Published by Seventh Sense Research Group.

Abstract—Regionalisation, an important problem from socio - geography. It could be solved by a classification algorithm for grouping spatial objects. A typical task is to find spatially compact and dense regions of arbitrary shape with a homogeneous internal d istribution of social variables. Grouping a set of homogeneous spatial units to compose a larger region can be useful for sampling procedures as well as many applications such as customer segmentation. It would be helpful to have specific purpose regions, depending on the kind of homogeneity one is interested in. In this paper we perform comparative study on various regionalisation techniques available in literatures.


[1] L . K. Sharma, S. Scheider, W. Kloesgen and O . P. Vyas, “Efficient clustering technique for regionalisation of a spatial database”, Int. J. Business Intelligence and Data Mining, Vol. 3, No. 1, pp. 66 - 81, 2008.
[2] C. D. Juan, R. Raul, S. Jordi, “Supervised Regionalization Methods: a Survey”, Research I nstitute of Applied Economics, 2006.
[3] R. M. Assuncao, M. C. Neves, G. Câmara, and C. C. Freitas, "Efficient regionalization techniques for socio - economic geographical units using minimum spanning trees," Int. J. of Geographical Information Science, vol. 20 , no. 7, pp. 797 - 811, August 2006.
[4] S. Wise, R. Haining and J. Ma, “Providing spatial statistical data analysis functionality for the GIS user: the SAGE project”, Int. J. of Geographical Information Science, vol. 15, no. 3, pp. 239 – 254, 2001.
[5] S. Opensha w and L. Rao, “Algorithms for reengineering 1991 census geography”, Environment and Planning, vol. 27, no. 3, pp. 425 – 446, 1995.
[6] S. Openshaw and C. Wymer. Census Users Handbook, chapter Classifying and regionalizing census data, pages 239 – 270. Cambridge, UK, GeoInformation International, 1995.
[7] S. Alvanides, S. Openshaw and P. Rees, “Designing your own geographies. In The Census Data System”, P. Rees, D. Martin and P. Williamson (Ed.), pp. 47 - 65, 2002.
[8] R. Xu and D. Wunsch, “Survey of Clustering Algorithms” , IEEE Tran. on Neural Networks, vol. 16, no. 3, May 2005, pp. 645 - 678.
[9] M. Ester, H. P. Kriegel, J. Sander and X. Xu, “A Density - Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”. In: Proc. 2nd Int. Conf. on Knowledge Discover y and Data Mining (KDD’96), Portland, AAAI Press, pp. 291 - 316, 1996.
[10] S. W. Hess, J. B. Weaver, H. J. Siegfeld, J. N., Whelan and P. A. Zitlau, Nonpartisan political redistricting by computer. Operations Research, 13(6):998 – 1006, 1965.
[11] H. F. Kaiser, "An obj ective method for establishing legislative districts", Midwest Journal of Political Science, 10(2):200 – 213, 1966.
[12] G. Mills, “The determination of local government electoral boundaries”, Operational Research Quarterly, 18(3):243 – 255, 1967.
[13] F. Bacao, V. Lobo , and M. Painho, “Applying genetic algorithms to zone design. Soft Computing”, 9(5):341 – 348, 2005.
[14] D. GUO, "Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP)", Int. J. of Geographical Information Science Vol. 2 2, No. 7, July 2008, 801 – 823.
[15] J. C. Duque, Design of homogeneous territorial units. A Methodological Proposal and Applications. PhD thesis, University of Barcelona, 2004.

KeywordsSpatial Data Mining, Regionalisation, Spatial Cluster