English  |  正體中文  |  简体中文  |  Items with full text/Total items : 74010/74010 (100%)
Visitors : 24677731      Online Users : 245
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/68918

    Title: An Iterative Approach to Multi-Criteria Optimal Location Query
    Authors: 韓伯維;Harn,Po-wei
    Contributors: 資訊工程學系
    Keywords: 多標準最佳位置查詢;最佳位置選擇的更新問題;多標準最佳位置查詢的迭代方法;Multi-Criteria Optimal Location Query;Voronoi Diagram;Overlapped Voronoi Diagram;Minimum Overlapped Voronoi Diagram;Incremental Algorithm of Voronoi Diagram;Multi-criteria Optimal Location Query Updating Problem;MOVD Incremental Updating Approach;Incremental Updating Framework;Insertion Algorithm;Deletion Algorithm;Framework of the MOVD-based Solution;Fermat-Weber Point
    Date: 2015-08-06
    Issue Date: 2015-09-23 14:46:34 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 空間數據查詢像是最近鄰居與最佳位置查詢在文獻當中已被廣泛研究。在這篇論文中,我們提出一個多標準最佳位置查詢的迭代方法,這個迭代方法能應用在最佳位置選擇的更新問題。在提供關於更新問題的正式定義之後,我們提出一個增量更新的方法。這個方法以Minimum Overlapped Voronoi Diagram (MOVD) 新增刪除物件為基礎。除此之外,我們以數學來分析增量更新方法的複雜度。在效率評估上,我們的演算法是透過大量實驗數據來衡量。由結論可知,我們提出的演算法與最先進的解決方法相較之下,在點集合數量與物件種類少的時候,我們的演算法發揮較好執行效率。;Spatial queries such as nearest neighbor and optimal location queries have been extensively studied in the literature. In this thesis, we present an iterative approach to Multi-Criteria Optimal Location Queries which can be applied on the updating problem of the optimal location selection. After providing a formal definition of the updating problem, we propose an incremental updating approach based on insertion and deletion of an object to the Minimum Overlapped Voronoi Diagram (MOVD). In addition, we analyze the the complexity of our solution for the updating problem. The performance of our algorithm is evaluated through extensive experiments. The results show that our algorithm runs efficiently compared with the state-of-the-art solution when the size of the point sets and the number of types are small.
    Appears in Collections:[資訊工程研究所] 博碩士論文

    Files in This Item:

    File Description SizeFormat

    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明