Archive system and method based on artificial intelligence

Through an archive system based on artificial intelligence, combined with natural language processing and deep learning technology, efficient and accurate archive retrieval and secure sharing are achieved, solving the problems of search difficulties and poor information sharing performance in traditional archive management methods, and improving archive management efficiency and service quality.

CN119066201AActive Publication Date: 2024-12-03SHANDONG QIANHE ARCHIVES MANAGEMENT CO LTD

Patent Information

Application Number
CN202411229278.6
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-03
Publication Date
2024-12-03
Estimated Expiration
2044-09-03

AI Technical Summary

Technical Problem

Traditional archive management methods are difficult to meet the needs of modern society for efficient and accurate archive management, especially when the number of archives is large and diverse, it is difficult to search and poor information sharing performance, which hinders the improvement of work efficiency and the fullness of information resources. use.

Method used

Adopting an archive system based on artificial intelligence, including intelligent search module, information sharing optimization module, deep learning engine and adaptive classification module, uses natural language processing, deep neural network, high-level encryption standards generated by quantum random number, stochastic gradient descent algorithm and Dynamically adjust the classification strategy for information gain value to achieve accurate retrieval, secure sharing and efficient classification.

Benefits of technology

It improves the accuracy and efficiency of archive retrieval, ensures secure sharing of information, dynamically adjusts classification strategies to facilitate the rapid positioning of required archives, and improves the overall efficiency and service quality of archive management.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119066201A_ABST
    Figure CN119066201A_ABST
Patent Text Reader

Abstract

The invention discloses an archive system and method based on artificial intelligence, and relates to the technical field of artificial intelligence, and the archive system comprises an intelligent retrieval module, an information sharing optimization module, a deep learning engine and an adaptive classification module. The semantic meaning of a retrieval request input by a user can be deeply understood, the deep neural network further strengthens the analysis capability of a complex semantic relationship, the retrieval request and an archive text are converted into high-dimensional vectors in combination with a word vector model, and the retrieval request and the archive text are analyzed through accurate cosine similarity calculation and introduction of a correlation calculation formula of a time decay factor. According to the method, the archives which most meet the requirements are quickly and accurately screened out from massive archives, and even in a huge-scale archive room, a deep learning engine can continuously optimize feature extraction and mode recognition capabilities through training of a large amount of archive data, so that a large amount of time is saved, and the possibility of error occurrence is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of artificial intelligence technology, and in particular to an archive system and method based on artificial intelligence. Background Art

[0002] With the rapid development of information technology, the importance of archive management has become increasingly prominent. In various fields, a large amount of information is recorded and saved as archive materials, covering various forms such as text, images, audio, and video. Traditional archive management mainly relies on manual operation and simple computer assistance. However, with the continuous increase in the number of archives and the increasing variety of archives, this method has gradually failed to meet the needs of modern society for efficient and accurate archive management. The existing archive system and method based on artificial intelligence have certain defects. On the one hand, archive retrieval is difficult. Faced with a large number of archival materials with various types, manual retrieval is difficult and error-prone, and time-consuming. Especially when the archive room is large, this problem is more prominent. On the other hand, in terms of archival information sharing, some existing computer management systems only use it as a tool for storing data, and the information sharing performance is poor. The lack of an effective sharing mechanism makes it impossible for archival information to flow efficiently between different departments and different users, and it is impossible to truly play the service function of information. This not only hinders the improvement of work efficiency, but also limits the full utilization of information resources. To this end, we propose an archive system and method based on artificial intelligence. Summary of the invention

[0003] The object of the present invention is to provide an archive system and method based on artificial intelligence.

[0004] To solve the problems raised in the above background technology, the present invention provides the following technical solutions: an archive system based on artificial intelligence, the archive system comprising an intelligent retrieval module, an information sharing optimization module, a deep learning engine and an adaptive classification module; The intelligent retrieval module uses natural language processing and deep neural networks, combined with word vector models, to convert retrieval requests and archive texts into vector forms, and achieves accurate and timely retrieval through cosine similarity and the correlation calculation formula that introduces the time decay factor. The retrieved relevant archive data will be passed as input to the deep learning engine and the adaptive classification module. The information sharing optimization module adopts the advanced encryption standard improved algorithm that integrates quantum random number generation, uses the quantum random number generator to generate the initial key, encrypts the archive information in groups, and dynamically adjusts the number of encryption rounds according to the key length and security level to ensure the safe sharing of information. The deep learning engine uses the stochastic gradient descent algorithm to train the multi-layer convolutional neural network, and calculates the loss. The loss function gradient and updated network parameters realize accurate feature extraction and pattern recognition of archival data. The deep learning engine extracts features after acquiring archival data from the intelligent retrieval module. The extracted features can be fed back to the intelligent retrieval module to optimize the retrieval results. At the same time, it can also provide more abundant feature information for classification for the adaptive classification module. The adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value according to the archival attributes. The adaptive classification module receives the feature information extracted by the deep learning engine and the archival data provided by the intelligent retrieval module, and comprehensively considers these factors to make classification adjustments, so that the archival classification is more reasonable and efficient. At the same time, the classification results can also provide a more accurate retrieval scope and direction for the intelligent retrieval module. The archive system also includes a data cleaning module, which uses a Z-score standardization method for numerical data and performs stem extraction and stop word filtering on text data.

