摘要
针对网格资源匹配过程逐渐复杂化,以语义相似度查找机制为基础,提出了一种基于非对称资源属性描述的网格资源匹配算法BARM。BARM利用两次匹配对匹配过程加以边界约束,通过调整权重和阈值控制匹配结果的查准率和查全率,从而满足用户个性化的需求。
For grid resource matching process becoming more and more complex,this paper proposed a description matching algorithm（BARM） based on asymmetric grid resource properties,which was based on semantic similarity search mechanisms.BARM used two times match to restrict the boundary constraints.It could control the precision rate and recall rate to meet the needs of users by adjusting the weights and threshold.
出处
《计算机应用研究》
CSCD
北大核心
2012年第6期2102-2104,共3页
Application Research of Computers
关键词
资源匹配
非对称属性
语义相似度
resource matching
asymmetric properties
semantic similarity
