面向现场服务设施位置优化选择的空间数据挖掘

A. Zarnani, M. Rahgozar, C. Lucas, F. Taghiyareh
{"title":"面向现场服务设施位置优化选择的空间数据挖掘","authors":"A. Zarnani, M. Rahgozar, C. Lucas, F. Taghiyareh","doi":"10.1109/CIDM.2007.368949","DOIUrl":null,"url":null,"abstract":"Spatial data mining has been developed as the effective technique in many applications that involve large amounts of geo-spatial data. Many organizations provide field-based services such as delivery, field-services and emergency to their customers. Considering the geographical distribution of the customer request points, the location of facilities will have noticeable impact on the overall efficiency of the company's operations. The closer the facilities are to the customers, the sooner and cheaper will be the service provision transaction. In this paper, we empirically study the role of spatial clustering methods in such context. We have implemented and tuned some of the main spatial clustering algorithms to discover the best locations for facility establishment. A new spatial clustering algorithm is proposed that does not require the number of facilities as input. The new algorithm will determine the optimal number of facilities along with their locations based on the business context trade-offs. Many experiments are conducted to study the performance of the studied algorithms on real world and synthetic data sets. The results reveal valuable distinctions between the different methods and confirm the higher efficiency of the proposed algorithm.","PeriodicalId":423707,"journal":{"name":"2007 IEEE Symposium on Computational Intelligence and Data Mining","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Spatial Data Mining for Optimized Selection of Facility Locations in Field-based Services\",\"authors\":\"A. Zarnani, M. Rahgozar, C. Lucas, F. Taghiyareh\",\"doi\":\"10.1109/CIDM.2007.368949\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Spatial data mining has been developed as the effective technique in many applications that involve large amounts of geo-spatial data. Many organizations provide field-based services such as delivery, field-services and emergency to their customers. Considering the geographical distribution of the customer request points, the location of facilities will have noticeable impact on the overall efficiency of the company's operations. The closer the facilities are to the customers, the sooner and cheaper will be the service provision transaction. In this paper, we empirically study the role of spatial clustering methods in such context. We have implemented and tuned some of the main spatial clustering algorithms to discover the best locations for facility establishment. A new spatial clustering algorithm is proposed that does not require the number of facilities as input. The new algorithm will determine the optimal number of facilities along with their locations based on the business context trade-offs. Many experiments are conducted to study the performance of the studied algorithms on real world and synthetic data sets. The results reveal valuable distinctions between the different methods and confirm the higher efficiency of the proposed algorithm.\",\"PeriodicalId\":423707,\"journal\":{\"name\":\"2007 IEEE Symposium on Computational Intelligence and Data Mining\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Symposium on Computational Intelligence and Data Mining\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIDM.2007.368949\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Symposium on Computational Intelligence and Data Mining","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIDM.2007.368949","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

空间数据挖掘技术已经发展成为涉及大量地理空间数据的许多应用的有效技术。许多组织为其客户提供交付、现场服务和应急等基于现场的服务。考虑到客户要求点的地理分布,设施的位置将对公司运营的整体效率产生明显的影响。设施离客户越近,提供服务的交易就会越快、越便宜。本文对空间聚类方法在这一背景下的作用进行了实证研究。我们已经实现和调整了一些主要的空间聚类算法,以发现设施建立的最佳位置。提出了一种不需要设施数量作为输入的空间聚类算法。新算法将根据业务环境权衡确定设施的最佳数量及其位置。为了研究所研究的算法在真实世界和合成数据集上的性能,进行了许多实验。结果揭示了不同方法之间有价值的区别,并证实了所提算法的较高效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spatial Data Mining for Optimized Selection of Facility Locations in Field-based Services
Spatial data mining has been developed as the effective technique in many applications that involve large amounts of geo-spatial data. Many organizations provide field-based services such as delivery, field-services and emergency to their customers. Considering the geographical distribution of the customer request points, the location of facilities will have noticeable impact on the overall efficiency of the company's operations. The closer the facilities are to the customers, the sooner and cheaper will be the service provision transaction. In this paper, we empirically study the role of spatial clustering methods in such context. We have implemented and tuned some of the main spatial clustering algorithms to discover the best locations for facility establishment. A new spatial clustering algorithm is proposed that does not require the number of facilities as input. The new algorithm will determine the optimal number of facilities along with their locations based on the business context trade-offs. Many experiments are conducted to study the performance of the studied algorithms on real world and synthetic data sets. The results reveal valuable distinctions between the different methods and confirm the higher efficiency of the proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信