[0005] As a further solution of the present invention: the intelligent retrieval module is provided with a word vector model, and the word vector model is used to convert the retrieval request and the archive text into a vector form, and the correlation between the retrieval request and the archive text is calculated by cosine similarity. At the same time, a time decay factor is introduced to reflect the timeliness of the archive, and a higher weight is given to newer archives. The correlation score between the retrieval request and the archive text is calculated by a correlation calculation formula. The specific correlation score calculation formula is as follows: in: represents the relevance score, Represents a retrieval request. Archival documents, Represents a search request With archive documents The semantic similarity of Indicates the frequency of the search term in the document. represents the update frequency of the document, λ is the time decay coefficient, Indicates the current time. Indicates the time when the file was created. α , β and γ is an adjustable weight parameter; The search results are sorted in reverse order using the relevance score calculation formula, with archives that are highly relevant and timely being displayed first.

[0006] As a further solution of the present invention: the information sharing optimization module adopts an improved Advanced Encryption Standard (AES) algorithm that integrates quantum random number generation to encrypt the shared archival information. In the initial stage of encryption, a quantum random number generator is used to generate a highly random and unpredictable initial key. In the encryption process, the archival information is first grouped into groups of 128 bits each. Then, multiple round keys are generated by combining quantum keys and traditional key expansion algorithms. The number of encryption rounds is dynamically adjusted according to the key length and the security level of the archive. 128-bit keys are used for 15 rounds of encryption, 192-bit keys are used for 18 rounds of encryption, and 256-bit keys are used for 20 rounds of encryption. In each round, byte replacement, row shift, column confusion and round key addition operations are performed in sequence to ensure the confidentiality and integrity of the archival information during the sharing process, and to ensure that only users with the correct keys can restore the original archival information through the corresponding decryption algorithm, thereby achieving safe and reliable information sharing.

[0007] As a further solution of the present invention: the deep learning engine uses the stochastic gradient descent (SGD) algorithm to train the multi-layer convolutional neural network. First, the network parameters, including the weights and biases of the convolution kernels, are initialized. In each iteration, a small batch of archive data is randomly selected as training samples, and the gradient of the loss function to the network parameters is calculated. The loss function here uses the entropy loss function. The specific loss function formula is as follows: in: represents the loss value, represents the true label, Represents the predicted output; Next, the parameters are updated according to the learning rate. The specific formula is as follows: in: Updated network parameters, Current network parameters, The gradient of the loss function; Through continuous iteration, the network gradually converges and can accurately extract features and recognize patterns of archival data.

[0008] As a further solution of the present invention: the adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value of the archive. First, for each attribute, the information entropy under the current classification is calculated. ,in Represents the probability of a certain attribute value appearing, and then calculates the information gain of the attribute for classification. The specific calculation formula is as follows: Information gain, D represents a dataset, Representation attributes A The value is v The data subset at time Representation dataset The information entropy of Representing a subset of data Information entropy of The larger the calculated information gain is, the greater the contribution of the attribute to the classification. The classification level and category division of the archives are dynamically adjusted according to the size of the information gain value.

[0009] As a further solution of the present invention: the data cleaning module uses data standardization technology to clean and normalize the original archive data. For numerical data, the Z-score standardization method is used to convert the data into a distribution with a mean of 0 and a standard deviation of 1. The calculation formula of Z-score standardization is as follows: in: represents the normalized value, Represents the original data value, represents the data mean, represents the standard deviation of the data; For text data, redundant and irrelevant information is removed through stemming and stop word filtering operations.

[0010] As a further solution of the present invention: the intelligent retrieval module also has an automatic error correction function. When the search request input by the user contains spelling errors and semantic ambiguity, the similarity with the correct search term is calculated through the edit distance algorithm. First, the character string input by the user is converted into a character array, and then the edit distance between the two arrays is calculated by the dynamic programming method. The editing operations include inserting, deleting and replacing characters. According to the size of the edit distance, the similarity with the possible correct search term is judged, and automatic error correction and optimization are performed. At the same time, the context information and historical search records are combined to further improve the accuracy of error correction.

[0011] As a further solution of the present invention: the information sharing optimization module supports attribute-based access control (ABAC) strategy. The information sharing optimization module dynamically allocates access rights according to user attributes, environment attributes, operation attributes and object attributes. First, the access control policy rules are defined. Then, when the user initiates an access request, the relevant attribute information is extracted, and these attributes are evaluated and matched using a rule engine. If the match is successful, the corresponding access rights are granted, otherwise, access is denied.

[0012] As a further solution of the present invention: When performing feature extraction, the deep learning engine uses a local binary pattern (LBP) algorithm to extract features from archival image data. First, the image is divided into several small areas. The central pixel of each area is compared with its neighborhood pixels. If the neighborhood pixel value is greater than the central pixel value, it is marked as 1, otherwise, it is marked as 0. These marked values ​​are combined into a binary number in a certain order, and converted into a decimal number as the LBP value of the area. Then, the frequency of occurrence of different LBP values ​​in the image is counted to form a feature vector. In this way, the detailed features of the archival image data can be effectively captured.

