# A Novel Literary Translation Text Classification Method Based on Distributed Incremental Sequence Data Mining Algorithm

Authors: Ji Sun
Journal: Security and Communication Networks
 (2022)

---

## Abstract

With the rapid development of electronic information technology and Internet technology, people's ability to generate and collect data is also increasing. With the rapid development of international exchanges, the number of literary translation texts has also increased dramatically. The information contained in the huge data of literary translation texts is huge, but these data are disorganized at this stage. Therefore, the classification of literary translation texts has become the key to efficient management of translated text information. Literary translation text classification is the process of classifying a given text as one or several of several predetermined text categories according to the content of the text. As one of the key steps in processing huge amounts of text data, text classification is generally regarded as the orderly organization of text sets, that is, grouping similar and related texts together. In this way, the problem of information clutter can be solved to a greater extent, and the efficiency of users' discovery, filtering, and analysis of text information resources can be effectively improved. At present, the basis of text classification is mainly based on the characteristics of words in the article, to analyze the correlation between words and categories. This approach ignores information such as word order and collocations in literary translation texts. To solve this problem, this paper introduces the distributed incremental sequence data mining algorithm into the classification of literary translation texts. This method can fully mine the features of syntactic order and other features based on considering the words and phrasing characteristics of articles in different application fields. The text classification effect is strengthened by discovering more effective information. The experimental results show that the method can improve the classification performance of literary translation texts.


---

## Body

## 1. Introduction

With the advancement of globalization, international exchanges and learning have become more common, and the dissemination of literary texts has grown in scope. As the world's primary language of communication today, English has gradually produced translated texts from various literature. Many literary translation texts were created over time. When confronted with a massive amount of literary translation text information, knowing how to efficiently filter useful information, accurately locate information categories, and deftly explore hidden information has become increasingly important. Based on this demand, text classification technology emerges as needed, having a significant impact on the process of knowledge discovery. The early text classification was done entirely by hand, and the work was arduous, clumsy, time consuming, labor intensive, and inefficient. Until the late 1950s, the IBM Corporation of the United States led the way in incorporating the concept of word frequency statistics into the text classification process, with positive results. This also marks the beginning of a new phase in text classification research. Many experts and scholars have conducted extensive and in-depth research on text classification methods since then, and many text classification methods have been proposed.Because of Internet's rapid development, all types of information are flooding the network, and a keyword search in a search engine will return millions of results. The ability to use effective classification methods to filter useful category information has a wide range of applications in real life [1–3]. Many researchers from various fields have conducted extensive research on this topic, and various text classification methods have emerged [4, 5]. Text classification based on similarity is a widely used method in the field of text classification [6–8]. Several methods for calculating vector similarity have been proposed, including Euclidean distance, Jaccard similarity, cosine similarity, Kullback–Leibler divergence, Canberra distance metric, hammering distance, dice coefficient, and pairwise adaptive, among others. Measures of similarity have been developed. It is commonly used in text classification [9, 10]. This different relationship, however, is a significant factor influencing classification performance. The use of bag-of-words is also very mature in the field of text classification [11–13]. A document is frequently represented as a vector, with each component containing the value corresponding to the corresponding feature. This feature value could be word frequency, associated word frequency, or something else. Many studies have begun to conduct in-depth research on text lexical rules in order to improve the performance of text classification [14]. Because of their simplicity, word-based methods are preferred by researchers in a variety of fields. At this point, many word-based feature selection methods have been proposed by various scholars [15–17]. However, word-based methods usually ignore the association between words, which will lead to loss of information about paragraphs and sentences in the text and will easily cause problems such as polysemy, synonyms, and noise interference [18].Texts in various application fields, in general, have their own distinct writing characteristics, or literary habits. Some of these habits are reflected in the article's wording and phrasing, while others are reflected in word collocation, syntactic order, or other aspects. Because of the presence of these characteristics, we can easily identify texts in a variety of application fields. As a result, whether it is the initial manual recognition or machine recognition, the information used for text classification is likely to belong to the article characteristics of the application field contained in each document. Most current text classification methods primarily complete the task of text classification by identifying, extracting, and utilizing textual characteristics in various fields. The current problem is that the traditional classification method still focuses on the relevance of the article and only determines which feature words correspond to the field. However, words are relatively isolated from each other, and the characteristics of word collocation and syntactic order are not considered, so the information that can be extracted is relatively limited. Sequence pattern mining can dig out the pattern sequences hidden in the transaction set, and all the elements in these pattern sequences are frequent and relatively sequential. This order can be relative to time or relative to space. This shows that the sequential pattern mining method can fully and effectively utilize the sequential characteristics of transactions. In view of the shortcomings of the existing text classification methods, this paper attempts to introduce the idea of sequential pattern mining into the text classification method and uses the distributed incremental sequential data mining algorithm to propose a method of literary translation text based on the distributed incremental sequential data mining algorithm. The new method can fully mine text syntactic sequence features such as word order and word collocation based on considering the characteristics of words and phrasing of articles in different application fields. Thereby, more effective information can be discovered to strengthen and improve the effect of text classification.


## 2. Knowledge Based on Sequence Patterns

### 2.1. Sequence Pattern Data Mining

