發(fā)布時間：2018-12-26 07:51

【摘要】：針對傳統(tǒng)微博社區(qū)發(fā)現(xiàn)算法內(nèi)聚低重疊度不可控制等問題,以自頂向下的策略,提出一種基于核心標簽的可重疊微博社區(qū)發(fā)現(xiàn)策略Tag Cut.先利用用戶標簽的共現(xiàn)關(guān)系及逆用戶頻率對標簽進行加權(quán),并基于標簽之間的內(nèi)聯(lián)及外聯(lián)關(guān)系并將用戶的標簽進行擴充,然后在整體社區(qū)中提取包含某一標簽的用戶作為臨時分組并利用評價函數(shù)評估劃分的優(yōu)劣,最后選出最合適的核心標簽根據(jù)其對應分組與其他分組距離的遠近來決定將其劃分為新的分組還是并入其他分組.用此策略反復迭代直到滿足要求.該算法劃分的組由若干個擁有核心標簽的分組組成且綜合利用微博用戶已聲明的及隱含的興趣、用戶之間的關(guān)注規(guī)律、結(jié)果的實用性對劃分結(jié)果進行修正.經(jīng)真實數(shù)據(jù)實驗表明該方法內(nèi)聚高社區(qū)重疊度可控且擁有實際意義.
[Abstract]:Aiming at the problem of uncontrollable cohesion and low overlap in traditional Weibo community discovery algorithm, this paper proposes an overlapping community discovery strategy Tag Cut. based on core tag based on top-down strategy. The labels are weighted by the co-occurrence and inverse user frequency of the user tags, and the user's tags are expanded based on the inline and outreach relationships between the tags. The users that contain a label are then extracted from the community as a temporary grouping and evaluated by the evaluation function. Finally, the most suitable core label is selected to decide whether to divide it into new groups or to merge them into other groups according to the distance between the corresponding packets and the other groups. Iterate over and over with this strategy until you meet the requirements. The proposed algorithm is composed of several groups with core tags, and uses Weibo's declared and implied interests, the rules of concern among users, and the practicability of the results to modify the partition results. The real data experiments show that the method is controllable and has practical significance.
【作者單位】： 西北師范大學計算機科學與工程學院;中國科學院計算技術(shù)研究所智能信息處理重點實驗室;北京師范大學信息科學與技術(shù)學院;
【基金】：國家自然科學基金(No.61363058,No.61163039) 甘肅省青年科技基金(No.145RJYA259,No.1606RJYA269) 甘肅省自然科學研究基金(No.145RJZA232) 中國科學院計算技術(shù)研究所智能信息處理重點實驗室開放基金(No.IIP2014-4)
【分類號】：TP393.092
，

本文編號：2391763