
Research Article
Retrieval Algorithm of Digital Information Resources for Legal Theory Teaching Based on Multi-scale Dense Network
@INPROCEEDINGS{10.1007/978-3-031-50543-0_8, author={Zefeng Li and Lu Zhao and Peihua Zhang}, title={Retrieval Algorithm of Digital Information Resources for Legal Theory Teaching Based on Multi-scale Dense Network}, proceedings={Advanced Hybrid Information Processing. 7th EAI International Conference, ADHIP 2023, Harbin, China, September 22-24, 2023, Proceedings, Part I}, proceedings_a={ADHIP}, year={2024}, month={3}, keywords={Multi-Scale Dense Network Teaching Information Resource Retrieval Digitization Legal Theory}, doi={10.1007/978-3-031-50543-0_8} }
- Zefeng Li
Lu Zhao
Peihua Zhang
Year: 2024
Retrieval Algorithm of Digital Information Resources for Legal Theory Teaching Based on Multi-scale Dense Network
ADHIP
Springer
DOI: 10.1007/978-3-031-50543-0_8
Abstract
To solve the problem that the existing retrieval algorithms have poor retrieval ability when retrieving digital information resources for legal theory teaching, the loss value in the iterative process of the retrieval algorithm is too large, which affects the retrieval performance and cannot meet the high-precision requirements of users for resource retrieval, the multi-scale dense network theory is introduced, Research on the design of digital information resources retrieval algorithm for legal theory teaching based on multi-scale dense network. Based on web crawler technology, obtain legal theory teaching document data sources, merge and transform different documents, introduce multi-scale dense networks, combine K-means algorithm and Canopy algorithm to cluster resources, allocate legal theory teaching digital information resources, and extract resource retrieval features based on word matching features, central sampling index library features, and topic related features, efficient retrieval of resources through information fusion. The experimental results show that the new retrieval algorithm has stronger retrieval ability in practical applications, and the loss value can rapidly decline in the algorithm iteration process, thus providing users with higher quality retrieval services.