[0013] In addition, the present invention also provides an artificial intelligence-based archive method, which comprises the following steps: Step 1: Use the word vector model in the intelligent retrieval module. This model is optimized and trained by a deep neural network to convert the search request and archive text entered by the user into a vector form, helping to accurately capture the semantic features of the text and provide a basis for subsequent relevance calculations; Step 2: Calculate the semantic similarity between the search request and the archive document through cosine similarity. In the calculation process, further analyze and optimize the vectors in combination with natural language processing technology to improve the accuracy of semantic similarity calculation; Step 3: Introduce a time decay factor to reflect the timeliness of archives, give higher weights to newer archives, and consider the time characteristics of archives, so that the search results are more in line with the user's needs for the latest information. By dynamically adjusting the time decay coefficient, the influence of timeliness on the relevance score can be flexibly controlled according to different archive types and application scenarios; Step 4: Calculate the correlation formula Calculate the relevance scores between the search request and the archive text, sort the search results in reverse order using the relevance score calculation formula, give priority to displaying archives with high relevance and timeliness, and provide users with the search results that best meet their needs.

[0014] By adopting the above technical solution, compared with the prior art, the beneficial effects of the present invention are: 1. The present invention uses natural language processing technology through the intelligent retrieval module to deeply understand the semantics of the retrieval request input by the user. The deep neural network further strengthens the analysis ability of complex semantic relationships. Combined with the word vector model, the retrieval request and the archive text are converted into high-dimensional vectors. Through accurate cosine similarity calculation and the correlation calculation formula introducing the time decay factor, the archives that best meet the needs can be quickly and accurately screened from the massive archives. Even in a large-scale archive room, the deep learning engine can continuously optimize the feature extraction and pattern recognition capabilities through training on a large amount of archive data, greatly improving the accuracy and efficiency of retrieval, saving a lot of time and reducing the possibility of errors. 2. The present invention adopts an improved advanced encryption standard algorithm that integrates quantum random number generation through the information sharing optimization module, and uses a quantum random number generator to generate a highly random and unpredictable initial key to ensure the security of archival information during the sharing process. In the encryption process, the archival information is grouped, and multiple round keys are generated by combining quantum keys and traditional key expansion algorithms. The number of encryption rounds is dynamically adjusted according to the key length and the security level of the archive. At the same time, the intelligent retrieval module and the information sharing optimization module work together to enable the archival information to be efficiently transferred between different users and systems. The data cleaning module provides a high-quality data foundation for information sharing, truly giving play to the service function of information, promoting collaboration and communication between departments, and improving overall work efficiency. 3. The present invention dynamically adjusts the classification strategy by calculating the information gain value according to the archive attributes through the adaptive classification module, and combines the rich feature information extracted by the deep learning engine to classify the archives more accurately. When faced with a large and diverse range of archival materials, this dynamic classification method ensures that the archives are always in a reasonable classification system, which is convenient for users to quickly locate the required archives. At the same time, the deep learning engine uses the local binary pattern algorithm to process the archive image data during feature extraction, effectively capturing the image detail features, further enriching the feature information of the archives, and providing strong support for the accurate classification and efficient retrieval of archives, greatly improving the overall efficiency and service quality of archive management. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 A schematic diagram of a system flow in an embodiment of the present invention; Figure 2 Schematic diagram of the method steps in an embodiment of the present invention. DETAILED DESCRIPTION

[0016] The specific embodiments of the present invention will be further described below in conjunction with the accompanying drawings. It should be noted that the description of these embodiments is used to help understand the present invention, but does not constitute a limitation of the present invention.

