Name
Abstract | ||
|---|---|---|
The last decade has witnessed the emergence and popularity of event-based social networks (EBSNs), which extend online social networks to the physical world. Fundamental on EBSN platforms is to appropriately assign EBSN users to events they are interested to attend, known as event-participant arrangement. Previous event-participant arrangement studies either fail to avoid conflicts among events or ignore the social interactions among participants. In this work, we propose a new event-participant arrangement problem called Interaction-aware Global Event-Participant Arrangement (IGEPA). It globally optimizes arrangements between events and participants to avoid conflicts in events, and not only accounts for user interests, but also encourages socially active participants to join. To solve the IGEPA problem, we design an approximation algorithm which has an approximation ratio of at least 1\4. Experimental results validate the effectiveness of our solution. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICDE.2019.00161 | international conference on data engineering |
Keywords | Field | DocType |
Approximation algorithms,Social networking (online),Gold,Benchmark testing,Communications technology,Upper bound,Conferences | Data science,Approximation algorithm,Data mining,Social network,Computer science,Upper and lower bounds,Popularity,Information and Communications Technology,Benchmark (computing) | Conference |
ISSN | ISBN | Citations |
1084-4627 | 978-1-5386-7474-1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fei-Fei Kou | 1 | 1 | 3.72 |
| Zimu Zhou | 2 | 1157 | 61.40 |
| Hao Cheng | 3 | 167 | 16.65 |
| Junping Du | 4 | 789 | 91.80 |
| Xexuan Shi | 5 | 0 | 0.34 |
| Pan Xu | 6 | 17 | 2.01 |