Active learning of strict partial orders: A case study on concept prerequisite relations

Chen Liang, Jianbo Ye, Han Zhao, Bart Pursel, C. Lee Giles

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Strict partial order is a mathematical structure commonly seen in relational data. One obstacle to extracting such type of relations at scale is the lack of large scale labels for building effective data-driven solutions. We develop an active learning framework for mining such relations subject to a strict order. Our approach incorporates relational reasoning not only in finding new unlabeled pairs whose labels can be deduced from an existing label set, but also in devising new query strategies that consider the relational structure of labels. Our experiments on concept prerequisite relations show our proposed framework can substantially improve the classification performance with the same query budget compared to other baseline approaches.

Original languageEnglish (US)
Title of host publicationEDM 2019 - Proceedings of the 12th International Conference on Educational Data Mining
EditorsCollin F. Lynch, Agathe Merceron, Michel Desmarais, Roger Nkambou
PublisherInternational Educational Data Mining Society
Pages348-353
Number of pages6
ISBN (Electronic)9781733673600
StatePublished - 2019
Event12th International Conference on Educational Data Mining, EDM 2019 - Montreal, Canada
Duration: Jul 2 2019Jul 5 2019

Publication series

NameEDM 2019 - Proceedings of the 12th International Conference on Educational Data Mining

Conference

Conference12th International Conference on Educational Data Mining, EDM 2019
CountryCanada
CityMontreal
Period7/2/197/5/19

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications

Fingerprint Dive into the research topics of 'Active learning of strict partial orders: A case study on concept prerequisite relations'. Together they form a unique fingerprint.

Cite this