Redirigiendo al acceso original de articulo en 21 segundos...
ARTÍCULO
TITULO

Searching for an Optimal Hexagonal Shaped Enumeration Unit Size for Effective Spatial Pattern Recognition in Choropleth Maps

Izabela Karsznia    
Izabela Malgorzata Golebiowska    
Jolanta Korycka-Skorupa and Tomasz Nowacki    

Resumen

Thoughtful consideration of the enumeration unit size in choropleth map design is important to ensure the correct communication of spatial information. However, the enumeration unit size and its influence on pattern conveying in choropleth maps have not yet been the subject of in-depth empirical studies. This research aims to address this gap. We focused on the issue concerning whether the ability to recognize spatial patterns on an Equal Area Unit Map is related to the hexagonal enumeration unit size, defined by the number of pixels. The aim is to indicate the range of the enumeration unit sizes, namely, at what point the upper and lower borders of the range where the spatial patterns start, and where the end is visible and recognizable by users. To address this problem, we conducted an empirical study with 488 users. The results show that the enumeration unit size has an impact on the users? spatial pattern recognition abilities. Choropleth maps with enumeration unit sizes of 26, 52, and 104 pixels were, in the majority, indicated by participants as those most suitable for indicating spatial patterns. This was in contrast to choropleth maps with enumeration unit sizes of 1664 and 3328 pixels, which users indicated as not being useful. However, there were some exceptions to this general finding. Thus, determining the optimal enumeration unit size is a challenging task, and requires further insightful investigations.

 Artículos similares

       
 
Gabriella Kicska and Attila Kiss    
Nowadays, the high-dimensionality of data causes a variety of problems in machine learning. It is necessary to reduce the feature number by selecting only the most relevant of them. Different approaches called Feature Selection are used for this task. In... ver más

 
Rong Yang and Baoning Niu    
Continuous k nearest neighbor queries over spatial?textual data streams (abbreviated as CkQST) are the core operations of numerous location-based publish/subscribe systems. Such a system is usually subscribed with millions of CkQST and evaluated simultan... ver más

 
Xiao Zhou, Mingzhan Su, Zhong Liu, Yu Hu, Bin Sun and Guanghui Feng    
A smart tour route planning algorithm based on a Naïve Bayes interest data mining machine learning is brought forward in the paper, according to the problems of current tour route planning methods. A machine learning model of Naïve Bayes interest data mi... ver más

 
Jingpu Wang, Xin Song and Yatao Ma    
Non-orthogonal multiple access (NOMA) has become a promising technology for 5G. With the support of effective resource allocation algorithms, it can improve the spectrum resource utilization and system throughput. In this article, a new resource allocati... ver más
Revista: Future Internet

 
Arun Onlam, Daranpob Yodphet, Rongrit Chatthaworn, Chayada Surawanitkun, Apirat Siritaratiwat and Pirat Khunkitti    
This paper proposes a novel adaptive optimization algorithm to solve the network reconfiguration and distributed generation (DG) placement problems with objective functions including power loss minimization and voltage stability index (VSI) improvement. ... ver más
Revista: Energies