[0017] In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0018] Embodiment 1: With the rapid development of information technology, the importance of archive management has become increasingly prominent. In various fields, a large amount of information is recorded and saved as archive materials, covering various forms such as text, images, audio, and video. Traditional archive management mainly relies on manual operation and simple computer assistance. However, with the continuous increase in the number of archives and the increasing variety of archives, this method has gradually failed to meet the needs of modern society for efficient and accurate archive management. The existing archive system and method based on artificial intelligence have certain defects. On the one hand, archive retrieval is difficult. Faced with a large number of archive materials of various types, manual retrieval is difficult and prone to errors, and it takes a lot of time. Especially when the archive room is large, this problem is more prominent. On the other hand, in terms of archive information sharing, some existing computer management systems only use it as a tool for storing data, and the information sharing performance is poor. The lack of an effective sharing mechanism makes it impossible for archive information to flow efficiently between different departments and different users, and it is impossible to truly play the service function of information. This not only hinders the improvement of work efficiency, but also limits the full utilization of information resources. To this end, we propose an archive system and method based on artificial intelligence; Therefore, in order to effectively solve the above problems, the present application proposes an artificial intelligence-based archive system and method, as shown in the accompanying drawings of the specification. Figure 1-Figure 2 As shown, it includes intelligent retrieval module, information sharing optimization module, deep learning engine and adaptive classification module; The intelligent retrieval module uses natural language processing and deep neural networks, combined with word vector models, to convert retrieval requests and archive texts into vector forms. It achieves accurate and timely retrieval through cosine similarity and the correlation calculation formula that introduces the time decay factor. The retrieved relevant archive data will be passed as input to the deep learning engine and adaptive classification module. The information sharing optimization module adopts the advanced encryption standard improved algorithm that integrates quantum random number generation, uses the quantum random number generator to generate the initial key, encrypts the archive information in groups, and dynamically adjusts the number of encryption rounds according to the key length and security level to ensure the safe sharing of information. The deep learning engine uses the stochastic gradient descent algorithm to train the multi-layer convolutional neural network. By calculating the loss The loss function gradient and updated network parameters realize accurate feature extraction and pattern recognition of archival data. The deep learning engine extracts features after obtaining archival data from the intelligent retrieval module. The extracted features can be fed back to the intelligent retrieval module to optimize the retrieval results. At the same time, it can also provide more abundant feature information for classification for the adaptive classification module. The adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value according to the archival attributes. The adaptive classification module receives the feature information extracted by the deep learning engine and the archival data provided by the intelligent retrieval module, and comprehensively considers these factors to make classification adjustments, making the archival classification more reasonable and efficient. At the same time, the classification results can also provide a more accurate retrieval scope and direction for the intelligent retrieval module. The archive system also includes a data cleaning module, which uses the Z-score normalization method for numerical data and performs stemming and stop word filtering for text data; The specific workflow is to use the word vector model in the intelligent retrieval module. The word vector model is optimized and trained by a deep neural network to convert the search request and archive text entered by the user into a vector form, which helps to accurately capture the semantic features of the text and provide a basis for subsequent relevance calculations. The semantic similarity between the search request and the archive document is calculated through cosine similarity. During the calculation process, the vector is further analyzed and optimized in combination with natural language processing technology to improve the accuracy of semantic similarity calculations. Furthermore, by using natural language processing technology through the intelligent retrieval module, it is possible to deeply understand the semantics of the retrieval requests input by the user. The deep neural network further enhances the ability to analyze complex semantic relationships. Combined with the word vector model, the retrieval request and the archival text are converted into high-dimensional vectors. Through precise cosine similarity calculation and the correlation calculation formula that introduces the time decay factor, the archives that best meet the needs can be quickly and accurately selected from the massive archives. Even in large-scale archives, the deep learning engine can continuously optimize the feature extraction and pattern recognition capabilities through training on a large amount of archival data, greatly improving the accuracy and efficiency of retrieval, saving a lot of time and reducing the possibility of errors.

