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
Online AccessGet full text
ISSN1000-436X

Cover

Abstract 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.
AbstractList 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.
Author Yang, Yan
Li, Wei
Zhu, Jing-Hua
Jin, Hu
Author_xml – sequence: 1
  givenname: Yan
  surname: Yang
  fullname: Yang, Yan
– sequence: 2
  givenname: Jing-Hua
  surname: Zhu
  fullname: Zhu, Jing-Hua
– sequence: 3
  givenname: Hu
  surname: Jin
  fullname: Jin, Hu
– sequence: 4
  givenname: Wei
  surname: Li
  fullname: Li, Wei
BookMark eNotj01LAzEUAHOoYK39D3v0svCSl43ZoxS_sNCLgrfysnlpA9vNmqSI_96CngbmMDA3YjGliRdiKQGg1Wg-r8W6lOigk3hvAOVSmDf--U7Zl-bAE2eqMU0NjYeUYz2eGkeFfXNRLs6Ua6zcHDLNx1txFWgsvP7nSnw8Pb5vXtrt7vl187BtZwlYW-tDp_SAVvoQAimnwfba9jYM6B1oCR2Y4A0xqp6C7wy7XhEOwRAMnnAl7v66c05fZy51f4pl4HGkidO57C9nvVVaIeIvQ51GkA
ContentType Journal Article
DBID 7SP
8FD
L7M
DatabaseName Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
EndPage 152
GroupedDBID -0Y
7SP
8FD
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CUBFJ
L7M
ID FETCH-LOGICAL-p103t-8df524c381dfffa2b40894898fc3db0410506fd6ae329afd56eb92a3cf6a0cda3
ISSN 1000-436X
IngestDate Fri Jul 11 14:00:57 EDT 2025
IsPeerReviewed false
IsScholarly true
Issue 9A
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p103t-8df524c381dfffa2b40894898fc3db0410506fd6ae329afd56eb92a3cf6a0cda3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 1009824233
PQPubID 23500
PageCount 7
ParticipantIDs proquest_miscellaneous_1009824233
PublicationCentury 2000
PublicationDate 20110901
PublicationDateYYYYMMDD 2011-09-01
PublicationDate_xml – month: 09
  year: 2011
  text: 20110901
  day: 01
PublicationDecade 2010
PublicationTitle Tongxin Xuebao
PublicationYear 2011
SSID ssib051376031
ssj0002912165
ssib058759023
ssib001102965
ssib023646527
ssib023168036
ssib036439991
ssib050281523
ssib000968473
Score 1.9237444
Snippet To improve the efficiency of keywords generation, a bipartite graph based keywords generation(BGKG) algorithm was proposed. It generated keywords based on...
SourceID proquest
SourceType Aggregation Database
StartPage 146
SubjectTerms Algorithms
China
Clients
Graphs
Logs
Query processing
Search engines
Title Keywords generation algorithm based on bipartite graph
URI https://www.proquest.com/docview/1009824233
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  issn: 1000-436X
  databaseCode: M~E
  dateStart: 19800101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://road.issn.org
  omitProxy: true
  ssIdentifier: ssib058759023
  providerName: ISSN International Centre
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Nb9MwFLfYTlwQEyC-FSTEpQqK7cSNjxPqVI1uXFJRuFT-XCuxpLBEgx3423l2ErsIDoNL1FqtlfT9-j793g-h15YpowQ1KQgcApTpVKaSWJVqqogqaW4y4RL6Z-dsvsxPV8Uq8oT67pJWvlU3f-0r-R-pwhrI1XXJ_oNkw6awAK9BvnAFCcP1VjJ-b35cQ_B45XiQzSBK8eWigYB_czlxBkq7YoDc7tyXWzOJDBODP1o19cX3bT1ZdUaKJqiAIYn8KULn86bzAgdLl867oMtP-xEE825cWPjTAR_Ndj-d4PKjfEwn9BrQtZrn1NMLBhUZU5AABX68p_DGBGJvO3E_jfb3sdbnH9Yny8ViXc1W1Zvd19QxfrnK-EB_coAOKHbcE2c_Z_uBFZjN_Y7fjPBYjyWObiujLL5nOStIcKSo87N4nAJUgBcF9xb2K7A7CxTrnwVEbXxgT_I2nHBMsOchDb_HH8baeyDVfXRvCB2S4x4HR-jOzeYBYiMGkoiBJGAg8RhIYClgIPEYeIiWJ7Pq3TwduDDSHc5om5baFiRX4F9pa60gMs9Knpe8tIpqmbnDuhmzmglDCRdWF8xITgRVlolMaUEfocO6qc1jlEhaKorhn2uxzK2ZwhbEwNNbOdUCU_YEvRofdA26xhWQRG2a7srNt-alc8Dp01t85hm6GwH2HB223zrzAjy4Vr70wv4FId5C1A
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Keywords+generation+algorithm+based+on+bipartite+graph&rft.jtitle=Tongxin+Xuebao&rft.au=Yang%2C+Yan&rft.au=Zhu%2C+Jing-Hua&rft.au=Jin%2C+Hu&rft.au=Li%2C+Wei&rft.date=2011-09-01&rft.issn=1000-436X&rft.volume=32&rft.issue=9A&rft.spage=146&rft.epage=152&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1000-436X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1000-436X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1000-436X&client=summon