J4 ›› 2012, Vol. 47 ›› Issue (5): 32-37.

• Articles • Previous Articles     Next Articles

Bipartite graph based semi-supervised method for entity mining from the query log

CAO Lei1,2, GUO Jia-feng1, CHENG Xue-qi1   

  1. 1. Research Center of Web Data Science & Engineering, Institute of Computing Technology, Chinese Academy of Sciences,
     Beijing 100190, China; 2. Graduate University of Chinese Academy of Sciences, Beijing 100190, China
  • Received:2011-11-30 Online:2012-05-20 Published:2012-06-01

Abstract:

Named entity mining from query log aims to mine a list of named entities with the specific type from the query log. A bipartite graph based semi-supervised ranking method, which leverages the relationship between the entities (i.e. entities share common templates) to help improve the ranking, was proposed to resolve the scarcity of seed entity in  existing work about named entity mining from the query log. First, a bipartite graph based on the candidate entities and templates was constructed. Then, the relevance score was propagated from the seed entities to other candidate entities. Finally, the candidate entities were ranked according to the relevance score. An optimization framework for the iterative process was further developed in this  ranking method. Experimental results show the effectiveness of the proposed method.

Key words: query log; named entity mining; semi-supervised method; bipartite graph

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!