[0019] Embodiment 2: Based on the first embodiment, as shown in the accompanying drawings of the specification Figure 1 As shown in the figure, the intelligent retrieval module is provided with a word vector model, which is used to convert the retrieval request and the archive text into a vector form, and the correlation between the retrieval request and the archive text is calculated by cosine similarity. At the same time, the time decay factor is introduced to reflect the timeliness of the archive, and a higher weight is given to newer archives. The correlation score between the retrieval request and the archive text is calculated by the correlation calculation formula. The specific correlation score calculation formula is as follows: in: represents the relevance score, Represents a retrieval request. Archival documents, Represents a search request With archive documents The semantic similarity of Indicates the frequency of the search term in the document. represents the update frequency of the document, λ is the time decay coefficient, Indicates the current time. Indicates the time when the file was created. α , β and γ is an adjustable weight parameter; The search results are sorted in reverse order by the relevance score calculation formula, and archives with high relevance and strong timeliness are displayed first. The information sharing optimization module uses the improved Advanced Encryption Standard (AES) algorithm that integrates quantum random number generation to encrypt the shared archive information. In the initial stage of encryption, a highly random and unpredictable initial key is generated using a quantum random number generator. During the encryption process, the archive information is first grouped into 128-bit groups. Then, multiple round keys are generated by combining quantum keys and traditional key expansion algorithms. The number of encryption rounds is dynamically adjusted according to the key length and the security level of the archive. 128-bit keys are encrypted for 15 rounds, 192-bit keys are encrypted for 18 rounds, and 256-bit keys are encrypted for 15 rounds. The deep learning engine uses the stochastic gradient descent (SGD) algorithm to train the multi-layer convolutional neural network. First, the network parameters, including the weights and biases of the convolution kernel, are initialized. In each iteration, a small batch of archive data is randomly selected as a training sample, and the gradient of the loss function to the network parameters is calculated. The loss function here uses the entropy loss function. The specific loss function formula is as follows: in: represents the loss value, represents the true label, Represents the predicted output; Next, the parameters are updated according to the learning rate. The specific formula is as follows: in: Updated network parameters, Current network parameters, The gradient of the loss function; Through continuous iteration, the network gradually converges and can accurately extract features and recognize patterns of archive data. The adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value of the archive. First, for each attribute, its information entropy under the current classification is calculated. ,in Represents the probability of a certain attribute value appearing, and then calculates the information gain of the attribute for classification. The specific calculation formula is as follows: Information gain, D represents a dataset, Representation attributes A The value is v The data subset at time Representation dataset The information entropy of Representing a subset of data Information entropy of The greater the calculated information gain, the greater the contribution of the attribute to the classification. The classification level and category division of the archives are dynamically adjusted according to the information gain value. Specific workflow,For the information sharing optimization module, the Advanced Encryption Standard (AES) algorithm is used to encrypt the shared archive information. During the encryption process, the archive information is first grouped into 128 bits per group. Assuming that the original archive information is a piece of binary data "10101100 01110011 11010100 10001011", it is divided into 128-bit groups. Then, multiple round keys are generated through the key expansion algorithm. The number of encryption rounds depends on the key length. A 128-bit key is used for 10 rounds of encryption, a 192-bit key is used for 12 rounds of encryption, and a 256-bit key is used for 14 rounds of encryption. Taking a 128-bit key as an example, assuming that the key is "01010101 10101010 11110000 00001111", in each round of encryption, byte replacement operations are performed in sequence, that is, the input bytes are replaced with the corresponding output bytes through a predefined lookup table, such as replacing "10101100" with "01100101", thereby changing the distribution of the data, and then a row shift operation is performed, cyclically shifting each row of bytes in the matrix according to a specific offset. Assuming that the first row is not shifted, the second row is shifted left by one, the third row is shifted left by two, and the fourth row is shifted left by three to increase the degree of confusion of the data, and then a column confusion operation is performed, processing the bytes of each column through linear transformation, so that the change of a single byte can affect the data of the entire column, and finally a round key addition operation is performed, and the round key of the current round is bitwise XORed with the previously processed data. For example, in the first round, the processed data "0110010100111001 10010110 01001001" is combined with the round key "01010101 10101010 11110000 00001111" to further enhance the security of encryption. Only users with the correct key can restore the original archive information through the corresponding decryption algorithm, thus achieving safe and reliable information sharing; Furthermore, the information sharing optimization module adopts an improved algorithm of the Advanced Encryption Standard that integrates quantum random number generation, and uses the quantum random number generator to generate a highly random and unpredictable initial key to ensure the security of archival information during the sharing process. During the encryption process, the archival information is grouped, and multiple round keys are generated by combining the quantum key and the traditional key expansion algorithm. The number of encryption rounds is dynamically adjusted according to the key length and the security level of the archive. At the same time, the intelligent retrieval module works together with the information sharing optimization module to enable archival information to flow efficiently between different users and systems. The data cleaning module provides a high-quality data foundation for information sharing, truly giving play to the service function of information, promoting collaboration and communication between departments, and improving overall work efficiency.

[0020] Embodiment three: Based on the second embodiment, as shown in the accompanying drawings of the specification Figure 1-Figure 2 As shown in the figure, the data cleaning module uses data standardization technology to clean and normalize the original archive data. For numerical data, the Z-score standardization method is used to convert the data into a distribution with a mean of 0 and a standard deviation of 1. The calculation formula for Z-score standardization is as follows: in: represents the normalized value, Represents the original data value, represents the data mean, represents the standard deviation of the data; For text data, redundant and irrelevant information is removed through stem extraction and stop word filtering operations. The intelligent retrieval module also has an automatic error correction function. When the search request entered by the user contains spelling errors and semantic ambiguity, the edit distance algorithm is used to calculate the similarity with the correct search term. First, the string entered by the user is converted into a character array, and then the edit distance between the two arrays is calculated through the dynamic programming method. The editing operations include inserting, deleting and replacing characters. According to the size of the edit distance, the similarity with the possible correct search term is judged, and automatic error correction and optimization are performed. At the same time, the context information and historical search records are combined to further improve the accuracy of error correction. The information sharing optimization module supports attribute-based access control (ABAC) strategy. The information sharing optimization module dynamically allocates access rights based on user attributes, environmental attributes, operation attributes and object attributes. First, define the access control policy rules. Then, when the user initiates an access request, extract the relevant attribute information, and use the rule engine to evaluate and match these attributes. If the match is successful, the corresponding access rights are granted, otherwise, access is denied. When the deep learning engine extracts features, it uses the local binary pattern (LBP) algorithm to extract features from the archival image data. First, divide the image into several small areas. For each area, the central pixel is compared with its neighboring pixels. If the neighboring pixel value is greater than the central pixel value, it is marked as 1, otherwise, it is marked as 0. These marked values ​​are combined into a binary number in a certain order and converted into a decimal number as the LBP value of the area. Then, the frequency of occurrence of different LBP values ​​in the image is counted to form a feature vector. In this way, the detailed features of the archival image data can be effectively captured; Specific workflow,For the intelligent retrieval module, when the search request entered by the user contains spelling errors or semantic ambiguity, the edit distance algorithm is used to calculate the similarity with the correct search term. First, the string entered by the user is converted into a character array. For example, the user enters "cmoputer", which is converted into a character array ['c','','o','p','u','t','e','r']. Then, the edit distance between the two arrays is calculated by dynamic programming. The editing operations include inserting, deleting, and replacing characters. Assuming that the correct search term is "computer", it is converted into a character array ['c','o','','p','u','t','e','r']. Create a two-dimensional array to calculate the edit distance. The initial state is that the first row and the first column represent the number of operations from the empty string to the target string, respectively. Then, the two character arrays are compared bit by bit. According to whether the current characters are the same and the previous calculation results, the value of the edit distance is updated. For example, if the first character 'c' is the same, no operation is required. For the second characters '' and 'o' are different, the minimum cost of replacement, insertion or deletion is calculated. According to the size of the edit distance, the similarity with the possible correct search terms is judged. The smaller the edit distance, the higher the similarity. Automatic error correction and optimization are performed. At the same time, the context information and historical search records are combined to further improve the accuracy and intelligence of error correction. For example, if the user often enters "cmoputer" but actually wants to search for files related to "computer", the system will correct it to "computer" according to the historical records to improve the success rate of retrieval and user experience. For example, in an academic document archive system, the user enters "neorlogy". The system finds that it has a high similarity with "neurology" by calculating the edit distance, and automatically corrects it to "neurology" and displays related document archives to help users quickly obtain the required information. Furthermore, the adaptive classification module dynamically adjusts the classification strategy based on the information gain value calculated according to the archive attributes. Combined with the rich feature information extracted by the deep learning engine, the archives can be classified more accurately. When faced with a large and diverse range of archival materials, this dynamic classification method ensures that the archives are always in a reasonable classification system, which is convenient for users to quickly locate the required archives. At the same time, the deep learning engine uses the local binary pattern algorithm to process the archival image data during feature extraction, effectively capturing the image detail features, further enriching the feature information of the archives, and providing strong support for the accurate classification and efficient retrieval of archives, greatly improving the overall efficiency and service quality of archive management.