The goal of sequential pattern mining [19] is to find all sequential patterns in a sequence database that have a frequency greater than a predefined threshold. Mining for sequence patterns is analogous to mining for association rules. However, the former is more concerned with the temporal or spatial dependencies of event elements than the latter, i.e., the former is more concerned with event sequence characteristics. This order can be both temporal and spatial in nature. The original goal of sequence mining was to uncover sequences of frequent buying patterns in a transaction database with transaction times. In this method, we can determine the purchase behavior trajectory of most clients over a certain time period. Later, with the deepening of algorithm research and the upgrading of technology, especially the optimization of mining algorithms and the use of high-performance computers, the application field of sequential pattern mining has become very broad. At present, it is widely used in professional fields such as customer purchasing behavior prediction, medical diagnosis, web page access pattern prediction, industrial control, and gene sequence analysis.Sequential pattern mining is one of the important technologies in the field of data mining and has applications in many fields. At present, there are a lot of related research studies on sequential pattern mining algorithms, and the proposed algorithms are also very comprehensive. According to different mining strategies, sequential pattern mining algorithms can be divided into two categories, one is the algorithm based on the breadth-first search strategy, and the other is the algorithm based on the depth-first search strategy. Among them, the representative algorithms based on the breadth-first search strategy are the Apriori-All algorithm [20], the GSP algorithm [21], and the SPADE algorithm [22]. Typical depth-first search algorithms mainly include FreeSpan algorithm [23], PrefixSpan algorithm [24], and SPAM algorithm [25].


### 2.2. Text Classification Based on Sequential Patterns

As illustrated in Figure1, text classification based on sequential patterns consists mostly of two stages. The first task is to create a library of classification patterns. The sequential pattern mining approach is used to mine the sequential patterns belonging to this category for each batch of training texts from a known category, resulting in the formation of the pattern sublibrary of this category. After each category's sublibraries are generated, they are aggregated into the final pattern library P = {P1,…,Pj,…, Pk}. The next step is to examine the freshly entered text. The input text sequence is generated by turning each text into a line of text characters using related approaches. Second, pattern matching is carried out. Finally, the text is classified in accordance with the classification principle. The classification of literary translation texts in this paper is based on the framework shown in Figure 1.Figure 1
Architecture diagram of text classification based on sequence pattern.According to Figure1, it can be concluded that the text classification process based on sequence patterns is as follows:Text preparation is the first. Only discrete data can be analyzed with sequential pattern mining algorithms, and it is not always evident whether a dataset is discrete. If the data are continuous, it must first be discretized. To obtain a set of word sequences for each category, we first store all the texts in the training text set individually according to distinct categories and then execute word segmentation and stop word removal processing on them according to a unified standard.Second, each category's frequent sequence patterns are mined to create a categorization pattern library. Each category's set of word sequences is turned into a standard set of transactions with timestamps and sequence IDs. The sequential pattern mining method is then utilized for the standard transaction sets of different categories to uncover the frequent patterns belonging to each category, and the subpattern library belonging to each category is obtained. The categorization pattern library is then obtained.Finally, text classification is carried out. The new text is input to be categorized, and pattern matching is executed with all frequent patterns in the classification pattern library that has been created. We count the number of common patterns that match the new text in each subpattern library. Finally, documents having unidentified category attribute values are categorized using the definition classification principle.


## 2.1. Sequence Pattern Data Mining

The goal of sequential pattern mining [19] is to find all sequential patterns in a sequence database that have a frequency greater than a predefined threshold. Mining for sequence patterns is analogous to mining for association rules. However, the former is more concerned with the temporal or spatial dependencies of event elements than the latter, i.e., the former is more concerned with event sequence characteristics. This order can be both temporal and spatial in nature. The original goal of sequence mining was to uncover sequences of frequent buying patterns in a transaction database with transaction times. In this method, we can determine the purchase behavior trajectory of most clients over a certain time period. Later, with the deepening of algorithm research and the upgrading of technology, especially the optimization of mining algorithms and the use of high-performance computers, the application field of sequential pattern mining has become very broad. At present, it is widely used in professional fields such as customer purchasing behavior prediction, medical diagnosis, web page access pattern prediction, industrial control, and gene sequence analysis.Sequential pattern mining is one of the important technologies in the field of data mining and has applications in many fields. At present, there are a lot of related research studies on sequential pattern mining algorithms, and the proposed algorithms are also very comprehensive. According to different mining strategies, sequential pattern mining algorithms can be divided into two categories, one is the algorithm based on the breadth-first search strategy, and the other is the algorithm based on the depth-first search strategy. Among them, the representative algorithms based on the breadth-first search strategy are the Apriori-All algorithm [20], the GSP algorithm [21], and the SPADE algorithm [22]. Typical depth-first search algorithms mainly include FreeSpan algorithm [23], PrefixSpan algorithm [24], and SPAM algorithm [25].


## 2.2. Text Classification Based on Sequential Patterns

As illustrated in Figure1, text classification based on sequential patterns consists mostly of two stages. The first task is to create a library of classification patterns. The sequential pattern mining approach is used to mine the sequential patterns belonging to this category for each batch of training texts from a known category, resulting in the formation of the pattern sublibrary of this category. After each category's sublibraries are generated, they are aggregated into the final pattern library P = {P1,…,Pj,…, Pk}. The next step is to examine the freshly entered text. The input text sequence is generated by turning each text into a line of text characters using related approaches. Second, pattern matching is carried out. Finally, the text is classified in accordance with the classification principle. The classification of literary translation texts in this paper is based on the framework shown in Figure 1.Figure 1
Architecture diagram of text classification based on sequence pattern.According to Figure1, it can be concluded that the text classification process based on sequence patterns is as follows:Text preparation is the first. Only discrete data can be analyzed with sequential pattern mining algorithms, and it is not always evident whether a dataset is discrete. If the data are continuous, it must first be discretized. To obtain a set of word sequences for each category, we first store all the texts in the training text set individually according to distinct categories and then execute word segmentation and stop word removal processing on them according to a unified standard.Second, each category's frequent sequence patterns are mined to create a categorization pattern library. Each category's set of word sequences is turned into a standard set of transactions with timestamps and sequence IDs. The sequential pattern mining method is then utilized for the standard transaction sets of different categories to uncover the frequent patterns belonging to each category, and the subpattern library belonging to each category is obtained. The categorization pattern library is then obtained.Finally, text classification is carried out. The new text is input to be categorized, and pattern matching is executed with all frequent patterns in the classification pattern library that has been created. We count the number of common patterns that match the new text in each subpattern library. Finally, documents having unidentified category attribute values are categorized using the definition classification principle.


