Influence maximization-based event organization on social networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper is an ongoing work, and was presented as “Lightening Talk” in the DyNo workshop held at ECML/PKDD 2017. Online event-based social services allow users to organize social events by specifying the themes, and invite friends to participate social events. While the event information can be spread over the social network, it is expected that by certain communication between event hosts, users interested in the event themes can be as many as possible. In this work, by combining the ideas of team formation and influence maximization, we formulate a novel research problem, Influential Team Formation (ITF), to facilitate the organization of social events. Given a set L of required labels to describe the event topics, a social network, and the size k of the host team, ITF is to find a k-node set S that satisfying L and maximizing the Influence-Cost Ratio (i.e., the influence spread per communication cost between team members). Since ITF is proved to be NP-hard, we develop two greedy algorithms and one heuristic method to solve it. Extensive experiments conducted on Facebook and Google+ datasets exhibit the effectiveness and efficiency of the proposed methods. In addition, by employing the real event participation data in Meetup, we show that ITF with the proposed solutions is able to predict organizers of influential events.

Original languageEnglish
Title of host publicationPersonal Analytics and Privacy
Subtitle of host publicationAn Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers
EditorsRiccardo Guidotti, Anna Monreale, Dino Pedreschi, Serge Abiteboul
PublisherSpringer Verlag
Pages155-158
Number of pages4
ISBN (Print)9783319719696
DOIs
Publication statusPublished - 2017 Jan 1
Event1st International Workshop on Personal Analytics and Privacy, PAP 2017, Held in Conjunction with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2017 - Skopje, Macedonia, The Former Yugoslav Republic of
Duration: 2017 Sep 182017 Sep 18

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10708 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Workshop on Personal Analytics and Privacy, PAP 2017, Held in Conjunction with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2017
CountryMacedonia, The Former Yugoslav Republic of
CitySkopje
Period17-09-1817-09-18

Fingerprint

Social Networks
Heuristic methods
Communication
Labels
Costs
Experiments
Influence
Communication Cost
Heuristic Method
Greedy Algorithm
NP-complete problem
Predict
Vertex of a graph

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Li, C-T. (2017). Influence maximization-based event organization on social networks. In R. Guidotti, A. Monreale, D. Pedreschi, & S. Abiteboul (Eds.), Personal Analytics and Privacy: An Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers (pp. 155-158). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10708 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-71970-2_13
Li, Cheng-Te. / Influence maximization-based event organization on social networks. Personal Analytics and Privacy: An Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers. editor / Riccardo Guidotti ; Anna Monreale ; Dino Pedreschi ; Serge Abiteboul. Springer Verlag, 2017. pp. 155-158 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cd653773f0be4e129b3de7ced27b42ba,
title = "Influence maximization-based event organization on social networks",
abstract = "This paper is an ongoing work, and was presented as “Lightening Talk” in the DyNo workshop held at ECML/PKDD 2017. Online event-based social services allow users to organize social events by specifying the themes, and invite friends to participate social events. While the event information can be spread over the social network, it is expected that by certain communication between event hosts, users interested in the event themes can be as many as possible. In this work, by combining the ideas of team formation and influence maximization, we formulate a novel research problem, Influential Team Formation (ITF), to facilitate the organization of social events. Given a set L of required labels to describe the event topics, a social network, and the size k of the host team, ITF is to find a k-node set S that satisfying L and maximizing the Influence-Cost Ratio (i.e., the influence spread per communication cost between team members). Since ITF is proved to be NP-hard, we develop two greedy algorithms and one heuristic method to solve it. Extensive experiments conducted on Facebook and Google+ datasets exhibit the effectiveness and efficiency of the proposed methods. In addition, by employing the real event participation data in Meetup, we show that ITF with the proposed solutions is able to predict organizers of influential events.",
author = "Cheng-Te Li",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-71970-2_13",
language = "English",
isbn = "9783319719696",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "155--158",
editor = "Riccardo Guidotti and Anna Monreale and Dino Pedreschi and Serge Abiteboul",
booktitle = "Personal Analytics and Privacy",
address = "Germany",

}

