ネットワークＫ関数法におけるネットワークの詳細度の問題に関する研究

• 森田 匡俊

  名古屋大学大学院

書誌事項

タイトル別名

• A Study of K-functions at Different Levels of Detail of Network Data
• ネットワーク K カンスウホウ ニ オケル ネットワーク ノ ショウサイド ノ モンダイ ニ カンスル ケンキュウ

抄録

Spatial data are created at different levels of detail (LOD), for example, a road network is sometimes represented only by intercity roads or sometimes by both intercity and intracity roads. This difference in LOD causes a problem because it affects spatial analysis.<br>This paper deals with this LOD-dependent problem, specifically focusing on network K-function analysis, which is frequently conducted for interpreting point patterns. First, a mathematical model is developed based on a simple radial network. From this mathematical model, it is explicitly found that the lowest limit, K_low(h), of estimated K-values exists independently from the LOD of network data. Second, to extend the considerations into K-functions to actually observed networks, road network data are considered in which K-values are computed using Monte Carlo simulation. The obtained K-values imply that the lowest limit, K_low(h), also exists in networks in the real world. This result suggests that spatial analysts are empirically, in some cases, able to interpret point patterns without taking into account the LOD of network data.

収録刊行物

• 地理学評論

  地理学評論 81 (4), 179-196, 2008

  公益社団法人 日本地理学会

キーワード

• ネットワークの詳細度
• 空間分析
• 点パターン分析
• <i>K</i>関数法

詳細情報

• CRID: 1390282680181110784
• NII論文ID: 10025831072
• NII書誌ID: AA11591990
• DOI: 10.4157/grj.81.179
• ISSN: 21851727
• ISSN: 13479555
• NDL書誌ID: 9495049
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I9495049
• 本文言語コード: ja
• データソース種別:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可