skip to main content
10.1145/2786006.2786010acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Geo-Social Co-location Mining

Published: 31 May 2015 Publication History

Abstract

Modern technology to capture geo-spatial information produces a huge flood of geo-spatial and geo-spatio-temporal data with a new user mentality of utilizing this technology to voluntarily share information. This location information, enriched with social information, is a new source to discover new and useful knowledge. This work introduces geo-social co-location mining, the problem of finding social groups that are frequently found at the same location. This problem has applications in social sciences, allowing to research interactions between social groups and permitting social-link prediction. It can be divided into two sub-problems. The first sub-problem of finding spatial co-location instances, requires to properly address the inherent uncertainty in geo-social network data, which is a consequence of generally very sparse check-in data, and thus very sparse trajectory information. For this purpose, we propose a probabilistic model to estimate the probability of a user to be located at a given location at a given time, creating the notion of probabilistic co-locations. The second sub-problem of mining the resulting probabilistic co-location instances requires efficient methods for large databases having a high degree of uncertainty. Our approach solves this problem by extending solutions for probabilistic frequent itemset mining. Our experimental evaluation performed on real (but anonymized) geo-social network data shows the high efficiency of our approach, and its ability to find new social interactions.

References

[1]
C. Aggarwal, Y. Li, J. Wang, and J. Wang. Frequent pattern mining with uncertain data. In Proc. KDD, pages 29--38, 2009.
[2]
R. Agrawal, T. Imieliński, and A. Swami. Mining association rules between sets of items in large databases. In ACM SIGMOD Record, volume 22, pages 207--216. ACM, 1993.
[3]
C. Berge. Graphs and hypergraphs, volume 6. Elsevier, 1976.
[4]
T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Züfle. Probabilistic frequent itemset mining in uncertain databases. In Proc. KDD, pages 119--128, 2009.
[5]
T. Bernecker, H.-P. Kriegel, M. Renz, F. Verhein, and A. Züfle. Probabilistic frequent pattern growth for itemset mining in uncertain databases. In Scientific and Statistical Database Management, pages 38--55. 2012.
[6]
T. Bernecker, H.-P. Kriegel, M. Renz, and A. Züfle. Hot item detection in uncertain data. In Proc. PAKDD, 2009.
[7]
T. Calders, C. Garboni, and B. Goethals. Approximation of frequentness probability of itemsets in uncertain data. In Data Mining (ICDM), 2010 IEEE 10th International Conference on, pages 749--754. IEEE, 2010.
[8]
E. Cho, S. A. Myers, and J. Leskovec. Friendship and mobility: user movement in location-based social networks. In Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1082--1090. ACM, 2011.
[9]
C.-Y. Chow, M. F. Mokbel, and W. G. Aref. Casper*: Query processing for location services without compromising privacy. ACM TODS, 34(4):24, 2009.
[10]
C. K. Chui and B. Kao. A decremental approach for mining frequent itemsets from uncertain data. In Proc. PAKDD, pages 64--75, 2008.
[11]
C.-K. Chui, B. Kao, and E. Hung. Mining frequent itemsets from uncertain data. In In Proceedings of the 11th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-2007), Nanjing, China, May 22--25, pages 47--58, 2007.
[12]
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. Proc. SIGMOD, 29:1--12, 2000.
[13]
Y. Huang, J. Pei, and H. Xiong. Mining co-location patterns with rare events from spatial data sets. In Geoinformatica, volume 10, pages 239--260, 2006.
[14]
Y. Huang, S. Shekhar, and H. Xiong. Discovering co-location patterns from spatial data sets: A general approach. In IEEE TKDE, volume 16, pages 1472--1485, 2004.
[15]
Y. Huang, L. Zhang, and P. Zhang. Finding sequential patterns from a massive number of spatio-temporal events. In Proc. SDM, 2006.
[16]
Y. Kozawa, T. Amagasa, and H. Kitagawa. Gpu acceleration of probabilistic frequent itemset mining from uncertain databases. In Proceedings of the 21st ACM international conference on Information and knowledge management, pages 892--901, 2012.
[17]
C. K.-S. Leung, C. L. Carmichael, and B. Hao. Efficient mining of frequent patterns from uncertain data. In ICDMW '07: Proceedings of the Seventh IEEE International Conference on Data Mining Workshops, pages 489--494, 2007.
[18]
J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. Proc. VLDB, 2(1):502--513, 2009.
[19]
J. Li, B. Saha, and A. Deshpande. A unified approach to ranking in probabilistic databases. VLDB Journal, 20(2):249--275, 2011.
[20]
J. Li, Z. Zou, and H. Gao. Mining frequent subgraphs over uncertain graph databases under probabilistic semantics. The VLDB Journal, 21:753--777, 2012.
[21]
N. Mamoulis. Co-location pattern. In Encyclopedia of GIS, page 98. 2008.
[22]
N. Mamoulis. Co-location patterns, algorithms. In Encyclopedia of GIS, pages 103--107. 2008.
[23]
J. Niedermayer, A. Züfle, T. Emrich, M. Renz, N. Mamoulis, L. Chen, and H. Kriegel. Probabilistic nearest neighbor queries on uncertain moving object trajectories. PVLDB, 7(3):205--216, 2013.
[24]
S. Shekhar and Y. Huang. Co-location rules mining: A summary of results. In Proc. SSTD, pages 236--256, 2001.
[25]
Y. Tong, L. Chen, Y. Cheng, and P. S. Yu. Mining frequent itemsets over uncertain databases. 5(11):1650--1661, 2012.
[26]
L. Wang, R. Cheng, S. D. Lee, and D. Cheung. Accelerating probabilistic frequent itemset mining: a model-based approach. In Proc. CIKM, pages 429--438, 2010.
[27]
L. Wang, D.-L. Cheung, R. Cheng, S.-D. Lee, and X. Yang. Efficient mining of frequent item sets on large uncertain databases. Knowledge and Data Engineering, IEEE Transactions on, 24(12):2170--2183, 2012.
[28]
L. Wang, P. Wu, and H. Chen. Finding probabilistic prevalent colocations in spatially uncertain data sets. IEEE Transactions on Knowledge and Data Engineering, 25(4):790--804, 2013.
[29]
H. Xiong, S. Shekhar, Y. Huang, V. Kumar, X. Ma, and J. S. Yoo. A framework for discovering co-location patterns in data sets with extended spatial objects. In SDM, pages 78--89, 2004.
[30]
Q. Zhang, F. Li, and K. Yi. Finding frequent items in probabilistic data. In Proc. SIGMOD, pages 819--832, 2008.
[31]
X. Zhang, N. Mamoulis, D. W. Cheung, and Y. Shou. Fast mining of spatial collocations. In Proc. KDD, pages 384--393, 2004.
[32]
Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In Proc. KDD, pages 633--642, 2010.
[33]
Z. Zou, J. Li, H. Gao, and S. Zhang. Mining frequent subgraph patterns from uncertain graph data. Knowledge and Data Engineering, IEEE Transactions on, 22(9):1203--1218, 2010.

