2434 search results - page 118 / 487 » Algorithmic Randomness of Closed Sets |
141
click to vote
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
110
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
Many NLP tasks rely on accurately estimating word dependency probabilities P(w1|w2), where the words w1 and w2 have a particular relationship (such as verb-object). Because of the...
95
Voted
SIGSOFT
2007
ACM
16 years 4 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
146
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
In real sequence labeling tasks, statistics of many higher order features are not sufficient due to the training data sparseness, very few of them are useful. We describe Sparse H...
130
click to vote
SIGIR
2009
ACM
15 years 10 months ago
2009
ACM
Recent work in supervised learning of term-based retrieval models has shown significantly improved accuracy can often be achieved via better model estimation [2, 10, 11, 17]. In ...