## 3. Distributed Incremental Sequence Data Mining Algorithm

### 3.1. Distributed Computing Framework MapReduce

A sequential pattern mining method based on the distributed lexical sequence tree algorithm was proposed in reference [26]. Based on this research, this work employs a MapReduce-based distributed incremental sequential pattern mining approach. In a huge data setting, the approach can be utilized to overcome the incremental maintenance problem of sequential pattern mining. To deal with huge data challenges, MapReduce employs a distributed programming framework that employs a divide-and-conquer method. The system conceals the internal mechanics of data segmentation and distribution, task scheduling, intermachine communication, and fault tolerance from the programmer. It enables inexperienced programmers to efficiently manage the system's resources in a distributed system. The MapReduce approach not only simplifies distributed programming, but it also allows for more efficient processing of big data volumes.Our method is divided into two MapReduce stages. The first stage consists primarily of reading the sequence's input split and determining the support count of the frequent 1 itemsets, as well as determining whether the frequent 1 itemsets belong to the incremental dataset using flag variables. The CMP data structure is created in the second stage. The candidate data are generated by using the CMP data structure and backward expansion. Furthermore, the prepruning attributes used in backward mining prevent erroneous candidate sequences from being generated in the input database, which speeds up the mining process.


### 3.2. Mining Frequent 1 Sequence

The first stage is used to mine frequent 1 sequence. Each Map1 identifies the input sequence dataset and determines whether itemx belongs to the corresponding sequence's incremental dataset IDB. Item x stores 1 in distributed cache F if item belongs to IDB, otherwise 0. Then, Map outputs item x and its matching value in F as <key, value> and Reduce1<x, value> as input. The item count and flag variables are set to zero. The function of the flag variable is to indicate whether the item is included in the IDB. Reduce1 is used to determine how many values are related to each item. Reduce1 sets the flag variable to 1 after getting the item value 1, which aids in finding the incremental union in the second stage. At last, as the first stage's output, the frequent 1 itemsets, and their related counts and flags are used. Figure 2 depicts the first stage of this method's procedure.Figure 2
Flowchart of the first stage.


### 3.3. Mining Frequentk Sequences

First, the frequent 1 itemsets, minimum support counts, and flags in the original dataset output from the first stage are used as the input of the second stage. Second, Map2 creates incremental unions and constructs CMP data structures, and uses prepruning attributes for backward mining. Finally, Reduce2 is used to mine frequentk sequences. The second stage process is shown in Figure 3.Figure 3
Flowchart of the second stage.


#### 3.3.1. Discovering the Incremental Union

The distributed cache file is read in the second stage, and the incremental union is found. For each item in the distributed cache file, we check if its flag is equal to 1. If it is equal to 1, we join the item to the incremental union, otherwise the 1 mode cannot be added to the incremental union.


#### 3.3.2. Constructing the CMP Data Structure

This paper constructs the CMP data structure to optimize the speed of the algorithm. CMP(i) construction: By definition, CMP(i) is a mapping of an item and its preceding item list (co-occurrence list, CLST) relative to the extension of the itemset. The sequence scans from the last itemset to the first to match the CLST. If there is corresponding item toεi exists in CMP(i), then the CLST of εi is retrieved from CMP(i) of εi, and the co-occurrence item εj is checkedcby the retrieved CLST to find its count. If item j did not previously exist in CLST, it is included in CLST εi. If the entry in CMP(i) corresponding to term i does not exist, then a CLST for term i is created by including the co-occurrence term εj. The CMP(i) of εi is updated with the corresponding CLST CMP(s) construction: By definition, a CMP(s) is an item mapping to its preceding list relative to the sequence expansion, and creating a CMP(s) is basically the same as creating a CMP(i).


#### 3.3.3. Backward Mining Algorithm

The input of the backward mining algorithm is the sequence, the end projection (Epj) and H projection (Hpj) of the CMP(i), and CMP(s) sequences of the first item of the sequence, and the output is the updated data set frequent sequential patterns in UDB. The 1-mode end projection is the Epj from the backward extension. The sequence’s backward extension is inferred by the CMP(i) and CMP(s) of the sequence. If the CMP(i) of the sequence does not exist, then itemset extension does not exist. The Epj of the generated sequences can be found in the Epj of the sequences, and the H projections of the sequences are scanned to find the H projections of the sequences extending from them. Support counts for these sequences are the sum of Epj’s and Hpj’s size. When the support counts of all extensions meet the lower threshold, they will be added into frequent sequences list and be called with recursion.


#### 3.3.4. Generating Candidate Sequences

After creating the CMP data structure, a candidate set is generated. This paper designs two candidate generation rules based on backward mining to avoid generating misleading data so as to generate sequences of candidate efficiently. We assume the following definitions:(1)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate itemset candidates from a extensions that belong to CMP(i) (b) Ck+1ε=aεkεk−1…ε1, where b is the first term in εk(2)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate sequence candidates by extending a that belong to CMP(s) (b) Ck+1s=aεkεk−1…ε1, where b is the first term in εk


#### 3.3.5. Generating Prepruning Sequences

Computing the support counts is quite slow. Mining speed can be improved if the generated candidates are pruned before computing support counts. This paper defines prepruning properties based on the CMP data structure. Sequences are trimmed early if their length exceeds a certain value, according to their properties. As shown in Figure4, the following definitions are assumed:Figure 4
Definitions of prepruning.


#### 3.3.6. Algorithm Implementation