[0021] Working principle: First, the word vector model in the intelligent retrieval module is used. This model has been optimized and trained by deep neural networks to convert the retrieval requests and archive texts entered by users into vector form, which helps to accurately capture the semantic features of the text and provide a basis for subsequent relevance calculations. Then, the semantic similarity between the retrieval request and the archive document is calculated by cosine similarity. During the calculation process, the vector is further analyzed and optimized in combination with natural language processing technology to improve the accuracy of semantic similarity calculations. A time decay factor is introduced to reflect the timeliness of the archives, giving higher weights to newer archives. Considering the time characteristics of the archives, the retrieval results are more in line with the user's demand for the latest information. By dynamically adjusting the time decay coefficient, the degree of influence of timeliness on the relevance score can be flexibly controlled according to different archive types and application scenarios. According to the relevance calculation formula Calculate the relevance scores between the search request and the archive text, sort the search results in reverse order using the relevance score calculation formula, and give priority to displaying archives with high relevance and timeliness, providing users with the search results that best meet their needs. At this point, the entire workflow ends.

[0022] At the same time, the present application uses specific words to describe the embodiments of the present application. For example, "one embodiment", "an embodiment", and / or "some embodiments" refer to a certain feature, structure or characteristic related to at least one embodiment of the present application. Therefore, it should be emphasized and noted that "one embodiment" or "an embodiment" or "an alternative embodiment" mentioned twice or more in different positions in this specification does not necessarily refer to the same embodiment. In addition, certain features, structures or characteristics in one or more embodiments of the present application can be appropriately combined.

[0023] Some aspects of the present application may be performed entirely by hardware, entirely by software (including firmware, resident software, microcode, etc.), or by a combination of hardware and software. The above hardware or software may be referred to as "data blocks", "modules", "engines", "units", "components" or "systems". The processor may be one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DAPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, microcontrollers, microprocessors, or combinations thereof. In addition, various aspects of the present application may be represented as computer products located in one or more computer-readable media, which include computer-readable program codes. For example, computer-readable media may include, but are not limited to, magnetic storage devices (e.g., hard disks, floppy disks, tapes ...), optical disks (e.g., compact disks CDs, digital versatile disks DVDs ...), smart cards, and flash memory devices (e.g., cards, sticks, key drives ...).

[0024] A computer-readable medium may include a propagated data signal containing computer program code, such as in baseband or as part of a carrier wave. The propagated signal may have a variety of manifestations, including electromagnetic, optical, etc., or a suitable combination. A computer-readable medium may be any computer-readable medium other than a computer-readable storage medium, which may be connected to an instruction execution system, device or apparatus to communicate, propagate or transmit a program for use. The program code on the computer-readable medium may be propagated through any suitable medium, including radio, cable, fiber optic cable, radio frequency signal, or similar medium, or a combination of any of the above mediums.

