Efficient clustering technique for regionalisation of a spatial database Online publication date: Fri, 25-Apr-2008
by Lokesh Kumar Sharma, Simon Scheider, Willy Kloesgen, Om Prakash Vyas
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 3, No. 1, 2008
Abstract: Regionalisation, a prominent problem from social geography, 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 distribution 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, e.g., direct mailing. It would be helpful to have specific purpose regions, depending on the kind of homogeneity one is interested in. In this paper, we propose an algorithm combining the 'spatial density' clustering approach and a covariance-based method to inductively find spatially dense and non spatially homogeneous clusters of arbitrary shape.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com