The resources used are initialized through the SETUP function in the second phase of the MapReduce platform in this paper. After getting the input, Mappers treats infrequent items with pruning, then creates CMP(i) and CMP(s), and finds Projection and end projection of each 1-modea. Each 1-mode is checked to see if it belongs to an incremental union to get the 1-modes of stable and expand them to seek the frequent sequences. If 1 mode is unstable, the function of backward mining will be called for each unstable ones, and 5 parameters are passed to the function when calling: unstable 1-mode a, the extended sequence of a, the itemset extended sequence of a, the end projection of a, and the H projection of a, where the H projection of a is calculated from the difference between the projection of a and the end projection of a.Reduce2 takesk and value v as input and initializes the item count to 0. Reduce2 computes the items’ values, after receiving the value about the item, and increments the item count. If the item count is greater than the product of the min support count and |UD|, we output k and item counts and then write them to files in the Hadoop distributed file system HDFS.


## 3.1. Distributed Computing Framework MapReduce

A sequential pattern mining method based on the distributed lexical sequence tree algorithm was proposed in reference [26]. Based on this research, this work employs a MapReduce-based distributed incremental sequential pattern mining approach. In a huge data setting, the approach can be utilized to overcome the incremental maintenance problem of sequential pattern mining. To deal with huge data challenges, MapReduce employs a distributed programming framework that employs a divide-and-conquer method. The system conceals the internal mechanics of data segmentation and distribution, task scheduling, intermachine communication, and fault tolerance from the programmer. It enables inexperienced programmers to efficiently manage the system's resources in a distributed system. The MapReduce approach not only simplifies distributed programming, but it also allows for more efficient processing of big data volumes.Our method is divided into two MapReduce stages. The first stage consists primarily of reading the sequence's input split and determining the support count of the frequent 1 itemsets, as well as determining whether the frequent 1 itemsets belong to the incremental dataset using flag variables. The CMP data structure is created in the second stage. The candidate data are generated by using the CMP data structure and backward expansion. Furthermore, the prepruning attributes used in backward mining prevent erroneous candidate sequences from being generated in the input database, which speeds up the mining process.


## 3.2. Mining Frequent 1 Sequence

The first stage is used to mine frequent 1 sequence. Each Map1 identifies the input sequence dataset and determines whether itemx belongs to the corresponding sequence's incremental dataset IDB. Item x stores 1 in distributed cache F if item belongs to IDB, otherwise 0. Then, Map outputs item x and its matching value in F as <key, value> and Reduce1<x, value> as input. The item count and flag variables are set to zero. The function of the flag variable is to indicate whether the item is included in the IDB. Reduce1 is used to determine how many values are related to each item. Reduce1 sets the flag variable to 1 after getting the item value 1, which aids in finding the incremental union in the second stage. At last, as the first stage's output, the frequent 1 itemsets, and their related counts and flags are used. Figure 2 depicts the first stage of this method's procedure.Figure 2
Flowchart of the first stage.


## 3.3. Mining Frequentk Sequences

First, the frequent 1 itemsets, minimum support counts, and flags in the original dataset output from the first stage are used as the input of the second stage. Second, Map2 creates incremental unions and constructs CMP data structures, and uses prepruning attributes for backward mining. Finally, Reduce2 is used to mine frequentk sequences. The second stage process is shown in Figure 3.Figure 3
Flowchart of the second stage.


### 3.3.1. Discovering the Incremental Union

The distributed cache file is read in the second stage, and the incremental union is found. For each item in the distributed cache file, we check if its flag is equal to 1. If it is equal to 1, we join the item to the incremental union, otherwise the 1 mode cannot be added to the incremental union.


### 3.3.2. Constructing the CMP Data Structure

This paper constructs the CMP data structure to optimize the speed of the algorithm. CMP(i) construction: By definition, CMP(i) is a mapping of an item and its preceding item list (co-occurrence list, CLST) relative to the extension of the itemset. The sequence scans from the last itemset to the first to match the CLST. If there is corresponding item toεi exists in CMP(i), then the CLST of εi is retrieved from CMP(i) of εi, and the co-occurrence item εj is checkedcby the retrieved CLST to find its count. If item j did not previously exist in CLST, it is included in CLST εi. If the entry in CMP(i) corresponding to term i does not exist, then a CLST for term i is created by including the co-occurrence term εj. The CMP(i) of εi is updated with the corresponding CLST CMP(s) construction: By definition, a CMP(s) is an item mapping to its preceding list relative to the sequence expansion, and creating a CMP(s) is basically the same as creating a CMP(i).


### 3.3.3. Backward Mining Algorithm

The input of the backward mining algorithm is the sequence, the end projection (Epj) and H projection (Hpj) of the CMP(i), and CMP(s) sequences of the first item of the sequence, and the output is the updated data set frequent sequential patterns in UDB. The 1-mode end projection is the Epj from the backward extension. The sequence’s backward extension is inferred by the CMP(i) and CMP(s) of the sequence. If the CMP(i) of the sequence does not exist, then itemset extension does not exist. The Epj of the generated sequences can be found in the Epj of the sequences, and the H projections of the sequences are scanned to find the H projections of the sequences extending from them. Support counts for these sequences are the sum of Epj’s and Hpj’s size. When the support counts of all extensions meet the lower threshold, they will be added into frequent sequences list and be called with recursion.


### 3.3.4. Generating Candidate Sequences

After creating the CMP data structure, a candidate set is generated. This paper designs two candidate generation rules based on backward mining to avoid generating misleading data so as to generate sequences of candidate efficiently. We assume the following definitions:(1)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate itemset candidates from a extensions that belong to CMP(i) (b) Ck+1ε=aεkεk−1…ε1, where b is the first term in εk(2)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate sequence candidates by extending a that belong to CMP(s) (b) Ck+1s=aεkεk−1…ε1, where b is the first term in εk


### 3.3.5. Generating Prepruning Sequences