[0025] Similarly, it should be noted that in order to simplify the description disclosed in this application, so as to help understand one or more embodiments of the invention, in the above description of the embodiments of the present application, sometimes multiple features are merged into one embodiment, drawings or descriptions thereof. However, this disclosure method does not mean that the features required by the object of the present application are more than the features mentioned in the claims. In fact, the features of the embodiment are less than all the features of the single embodiment disclosed above. In some embodiments, numbers describing the number of components and attributes are used. It should be understood that such numbers used in the description of the embodiments are modified by the modifiers "approximately", "approximately" or "substantially" in some examples. Unless otherwise specified, "approximately", "approximately" or "substantially" indicate that the number allows a variation of ±20%. Accordingly, in some embodiments, the numerical parameters used in the specification and claims are approximate values, which may change according to the characteristics required by individual embodiments. In some embodiments, the numerical parameters should take into account the specified significant digits and adopt the general method of retaining the digits. Although the numerical domains and parameters used to confirm the breadth of their range in some embodiments of the present application are approximate values, in specific embodiments, such numerical settings are as accurate as possible within the feasible range.

[0026] Although the present invention is disclosed as above in terms of preferred embodiments, it is not intended to limit the present invention. Any person skilled in the art may make possible changes and modifications without departing from the spirit and scope of the present invention. Therefore, any modification, equivalent change and modification made to the above embodiments according to the technical essence of the present invention without departing from the content of the technical solution of the present invention shall fall within the scope of protection defined by the claims of the present invention.

Claims

1. An artificial intelligence-based archive system, characterized by: The archive system includes an intelligent retrieval module, an information sharing optimization module, a deep learning engine and an adaptive classification module; The intelligent retrieval module uses natural language processing and deep neural networks, combined with word vector models, to convert retrieval requests and archive texts into vector forms, and achieves accurate and timely retrieval through cosine similarity and the correlation calculation formula that introduces the time decay factor. The retrieved relevant archive data will be passed as input to the deep learning engine and the adaptive classification module. The information sharing optimization module adopts the advanced encryption standard improved algorithm that integrates quantum random number generation, uses the quantum random number generator to generate the initial key, encrypts the archive information in groups, and dynamically adjusts the number of encryption rounds according to the key length and security level to ensure the safe sharing of information. The deep learning engine uses the stochastic gradient descent algorithm to train the multi-layer convolutional neural network, and calculates the loss. The loss function gradient and updated network parameters realize accurate feature extraction and pattern recognition of archival data. The deep learning engine extracts features after acquiring archival data from the intelligent retrieval module. The extracted features can be fed back to the intelligent retrieval module to optimize the retrieval results. At the same time, it can also provide more abundant feature information for classification for the adaptive classification module. The adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value according to the archival attributes. The adaptive classification module receives the feature information extracted by the deep learning engine and the archival data provided by the intelligent retrieval module, and comprehensively considers these factors to make classification adjustments, so that the archival classification is more reasonable and efficient. At the same time, the classification results can also provide a more accurate retrieval scope and direction for the intelligent retrieval module. The archive system also includes a data cleaning module, which uses a Z-score standardization method for numerical data and performs stem extraction and stop word filtering on text data.

2. The artificial intelligence-based archive system according to claim 1, characterized in that: The intelligent retrieval module is provided with a word vector model, which is used to convert the retrieval request and the archive text into a vector form, and the correlation between the retrieval request and the archive text is calculated by cosine similarity. At the same time, a time decay factor is introduced to reflect the timeliness of the archive, and a higher weight is given to newer archives. The correlation score between the retrieval request and the archive text is calculated by a correlation calculation formula. The specific correlation score calculation formula is as follows: in: represents the relevance score, Represents a retrieval request. Archival documents, Represents a search request With archive documents The semantic similarity of Indicates the frequency of the search term in the document. represents the update frequency of the document, λ is the time decay coefficient, Indicates the current time. Indicates the time when the file was created. α , β and γ is an adjustable weight parameter; The search results are sorted in reverse order using the relevance score calculation formula, with archives that are highly relevant and timely being displayed first.

3. The artificial intelligence-based archive system according to claim 1, characterized in that: The information sharing optimization module adopts the improved Advanced Encryption Standard (AES) algorithm that integrates quantum random number generation to encrypt the shared archival information. In the initial stage of encryption, a quantum random number generator is used to generate a highly random and unpredictable initial key. In the encryption process, the archival information is first grouped into 128 bits per group. Then, multiple round keys are generated by combining quantum keys and traditional key expansion algorithms. The number of encryption rounds is dynamically adjusted according to the key length and the security level of the archive. 128-bit keys are used for 15 rounds of encryption, 192-bit keys are used for 18 rounds of encryption, and 256-bit keys are used for 20 rounds of encryption. In each round, byte replacement, row shift, column confusion and round key addition operations are performed in sequence to ensure the confidentiality and integrity of the archival information during the sharing process, and to ensure that only users with the correct keys can restore the original archival information through the corresponding decryption algorithm, thereby achieving safe and reliable information sharing.

4. The artificial intelligence-based archive system according to claim 1, characterized in that: The deep learning engine uses the stochastic gradient descent (SGD) algorithm to train the multi-layer convolutional neural network. First, the network parameters, including the weights and biases of the convolution kernels, are initialized. In each iteration, a small batch of archive data is randomly selected as training samples, and the gradient of the loss function to the network parameters is calculated. The loss function here uses the entropy loss function. The specific loss function formula is as follows: in: represents the loss value, represents the true label, Represents the predicted output; Next, the parameters are updated according to the learning rate. The specific formula is as follows: in: Updated network parameters, Current network parameters, The gradient of the loss function; Through continuous iteration, the network gradually converges and can accurately extract features and recognize patterns of archival data.

