2014
DOI: 10.2498/cit.1002377
|View full text |Cite
|
Sign up to set email alerts
|

A K-complementarity Technique for Forming Groups of Tutors in Intelligent Learning Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
3
2

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 36 publications
0
2
0
Order By: Relevance
“…-Learner-Tutor Grouping System: It contains two grouping algorithms: Complement Algorithm and Incremental Complementarity Algorithm [4]. These algorithms are used to group the tutors, but their absence for technical or family reasons may influence their actions towards their learners.…”
Section: Functional Architecture Of the Proposed Systemmentioning
confidence: 99%
See 1 more Smart Citation
“…-Learner-Tutor Grouping System: It contains two grouping algorithms: Complement Algorithm and Incremental Complementarity Algorithm [4]. These algorithms are used to group the tutors, but their absence for technical or family reasons may influence their actions towards their learners.…”
Section: Functional Architecture Of the Proposed Systemmentioning
confidence: 99%
“…In these situations, the obvious strategy, then, is to propose to offer learners another dimension in their tutoring model by assigning the task of tutoring to the learners so becoming learner-tutor. This space offers all the tools and mechanisms to support and promote collaboration between the learner tutors in order to solve the learners' problems then to propose a new method of clustering learners in CEHL and this is based on the work of Y. Lafifi [4]. The aim of this method is to combine the tw o algorithms (complement algorithm and complementarity algorithm) that aims at grouping learners.…”
Section: Introductionmentioning
confidence: 99%