检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:赵雷[1] ZHAO Lei(Library of Shandong University,Jinan 250100,China)
出 处:《电子设计工程》2022年第5期42-45,50,共5页Electronic Design Engineering
基 金:山东省社会科学规划研究项目(19CTQJ03);2020年教育部产学合作协同育人项目(202002136001)。
摘 要:为打破图书馆各级存储数据间的信息孤岛,实现数字资源实时互联互通,提出了基于深度挖掘的图书馆数字资源整合与共享算法。通过确定权重样本时间衰减周期的方式,得到完整的数据集表达条件,再遵照实值挖掘参数的设定结果,实现对图书馆数字资源的深度挖掘。基于此,建立数字资源目录体系,借助共享元信息编码参量,得到最终的资源整合维度计算结果。对比实验结果表明,与云计算型资源整合策略相比,基于深度挖掘的整合与共享算法能够更好地解决图书馆各级存储数据间的信息孤岛问题,在实现数字资源实时互联互通的同时,维护图书馆资源存储环境的稳定性。In order to break the information island among all levels of stored data in the library and realize the real-time interconnection of digital resources,this paper puts forward an algorithm of library digital resources integration and sharing based on deep mining. By determining the time attenuation period of the weight sample,the complete expression condition of the data set is obtained,and then the deep mining processing of the digital resources in the library is realized according to the setting results of the real value mining parameters. Based on this,the digital resource catalog system is established,and the final calculation result of resource integration dimension is obtained by using the coding parameters of shared meta-information. The comparative experimental results show that,compared with the resource integration strategy based on cloud computing,the integration and sharing algorithm based on deep mining can better solve the problem of information isolation among all levels of stored data in the library,and maintain the stability of the library resource storage environment while realizing the real-time interconnection of digital resources.
关 键 词:深度挖掘 数字资源 整合共享 目录体系 元信息编码 整合维度
分 类 号:TN99[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:52.15.123.168