Computing the support counts is quite slow. Mining speed can be improved if the generated candidates are pruned before computing support counts. This paper defines prepruning properties based on the CMP data structure. Sequences are trimmed early if their length exceeds a certain value, according to their properties. As shown in Figure4, the following definitions are assumed:Figure 4
Definitions of prepruning.


### 3.3.6. Algorithm Implementation

The resources used are initialized through the SETUP function in the second phase of the MapReduce platform in this paper. After getting the input, Mappers treats infrequent items with pruning, then creates CMP(i) and CMP(s), and finds Projection and end projection of each 1-modea. Each 1-mode is checked to see if it belongs to an incremental union to get the 1-modes of stable and expand them to seek the frequent sequences. If 1 mode is unstable, the function of backward mining will be called for each unstable ones, and 5 parameters are passed to the function when calling: unstable 1-mode a, the extended sequence of a, the itemset extended sequence of a, the end projection of a, and the H projection of a, where the H projection of a is calculated from the difference between the projection of a and the end projection of a.Reduce2 takesk and value v as input and initializes the item count to 0. Reduce2 computes the items’ values, after receiving the value about the item, and increments the item count. If the item count is greater than the product of the min support count and |UD|, we output k and item counts and then write them to files in the Hadoop distributed file system HDFS.


## 3.3.1. Discovering the Incremental Union

The distributed cache file is read in the second stage, and the incremental union is found. For each item in the distributed cache file, we check if its flag is equal to 1. If it is equal to 1, we join the item to the incremental union, otherwise the 1 mode cannot be added to the incremental union.


## 3.3.2. Constructing the CMP Data Structure

This paper constructs the CMP data structure to optimize the speed of the algorithm. CMP(i) construction: By definition, CMP(i) is a mapping of an item and its preceding item list (co-occurrence list, CLST) relative to the extension of the itemset. The sequence scans from the last itemset to the first to match the CLST. If there is corresponding item toεi exists in CMP(i), then the CLST of εi is retrieved from CMP(i) of εi, and the co-occurrence item εj is checkedcby the retrieved CLST to find its count. If item j did not previously exist in CLST, it is included in CLST εi. If the entry in CMP(i) corresponding to term i does not exist, then a CLST for term i is created by including the co-occurrence term εj. The CMP(i) of εi is updated with the corresponding CLST CMP(s) construction: By definition, a CMP(s) is an item mapping to its preceding list relative to the sequence expansion, and creating a CMP(s) is basically the same as creating a CMP(i).


## 3.3.3. Backward Mining Algorithm

The input of the backward mining algorithm is the sequence, the end projection (Epj) and H projection (Hpj) of the CMP(i), and CMP(s) sequences of the first item of the sequence, and the output is the updated data set frequent sequential patterns in UDB. The 1-mode end projection is the Epj from the backward extension. The sequence’s backward extension is inferred by the CMP(i) and CMP(s) of the sequence. If the CMP(i) of the sequence does not exist, then itemset extension does not exist. The Epj of the generated sequences can be found in the Epj of the sequences, and the H projections of the sequences are scanned to find the H projections of the sequences extending from them. Support counts for these sequences are the sum of Epj’s and Hpj’s size. When the support counts of all extensions meet the lower threshold, they will be added into frequent sequences list and be called with recursion.


## 3.3.4. Generating Candidate Sequences

After creating the CMP data structure, a candidate set is generated. This paper designs two candidate generation rules based on backward mining to avoid generating misleading data so as to generate sequences of candidate efficiently. We assume the following definitions:(1)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate itemset candidates from a extensions that belong to CMP(i) (b) Ck+1ε=aεkεk−1…ε1, where b is the first term in εk(2)
For a given sequence pattern of lengthks=εkεk−1…ε1, generate sequence candidates by extending a that belong to CMP(s) (b) Ck+1s=aεkεk−1…ε1, where b is the first term in εk


## 3.3.5. Generating Prepruning Sequences

Computing the support counts is quite slow. Mining speed can be improved if the generated candidates are pruned before computing support counts. This paper defines prepruning properties based on the CMP data structure. Sequences are trimmed early if their length exceeds a certain value, according to their properties. As shown in Figure4, the following definitions are assumed:Figure 4
Definitions of prepruning.


## 3.3.6. Algorithm Implementation

The resources used are initialized through the SETUP function in the second phase of the MapReduce platform in this paper. After getting the input, Mappers treats infrequent items with pruning, then creates CMP(i) and CMP(s), and finds Projection and end projection of each 1-modea. Each 1-mode is checked to see if it belongs to an incremental union to get the 1-modes of stable and expand them to seek the frequent sequences. If 1 mode is unstable, the function of backward mining will be called for each unstable ones, and 5 parameters are passed to the function when calling: unstable 1-mode a, the extended sequence of a, the itemset extended sequence of a, the end projection of a, and the H projection of a, where the H projection of a is calculated from the difference between the projection of a and the end projection of a.Reduce2 takesk and value v as input and initializes the item count to 0. Reduce2 computes the items’ values, after receiving the value about the item, and increments the item count. If the item count is greater than the product of the min support count and |UD|, we output k and item counts and then write them to files in the Hadoop distributed file system HDFS.


## 4. Experiment

### 4.1. Experimental Design

