This paper evaluates the efficiency of a number of popular corpus-based distributional models in performing discovery on very large document sets, including online collections. Literature-based discovery is the process of identifying previously unknown connections from text, often published literature, that could lead to the development of new techniques or technologies. Literature-based discovery has attracted growing research interest ever since Swanson's serendipitous discovery of the therapeutic effects of fish oil on Raynaud's disease in 1986. The successful application of distributional models in automating the identification of indirect associations underpinning literature-based discovery has been heavily demonstrated in the medical domain. However, we wish to investigate the computational complexity of distributional models for literature-based discovery on much larger document collections, as they may provide computationally tractable solutions to tasks including, predicting future disruptive innovations. In this paper we perform a computational complexity analysis on four successful corpus-based distributional models to evaluate their fit for such tasks. Our results indicate that corpus-based distributional models that store their representations in fixed dimensions provide superior efficiency on literature-based discovery tasks.
|Cite as: Symonds, M., Bruza, P. and Sitbon, L. (2014). The Efficiency of Corpus-based Distributional Models for Literature-based Discovery on Large Data Sets. In Proc. Australasian Web Conference (AWC 2014) Auckland, New Zealand. CRPIT, 155. Trotman, A., Cranefield, S. and Yang, J. Eds., ACS. 49-58 |
(local if available)