Cited By

View all
  • (2024)A Complete and Comprehensive Semantic Perception of Mobile Traveling for Mobile Communication ServicesIEEE Internet of Things Journal10.1109/JIOT.2023.330747811:3(5467-5490)Online publication date: 1-Feb-2024
  • (2021)On the Transition of Social Interaction from In-Person to Online: Predicting Changes in Social Media Usage of College Students during the COVID-19 Pandemic based on Pre-COVID-19 On-Campus ColocationProceedings of the 2021 International Conference on Multimodal Interaction10.1145/3462244.3479888(425-434)Online publication date: 18-Oct-2021
  • (2020)From Data to Rhizomes: Applying a Geographical Concept to Understand the Mobility of Tourists from Geo-Located TweetsInformatics10.3390/informatics80100018:1(1)Online publication date: 24-Dec-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
GeoRich'15: Second International ACM Workshop on Managing and Mining Enriched Geo-Spatial Data
May 2015
44 pages
ISBN:9781450336680
DOI:10.1145/2786006
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 31 May 2015

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

SIGMOD/PODS'15
Sponsor:
SIGMOD/PODS'15: International Conference on Management of Data
May 31 - June 4, 2015
VIC, Melbourne, Australia

Acceptance Rates

GeoRich'15 Paper Acceptance Rate 5 of 13 submissions, 38%;
Overall Acceptance Rate 25 of 50 submissions, 50%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)8
  • Downloads (Last 6 weeks)4
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2024)A Complete and Comprehensive Semantic Perception of Mobile Traveling for Mobile Communication ServicesIEEE Internet of Things Journal10.1109/JIOT.2023.330747811:3(5467-5490)Online publication date: 1-Feb-2024
  • (2021)On the Transition of Social Interaction from In-Person to Online: Predicting Changes in Social Media Usage of College Students during the COVID-19 Pandemic based on Pre-COVID-19 On-Campus ColocationProceedings of the 2021 International Conference on Multimodal Interaction10.1145/3462244.3479888(425-434)Online publication date: 18-Oct-2021
  • (2020)From Data to Rhizomes: Applying a Geographical Concept to Understand the Mobility of Tourists from Geo-Located TweetsInformatics10.3390/informatics80100018:1(1)Online publication date: 24-Dec-2020
  • (2020)Spatial Association Pattern Mining Using In-Memory Computational FrameworkBig Data – BigData 202010.1007/978-3-030-59612-5_17(239-246)Online publication date: 18-Sep-2020
  • (2019)A framework for generating condensed co-location sets from spatial databasesIntelligent Data Analysis10.3233/IDA-17375223:2(333-355)Online publication date: 4-Apr-2019
  • (2019)Parallel Algorithm for Spatial Data Mining Using CUDAJOURNAL OF ADVANCED INFORMATION TECHNOLOGY AND CONVERGENCE10.14801/JAITC.2019.9.2.899:2(89-97)Online publication date: 31-Dec-2019
  • (2019)Seed-Driven Geo-Social Data ExtractionProceedings of the 16th International Symposium on Spatial and Temporal Databases10.1145/3340964.3340973(11-20)Online publication date: 19-Aug-2019
  • (2019)Computing Co-location Patterns in Spatial Data with Extended Objects: a Scalable Buffer-based ApproachIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2930598(1-1)Online publication date: 2019
  • (2019)Parallel co-location mining with MapReduce and NoSQL systemsKnowledge and Information Systems10.1007/s10115-019-01381-yOnline publication date: 21-Aug-2019
  • (2018)Research on Spatial Co-Locations Mining: A SurveyComputer Science and Application10.12677/CSA.2018.8303808:03(328-338)Online publication date: 2018
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media