{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T03:40:59Z","timestamp":1767843659201,"version":"3.49.0"},"reference-count":27,"publisher":"Wiley","issue":"8","license":[{"start":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T00:00:00Z","timestamp":1577923200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2021,4,25]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>Geotagged data gathered from social media can be used to discover places\u2010of\u2010interest (PoIs) that have attracted many visitors. Since a PoI is generally identified by geographical coordinates of a single point, it is hard to match it with people trajectories. Therefore, we define an area, called <jats:italic>region\u2010of\u2010interest<\/jats:italic> (<jats:italic>RoI<\/jats:italic>), represented by the boundaries of a PoI. The main goal of this study is to discover RoIs from PoIs using spatial data mining techniques. In this paper, we propose a new parallel method for extracting RoIs from social media datasets. It consists of two main steps: (i) <jats:italic>automatic keyword extraction and data grouping<\/jats:italic> and (ii) <jats:italic>parallel RoI extraction<\/jats:italic>. The first step extracts keywords identifying the PoIs; these keywords are used to group social media items according to the places they refer to. The second step uses a Parallel Clustering Approach (ParCA) of spatial dataset to identify RoIs. ParCA exploits a parallel execution of DBSCAN on subsets of data to generate subclusters on each processing node and then merge overlapping subclusters to form global clusters. ParCA was implemented using the MapReduce model. Experiments performed over a set of PoIs in the city of Rome using social media data show that our approach is highly scalable and reaches an accuracy of 79% in detecting RoIs. On a parallel computer with 50 cores, we obtained a speedup of 52 by processing large datasets divided into 32 splits, compared with the execution time registered when each dataset is not partitioned.<\/jats:p>","DOI":"10.1002\/cpe.5638","type":"journal-article","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T10:51:29Z","timestamp":1577962289000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parallel extraction of Regions\u2010of\u2010Interest from social media data"],"prefix":"10.1002","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6324-8108","authenticated-orcid":false,"given":"Loris","family":"Belcastro","sequence":"first","affiliation":[{"name":"DIMES University of Calabria  Rende Italy"}]},{"given":"M. Tahar","family":"Kechadi","sequence":"additional","affiliation":[{"name":"Insight UCD  Dublin Ireland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7887-1314","authenticated-orcid":false,"given":"Fabrizio","family":"Marozzo","sequence":"additional","affiliation":[{"name":"DIMES University of Calabria  Rende Italy"}]},{"given":"Luca","family":"Pastore","sequence":"additional","affiliation":[{"name":"Insight UCD  Dublin Ireland"}]},{"given":"Domenico","family":"Talia","sequence":"additional","affiliation":[{"name":"DIMES University of Calabria  Rende Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5076-6544","authenticated-orcid":false,"given":"Paolo","family":"Trunfio","sequence":"additional","affiliation":[{"name":"DIMES University of Calabria  Rende Italy"}]}],"member":"311","published-online":{"date-parts":[[2020,1,2]]},"reference":[{"key":"e_1_2_7_2_1","volume-title":"Data Analysis in the Cloud","author":"Talia D","year":"2015"},{"key":"e_1_2_7_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525442"},{"key":"e_1_2_7_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-018-0547-5"},{"key":"e_1_2_7_5_1","doi-asserted-by":"crossref","unstructured":"YuanJ ZhengY ZhangL XieX SunG.Where to find my next passenger. In: Proceedings of the 13th International Conference on Ubiquitous Computing (UbiComp '11);2011;Beijing China.","DOI":"10.1145\/2030112.2030128"},{"issue":"2","key":"e_1_2_7_6_1","first-page":"586","article-title":"Trajectory pattern mining for urban computing in the cloud","volume":"28","author":"Altomare A","year":"2017","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"e_1_2_7_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154411"},{"key":"e_1_2_7_8_1","unstructured":"EsterM KriegelH\u2010P SanderJ XuX.A density\u2010based algorithm for discovering clusters a density\u2010based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96);1996;Portland OR."},{"key":"e_1_2_7_9_1","doi-asserted-by":"crossref","unstructured":"GhanemS KechadiT TariAK.New approach for distributed clustering. In: Proceedings of the 2011 IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services;2011;Fuzhou China.","DOI":"10.1109\/ICSDM.2011.5969005"},{"key":"e_1_2_7_10_1","doi-asserted-by":"crossref","unstructured":"GiannottiF NanniM PinelliF PedreschiD.Trajectory pattern mining. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '07);2007;San Jose CA.","DOI":"10.1145\/1281192.1281230"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1034115"},{"key":"e_1_2_7_12_1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein VI","year":"1966","journal-title":"Sov Phys Dokl"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1997.0550"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(99)00124-7"},{"key":"e_1_2_7_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.03.023"},{"key":"e_1_2_7_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"e_1_2_7_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12326-9_9"},{"key":"e_1_2_7_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.12.104"},{"key":"e_1_2_7_19_1","doi-asserted-by":"crossref","unstructured":"CesarioE CongedoC MarozzoF et al.Following soccer fans from geotagged tweets at FIFA World Cup 2014. In: Proceedings of the 2015 2nd IEEE International Conference on Spatial Data Mining and Geographical Knowledge Services (ICSDM);2015;Fuzhou China.","DOI":"10.1109\/ICSDM.2015.7298021"},{"key":"e_1_2_7_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2168752.2168770"},{"key":"e_1_2_7_21_1","doi-asserted-by":"crossref","unstructured":"KisilevichS MansmannF KeimD.P\u2010DBSCAN: a density based clustering algorithm for exploration and analysis of attractive areas using collections of geo\u2010tagged photos. In: Proceedings of the 1st International Conference and Exhibition on Computing for Geospatial Research & Application (COM.Geo '10);2010;Washington DC.","DOI":"10.1145\/1823854.1823897"},{"key":"e_1_2_7_22_1","doi-asserted-by":"crossref","unstructured":"YinZ CaoL HanJ LuoJ HuangTS.Diversified trajectory pattern ranking in geo\u2010tagged social media. In: Proceedings of the 2011 SIAM International Conference on Data Mining (SDM 11);2011;Mesa AZ.","DOI":"10.1137\/1.9781611972818.84"},{"key":"e_1_2_7_23_1","doi-asserted-by":"crossref","unstructured":"FerrariL RosiA MameiM ZambonelliF.Extracting urban patterns from location\u2010based social networks. In: Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location\u2010Based Social Networks (LBSN '11);2011;Chicago IL.","DOI":"10.1145\/2063212.2063226"},{"key":"e_1_2_7_24_1","doi-asserted-by":"crossref","unstructured":"J\u00e4rvP TammetT TallM.Hierarchical regions of interest. In: Proceedings of the 2018 19th IEEE International Conference on Mobile Data Management (MDM);2018;Aalborg Denmark.","DOI":"10.1109\/MDM.2018.00025"},{"key":"e_1_2_7_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.065"},{"key":"e_1_2_7_26_1","doi-asserted-by":"crossref","unstructured":"CesarioE IannazzoAR MarozzoF et al.Analyzing social media data to discover mobility patterns at EXPO 2015: Methodology and results. In: Proceedings of the 2016 International Conference on High Performance Computing and Simulation (HPCS 2016);2016;Innsbruck Austria.","DOI":"10.1109\/HPCSim.2016.7568340"},{"key":"e_1_2_7_27_1","doi-asserted-by":"crossref","unstructured":"ShiJ MamoulisN WuD CheungDW.Density\u2010based place clustering in geo\u2010social networks. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD '14);2014;Snowbird UT.","DOI":"10.1145\/2588555.2610497"},{"key":"e_1_2_7_28_1","doi-asserted-by":"publisher","DOI":"10.3390\/a10010035"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.5638","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5638","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.5638","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T04:17:06Z","timestamp":1693541826000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.5638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,2]]},"references-count":27,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2021,4,25]]}},"alternative-id":["10.1002\/cpe.5638"],"URL":"https:\/\/doi.org\/10.1002\/cpe.5638","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,2]]},"assertion":[{"value":"2019-03-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-11-18","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e5638"}}