Keywords generation algorithm based on bipartite graph

To improve the efficiency of keywords generation, a bipartite graph based keywords generation(BGKG) algorithm was proposed. It generated keywords based on search engine logs and built a bipartite graph between query terms and the clicked URLs. It took into account the rank of the URLs in result page...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao Vol. 32; no. 9A; pp. 146 - 152
Main Authors Yang, Yan, Zhu, Jing-Hua, Jin, Hu, Li, Wei
Format Journal Article
LanguageChinese
Published 01.09.2011
Subjects
Algorithms
China
Clients
Graphs
Logs
Query processing
Search engines
Online AccessGet full text
ISSN1000-436X

Cover

More Information
Summary:To improve the efficiency of keywords generation, a bipartite graph based keywords generation(BGKG) algorithm was proposed. It generated keywords based on search engine logs and built a bipartite graph between query terms and the clicked URLs. It took into account the rank of the URLs in result pages and the order of users' clicking. Experiments were done with real query logs. The results show that keywords generated by BGKG can satisfy the needs of enterprise clients and BGKG is more efficient than other keyword generation algorithms.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1000-436X