Li, C-T 2017, Influence maximization-based event organization on social networks. in R Guidotti, A Monreale, D Pedreschi & S Abiteboul (eds), Personal Analytics and Privacy: An Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10708 LNCS, Springer Verlag, pp. 155-158, 1st International Workshop on Personal Analytics and Privacy, PAP 2017, Held in Conjunction with the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2017, Skopje, Macedonia, The Former Yugoslav Republic of, 17-09-18. https://doi.org/10.1007/978-3-319-71970-2_13

Influence maximization-based event organization on social networks. / Li, Cheng-Te.

Personal Analytics and Privacy: An Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers. ed. / Riccardo Guidotti; Anna Monreale; Dino Pedreschi; Serge Abiteboul. Springer Verlag, 2017. p. 155-158 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10708 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Influence maximization-based event organization on social networks

AU - Li, Cheng-Te

PY - 2017/1/1

Y1 - 2017/1/1

N2 - This paper is an ongoing work, and was presented as “Lightening Talk” in the DyNo workshop held at ECML/PKDD 2017. Online event-based social services allow users to organize social events by specifying the themes, and invite friends to participate social events. While the event information can be spread over the social network, it is expected that by certain communication between event hosts, users interested in the event themes can be as many as possible. In this work, by combining the ideas of team formation and influence maximization, we formulate a novel research problem, Influential Team Formation (ITF), to facilitate the organization of social events. Given a set L of required labels to describe the event topics, a social network, and the size k of the host team, ITF is to find a k-node set S that satisfying L and maximizing the Influence-Cost Ratio (i.e., the influence spread per communication cost between team members). Since ITF is proved to be NP-hard, we develop two greedy algorithms and one heuristic method to solve it. Extensive experiments conducted on Facebook and Google+ datasets exhibit the effectiveness and efficiency of the proposed methods. In addition, by employing the real event participation data in Meetup, we show that ITF with the proposed solutions is able to predict organizers of influential events.

AB - This paper is an ongoing work, and was presented as “Lightening Talk” in the DyNo workshop held at ECML/PKDD 2017. Online event-based social services allow users to organize social events by specifying the themes, and invite friends to participate social events. While the event information can be spread over the social network, it is expected that by certain communication between event hosts, users interested in the event themes can be as many as possible. In this work, by combining the ideas of team formation and influence maximization, we formulate a novel research problem, Influential Team Formation (ITF), to facilitate the organization of social events. Given a set L of required labels to describe the event topics, a social network, and the size k of the host team, ITF is to find a k-node set S that satisfying L and maximizing the Influence-Cost Ratio (i.e., the influence spread per communication cost between team members). Since ITF is proved to be NP-hard, we develop two greedy algorithms and one heuristic method to solve it. Extensive experiments conducted on Facebook and Google+ datasets exhibit the effectiveness and efficiency of the proposed methods. In addition, by employing the real event participation data in Meetup, we show that ITF with the proposed solutions is able to predict organizers of influential events.

UR - http://www.scopus.com/inward/record.url?scp=85038215681&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85038215681&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-71970-2_13

DO - 10.1007/978-3-319-71970-2_13

M3 - Conference contribution

AN - SCOPUS:85038215681

SN - 9783319719696

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 155

EP - 158

BT - Personal Analytics and Privacy

A2 - Guidotti, Riccardo

A2 - Monreale, Anna

A2 - Pedreschi, Dino

A2 - Abiteboul, Serge

PB - Springer Verlag

ER -

Li C-T. Influence maximization-based event organization on social networks. In Guidotti R, Monreale A, Pedreschi D, Abiteboul S, editors, Personal Analytics and Privacy: An Individual and Collective Perspective - 1st International Workshop, PAP 2017, Held in Conjunction with ECML PKDD 2017, Revised Selected Papers. Springer Verlag. 2017. p. 155-158. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-71970-2_13