2018 search results - page 124 / 404 » Magnitude-preserving ranking algorithms |
154
click to vote
COMAD
2009
15 years 7 months ago
2009
Terms in textual documents tend to occur more in contexts to which they are related. We can exploit this bias by modelling terms and their cooccurrences s, resembling the abstract...
168
click to vote
SIGIR
2010
ACM
15 years 6 months ago
2010
ACM
Query reformulation techniques based on query logs have recently proven to be effective for web queries. However, when initial queries have reasonably good quality, these techniqu...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
175
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Bursty features in text streams are very useful in many text mining applications. Most existing studies detect bursty features based purely on term frequency changes without takin...
186
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...