Text Classification Through Time: Efficient Label Propagation in Time-Based Graphs Export

@inproceedings{Baluja09, abstract = {One of the fundamental assumptions for machine learning based text classification systems is that the underlying distribution from which the set of labeled-text is drawn is identical to the distribution from which the text-to-be-labeled is drawn. However, in live news aggregation sites, this assumption is rarely correct. Instead, the events and topics discussed in news stories dramatically change over time. Rather than ignoring this phenomenon, we attempt to explicitly model the transitions of news stories and classifications over time to label stories that may be acquired months after the initial examples are labeled. We test our system, based on efficiently propagating labels in time-based graphs, with recently published news stories collected over an eighty day period. Experiments presented in this paper include the use of training labels from each story within the first several days of gathering stories, to using a single story as a label.}, author = {Baluja, Shumeet and Ravichandran, Deepak and Sivakumar, D.}, booktitle = {Proceeding of the International Conference on Knowledge Discovery and Information Retrieval (KDIR 2009)}, citeulike-article-id = {5973472}, day = {6-8}, keywords = {machine-learning, news, temporal, text-classification}, location = {Madeira, Portugal}, month = {October}, organization = {INSTICC}, posted-at = {2009-10-20 10:46:40}, priority = {0}, title = {Text Classification Through Time: Efficient Label Propagation in Time-Based Graphs}, year = {2009} }

TY - CONF ID - Baluja09 L3 - citeulike-article-id:5973472 N2 - One of the fundamental assumptions for machine learning based text classification systems is that the underlying distribution from which the set of labeled-text is drawn is identical to the distribution from which the text-to-be-labeled is drawn. However, in live news aggregation sites, this assumption is rarely correct. Instead, the events and topics discussed in news stories dramatically change over time. Rather than ignoring this phenomenon, we attempt to explicitly model the transitions of news stories and classifications over time to label stories that may be acquired months after the initial examples are labeled. We test our system, based on efficiently propagating labels in time-based graphs, with recently published news stories collected over an eighty day period. Experiments presented in this paper include the use of training labels from each story within the first several days of gathering stories, to using a single story as a label. CY - Madeira, Portugal OR - INSTICC TI - Text Classification Through Time: Efficient Label Propagation in Time-Based Graphs T2 - Proceeding of the International Conference on Knowledge Discovery and Information Retrieval (KDIR 2009) KW - machine-learning KW - news KW - temporal KW - text-classification AU - Baluja, Shumeet AU - Ravichandran, Deepak AU - Sivakumar, D PY - 2009/10/6-8/ ER -