This evening, it was Ph.D. Mjs's turn to give his presentation in English.
His topic was Learning Random Walks for Inducing Word Dependency Distributions.
The main idea of this paper was constructing a rule links from expert experience, wordnet and other resource. On Markov chain method there were some ramdom walks of the links graph. After some search, the probabilities could be obtained. This method could solve the data sparseness problem.
So wonderful idea. This random idea was little similar with the random forest. Based on the random idea, we could do lots of things.
没有评论:
发表评论