298 search results - page 23 / 60 » An information-theoretic measure for document similarity |
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Accelerated by the technological advances in the domain, the size of the biomedical literature has been growing rapidly. As a result, it is not feasible for individual researchers...
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
CICLING
2007
Springer
15 years 6 months ago
2007
Springer
Clustering short length texts is a difficult task itself, but adding the narrow domain characteristic poses an additional challenge for current clustering methods. We addressed thi...
106
click to vote
SODA
2000
ACM
15 years 1 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
DOCENG
2007
ACM
15 years 3 months ago
2007
ACM
The problem of version detection is critical in many important application scenarios, including software clone identification, Web page ranking, plagiarism detection, and peer-to-...