The hardware environment used in the experiment in this paper is CPU frequency 3.40 GHz; memory 4G. Software environment: Operating system: Windows10; IDE : MyEclipse9.0; Development environment: JDK 1.6; Development language: Python 2.7; Database: MySql.The evaluation metrics used in the experiment are Recall (R), Precision (P) and F1. Recall refers to the ratio of the number of samples correctly judged by the classifier to the total number of samples belonging to this class; precision refers to the proportion of samples that truly belong to this class among the samples judged by the classifier as this class. We assume that when retrieving documents from a large-scale document collection, the documents can be divided into four groups:A represents relevant documents retrieved by the system; B represents irrelevant documents retrieved by the system; C represents relevant but not retrieved by the system documents; D stands for irrelevant documents that have not been retrieved by the system. Then, the text classification recall and precision can be defined as(1)Recall=AA+C×100%,Precision=AA+B×100%,F1=2×Recall×PrecisionRecall+Precision.In general, the text classification process can be divided into two parts: training the model and classifying the text. The main goal of training is to construct a classification model using the special relationship between text features and text categories through a set of training texts of known categories. The generalized model training process includes five steps: acquisition of training text sets, text preprocessing, text feature extraction, text representation, and selection of classification algorithms to construct classifiers. Categorizing text is to use the classifier obtained from the above training results to classify new and unknown text into categories, and the process of “sticking” category labels, mainly including text preprocessing, text representation, text classification, and classification performance evaluation. The main feature selection methods used in this step are mutual information (MI) and information gain (IG). In order to compare the performance of text algorithms, the comparison classification algorithms used include classic support vector machines (SVM) and random forests (RF).


### 4.2. Experimental Data

The datasets used in the experiments are two public corpora: Reuters-21578 and 20-Newsgroups.


#### 4.2.1. Reuters-21578

The Reuters-21578 corpus is widely used for text mining. The data, originally collected by Carnegie Corporation and Reuters newsgroups, contained 21,578 documents on 135 different topics. The experiment uses a total of 9,980 documents from the top 10 topics. Because CORN and WHEAT are closely related to GRAIN, they are classified into GRAIN, so they are also called R8. This paper uses the 10-fold cross-validation method to divide the training dataset and the test dataset. We choose 80% as the training set and 20% as the test set. Table1 describes the categories of documents in the dataset Reuters-21578.Table 1
Dataset Reuters-21578 details.
CategoryTotal of each categoryTraining numberTesting numberACQ23691895474CRUD578462116EARN39643171793GRAIN582466116INTEREST47838296MONEY717574143SHIP28622957TRADE48638997The 20-Newsgroups dataset contains 4 major categories: COMP, REC, SCI, and TALK; each category contains 4 subcategories, with a total of 15,033 documents. Table2 describes the document descriptions for each category in the dataset 20-Newsgroups. We choose 80% as the training set and 20% as the test set.Table 2
Dataset 20-Newsgroups details.
CategoryTotal of each categoryTraining numberTesting numberCOMP38703096774REC39683174794SCI39453156789TALK32502600650


### 4.3. Experimental Results

The experimental results obtained by each classification algorithm on the Reuters-21578 dataset are shown inTable3–5.Table 3
Recall values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.48350.49090.65360.59860.50690.59850.49430.4665MI0.43280.42510.59020.52650.44010.53360.44380.4240RFIG0.50020.84180.74200.89100.70840.68940.81650.5900MI0.43010.75770.64360.79700.62620.59880.68150.5172ProposedIG0.59760.84170.85740.88840.96080.8240.90610.8217MI0.53950.73060.69600.73030.86120.8020.81050.6827Table 4
Precision values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.53130.51030.66110.62240.55740.60720.49820.5290MI0.45680.42940.61480.53150.44730.59970.49720.4470RFIG0.51090.87710.77850.91490.71490.71640.86480.6454MI0.44710.75880.65170.80070.68840.62230.72360.5617ProposedIG0.66920.91350.93700.92880.89320.88210.96450.8534MI0.54520.74630.72260.79120.85390.8100.86710.6876Table 5
F1 values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.50630.50040.65730.61030.53100.60280.49620.4958MI0.44450.42720.60220.52900.44370.56470.46900.4352RFIG0.50550.85910.75980.90280.71160.70260.84000.6165MI0.43840.75820.64760.79880.65580.61030.70190.5385ProposedIG0.63140.87610.89540.90820.85550.85120.93440.8373MI0.54230.73840.70910.75950.83200.76800.83780.6851From the experimental data in Table3–5 and the comparison chart of the classification results of each method shown in Figure 5, the following experimental conclusions can be drawn:(1)
Regardless of the classification method, the experimental results obtained by the IG-based feature extraction method are generally better than those obtained by the MI-based feature extraction method. This is because the IG-based feature extraction method can perform global feature extraction, and the extracted features are often valid for all classes.(2)
When the IG feature extraction method is used, the classification performance of the method proposed in this paper is better than other methods in most cases. The classification performance of RF is not much different from that of the method used in this paper, especially in the text classification of the first 6 classes. When using the MI feature classification method, comparing the experimental results obtained by different classifiers, in the first four categories of text classification, the method used in this paper is close to the classification performance of RF and the performance in the latter four categories. In this paper, the method used has distinct advantages. From the beginning to the end, the classification performance shown by the SVM method is not very good.(3)
Based on the above analysis, the method proposed in this paper can obtain better results than other classifiers no matter which feature extraction method is used. This fully shows that the method in this paper has certain advantages in the similar methods. In addition, according to the size of the specific data in each table, the text classification accuracy obtained by this method generally exceeds 0.8, which shows that the text classification based on this method has certain practicability.Figure 5
Comparison of experimental results on the Reuters-21578 dataset.The experimental results obtained by each classification algorithm on the 20-Newsgroups dataset are shown in Table6:Table 6
Experimental results on the 20-Newsgroups dataset.
MethodCategoryFeature extractionRecallPrecisionF1SVMCOMPIG0.65550.73490.6929MI0.54450.57000.5569RECIG0.62940.66240.6455MI0.51530.52840.5217SCIIG0.68680.81920.7472MI0.60930.70160.6522TALKIG0.56030.62840.5924MI0.46540.49920.4817RFCOMPIG0.65340.68160.6672MI0.56090.63630.5962RECIG0.71800.86700.7855MI0.59240.61860.6052SCIIG0.59040.62680.6081MI0.52440.57130.5469TALKIG0.75360.77230.7628MI0.61800.70870.6602ProposedCOMPIG0.69230.75500.7223MI0.58880.71050.6440RECIG0.66680.72710.6957MI0.54710.62050.5815SCIIG0.79890.83150.8149MI0.65610.71270.6832TALKIG0.60120.62660.6136MI0.53410.62040.5740From the experimental data in Table6 and the comparison chart of the classification results of each method shown in Figure 6, the following experimental conclusions can be drawn:(1)
The 20-Newsgroups dataset has 4 categories, and the experimental data of the first 3 categories shown in Table6 show that the method used in this paper has the best classification performance, regardless of whether it is based on IG or MI. The classification performance of RF is not stable. The performance of the SVM algorithm is stable, but the overall classification performance is lower than the method proposed in this paper.(2)
On the 20-Newsgroups dataset, the difference between the classification results obtained by the two feature extraction methods becomes smaller. However, the experimental results obtained by the IG-based feature extraction method are still better than the MI-based method.(3)
Compared with the classification results of the Reuters-21578 dataset, the classification results obtained on the 20-Newsgroups dataset are slightly worse. This shows that the experimental results obtained by the same classification method on different text datasets are not the same.Figure 6
Comparison of experimental results on the 20-Newsgroups dataset.


