Abstract | ||
---|---|---|
This paper presents a recommendation algorithm that suggests relevant collaborative teams of teachers to the coordinators of courses or units of learning. This work is motivated by the need of automating and facilitating the search of experts that could contribute to the design and development of units of learning in collaborative authoring tools. The proposed algorithm solves a set covering problem by following a greedy approach that maximizes a Gaussian cost function. The results show that the recommended collaborative teams are optimal in terms of precision, but should be improved in terms of coverage and recall. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/ICALT.2011.137 | ICALT |
Keywords | Field | DocType |
collaborative authoring,team working,precision,recommendation algorithm,recommended collaborative team,teaching,recommending teachers,set theory,coverage,recommender systems,relevant collaborative team,greedy approach,expert search,greedy algorithms,set covering problem,proposed algorithm,gaussian processes,gaussian cost function,learning unit,collaborative teams,recall,collaborative teacher teams,authoring systems,groupware,course coordinator,courseware,collaborative authoring tool,collaborative authoring tools,set-covering,computer science,materials,algorithm design and analysis,indexing terms,organizations,collaboration,set cover,cost function | Recommender system,Set cover problem,Set theory,Algorithm design,Computer science,Collaborative software,Knowledge management,Collaborative authoring,Greedy algorithm,Multimedia,Team working | Conference |
ISSN | ISBN | Citations |
2161-3761 E-ISBN : 978-0-7695-4346-8 | 978-0-7695-4346-8 | 2 |
PageRank | References | Authors |
0.38 | 3 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Bakhtiyor Bahritidinov | 1 | 3 | 1.50 |
Eduardo Sánchez | 2 | 2 | 0.72 |
Manuel Lama | 3 | 383 | 34.84 |