2012
DOI: 10.1016/j.jag.2012.01.020
|View full text |Cite
|
Sign up to set email alerts
|

Community detection in spatial networks: Inferring land use from a planar graph of land cover objects

Abstract: Land cover to land use Modularity a b s t r a c tThis paper applies three algorithms for detecting communities within networks. It applies them to a network of land cover objects, identified in an OBIA, in order to identify areas of homogenous land use. Previous research on land cover to land use transformations has identified the need for rules and knowledge to merge land cover objects. This research shows that Walktrap, Spinglass and Fastgreedy algorithms are able to identify land use communities but with di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
26
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 31 publications
(26 citation statements)
references
References 45 publications
0
26
0
Order By: Relevance
“…This differs from other studies on land use, e.g. van der Kwast et al (2011) using regular grids, Comber et al (2012) using sub-graphs partitioned from a planar graph, and Hu and Wang (2013) using parcels. An existing urban land use map however may not be available for some areas.…”
Section: Discussionmentioning
confidence: 64%
See 4 more Smart Citations
“…This differs from other studies on land use, e.g. van der Kwast et al (2011) using regular grids, Comber et al (2012) using sub-graphs partitioned from a planar graph, and Hu and Wang (2013) using parcels. An existing urban land use map however may not be available for some areas.…”
Section: Discussionmentioning
confidence: 64%
“…Such a graph can represent the spatial relations between land cover objects, where a sub-graph corresponds to a basic land use unit. Interesting work on using graph-based methods for land use classification is given by Barnsley and Barr (1997); Comber et al (2012) and Walde et al (2014). The difficulty, however, is to effectively partition a graph into meaningful sub-graphs.…”
Section: Graph-based Methodsmentioning
confidence: 99%
See 3 more Smart Citations