Name
Abstract | ||
|---|---|---|
While active learning (AL) has been recently applied to help the user explore a large database to retrieve data instances of interest, existing methods often require a large number of instances to be labeled in order to achieve good accuracy. To address this slow convergence problem, our work augments version space-based AL algorithms, which have strong theoretical results on convergence but are very costly to run, with additional insights obtained in the user labeling process. These insights lead to a novel algorithm that factorizes the version space to perform active learning in a set of subspaces. Our work offers theoretical results on optimality and approximation for this algorithm, as well as optimizations for better performance. Evaluation results show that our factorized version space algorithm significantly outperforms other version space algorithms, as well as a recent factorization-aware algorithm, for large database exploration. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ICDM.2019.00117 | 2019 19TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2019) |
Keywords | DocType | ISSN |
Active learning, version space, data exploration | Conference | 1550-4786 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luciano Di Palma | 1 | 0 | 0.34 |
| Yanlei Diao | 2 | 2234 | 108.95 |
| Anna Liu | 3 | 566 | 23.91 |