Name
Abstract | ||
|---|---|---|
We investigate online group formation where members seek to increase their learning potential via collaboration. We capture two common learning models: LpA where each member learns from all higher skilled ones, and LpD where the least skilled member learns from the most skilled one. We formulate the problem of forming groups with the purpose of optimizing peer learning under different affinity structures: AffD where group affinity is the smallest between all members, and AffC where group affinity is the smallest between a designated member (e.g., the least skilled or the most skilled) and all others. This gives rise to multiple variants of a multiobjective optimization problem. We propose principled modeling of these problems and investigate theoretical and algorithmic challenges. We first present hardness results, and then develop computationally efficient algorithms with constant approximation factors. Our real-data experiments demonstrate with statistical significance that forming groups considering affinity improves learning. Our extensive synthetic experiments demonstrate the qualitative and scalability aspects of our solutions.
|
Year | DOI | Keywords |
|---|---|---|
2019 | 10.1145/3292500.3330945 | approximation algorithm, multi-objective optimization, online network, peer learning |
Field | DocType | ISSN |
Approximation algorithm,Computer science,Multi-objective optimization,Artificial intelligence,Learning models,Multiobjective optimization problem,Peer learning,Affinities,Machine learning,Scalability | Conference | 978-1-4503-6201-6 |
ISBN | Citations | PageRank |
978-1-4503-6201-6 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammadreza Esfandiari | 1 | 2 | 1.38 |
| dong wei | 2 | 16 | 6.83 |
| Sihem Amer-Yahia | 3 | 2400 | 176.15 |
| Senjuti Basu Roy | 4 | 577 | 41.92 |