Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery &Amp; Data Mining 2019
DOI: 10.1145/3292500.3330945
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing Peer Learning in Online Groups with Affinities

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 smalle… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…The two classes were randomly assigned as two groups: the experimental group with peer scaffolding (37 people) and the control group without peer scaffolding (34 people). Participants in each group were further grouped into small vocabulary learning teams consisting of 4–5 teammates, based on the statement that peer learning usually takes place by forming small groups consisting of 3–5 members ( Agrawal et al, 2014 ; Esfandiari et al, 2019 ).…”
Section: Methodsmentioning
confidence: 99%
“…The two classes were randomly assigned as two groups: the experimental group with peer scaffolding (37 people) and the control group without peer scaffolding (34 people). Participants in each group were further grouped into small vocabulary learning teams consisting of 4–5 teammates, based on the statement that peer learning usually takes place by forming small groups consisting of 3–5 members ( Agrawal et al, 2014 ; Esfandiari et al, 2019 ).…”
Section: Methodsmentioning
confidence: 99%
“…Assignment algorithms are usually designed to improve platform-centric and requester-centric goals such as result quality, completion time and throughput. There are also task assignment solutions that consider worker-centric goals, such as mental stress [37], motivation [48], affinity [22] and boredom [13].…”
Section: Task Assignment Objective Functionsmentioning
confidence: 99%
“…They include scaffolding where tasks are combined in alternating difficulty levels, and collaboration where workers learn from their interactions with higher-skilled peers. In online labor marketplaces, a few studies focused on the role of task difficulty and workers' ability to complete micro-tasks in improving skills [23], and how affinity between workers can be used to form teams that collaborate to produce high quality contributions while also improving skills [22]. Usually, such approaches require additional human cost to build training material or give feedback to workers.…”
Section: Introductionmentioning
confidence: 99%
“…Other related work includes the team-formation problem [13], where it is asked to select team members who bear a small communication cost, formulated as a Steiner tree or diameter. Esfandiari et al [7] have a different focus, partitioning students into different groups to encourage peer learning, so as to optimize some special affinity structure such as a star in each group.…”
Section: Related Workmentioning
confidence: 99%