## 4.1. Experimental Design

The hardware environment used in the experiment in this paper is CPU frequency 3.40 GHz; memory 4G. Software environment: Operating system: Windows10; IDE : MyEclipse9.0; Development environment: JDK 1.6; Development language: Python 2.7; Database: MySql.The evaluation metrics used in the experiment are Recall (R), Precision (P) and F1. Recall refers to the ratio of the number of samples correctly judged by the classifier to the total number of samples belonging to this class; precision refers to the proportion of samples that truly belong to this class among the samples judged by the classifier as this class. We assume that when retrieving documents from a large-scale document collection, the documents can be divided into four groups:A represents relevant documents retrieved by the system; B represents irrelevant documents retrieved by the system; C represents relevant but not retrieved by the system documents; D stands for irrelevant documents that have not been retrieved by the system. Then, the text classification recall and precision can be defined as(1)Recall=AA+C×100%,Precision=AA+B×100%,F1=2×Recall×PrecisionRecall+Precision.In general, the text classification process can be divided into two parts: training the model and classifying the text. The main goal of training is to construct a classification model using the special relationship between text features and text categories through a set of training texts of known categories. The generalized model training process includes five steps: acquisition of training text sets, text preprocessing, text feature extraction, text representation, and selection of classification algorithms to construct classifiers. Categorizing text is to use the classifier obtained from the above training results to classify new and unknown text into categories, and the process of “sticking” category labels, mainly including text preprocessing, text representation, text classification, and classification performance evaluation. The main feature selection methods used in this step are mutual information (MI) and information gain (IG). In order to compare the performance of text algorithms, the comparison classification algorithms used include classic support vector machines (SVM) and random forests (RF).


## 4.2. Experimental Data

The datasets used in the experiments are two public corpora: Reuters-21578 and 20-Newsgroups.


### 4.2.1. Reuters-21578

The Reuters-21578 corpus is widely used for text mining. The data, originally collected by Carnegie Corporation and Reuters newsgroups, contained 21,578 documents on 135 different topics. The experiment uses a total of 9,980 documents from the top 10 topics. Because CORN and WHEAT are closely related to GRAIN, they are classified into GRAIN, so they are also called R8. This paper uses the 10-fold cross-validation method to divide the training dataset and the test dataset. We choose 80% as the training set and 20% as the test set. Table1 describes the categories of documents in the dataset Reuters-21578.Table 1
Dataset Reuters-21578 details.
CategoryTotal of each categoryTraining numberTesting numberACQ23691895474CRUD578462116EARN39643171793GRAIN582466116INTEREST47838296MONEY717574143SHIP28622957TRADE48638997The 20-Newsgroups dataset contains 4 major categories: COMP, REC, SCI, and TALK; each category contains 4 subcategories, with a total of 15,033 documents. Table2 describes the document descriptions for each category in the dataset 20-Newsgroups. We choose 80% as the training set and 20% as the test set.Table 2
Dataset 20-Newsgroups details.
CategoryTotal of each categoryTraining numberTesting numberCOMP38703096774REC39683174794SCI39453156789TALK32502600650


## 4.2.1. Reuters-21578

The Reuters-21578 corpus is widely used for text mining. The data, originally collected by Carnegie Corporation and Reuters newsgroups, contained 21,578 documents on 135 different topics. The experiment uses a total of 9,980 documents from the top 10 topics. Because CORN and WHEAT are closely related to GRAIN, they are classified into GRAIN, so they are also called R8. This paper uses the 10-fold cross-validation method to divide the training dataset and the test dataset. We choose 80% as the training set and 20% as the test set. Table1 describes the categories of documents in the dataset Reuters-21578.Table 1
Dataset Reuters-21578 details.
CategoryTotal of each categoryTraining numberTesting numberACQ23691895474CRUD578462116EARN39643171793GRAIN582466116INTEREST47838296MONEY717574143SHIP28622957TRADE48638997The 20-Newsgroups dataset contains 4 major categories: COMP, REC, SCI, and TALK; each category contains 4 subcategories, with a total of 15,033 documents. Table2 describes the document descriptions for each category in the dataset 20-Newsgroups. We choose 80% as the training set and 20% as the test set.Table 2
Dataset 20-Newsgroups details.
CategoryTotal of each categoryTraining numberTesting numberCOMP38703096774REC39683174794SCI39453156789TALK32502600650


## 4.3. Experimental Results

