基于頻繁鏈接的Web權(quán)威資源挖掘
發(fā)布時(shí)間:2018-11-25 21:55
【摘要】:如何有效地利用Web這個(gè)巨大的信息庫(kù) ?傳統(tǒng)的基于關(guān)鍵字的搜索引擎取得了一定的成績(jī) ,但是存在著查準(zhǔn)率不高的問題 Web頁(yè)面間鏈接結(jié)構(gòu)事實(shí)上隱含地表達(dá)著權(quán)威的信息 ,這已被許多研究者用來試圖改善Web信息檢索(包括搜索引擎 )的性能 ,取得了較好的效果 ,但依然存在很大的改善空間 為此 ,提出了FARMING(基于頻繁度的Web圖的權(quán)威資源挖掘 )算法 詮釋了新的權(quán)威頁(yè)面定義 ,提出了帶階的頻繁子圖和權(quán)威社團(tuán)等概念 ,并用實(shí)驗(yàn)證明了FARMING算法的有效性
[Abstract]:How to effectively utilize the huge information base of Web? The traditional keyword-based search engine has made some achievements, but there is a problem that the precision rate is not high. In fact, the link structure between Web pages implicitly expresses authoritative information. This has been used by many researchers to improve the performance of Web information retrieval (including search engines), but there is still much room for improvement. In this paper, FARMING (authoritative Resource Mining based on frequent Web Graph) algorithm is proposed to interpret the new definition of authoritative page, and the concepts of frequent subgraph with order and authoritative community are put forward, and the validity of FARMING algorithm is proved by experiments.
【作者單位】: 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系
【基金】:國(guó)家自然科學(xué)基金 ( 6993 3 0 10 ) 國(guó)家“八六三”高技術(shù)研究發(fā)展計(jì)劃基金 ( 2 0 0 2AA4Z3 43 0 )
【分類號(hào)】:TP393.09
本文編號(hào):2357480
[Abstract]:How to effectively utilize the huge information base of Web? The traditional keyword-based search engine has made some achievements, but there is a problem that the precision rate is not high. In fact, the link structure between Web pages implicitly expresses authoritative information. This has been used by many researchers to improve the performance of Web information retrieval (including search engines), but there is still much room for improvement. In this paper, FARMING (authoritative Resource Mining based on frequent Web Graph) algorithm is proposed to interpret the new definition of authoritative page, and the concepts of frequent subgraph with order and authoritative community are put forward, and the validity of FARMING algorithm is proved by experiments.
【作者單位】: 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系 復(fù)旦大學(xué)計(jì)算機(jī)與信息技術(shù)系
【基金】:國(guó)家自然科學(xué)基金 ( 6993 3 0 10 ) 國(guó)家“八六三”高技術(shù)研究發(fā)展計(jì)劃基金 ( 2 0 0 2AA4Z3 43 0 )
【分類號(hào)】:TP393.09
【相似文獻(xiàn)】
相關(guān)博士學(xué)位論文 前1條
1 謝海濤;移動(dòng)個(gè)性化信息服務(wù)系統(tǒng)的進(jìn)化機(jī)制研究[D];北京郵電大學(xué);2012年
相關(guān)碩士學(xué)位論文 前1條
1 李文娟;網(wǎng)絡(luò)輿情傾向性分析技術(shù)研究與實(shí)現(xiàn)[D];哈爾濱工業(yè)大學(xué);2011年
,本文編號(hào):2357480
本文鏈接:http://sikaile.net/kejilunwen/sousuoyinqinglunwen/2357480.html
最近更新
教材專著