skip to main content
10.1145/2623330.2623724acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

On social event organization

Published: 24 August 2014 Publication History

Abstract

Online platforms, such as Meetup and Plancast, have recently become popular for planning gatherings and event organization. However, there is a surprising lack of studies on how to effectively and efficiently organize social events for a large group of people through such platforms. In this paper, we study the key computational problem involved in organization of social events, to our best knowledge, for the first time.
We propose the Social Event Organization (SEO) problem as one of assigning a set of events for a group of users to attend, where the users are socially connected with each other and have innate levels of interest in those events. As a first step toward Social Event Organization, we introduce a formal definition of a restricted version of the problem and show that it is NP-hard and is hard to approximate. We propose efficient heuristic algorithms that improve upon simple greedy algorithms by incorporating the notion of phantom events and by using look-ahead estimation. Using synthetic datasets and three real datasets including those from the platforms Meetup and Plancast, we experimentally demonstrate that our greedy heuristics are scalable and furthermore outperform the baseline algorithms significantly in terms of achieving superior social welfare.

Supplementary Material

MP4 File (p1206-sidebyside.mp4)

References

[1]
W. Aiello, F. R. K. Chung, and L. Lu. A random graph model for massive graphs. In STOC, pages 171--180, 2000.
[2]
S. Amer-Yahia, S. B. Roy, A. Chawla, G. Das, and C. Yu. Group recommendation: Semantics and efficiency. PVLDB, 2(1), 2009.
[3]
A. Anagnostopoulos et al. Online team formation in social networks. In WWW, 2012.
[4]
N. Armenatzoglou, S. Papadopoulos, and D. Papadias. A general framework for geo-social query processing. PVLDB, 6(10), 2013.
[5]
P. Biró et al. The college admissions problem with lower and common quotas. Theor. Comput. Sci, 411(34--36):3136--3153, 2010.
[6]
C. Chekuri and S. Khanna. A ptas for the multiple knapsack problem. In SODA, 2000.
[7]
L. Fleischer et al. Tight approximation algorithms for maximum general assignment problems. In SODA, 2006.
[8]
D. Gale and L. S. Shapley. College admissions and the stability of marriage. Amer. Math. Monthly, 69, 1962.
[9]
K. Hamada, K. Iwama, and S.Miyazaki. The hospitals/ residents problem with quota lower bounds. In MATCH-UP: Matching Under Preferences Workshop at ICALP, 2008.
[10]
L. Katz. A new status index derived from sociometric analysis. Psychometrika, 18(1), 1953.
[11]
S. Khot. On the power of unique 2-prover 1-round games. STOC, 2002.
[12]
S. O. Krumke and C. Thielen. The generalized assignment problem with minimum quantities. European Journal of Operational Research, 2013.
[13]
T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, 2009.
[14]
D. Liben-Nowell and J. Kleinberg. The link-prediction problem for social networks. Journal of the American society for information science and technology, 58(7), 2007.
[15]
X. Liu et al. Event-based social networks: linking the online and offline social worlds. In KDD, 2012.
[16]
E. Petrank. The hardness of approximations: Gap location. Computational Complexity, 4:133--157, 1994.
[17]
A.-K. Pietilainen and C. Diot. CRAWDAD data set thlab/sigcomm2009 (v. 2012-07-15). Downloaded from http://crawdad.cs.dartmouth.edu/thlab/sigcomm2009, 2012.
[18]
P. Raghavendra and D. Steurer. Graph expansion and the unique games conjecture. In STOC, 2010.
[19]
A. E. Roth. The evolution of the labor market for medical interns and residents: a case study in game theory. Journal of Political Economy, 6(4):991--1016, 1984.
[20]
D. B. Shmoys et al. An approximation algorithm for the generalized assignment problem. Math. Program., 62:461--474, 1993.
[21]
M. Sozio and A. Gionis. The community-search problem and how to plan a successful cocktail party. In KDD, pages 939--948, 2010.

Cited By

View all
  • (2024)Uncertainty-guided Boundary Learning for Imbalanced Social Event DetectionIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3324510(1-14)Online publication date: 2024
  • (2023)Joint knowledge graph approach for event participant prediction with social media retweetingKnowledge and Information Systems10.1007/s10115-023-02015-066:3(2115-2133)Online publication date: 27-Nov-2023
  • (2022)Cross-Domain Event Participant Prediction with Public Event Description2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAIAAI55812.2022.00017(33-38)Online publication date: Jul-2022
  • Show More Cited By

Index Terms

  1. On social event organization

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    KDD '14: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
    August 2014
    2028 pages
    ISBN:9781450329569
    DOI:10.1145/2623330
    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 ACM 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: 24 August 2014

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. assignment problems
    2. event organization
    3. social networks

    Qualifiers

    • Research-article

    Conference

    KDD '14
    Sponsor:

    Acceptance Rates

    KDD '14 Paper Acceptance Rate 151 of 1,036 submissions, 15%;
    Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

    Upcoming Conference

    KDD '25

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)41
    • Downloads (Last 6 weeks)10
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Uncertainty-guided Boundary Learning for Imbalanced Social Event DetectionIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.3324510(1-14)Online publication date: 2024
    • (2023)Joint knowledge graph approach for event participant prediction with social media retweetingKnowledge and Information Systems10.1007/s10115-023-02015-066:3(2115-2133)Online publication date: 27-Nov-2023
    • (2022)Cross-Domain Event Participant Prediction with Public Event Description2022 12th International Congress on Advanced Applied Informatics (IIAI-AAI)10.1109/IIAIAAI55812.2022.00017(33-38)Online publication date: Jul-2022
    • (2022)A Multi-factor Activity Arrangement Method Based on EBSN for Different Users2022 International Conference on Informatics, Networking and Computing (ICINC)10.1109/ICINC58035.2022.00020(58-64)Online publication date: Oct-2022
    • (2022)Utilizing Social Media Retweeting for Improving Event Participant PredictionWeb Information Systems Engineering – WISE 202210.1007/978-3-031-20891-1_1(3-10)Online publication date: 7-Nov-2022
    • (2022)Fatigue-Aware Event-Participant Arrangement in Event-Based Social Networks: An Upper Confidence Bound MethodIntelligent Systems and Applications10.1007/978-3-031-16078-3_54(780-796)Online publication date: 1-Sep-2022
    • (2021)From Symbols to Embeddings: A Tale of Two Representations in Computational Social ScienceJournal of Social Computing10.23919/JSC.2021.00112:2(103-156)Online publication date: Jun-2021
    • (2021)Platform-Oriented Event Time AllocationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2021.3109838(1-1)Online publication date: 2021
    • (2021)Hadoop-MTA: a system for Multi Data-center Trillion Concepts Auto-ML atop Hadoop2021 IEEE International Conference on Big Data (Big Data)10.1109/BigData52589.2021.9671617(5953-5955)Online publication date: 15-Dec-2021
    • (2021)BAN: Large Scale Brand ANonymization for Creative Recommendation via Label Light Adaptation2021 IEEE International Conference on Big Data (Big Data)10.1109/BigData52589.2021.9671287(5950-5952)Online publication date: 15-Dec-2021
    • 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

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media