The experimental results obtained by each classification algorithm on the Reuters-21578 dataset are shown inTable3–5.Table 3
Recall values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.48350.49090.65360.59860.50690.59850.49430.4665MI0.43280.42510.59020.52650.44010.53360.44380.4240RFIG0.50020.84180.74200.89100.70840.68940.81650.5900MI0.43010.75770.64360.79700.62620.59880.68150.5172ProposedIG0.59760.84170.85740.88840.96080.8240.90610.8217MI0.53950.73060.69600.73030.86120.8020.81050.6827Table 4
Precision values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.53130.51030.66110.62240.55740.60720.49820.5290MI0.45680.42940.61480.53150.44730.59970.49720.4470RFIG0.51090.87710.77850.91490.71490.71640.86480.6454MI0.44710.75880.65170.80070.68840.62230.72360.5617ProposedIG0.66920.91350.93700.92880.89320.88210.96450.8534MI0.54520.74630.72260.79120.85390.8100.86710.6876Table 5
F1 values on the Reuters-21578 dataset.
MethodFeature extractionACQCRUDEARNGRAININTERESTMONEYSHIPTRADESVMIG0.50630.50040.65730.61030.53100.60280.49620.4958MI0.44450.42720.60220.52900.44370.56470.46900.4352RFIG0.50550.85910.75980.90280.71160.70260.84000.6165MI0.43840.75820.64760.79880.65580.61030.70190.5385ProposedIG0.63140.87610.89540.90820.85550.85120.93440.8373MI0.54230.73840.70910.75950.83200.76800.83780.6851From the experimental data in Table3–5 and the comparison chart of the classification results of each method shown in Figure 5, the following experimental conclusions can be drawn:(1)
Regardless of the classification method, the experimental results obtained by the IG-based feature extraction method are generally better than those obtained by the MI-based feature extraction method. This is because the IG-based feature extraction method can perform global feature extraction, and the extracted features are often valid for all classes.(2)
When the IG feature extraction method is used, the classification performance of the method proposed in this paper is better than other methods in most cases. The classification performance of RF is not much different from that of the method used in this paper, especially in the text classification of the first 6 classes. When using the MI feature classification method, comparing the experimental results obtained by different classifiers, in the first four categories of text classification, the method used in this paper is close to the classification performance of RF and the performance in the latter four categories. In this paper, the method used has distinct advantages. From the beginning to the end, the classification performance shown by the SVM method is not very good.(3)
Based on the above analysis, the method proposed in this paper can obtain better results than other classifiers no matter which feature extraction method is used. This fully shows that the method in this paper has certain advantages in the similar methods. In addition, according to the size of the specific data in each table, the text classification accuracy obtained by this method generally exceeds 0.8, which shows that the text classification based on this method has certain practicability.Figure 5
Comparison of experimental results on the Reuters-21578 dataset.The experimental results obtained by each classification algorithm on the 20-Newsgroups dataset are shown in Table6:Table 6
Experimental results on the 20-Newsgroups dataset.
MethodCategoryFeature extractionRecallPrecisionF1SVMCOMPIG0.65550.73490.6929MI0.54450.57000.5569RECIG0.62940.66240.6455MI0.51530.52840.5217SCIIG0.68680.81920.7472MI0.60930.70160.6522TALKIG0.56030.62840.5924MI0.46540.49920.4817RFCOMPIG0.65340.68160.6672MI0.56090.63630.5962RECIG0.71800.86700.7855MI0.59240.61860.6052SCIIG0.59040.62680.6081MI0.52440.57130.5469TALKIG0.75360.77230.7628MI0.61800.70870.6602ProposedCOMPIG0.69230.75500.7223MI0.58880.71050.6440RECIG0.66680.72710.6957MI0.54710.62050.5815SCIIG0.79890.83150.8149MI0.65610.71270.6832TALKIG0.60120.62660.6136MI0.53410.62040.5740From the experimental data in Table6 and the comparison chart of the classification results of each method shown in Figure 6, the following experimental conclusions can be drawn:(1)
The 20-Newsgroups dataset has 4 categories, and the experimental data of the first 3 categories shown in Table6 show that the method used in this paper has the best classification performance, regardless of whether it is based on IG or MI. The classification performance of RF is not stable. The performance of the SVM algorithm is stable, but the overall classification performance is lower than the method proposed in this paper.(2)
On the 20-Newsgroups dataset, the difference between the classification results obtained by the two feature extraction methods becomes smaller. However, the experimental results obtained by the IG-based feature extraction method are still better than the MI-based method.(3)
Compared with the classification results of the Reuters-21578 dataset, the classification results obtained on the 20-Newsgroups dataset are slightly worse. This shows that the experimental results obtained by the same classification method on different text datasets are not the same.Figure 6
Comparison of experimental results on the 20-Newsgroups dataset.


## 5. Conclusion

With the development of internationalization, the demand for literary translation has increased dramatically. In order to make better use of these literary translation texts, this paper studies the classification of literary translation texts. Because the traditional classification method only pays attention to the words and phrases of the composition, and only knows which words correspond to which application fields, words are relatively isolated from each other and do not consider other characteristics such as word collocation, style, and typesetting. Therefore, this paper proposes a literary translation text classification method based on the distributed incremental sequence data mining algorithm. The method can fully mine the features of syntactic order and other features based on considering the characteristics of composition words and phrasing in different application fields, to discover more effective information, so it can strengthen the text classification effect. The experimental results also support this. This method also has some shortcomings, such as the classification accuracy is still far from being used in real production scenarios, and the classification accuracy needs to be further improved. The future research will be mainly carried out from the following two aspects: First, we will continue to deeply study the characteristics of composition words and wording in different application fields and try to compile a relatively high-quality stop word list, to improve the efficiency of the classification of literary translation texts by this method. The second is to introduce more feature extraction methods to improve the classification performance. Because a good feature extraction method can greatly improve the text classification performance, which is also shown in the experiments.



---

*Source: 1656151-2022-05-09.xml*