检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安理工大学计算机科学与工程学院,西安710048
出 处:《计算机应用》2016年第A01期262-264,共3页journal of Computer Applications
基 金:西安市科技计划项目(CXY1439(7))
摘 要:目前有很多关于构件分类和检索方法,但这些分类和检索方法的查询效率和查准率都不高。为此,结合树匹配思想,提出了基于云端的构件库的检索模型,该模型通过叶子节点亲和度匹配算法进行匹配,能快速检索出用户最可能需要的构件,在提高匹配速度的同时减少了匹配次数,提高了查全率,并且算法的时间复杂度和空间复杂度都是线性的。由于基于云端的构件库检索模型能根据节点间的亲和度关系进行匹配,因此可以根据节点间亲和度关系远近设置匹配精度,提高匹配的松弛度,很好地适应并应用到大规模构件库的构件检索中。There are many component classification and retrieval methods,but their query efficiency and precision are not high.Based on tree matching,component library retrieval based on cloud model was put forward.A leaf node affinity matching algorithm was used to quickly retrieve the components that the user most likely needed.The matching speed was improved,the number of matches was reduced,and the recall was increased.The time complexity and space complexity of the matching algorithm are linear.Component library retrieval model based on the cloud can match components according to the affinity relationship between nodes,and improve the matching degree of relaxation,so it can fit and be applied to the component retrieval of large-scale component library.
分 类 号:TP311.131[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.232.138