Please wait a minute...
New Technology of Library and Information Service  2007, Vol. 2 Issue (4): 39-42    DOI: 10.11925/infotech.1003-3513.2007.04.10
Current Issue | Archive | Adv Search |
Excavation of Web Knowledge Association Based on Bipartite Graph
Ren Hui  Zhou Xiaoguang  Shen Jin2
1(Ludong University Library,Yantai 264025,China)
2(School of Electric and Electronic Engineering,Shandong University of Technology, Zibo 255049,China)  
Download: PDF(417 KB)   HTML  
Export: BibTeX | EndNote (RIS)      

The analysis model of bipartite graph is to combine the content information on Web page and hyper-chain information, so as to provide an algorism based on classification method. By using bipartite graph,one can work out the Website’s maximum matching and complete matching. This method can also help excavate the implicit knowledge association and locate accurately the reasonable orientation of the users.

Key wordsBipartite graph      Knowledge association      Web excavation     
Received: 28 December 2006      Published: 25 April 2007


Corresponding Authors: Ren Hui     E-mail:
About author:: Ren Hui,Zhou Xiaoguang,Shen Jin

Cite this article:

Ren Hui,Zhou Xiaoguang,Shen Jin . Excavation of Web Knowledge Association Based on Bipartite Graph. New Technology of Library and Information Service, 2007, 2(4): 39-42.

URL:     OR

1新浪科技.第五次互联网资源调查报告:总结. Jan.20,2007)
2知识分类和门户社群的定义. Feb.23,2007)
6Xiaodi Huang,Wei Lai.Identification of Clusters in the Web Graph Based on Link Topology.In:Proceedings of the Seventh Database Engineering and Applications International Symposiun,2003:123-128
7Hwanjo Yu,Jiawei Han,Chang K C-C.PEBL:Web Page Classification Without Negative Examples.IEEE Transactions on Knowledge and Data Engineering,2004,16(1):70-81

[1] Lixin Zhou,Jie Lin. Extracting Product Features with NodeRank Algorithm[J]. 数据分析与知识发现, 2018, 2(4): 90-98.
  Copyright © 2016 Data Analysis and Knowledge Discovery   Tel/Fax:(010)82626611-6626,82624938