This paper proposes a spatial clustering model based on self-organizing feature map and a composite distance measure, and studies the knowledge discovery from spatial database of spatial objects with non-spatial attributes. This paper gives the structure, algorithm of the spatial clustering model based on SOFM. We put forward a composite clustering statistic, which is calculated by both geograp...

All animals acquire knowledge about the topography of their immediate environment through direct exploration. Uniquely, humans also acquire geographical knowledge indirectly through exposure to maps and verbal information, resulting in a rich database of global geographical knowledge. We used transcranial magnetic stimulation to investigate the structure and neural basis of this critical but po...

Operating with ignorance is an important concern of geographical information science when the objective to discover knowledge from imperfect spatial data. Data mining (driven by discovery tools) about processing available (observed, known, and understood) samples data aiming build a model (e.g., classifier) handle that are not yet observed, or understood. These tools traditionally take semantic...

This paper brings together our findings on the importance of the geographical proximity and the network structure in the knowledge creation and sharing in Canadian biotechnology and nanotechnology. We find that most of the knowledge sharing occurs inside the geographical clusters or in the proximate distance. However, very distant or overseas collaborations are preferred over the mid-range dist...

Over the past ten years, a sub® eld of GIScience has been recognized that addresses the linkage between human thought regarding geographical space, and the mechanisms for implementing these concepts in computational models. This research areahas developed an identity through a series of successful international conferences and the establishment of a journal. It has also been complemented throug...

We present a novel geographical routing scheme for spontaneous wireless mesh networks. Greedy geographical routing has many advantages, but suffers from packet losses occurring at the border of voids. In this paper, we propose a flexible greedy routing scheme that can be adapted to any variant of geographical routing and works for any connectivity graph, not necessarily Unit Disk Graphs. The id...