The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
This paper describes an approach to temporal pattern mining
using the concept of user dened temporal prototypes to dene the
nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...
We now have incrementally-grown databases of text documents ranging back for over a decade in areas ranging from personal email, to news-articles and conference proceedings. While...
The existence and use of standard test collections in information retrieval experimentation allows results to be compared between research groups and over time. Such comparisons, ...
Timothy G. Armstrong, Alistair Moffat, William Web...
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...