Sciweavers

290 search results - page 41 / 58
» Measuring similarity between collection of values
Sort
View
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
14 years 1 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
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...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
INCDM
2010
Springer
486views Data Mining» more  INCDM 2010»
13 years 10 months ago
Finding Temporal Patterns in Noisy Longitudinal Data: A Study in Diabetic Retinopathy
This paper describes an approach to temporal pattern mining using the concept of user de ned temporal prototypes to de ne the nature of the trends of interests. The temporal patt...
Vassiliki Somaraki, Deborah Broadbent, Frans Coene...
KDD
2007
ACM
136views Data Mining» more  KDD 2007»
14 years 9 months ago
Information genealogy: uncovering the flow of ideas in non-hyperlinked document databases
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...
Benyah Shaparenko, Thorsten Joachims
CIKM
2009
Springer
14 years 1 months ago
Improvements that don't add up: ad-hoc retrieval results since 1998
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...
BMCBI
2007
133views more  BMCBI 2007»
13 years 8 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja