Mapping mutable genres in structurally complex volumes
2013 IEEE International Conference on Big Data, 2013•ieeexplore.ieee.org
To mine large digital libraries in humanistically meaningful ways, we need to divide them by
genre. This is a task that classification algorithms are well suited to assist, but they need
adjustment to address the specific challenges of this domain. Digital libraries pose two
problems of scale not usually found in the article datasets used to test these algorithms. 1)
Because libraries span several centuries, the genres being identified may change gradually
across the time axis. 2) Because volumes are much longer than articles, they tend to be …
genre. This is a task that classification algorithms are well suited to assist, but they need
adjustment to address the specific challenges of this domain. Digital libraries pose two
problems of scale not usually found in the article datasets used to test these algorithms. 1)
Because libraries span several centuries, the genres being identified may change gradually
across the time axis. 2) Because volumes are much longer than articles, they tend to be …
To mine large digital libraries in humanistically meaningful ways, we need to divide them by genre. This is a task that classification algorithms are well suited to assist, but they need adjustment to address the specific challenges of this domain. Digital libraries pose two problems of scale not usually found in the article datasets used to test these algorithms. 1) Because libraries span several centuries, the genres being identified may change gradually across the time axis. 2) Because volumes are much longer than articles, they tend to be internally heterogeneous, and the classification task also requires segmentation. We describe a multilayered solution that trains hidden Markov models to segment volumes, and uses ensembles of overlapping classifers to address historical change. We demonstrate this on a collection of 469,200 volumes drawn from HathiTrust Digital Library.
ieeexplore.ieee.org