| Research and Application on Web Information Retrieval Based on Improved FP-Growth Algorithm |
| |
| 作者姓名： | JIAO Minghai~ YAN Ping~ JIANG Huiyan~ .Computer Center Northeastern University Shenyang Liaoning China .School of Information Science and Engineering Northeastern University Shenyang Liaoning China |
| |
| 作者单位： | JIAO Minghai~ 1，YAN Ping~ 2，JIANG Huiyan~ 1 1.Computer Center，Northeastern University，Shenyang 110004，Liaoning，China; 2.School of Information Science and Engineering，Northeastern University，Shenyang 110004，Liaoning，China |
| |
| 摘 要： | 0 IntroductionThe useful texts information in the Web is analyzed bythe method of Web information retrieval according tothe requirement of the user . To get the information of citingtexts and relative key words fromthe Web,we can searchforlots of correlativeinformation data storedinthe Web databaseby Webinformationretrieval .This paper appliedthe method-ology of data mining to Web information retrieval since thepurpose of data miningisto discover thefrequent patternfromthe Web.Alot of studi…
|
| 收稿时间： | 9 March 2006 |
Research and application on Web information retrieval based on improved FP-growth algorithm |
| |
| JIAO Minghai ,YAN Ping ,JIANG Huiyan .Computer Center,Northeastern University,Shenyang ,Liaoning,China, .School of Information Science and Engineering,Northeastern University,Shenyang ,Liaoning,China.Research and Application on Web Information Retrieval Based on Improved FP-Growth Algorithm[J].Wuhan University Journal of Natural Sciences,2006,11(5):1065-1068. |
| |
| Authors: | Jiao Minghai Yan Ping Jiang Huiyan |
| |
| Institution: | (1) Computer Center, Northeastern University, 110004 Shenyang, Liaoning, China;(2) School of Information Science and Engineering, Northeastern University, 110004 Shenyang, Liaoning, China |
| |
| Abstract: | A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web |
| |
| Keywords: | data mining frequent pattern aggregative chains FP-growth algorithm information retrieval |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ |
