{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:58:08Z","timestamp":1760241488197,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T00:00:00Z","timestamp":1521849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education","award":["NRF-2017R1D1A1A09000706"],"award-info":[{"award-number":["NRF-2017R1D1A1A09000706"]}]},{"name":"National IT Industry Promotion Agency (NIPA) grant funded by the Korea government (MSIT) (Development of Integrated Safety Management System for the Prevention of Industrial Accidents in Shipyard)","award":["S0607-18-1003"],"award-info":[{"award-number":["S0607-18-1003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In this paper, we are interested in computing ZIP code proximity from two perspectives, proximity between two ZIP codes (Ad-Hoc) and neighborhood proximity (Top-K). Such a computation can be used for ZIP code-based target marketing as one of the smart city applications. A na\u00efve approach to this computation is the usage of the distance between ZIP codes. We redefine a distance metric combining the centroid distance with the intersecting road network between ZIP codes by using a weighted sum method. Furthermore, we prove that the results of our combined approach conform to the characteristics of distance measurement. We have proposed a general and heuristic approach for computing Ad-Hoc proximity, while for computing Top-K proximity, we have proposed a general approach only. Our experimental results indicate that our approaches are verifiable and effective in reducing the execution time and search space.<\/jats:p>","DOI":"10.3390\/s18040965","type":"journal-article","created":{"date-parts":[[2018,3,26]],"date-time":"2018-03-26T03:43:29Z","timestamp":1522035809000},"page":"965","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Proximity Computation Techniques Using ZIP Code Data for Smart Cities"],"prefix":"10.3390","volume":"18","author":[{"given":"Muhammad","family":"Murdani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8207-9415","authenticated-orcid":false,"given":"Joonho","family":"Kwon","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Pusan National University, Busan 46241, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3556-5082","authenticated-orcid":false,"given":"Yoon-Ho","family":"Choi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Pusan National University, Busan 46241, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bonghee","family":"Hong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Pusan National University, Busan 46241, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,3,24]]},"reference":[{"key":"ref_1","first-page":"191","article-title":"A Survey on Proximity Measures for Social Networks","volume":"Volume 7538","author":"Cohen","year":"2012","journal-title":"SeCO Book"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2456","DOI":"10.1109\/COMST.2017.2736886","article-title":"Smart Cities: A Survey on Data Management, Security, and Enabling Technologies","volume":"19","author":"Gharaibeh","year":"2017","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_3","unstructured":"The United States Postal Service (2018, March 22). The History of the United States Postal Service > The 20th Century > ZIP Code. Available online: http:\/\/about.usps.com\/publications\/pub100\/pub100_029.htm."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Lyritsis, A., Papadopoulos, A.N., and Manolopoulos, Y. (2011, January 21\u201324). TAGs: Scalable threshold-based algorithms for proximity computation in graphs. Proceedings of the 14th International Conference on Extending Database Technology, Uppsala, Sweden.","DOI":"10.1145\/1951365.1951402"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Tong, H., Faloutsos, C., and Pan, J.Y. (2006, January 18\u201322). Fast Random Walk with Restart and Its Applications. Proceedings of the 6th IEEE International Conference on Data Mining, Hong Kong, China.","DOI":"10.1109\/ICDM.2006.70"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zheng, K., Su, H., Zheng, B., Shang, S., Xu, J., Liu, J., and Zhou, X. (2015, January 13\u201317). Interactive Top-k Spatial Keyword queries. Proceedings of the 31st IEEE International Conference on Data Engineering, Seoul, Korea.","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"ref_7","unstructured":"Tsatsanifos, G., and Vlachou, A. (2015, January 23\u201327). On Processing Top-k Spatio-Textual Preference Queries. Proceedings of the 18th International Conference on Extending Database Technology, Brussels, Belgium."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Carmel, D., Zwerdling, N., Guy, I., Ofek-Koifman, S., Har\u2019El, N., Ronen, I., Uziel, E., Yogev, S., and Chernov, S. (2009, January 2\u20136). Personalized social search based on the user\u2019s social network. Proceedings of the 18th ACM Conference on Information and Knowledge Management, Hong Kong, China.","DOI":"10.1145\/1645953.1646109"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., and Kleinberg, J.M. (2003, January 3\u20138). The link prediction problem for social networks. Proceedings of the 2003 ACM CIKM International Conference on Information and Knowledge Managemen, New Orleans, LA, USA.","DOI":"10.1145\/956863.956972"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1140\/epjb\/e2009-00335-8","article-title":"Predicting missing links via local information","volume":"71","author":"Zhou","year":"2009","journal-title":"Eur. Phys. J. B Condens. Matter Complex Syst."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1002\/asi.20591","article-title":"The link-prediction problem for social networks","volume":"58","author":"Kleinberg","year":"2007","journal-title":"J. Am. Soc. Inf. Sci. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/1005566.1005569","article-title":"Evaluating Top-k Queries over Web-accessible Databases","volume":"29","author":"Marian","year":"2004","journal-title":"ACM Trans. Database Syst."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Ilyas, I.F., Beskales, G., and Soliman, M.A. (2008). A Survey of Top-k Query Processing Techniques in Relational Database Systems. ACM Comput. Surv., 40.","DOI":"10.1145\/1391729.1391730"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TKDE.2010.119","article-title":"Ranking Spatial Data by Quality Preferences","volume":"23","author":"Yiu","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_15","unstructured":"Chen, L., Cong, G., Jensen, C.S., and Wu, D. (2013, January 26\u201330). Spatial Keyword Query Processing: An Experimental Evaluation. Proceedings of the 39th International Conference on Very Large Data Bases, Trento, Italy."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s10115-013-0696-9","article-title":"ALPS: An efficient algorithm for top-k spatial preference search in road networks","volume":"42","author":"Cho","year":"2015","journal-title":"Knowl. Inf. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.pmcj.2014.07.002","article-title":"A collaborative approach to moving k-nearest neighbor queries in directed and dynamic road networks","volume":"17","author":"Cho","year":"2015","journal-title":"Pervasive Mob. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.knosys.2015.11.009","article-title":"Efficient reverse spatial and textual k nearest neighbor queries on road networks","volume":"93","author":"Luo","year":"2016","journal-title":"Knowl. Based Syst."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Murdani, M.H., and Kwon, J. (2013, January 22\u201325). Measuring Proximity in a Graph of Spatial Data (ZIP Codes). Proceedings of the First International Workshop on Big Data Management and Analytics, Wuhan, China.","DOI":"10.1007\/978-3-642-40270-8_7"},{"key":"ref_20","unstructured":"United States Census Bureau (2018, March 22). 2012 TIGER\/Line\u00aeShapefiles, Available online: http:\/\/www.census.gov\/geo\/maps-data\/data\/tiger-line.html."},{"key":"ref_21","unstructured":"Knuth, D.E. (1997). The Art of Computer Programming, Addison Wesley Longman Publishing Co., Inc.. [3rd ed.]. Volume 1: Fundamental Algorithms."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A Note on Two Problems in Connexion with Graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_24","unstructured":"MapTechnica (2013, July 22). GIS Geodata Products. Available online: http:\/\/www.maptechnica.com."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Guttman, A. (1984, January 18\u201321). R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, Boston, MA, USA.","DOI":"10.1145\/602259.602266"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","article-title":"Survey of multi-objective optimization methods for engineering","volume":"26","author":"Marker","year":"2004","journal-title":"Struct. Multidiscip. Optim."},{"key":"ref_27","unstructured":"Neo4j (2018, March 22). The World\u2019s Leading Graph Database. Available online: http:\/\/www.neo4j.org\/."},{"key":"ref_28","unstructured":"PostGIS (2018, March 22). Spatial and Geographic objects for PostgreSQL. Available online: http:\/\/postgis.net\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/4\/965\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T14:58:24Z","timestamp":1760194704000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/4\/965"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,24]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["s18040965"],"URL":"https:\/\/doi.org\/10.3390\/s18040965","relation":{},"ISSN":["1424-8220"],"issn-type":[{"type":"electronic","value":"1424-8220"}],"subject":[],"published":{"date-parts":[[2018,3,24]]}}}