5. The artificial intelligence-based archive system according to claim 1, characterized in that: The adaptive classification module dynamically adjusts the classification strategy by calculating the information gain value of the archive. First, for each attribute, its information entropy under the current classification is calculated. ,in Represents the probability of a certain attribute value appearing, and then calculates the information gain of the attribute for classification. The specific calculation formula is as follows: Information gain, D represents a dataset, Representation attributes A The value is v The data subset at time Representation dataset The information entropy of Representing a subset of data Information entropy of The larger the calculated information gain is, the greater the contribution of the attribute to the classification. The classification level and category division of the archives are dynamically adjusted according to the size of the information gain value.

6. The artificial intelligence-based archive system according to claim 1, characterized in that: The data cleaning module uses data standardization technology to clean and normalize the original archive data. For numerical data, the Z-score standardization method is used to convert the data into a distribution with a mean of 0 and a standard deviation of 1. The calculation formula for Z-score standardization is as follows: in: represents the normalized value, Represents the original data value, represents the data mean, represents the standard deviation of the data; For text data, redundant and irrelevant information is removed through stemming and stop word filtering operations.

7. The artificial intelligence-based archive system according to claim 1, characterized in that: The intelligent retrieval module also has an automatic error correction function. When the search request input by the user contains spelling errors and semantic ambiguity, the similarity with the correct search term is calculated through the edit distance algorithm. First, the string input by the user is converted into a character array, and then the edit distance between the two arrays is calculated through the dynamic programming method. The editing operations include inserting, deleting and replacing characters. According to the size of the edit distance, the similarity with the possible correct search term is judged, and automatic error correction and optimization are performed. At the same time, the context information and historical search records are combined to further improve the accuracy of error correction.

8. The artificial intelligence-based archive system according to claim 1, characterized in that: The information sharing optimization module supports attribute-based access control (ABAC) strategy. The information sharing optimization module dynamically allocates access rights based on user attributes, environmental attributes, operation attributes and object attributes. First, the access control policy rules are defined. Then, when the user initiates an access request, the relevant attribute information is extracted and the rule engine is used to evaluate and match these attributes. If the match is successful, the corresponding access rights are granted, otherwise, access is denied.

9. The artificial intelligence-based archive system according to claim 1, characterized in that: When performing feature extraction, the deep learning engine uses the local binary pattern (LBP) algorithm to extract features from the archival image data. First, the image is divided into several small areas. The central pixel of each area is compared with its neighborhood pixels. If the neighborhood pixel value is greater than the central pixel value, it is marked as 1, otherwise, it is marked as 0. These marked values ​​are combined into a binary number in a certain order and converted into a decimal number as the LBP value of the area. Then, the frequency of occurrence of different LBP values ​​in the image is counted to form a feature vector. In this way, the detailed features of the archival image data can be effectively captured.

10. An artificial intelligence-based archival method applicable to the artificial intelligence-based archival system of any one of claims 1 to 9, characterized in that: The archival method comprises the following steps: Step 1: Use the word vector model in the intelligent retrieval module. This model is optimized and trained by a deep neural network to convert the search request and archive text entered by the user into a vector form, helping to accurately capture the semantic features of the text and provide a basis for subsequent relevance calculations; Step 2: Calculate the semantic similarity between the search request and the archive document through cosine similarity. In the calculation process, further analyze and optimize the vectors in combination with natural language processing technology to improve the accuracy of semantic similarity calculation; Step 3: Introduce a time decay factor to reflect the timeliness of archives, give higher weights to newer archives, and consider the time characteristics of archives, so that the search results are more in line with the user's needs for the latest information. By dynamically adjusting the time decay coefficient, the influence of timeliness on the relevance score can be flexibly controlled according to different archive types and application scenarios; Step 4: Calculate the correlation formula Calculate the relevance scores between the search request and the archive text, sort the search results in reverse order using the relevance score calculation formula, give priority to displaying archives with high relevance and timeliness, and provide users with the search results that best meet their needs.

Citation Information

Patent Citations

  • System and method for temporal identification of latent communities using electronic content

    CA2941604A1

  • Method and system for enhancing file entity association degree based on knowledge graph

    CN111753099A

  • Digital library retrieval and resource sharing system based on cloud computing

    CN116701771A

  • Power file question and answer type intelligent retrieval method and system

    CN117171333A

  • Automatic filing method and system for personnel archives

    CN117827750A

Cited By

  • Urban and rural planning and construction data security sharing method and system

    CN119885244A

  • Diagnosis prediction device and system based on knowledge caching and personalized federated learning

    CN119943357A

  • Implementation system for document encryption

    CN120145426A

  • An implementation system for document encryption

    CN120145426B

  • Government affair file intelligent classification and retrieval system

    CN120407796A