• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    Incremental learning of the triangular membership functions based on single-pass FCM and CHC genetic model①

    2017-03-28 09:47:32HuoWeigang霍緯綱QuFengZhangYuxiang
    High Technology Letters 2017年1期

    Huo Weigang (霍緯綱)Qu Feng, Zhang Yuxiang

    (Department of Computer Science and Technology, Civil Aviation University of China, Tianjin 300300, P.R.China)

    Incremental learning of the triangular membership functions based on single-pass FCM and CHC genetic model①

    Huo Weigang (霍緯綱)②Qu Feng, Zhang Yuxiang

    (Department of Computer Science and Technology, Civil Aviation University of China, Tianjin 300300, P.R.China)

    In order to improve the efficiency of learning the triangular membership functions (TMFs) for mining fuzzy association rule (FAR) in dynamic database, a single-pass fuzzy c means (SPFCM) algorithm is combined with the real-coded CHC genetic model to incrementally learn the TMFs. The cluster centers resulting from SPFCM are regarded as the midpoint of TMFs. The population of CHC is generated randomly according to the cluster center and constraint conditions among TMFs. Then a new population for incremental learning is composed of the excellent chromosomes stored in the first genetic process and the chromosomes generated based on the cluster center adjusted by SPFCM. The experiments on real datasets show that the number of generations converging to the solution of the proposed approach is less than that of the existing batch learning approach. The quality of TMFs generated by the approach is comparable to that of the batch learning approach. Compared with the existing incremental learning strategy, the proposed approach is superior in terms of the quality of TMFs and time cost.

    incremental learning, triangular membership function (TMFs), fuzzy association rule (FAR), real-coded CHC

    0 Introduction

    Many studies have proposed the method of mining fuzzy association rules (FAR) from quantitative data to avoid unnatural boundaries[1]. The result of mining FAR is strongly influenced by the quantitative attribute’s membership function. The problem of learning membership function is one of the most critical preprocessing steps. Much research work has been done to this problem. These approaches can be classified into two categories. The first is based on clustering method[2-4]. In Ref.[4], the method based on CLARANS clustering algorithm was proposed to find fuzzy set for mining fuzzy association rule. The membership functions of quantitative attribute were generated according to centroids of clusters. Ref.[2] presented a more efficient approach based on CURE cluster algorithm. Their method used less centroids than the approach described in Ref.[4]. Ref.[3] proposed an efficient algorithm for mining FAR in high-dimensional datasets. They used fuzzy c-means (FCM) clustering to create fuzzy partitions for numerical attribute.

    The second category employs evolutionary algorithms, particularly genetic algorithms (GAs)[5-10]. Ref.[5] presented a GAs-based clustering method to derive membership functions. In this method, centroids of clusters which were regarded as the midpoint of TMFs were adjusted by GAs. The optimization objective was to maximize the number of large fuzzy frequent itemsets. Ref.[6] proposed a GA-based framework to learn membership functions. The value of fitness function was calculated by the number of frequent 1-itemsets and suitability of membership functions. The suitability measure was used to guarantee a good shape of membership functions. In order to reduce the time cost of calculating frequent 1-itemsets, Ref.[7] used k-means clustering algorithm to divide the chromosomes in a population into k clusters. The number of frequent 1-itemsets derived from the representative chromosome in a cluster was regarded as the number of frequent 1-itemsets resulting from each chromosome in the cluster. In Ref.[8], the fitness of the chromosome was evaluated by the fuzzy-supports of frequent 1-itemsets and the suitability of derived membership functions, which made them adopt the divide-and-conquer strategy to derive membership functions for different quantitative attributes. Ref.[9] also proposed the multi-level ant colony framework to learn suitable membership functions for mining FAR. In this method, membership functions were encoded as a binary bits string. The fitness function was the same as the function used in Refs[6,7]. Multi-level processing was used to solve the problem in which the maximum quantities of item values in the transactions may be large. Ref.[10] presented an approach for genetic learning of membership functions based on the 2-tuples linguistic representation model and CHC genetic algorithm. The advantage of this method lied in the fact that the search space is reduced with respect to the classic tuning[6-8]. Recently, Ref.[11] proposed a method for genetic learning of the membership functions from imprecise data, which was based on the 3-tuples linguistic representation model to reduce the search space and to learn the adequate context for fuzzy linguistic terms.

    All of the above approaches are executed in a batch way. In a dynamic database where the new numeric values are inserted into the original dataset, these algorithms need to be executed from scratch. This is a huge computational workload. Ref.[12] proposed an approach for incremental generating membership function. The approach was based on the CLUSTERDB*cluster algorithm. Each cluster was represented by a trapezoidal function. When a new data object was inserted into the original dataset, the approach first determined the cluster for the new data object according to the clustering property of coherent partition. In the second step, the parameters of trapezoidal function which represented the cluster including the new data object were updated correspondingly. If the new data object can’t be absorbed by any cluster, CLUSTERDB*algorithm must be re-applied to the whole dataset. As far as we know, the research on incremental learning membership functions for mining FAR is very rare.

    Inspired by Ref.[13] and Ref.[14], a new approach to incrementally learn the TMFs for mining FAR is presented, which consists of the following two steps:

    (1) First, the values of quantitative attribute in the origin database are clustered by SPFCM[15]. The TMFs are encoded as three real-number schema and are learned by the CHC genetic model[15]. In order to enhance the quality of TMFs, the cluster centers resulting from SPFCM are regarded as the midpoint of TMFs. The other two endpoints of TMFs are generated sequentially according to its rational value range. In every generation of CHC, the chromosome with the best fitness value will be stored.

    (2) When the new numeric values are inserted into the original dataset, the cluster’s centers are adjusted by SPFCM. The new initial population consists of two parts. One part is randomly generated by the adjusted center as the first step. The other part is extracted from the excellent chromosomes maintained in the first step. In this genetic process, only new inserted numeric values are used to calculate the fitness value of the chromosomes. The chromosome with the best fitness value in the new population will be output as the membership functions of updated quantitative attribute.

    In order to assess the performance of the proposed approach, an experimental study using a public database, FAM95 is presented. First, the performance of our approach is compared with other batch learning methods in terms of the number of generation converging to a solution and the quality of TMFs. These batch learning methods include the batch CHC model proposed by Ref.[10] and the batch FCM-CHC model whose principle is the same as the approach proposed by Ref.[5]. Second, the proposed approach is compared with CLUSTERDB*based incremental learning approach. Finally, the influence of the number of new inserted numeric value on the proposed incremental genetic learning process is analyzed.

    1 The SPFCM algorithm and the CHC genetic components to incrementally learn the membership functions

    In this paper, the SPFCM algorithm and the CHC genetic model are used to design the proposed method. The CHC genetic algorithm is an advanced evolutionary algorithm which has a good trade-off between exploration and exploitation. It makes use of an incest prevention mechanism and a restarting process to provoke diversity in the population. Ref.[10] verified that the CHC genetic model was superior to usual genetic algorithm in learning membership functions for mining FAR. The SPFCM algorithm can produce data partitions in a single pass through the dataset, which is used to reduce the search space of the CHC genetic model and enhance the quality of the TMFs. The details of the SPFCM algorithm and the components designed in the CHC genetic model are described as follows.

    1.1 SPFCM algorithm

    SPFCM is an incremental clustering method designed based on FCM. It processes the data chunk by chunk. For each chunk, a set of weighted centroids are calculated to represent the chunk with one centroid per cluster. The weight for the centroid of each cluster in each chunk is calculated as follows:

    (1)

    In Eq.(1), wcis the weight of centroid of the cth cluster, npis the number of data objects in the pth chunk, k is the number of clusters, uciis the membership of data object i belonging to cluster c, and wiis the weight of data object i. For the first chunk of the data object (p=1), wiis assigned to 1 for every data object and q = 0. From the second chunk of data (p≠1), q=k and the k-weighted centroids are combined with the pth chunk of data. There union constitutes dataset X. The np+k data objects in X will be clustered by weighted FCM (wFCM) in which the weights of the npobjects in pth chunk are all set to 1 and the weights of k centroids are calculated from previous chunk according to Eq.(1).

    The wFCM modifies the objective function of FCM to take the effect of the weighted points into consideration. The iterative clustering principle of wFCM is the same as that of FCM. The cluster centroids and membership matrix for the wFCM are calculated as follows:

    (2)

    1≤i≤k, 1≤j≤np+k (3)

    In Eqs(2) and (3), m is a fuzziness coefficient.

    1.2 Chromosome representation and initial population

    The triangular membership functions (TMFs) are used in the proposed approach. It is used most widely in the fuzzy system. Each set of TMFs of a quantitative attribute is encoded as a chromosome and handled as an individual with real-number string. The membership functions for a quantitative attribute y having k fuzzy sets are shown in Fig.1, where Ri(1≤i≤k) denotes the membership function of the ith linguistic term for y, L and R indicate the parameters of fuzzy region R1and Rkrespectively, Cijindicates the parameter of fuzzy region Ri(i=2, 3,…,k-1; j=1, 2, 3), yminand ymaxindicate the minimum and maximum value of quantitative attribute y. A chromosome representing the membership functions for y is encoded in the following form:

    L,C21,C22,C23,C31,C32,C33,…,R

    Except for the left and right side of the membership functions R1and Rk, three integer numbers are used to represent the Ri(2≤i≤k-1). Each gene value in the chromosome must lie between yminand ymax. The inequality conditions of the value of the parameter Cij(i=2,3,…,k-1; j= 1,2,3) are Ci1≤Ci2≤Ci3, and ymin< C22< C32<…

    Fig.1 An example of membership functions for quantitative attribute y

    The initial set of chromosomes in an evolving population is randomly generated according to constraints mentioned above. To illustrate the procedure of initializing genetic population, it is assumed that the number of the membership function for quantitative attribute y is 4. So the length of every chromosome is 8. The size of evolving population is denoted as Npop. Then a two dimension array a[Npop][8]is used to represent the evolving population for generating high quality membership functions. The pseudo-code of the procedure of initializing evolving population in this study is described as follows.

    (1) Run the SPFCM clustering algorithm on the attribute values of quantitative attribute y, the clustering number is set as 4, produce the cluster center C={C(1), C(2), C(3), C(4)}.

    (2) For i =1 to Npop

    a[i][3]=C(2); //a[i][3] corresponds to C22in the chromosome.

    a[i][6]=C(3); //a[i][6] corresponds to C32in the chromosome.

    a[i][2]=randint (ymin,C(2)), which means randomly generating integer number between yminand C(2). // a[i][2] corresponds to C21in the chromosome. The meaning of following randint is the same as that of here.

    a[i][7]=randint (C(3), ymax); // a[i][7] corresponds to C33in the chromosome.

    a[i][4]=randint (C(2), a[i][7]); // a[i][4] corresponds to C23in the chromosome.

    a[i][1]=randint (ymin,a[i][4]); //a[i][1] corresponds to L in the chromosome.

    a[i][5]=randint (a[i][2], C(3)); // a[i][5] corresponds to C31in the chromosome.

    a[i][8]=randint (a[i][5], ymax); // a[i][8] corresponds to R in the chromosome.

    End for

    It must be pointed out that the principle of initializing evolving population is the same as the procedure mentioned above when the number of quantitative attribute’s fuzzy set is not 4.

    1.3 Chromosome evaluation

    In this study, the fitness function defined in Ref.[8] is used to evaluate a chromosome. The fitness value of chromosome Cqis defined as

    (4)

    Where L1is the set of fuzzy frequent 1-itemsets obtained by using the membership functions which are represented by the chromosome Cq, fuzzy_support (x) is the fuzzy support of fuzzy frequent 1-itemset x for the given transaction database, and suitability(Cq) represents the shape suitability of the membership functions. The suitability of the set of membership functions in the chromosome Cqis defined as

    suitability(Cq)=overlap_factor(Cq) +coverage_factor(Cq)

    (5)

    where overlap_factor(Cq) and coverage_factor(Cq) represent the overlap factor and the coverage factor of the membership functions represented by Cqrespectively.

    The overlap factor of the membership functions in Cqis defined as

    overlap_factor(Cq)=

    (6)

    where overlap(Ri, Rj=i+1) is the overlap length of adjacent membership function Riand Rj, k is the number of membership function for quantitative attribute y. According to the encoding style, if i =1, then Ci3=L and Ci2=ymin. If j=k, then Cj2=ymaxand Cj1=R.

    The coverage factor of the membership function in the chromosome Cqis defined as

    (7)

    where max(y) is the maximum quantity of quantitative attribute y, range (R1,…,Rk) is the coverage range of the membership functions.

    1.4 Crossover operator

    The Parent Centric BLX operator (PCBLX)[16]is used, which allows the offspring genes to be around the genes of one parent or around a wide zone determined by both parent genes. The PCBLX operator is described as follows. Assume that X=(x1,…,xn) and Y=(y1,…,yn), (xi, yi∈[a, b]?R, i=1,…,n) are two real-coded chromosomes going to be crossed. The two following offsprings are generated:

    The new generated offspring chromosome may not meet the inequality condition described in subsection 1.2. So the gene value of the new chromosome must be sorted. Assume that the number of membership function is 4. The new generated chromosome is denoted as a[i][1:8]. The pseudo-code of the procedure of sorting the chromosome is described as follows.

    a[i][2:4]=sort (a[i][2:4]); //sort the gene value of a[i][2], a[i][3] and a[i][4]in ascending order;

    a[i][5:7]=sort (a[i][5:7]); //sort the gene value of a[i][5], a[i][6] and a[i][7]in ascending order;

    While (a[i][3]>a[i][6])

    swap (a[i][3], a[i][6]); //swapping the gene value of a[i][3] and a[i][6].

    a[i][2:4]=sort (a[i][2:4]);

    a[i][5:7]=sort (a[i][5:7]);

    end

    1.5 Restart approach

    The CHC genetic model makes use of an incest prevention mechanism and a restarting process to provoke diversity in the population. During the reproduction step, two parents are crossed if their Hamming distance divided by 2 is over predefined threshold M. In order to calculate the Hamming distance of the two chromosomes, each gene value is transformed into a binary string. The length of each binary string is denoted as Bitlengene, which is the number of bit corresponding to the maximum value of the quantitative attribute y. The number of genes in the chromosome is denoted as Numgenes. The threshold value M is defined as

    M=(Numgenes·Bitlengene)/4

    (8)

    If no offspring is obtained in one generation of CHC scheme, the threshold value M will be decremented by a 10% of its initial value in the approach. When M is below zero, the restart procedure is performed. The evolving population is reinitialized by considering the best individual as the first chromosome of the new population and generating the remaining Npop-1 by randomly flipping 35% of their bits. When the new individual generated by the restart procedure does not meet the inequality constraint condition, it must execute the sorting procedure described in subsection 1.4.

    2 The proposed incremental learning algorithm

    The proposed learning approach consists of two phases. In phase 1, the best chromosomes during the execution of the CHC algorithm on the original dataset are collected. In phase 2, the incremental CHC algorithm on the new inserted dataset is executed. The initial population is composed of the chromosomes saved in phase 1 and the randomly generated chromosomes. The detailed steps of our approach are described below.

    Input: y={y1, y2, … , yn} the original dataset for quantitative attribute y, new inserted dataset {yn+1, yn+2,…, yn+m}, the number of membership function k, fuzzy support threshold β, and population size Npop

    Output: the best chromosome which represents the membership functions on the updated dataset {y1, … , yn+1, …, yn+m}

    Phase 1: genetic learning of the membership functions on {y1, y2, …, yn}

    Step 1.1: Run the SPFCM clustering algorithm on {y1, y2, … , yn}, the number of cluster is k, generate Npopchromosomes according to the principle described in subsection 1.2.

    Step 1.2: Evaluate the population. For each chromosome Cq:

    1.2.3 Calculate the fitness value of chromosome Cqusing the fitness function described in subsection 1.3.

    Step 1.3: Generate the next population Popnext:

    1.3.1 Shuffle the population, select the chromosomes two by two, crossover operator described in subsection 1.4 is executed if the Hamming distance between the selected chromosomes divided by 2 is over threshold value M.

    1.3.2 Evaluate the generated offspring, join the parents with their offspring and select the best Npopchromosomes as the next population Popnext

    Step 1.4: If the fitness value of the chromosome Cfeasiblewhich has the highest fitness value in Popnextis larger than all the fitness value of chromosome in feasible chromosome list (FCL), Cfeasibleis added to FCL. (The initial number of chromosome in FCL is 0.)

    Step 1.5: If there are no new generated offspring in Step 1.3.1, the threshold value M is decremented by 10% of its initial value.

    Step 1.6: If M<0, restart procedure described in subsection 1.5 is executed.

    Step 1.7: If the maximum number of iteration is not reached, go to Step 1.3.

    Phase 2: incremental learning of membership functions on {y1,…,yn+1,…, yn+m}

    Step 2.1: Generate the new initial population Pnew:

    2.1.1: Run the SPFCM clustering algorithm on {yn+1, yn+2, …, yn+m} and derive the new cluster center.

    2.1.2: The number of chromosome in FCL is denoted as NFCL. If NFCL

    2.1.3 If NFCL≥ Npop/2, select the best Npop/2 chromosomes from FCL and add them to Pnew. Randomly generate Npop/2 chromosomes according to the principle described in subsection 1.2.

    Step 2.3: Execute the CHC genetic process described in Step 1.3, Step 1.5 to Step 1.7.

    Step 2.4: Output the best chromosome in the final generation.

    3 Experimental results

    A real dataset called FAM95 (http://www.ics.uci.edu/~mlearn/) is used to assess the performance of the proposed incremental learning approach. There are 63,756 transactions in the dataset. Of the 23 attributes in the dataset, 3 quantitative attributes are chosen. They are age, head’s personal income and family income. The experiments are performed on a computer with 3.1GHz processor and 4GB main memory and running the Microsoft Windows 7 operating system. The proposed incremental learning approach and the relevant algorithm are all implemented by Matlab 7.0.

    3.1 Comparison of the proposed approach with the related batch approach

    In the experiment, the proposed approach is compared with the batch CHC model proposed by Ref.[10] and the batch FCM-CHC model whose principle is the same as the approach proposed by Ref.[5]. The proposed incremental approach, the batch CHC model and the batch FCM-CHC model is abbreviated to Inc-CHC, B-CHC and B-FCM-CHC respectively. In B-FCM-CHC, FCM algorithm is used to cluster the quantitative values and CHC genetic procedure is used to adjust the cluster center which is regarded as the midpoint of the TMFs. For the convenience of comparison, the coding method and the genetic operator of the B-CHC and the B-FCM-CHC are the same as the Inc-CHC. In the Inc-CHC, the first 33,756 quantitative values are extracted from FAM95 dataset as original database. The rest of 30,000 quantitative values are inserted into the original database for the experiment. The other two approaches are executed on the 63,756 quantitative values directly. The parameter values of each CHC model are described as follows: the number of membership function for the quantitative attribute 4, the size of evolving population 50, the maximum iteration number 500, and the fuzzy support threshold value 0.1.

    The three approaches are compared in terms of the number of generations converging to a solution and the quality of the solutions. Every approach is executed six times. The following experiment results are the average of six outcomes of the experiments.
    Figs 2-4 shows the average fitness values of the chromosomes in the population along with different number of generation of the Inc-CHC, B-CHC, and B-FCM-CHC for the quantitative attribute age, head’s personal income and family income respectively. The variation trend for the Inc-CHC in
    Figs 2-4 represents genetic process of Phase 2 described in Section 3. Table 1 presents the number of generations converging to a solution and the maximum fitness value obtained by the three CHC model. Analyzing these experiment results, the following conclusions can be got: (1) For the quantitative age and family income, the maximum fitness value obtained by the B-FCM-CHC is higher than the value obtained by the B-CHC. The converging speed of the B-FCM-CHC is slightly faster than that of the B-CHC. So FCM algorithm plays an important role in the genetic process of learning the TMFs and it contributes to obtain high quality membership functions and decrease the size of the tuning search space. However, for the head’s personal income, the difference between B-CHC and B-FCM-CHC is not very obvious. This is because that the midpoints of TMFs generated by the B-CHC and B-FCM-CHC are very close to the center generated by the FCM algorithm. (2) The Inc-CHC is superior to the B-CHC and the B-FCM-CHC in term of the number of generations converging to a solution. The maximum fitness value of the Inc-CHC is higher than that of B-CHC and is comparable to that of B-FCM-CHC even if the number of the converging generation is significantly less. The proposed incremental learning strategy is effective.

    Fig.2 The average fitness values along with numbers of generation for age

    Fig.3 The average fitness values along with numbers of generation for head’s personal income

    Fig.4 The average fitness values along with numbers of generation for family income Table 1 Number of converging generations and the maximum fitness value obtained by the three CHC model

    MethodAgeHead’spersonincomeFamilyincomeNumberofgenerationsMaxfitnessvalueNumberofgenerationsMaxfitnessvalueNumberofgenerationsMaxfitnessvalueB-CHC274.51.46233.751.46234.251.45B-FCM-CHC2481.51228.51.47200.751.51Inc-CHC11.5126.51.4777.51.49

    3.2 Comparison of Inc-CHC with the incremental approach based on CLUSTERDB*

    The proposed approach Inc-CHC is compared with the incremental learning membership function approach based on CLUSTERDB*in Ref.[12]. It is abbreviated to Inc-CLUSTERDB*. In the experiment, the quantitative attribute values of head’s personal income and family income are used. As before, the first 33,756 quantitative values are regarded as original dataset. The rest of 30,000 quantitative values are inserted into the original dataset. The triangular membership functions (TMFs) is used in Inc-CLUSTERDB*. The parameter values of Inc-CHC are the same as the values determined in subsection 3.1. So the cluster number is set as 4 in Inc-CLUSTERDB*. The second and the third cluster center, the minimum and the maximum quantitative attribute value are used as parameters value of TMFs. The fitness function defined in subsection 1.3 is used to assess the quality of TMFs generated by two methods. Table 2 shows the experiment results which include fitness values and time cost of the two methods. Then it is easy to draw the conclusions:

    (1) The quality of TMFs generated by Inc-CHC is better than that of Inc-CLUSTERDB*. This is because that Inc-CHC can dynamically adjust and optimize TMFs by CHC genetic process. Inc-CLUSTERDB*generates TMFs just according to data distribution of quantitative values.

    Table 2 The comparison of Inc-CHC with Inc-CLUSTERDB*

    (2) Time cost of Inc-CHC is less than that of the Inc-CLUSTERDB*. In order to obtain consistent partition, CLUSTERDB*algorithm must be re-applied to the whole dataset many times when the new inserted value is not between lower and upper bound of a cluster in Inc-CLUSTERDB*. So the higher time cost is required by Inc-CLUSTERDB*.

    3.3 The effect of the number of the inserted quantitative values on the proposed approach

    In this experiment, the effect of the number of the inserted quantitative values on the Inc-CHC is analyzed. The first 33,756 quantitative values are extracted from FAM95 dataset as original dataset. The inserted dataset is generated by sequentially selecting 7500, 15000, 22500 quantitative values from the remainder dataset respectively. The rest parameters values of the Inc-CHC are the same as that of the experiment described in subsection 4.1. Every experiment is also executed six times repeatedly. Average results of the experiments are presented in Tables 3-5. Tables 3-5 show the maximum fitness value obtained by the Inc-CHC and the number of iterative evaluation converging to a solution with different number of the inserted quantitative values for the three quantitative attribute respectively. It also shows the experiment results of B-FCM-CHC which executes on the 41256(33756+7500), 48756(33756+15000), 56256(33756+22500) selected quantitative values directly for the three quantitative attributes respectively.

    Table 3 The comparison of B-FCM-CHC and Inc-CHC with different number of inserted values for age

    Table 4 The comparison of B-FCM-CHC and Inc-CHC with different number of inserted values for Head’s person income

    Table 5 The comparison of B-FCM-CHC and Inc-CHC with different number of inserted values for Family income

    From these experiment results, it can be easily observed to the following phenomenon:

    (1) For each quantitative attribute, in the case of different number of inserted quantitative values, the maximum fitness values of the Inc-CHC are comparable to that of the B-FCM-CHC. But the number of the generation converging to a solution is less than that of the B-FCM-CHC.

    (2) The number of iterative evaluation converging to the maximum fitness value is very different when different number of inserted quantitative values is used for the quantitative attribute head’s personal income and family income. However, for the attribute age, it just needs one generation to converge to the solution for all the different number of inserted values.

    The main reason is analyzed as follows. When the distribution of new inserted quantitative values is the same as that of the original dataset, the chromosomes saved in the Phase 1 of the Inc-CHC are useful for the incrementally learning the membership functions. So a few number of generations converging to the solution is required by the Inc-CHC. Otherwise, when the distribution of the new inserted quantitative vales is very different from that of the original dataset, the optimal solution is shifted too much in the search space. A lot of number of generations converging to a solution is required. So it is concluded that the Inc-CHC is not sensitive to the number of the inserted values in terms of learning the high quality of membership functions. However, the number of the inserted quantitative values is very crucial factor in order to decrease the number of iterative generations.

    4 Conclusions

    In this paper, an incremental approach of learning the TMFs for mining fuzzy association rule is proposed. In the process of genetic learning of TMFs, cluster centers resulting from single-pass fuzzy c means (SPFCM) algorithm give the CHC genetic model heuristic information, which contributes to enhance the quality of TMFs. Compared with the existing incremental approach, the proposed method is superior in terms of the quality of the generated TMFs and the time cost. The number of iterative generations converging to a solution of our approach is less than that of the batch learning approach. The number of the inserted quantitative values is a crucial factor in terms of decreasing the number of iterative converging generations. In future, how to determine the appropriate number of inserted numeric values will be studied for the proposed approach.

    [1] Kalia H, Dehuri S, Ghosh A. A Survey on Fuzzy Association Rule Mining. International Journal of Data Warehousing and Mining, 2013, 9(1): 1-27

    [2] Kaya M, Alhajj R, Polat F, et al. Efficient automated mining of fuzzy association rules. In: Proceedings of the International Conference on Database and Expert Systems with Applications, Aix-en-Provence, France, 2002. 133-142

    [3] Mangalampalli A, Pudi V. FAR-HD: A fast and efficient algorithm for mining fuzzy association rules In large high-dimensional datasets. In: Proceedings of the 2013 IEEE International Conference on Fuzzy Systems, Hyderabad, India, 2013. 1-6

    [4] Fu A W, Wong M H, Sze S C, et al. Finding fuzzy sets for the mining of fuzzy association rules for numerical attributes. In: Proceedings of International Symposium on Intelligent Data Engineering and Learning (IDEAL'98), Hong Kong, China, 1998. 263-268

    [5] Kaya M, Alhajj R. Genetic algorithm based framework for mining fuzzy association rules. Fuzzy Sets and Systems, 2005, 152(3): 587-601

    [6] Hong T P, Chen C H, Wu Y L, et al. A GA-based fuzzy mining approach to achieve a trade-off between number of rules and suitability of membership functions. Soft Computing, 2006, 10(11): 1091-1101

    [7] Chen C H, Tseng V S, Hong T P. Cluster-based evaluation in fuzzy-genetic data mining. IEEE Transactions on Fuzzy Systems, 2008, 16(1): 249-262

    [8] Hong T P, Chen C H, Lee Y C, et al. Genetic-fuzzy data mining with divide-and-conquer strategy. IEEE Transactions on Evolutionary Computation, 2008, 12(2): 252-265

    [9] Hong T P, Tung Y F, Wang S L, et al. A multi-level ant-colony mining algorithm for membership functions. Information Sciences, 2012, 182(1): 3-14

    [10] Alcala-Fdez J, Alcala R, Gacto M J, et al. Learning the membership function contexts for mining fuzzy association rules by using genetic algorithms. Fuzzy Sets and Systems, 2009, 160(7): 905-921

    [11] Palacios A M, Palacios J L, Sanchez L, et al. Genetic learning of the membership functions for mining fuzzy association rules from low quality data. Information Sciences, 2015, 295(358-378)

    [12] Hachani N, Derbel I, Ounelli H. Automatic and Incremental Generation of Membership Functions. In: Proceedings of the 10th International Conference on Artificial Intelligence and Soft Computing, Pt I, Zakopane, Poland, 2010. 97-104

    [13] Mansour N, Awad M, Elfakih K. Incremental genetic algorithm. The International Arab Journal of Information Technology, 2006, 3(1): 42-47

    [14] Hore P, Hall L O, Goldgof D B. Single pass fuzzy c means. In: Proceedings of the IEEE International Conference on Fuzzy Systems, London, UK, 2007. 240-246

    [15] Eshelman L J. The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination. Foundations of Genetic Algorithms, 1991, 1: 265-283

    [16] Lozano M, Herrera F, Krasnogor N, et al. Real-coded memetic algorithms with crossover hill-climbing. Evolutionary Computation, 2004, 12(3): 273-302

    Huo Weigang, born in 1978. He received his Ph.D degrees in College of Computer and Control Engineering of Nankai University in 2011. He received M.S. degrees from Shanxi University in 2004. He also received B.S. degrees from Shanxi Normal University in 2001. His research interests include fuzzy classifier, fuzzy association rule mining.

    10.3772/j.issn.1006-6748.2017.01.002

    ①Supported by the National Natural Science Foundation of China (No. 61301245, U1533104).

    ②To whom correspondence should be addressed. E-mail: wghuo@cauc.edu.cn Received on Dec. 28, 2015,

    一二三四中文在线观看免费高清| 久久人人爽人人爽人人片va| 人人妻人人澡人人看| 国产成人免费观看mmmm| 国产成人免费无遮挡视频| 人妻少妇偷人精品九色| 久久久国产欧美日韩av| 亚洲经典国产精华液单| 国产精品成人在线| 男女边吃奶边做爰视频| 亚洲av免费高清在线观看| 99久久人妻综合| 日日摸夜夜添夜夜添av毛片| 超色免费av| 男女边吃奶边做爰视频| 久久精品夜色国产| 中文字幕久久专区| 免费看av在线观看网站| 久久久久久久久久成人| 少妇精品久久久久久久| 久久99热6这里只有精品| 免费av中文字幕在线| 伊人久久国产一区二区| 青春草国产在线视频| 麻豆乱淫一区二区| 麻豆乱淫一区二区| 国模一区二区三区四区视频| 成人影院久久| 国产精品秋霞免费鲁丝片| 看非洲黑人一级黄片| 亚洲综合色网址| 插阴视频在线观看视频| 午夜影院在线不卡| 亚洲精品aⅴ在线观看| 成人国产av品久久久| 国产精品人妻久久久影院| 欧美日韩精品成人综合77777| 午夜免费观看性视频| 国产片内射在线| 亚洲综合色网址| 十分钟在线观看高清视频www| 男人操女人黄网站| 这个男人来自地球电影免费观看 | 免费大片黄手机在线观看| 成年人免费黄色播放视频| 日产精品乱码卡一卡2卡三| 极品人妻少妇av视频| 少妇被粗大猛烈的视频| 99视频精品全部免费 在线| 午夜免费观看性视频| 狂野欧美激情性bbbbbb| 久久久久网色| 精品亚洲乱码少妇综合久久| 亚洲国产精品一区二区三区在线| 久久久精品94久久精品| 蜜桃国产av成人99| 久久精品人人爽人人爽视色| 一区二区av电影网| 亚洲精品久久午夜乱码| 97在线人人人人妻| 亚洲精品aⅴ在线观看| 国产成人精品婷婷| 一区二区三区免费毛片| 老司机亚洲免费影院| 亚洲精品国产av成人精品| 日韩亚洲欧美综合| 高清欧美精品videossex| 插阴视频在线观看视频| 亚洲av免费高清在线观看| xxxhd国产人妻xxx| 亚洲色图综合在线观看| 国产黄片视频在线免费观看| 毛片一级片免费看久久久久| 中文字幕最新亚洲高清| 高清av免费在线| 2022亚洲国产成人精品| 成人国产av品久久久| 国产又色又爽无遮挡免| 亚洲精品自拍成人| 观看美女的网站| 性色av一级| 欧美人与善性xxx| 91国产中文字幕| 成人漫画全彩无遮挡| a级毛色黄片| 伦精品一区二区三区| 成人手机av| 久久午夜综合久久蜜桃| 如何舔出高潮| 国产av精品麻豆| av免费在线看不卡| 日韩亚洲欧美综合| 日韩电影二区| 汤姆久久久久久久影院中文字幕| 国产高清有码在线观看视频| 香蕉精品网在线| 不卡视频在线观看欧美| 男女免费视频国产| 久久久久精品久久久久真实原创| 大片电影免费在线观看免费| 在线观看三级黄色| 有码 亚洲区| 一边亲一边摸免费视频| 大片电影免费在线观看免费| 18禁在线播放成人免费| 欧美亚洲日本最大视频资源| 欧美人与善性xxx| 汤姆久久久久久久影院中文字幕| 国产欧美另类精品又又久久亚洲欧美| 欧美性感艳星| 插阴视频在线观看视频| 色婷婷久久久亚洲欧美| 老司机影院成人| 亚洲婷婷狠狠爱综合网| .国产精品久久| 亚洲av中文av极速乱| 99热网站在线观看| 亚洲精品久久午夜乱码| 我要看黄色一级片免费的| 亚洲av不卡在线观看| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 亚洲精品,欧美精品| 欧美精品国产亚洲| 日韩大片免费观看网站| 在线观看美女被高潮喷水网站| 久久久久人妻精品一区果冻| 永久免费av网站大全| 欧美日韩视频精品一区| 欧美另类一区| 热99国产精品久久久久久7| 99久久人妻综合| 麻豆成人av视频| a级毛片在线看网站| 女人精品久久久久毛片| 日韩不卡一区二区三区视频在线| 少妇人妻久久综合中文| 在线 av 中文字幕| 亚洲久久久国产精品| 草草在线视频免费看| 国产在视频线精品| 亚洲精华国产精华液的使用体验| 国产伦精品一区二区三区视频9| 午夜91福利影院| 国产一区有黄有色的免费视频| 男女啪啪激烈高潮av片| 制服人妻中文乱码| 欧美日韩国产mv在线观看视频| 久久国产亚洲av麻豆专区| 免费观看的影片在线观看| 我要看黄色一级片免费的| 秋霞伦理黄片| 日韩伦理黄色片| 久久午夜福利片| 欧美一级a爱片免费观看看| 美女大奶头黄色视频| 成人18禁高潮啪啪吃奶动态图 | 亚洲国产日韩一区二区| 亚洲一级一片aⅴ在线观看| 熟女人妻精品中文字幕| 国产成人freesex在线| 国产一区二区在线观看av| 美女国产高潮福利片在线看| 欧美日本中文国产一区发布| 又粗又硬又长又爽又黄的视频| 在线免费观看不下载黄p国产| 一个人看视频在线观看www免费| 一区二区av电影网| 日韩一区二区三区影片| 你懂的网址亚洲精品在线观看| 国产精品免费大片| 自线自在国产av| 亚洲欧美精品自产自拍| 日本av手机在线免费观看| 国产乱人偷精品视频| 91久久精品电影网| 18禁在线无遮挡免费观看视频| 国产一区有黄有色的免费视频| 亚洲精品自拍成人| 午夜91福利影院| 少妇被粗大的猛进出69影院 | 最近最新中文字幕免费大全7| 下体分泌物呈黄色| 麻豆成人av视频| 亚洲美女黄色视频免费看| 69精品国产乱码久久久| 一本—道久久a久久精品蜜桃钙片| 插阴视频在线观看视频| 亚洲精华国产精华液的使用体验| 亚洲av成人精品一二三区| 丝袜美足系列| 少妇 在线观看| 亚洲国产成人一精品久久久| 边亲边吃奶的免费视频| 美女福利国产在线| 国产精品国产av在线观看| 亚洲av成人精品一二三区| 人妻少妇偷人精品九色| 在线播放无遮挡| 久久99一区二区三区| 成年人免费黄色播放视频| 亚洲久久久国产精品| 22中文网久久字幕| 91精品国产国语对白视频| 久久精品熟女亚洲av麻豆精品| 国产精品无大码| 日韩欧美精品免费久久| 99re6热这里在线精品视频| 免费不卡的大黄色大毛片视频在线观看| 狂野欧美激情性bbbbbb| 国产精品.久久久| 亚洲av福利一区| 麻豆精品久久久久久蜜桃| 亚洲经典国产精华液单| 男女国产视频网站| 伊人久久国产一区二区| 日本午夜av视频| 亚洲四区av| 99re6热这里在线精品视频| 国产欧美另类精品又又久久亚洲欧美| 国产爽快片一区二区三区| 高清黄色对白视频在线免费看| 天堂8中文在线网| 91成人精品电影| 91国产中文字幕| 免费观看的影片在线观看| 伦精品一区二区三区| 精品久久蜜臀av无| 九九爱精品视频在线观看| 成人毛片a级毛片在线播放| 免费观看性生交大片5| 天天影视国产精品| 日韩制服骚丝袜av| 成人二区视频| 最新的欧美精品一区二区| 亚洲高清免费不卡视频| 97超碰精品成人国产| 视频区图区小说| 熟女人妻精品中文字幕| 欧美三级亚洲精品| 少妇猛男粗大的猛烈进出视频| 考比视频在线观看| 日本vs欧美在线观看视频| 国产精品一二三区在线看| 国产熟女欧美一区二区| 男男h啪啪无遮挡| 考比视频在线观看| 久久久国产一区二区| 熟妇人妻不卡中文字幕| 久久久久久久久久久久大奶| 国产成人免费无遮挡视频| 午夜免费观看性视频| 国产成人91sexporn| a级毛色黄片| 制服丝袜香蕉在线| 国产成人a∨麻豆精品| 国产精品国产av在线观看| 女人精品久久久久毛片| 久久精品国产亚洲av天美| 日韩一本色道免费dvd| 毛片一级片免费看久久久久| 人妻制服诱惑在线中文字幕| 免费大片18禁| av视频免费观看在线观看| 女人精品久久久久毛片| 国产深夜福利视频在线观看| 在线观看免费日韩欧美大片 | 寂寞人妻少妇视频99o| 在线观看免费高清a一片| 午夜视频国产福利| xxx大片免费视频| 高清毛片免费看| 婷婷色麻豆天堂久久| 99久国产av精品国产电影| 欧美+日韩+精品| 精品国产乱码久久久久久小说| 在线免费观看不下载黄p国产| 日本免费在线观看一区| 国产精品久久久久久av不卡| 国产欧美亚洲国产| 成人漫画全彩无遮挡| 国产淫语在线视频| 一本色道久久久久久精品综合| 妹子高潮喷水视频| 色网站视频免费| 中文精品一卡2卡3卡4更新| 一二三四中文在线观看免费高清| 欧美丝袜亚洲另类| 黄色配什么色好看| 国产极品天堂在线| 国产国拍精品亚洲av在线观看| 色视频在线一区二区三区| 狂野欧美白嫩少妇大欣赏| 亚洲精品久久成人aⅴ小说 | 久久亚洲国产成人精品v| 欧美三级亚洲精品| 少妇丰满av| 久久99热这里只频精品6学生| 在线免费观看不下载黄p国产| 国产精品一区二区三区四区免费观看| 亚洲国产欧美在线一区| 狂野欧美白嫩少妇大欣赏| 午夜福利,免费看| 国产精品一国产av| 国产片内射在线| 久久久精品免费免费高清| 蜜桃在线观看..| 欧美亚洲 丝袜 人妻 在线| 好男人视频免费观看在线| 日韩欧美一区视频在线观看| 最新中文字幕久久久久| 热re99久久国产66热| 王馨瑶露胸无遮挡在线观看| 天堂俺去俺来也www色官网| 中国美白少妇内射xxxbb| 母亲3免费完整高清在线观看 | 亚洲色图 男人天堂 中文字幕 | 永久免费av网站大全| 一级片'在线观看视频| 国产亚洲精品久久久com| 欧美日韩精品成人综合77777| 久久免费观看电影| 欧美日韩在线观看h| 国产日韩一区二区三区精品不卡 | 嘟嘟电影网在线观看| 久久鲁丝午夜福利片| 国产国语露脸激情在线看| 免费观看的影片在线观看| 亚洲第一av免费看| 婷婷色麻豆天堂久久| 一本久久精品| 亚洲精品乱码久久久v下载方式| 制服丝袜香蕉在线| 伦理电影免费视频| 国产欧美日韩一区二区三区在线 | 黄片播放在线免费| 日韩三级伦理在线观看| 九色成人免费人妻av| 在线观看www视频免费| 波野结衣二区三区在线| 亚洲激情五月婷婷啪啪| 777米奇影视久久| 亚洲国产精品成人久久小说| 高清在线视频一区二区三区| 十八禁网站网址无遮挡| 国产精品偷伦视频观看了| 一本—道久久a久久精品蜜桃钙片| 亚洲四区av| 久热这里只有精品99| 日韩av不卡免费在线播放| 亚洲情色 制服丝袜| 午夜福利视频在线观看免费| 满18在线观看网站| 欧美精品国产亚洲| 最近2019中文字幕mv第一页| 国产成人一区二区在线| 一本—道久久a久久精品蜜桃钙片| 免费日韩欧美在线观看| 国产成人午夜福利电影在线观看| 欧美精品一区二区免费开放| 99九九在线精品视频| 国产不卡av网站在线观看| 亚洲熟女精品中文字幕| 国语对白做爰xxxⅹ性视频网站| 人妻 亚洲 视频| 永久网站在线| 搡老乐熟女国产| 国产欧美日韩一区二区三区在线 | 欧美国产精品一级二级三级| 成人二区视频| 精品国产露脸久久av麻豆| 亚洲精品乱久久久久久| 国产69精品久久久久777片| 你懂的网址亚洲精品在线观看| 久久久久人妻精品一区果冻| 如何舔出高潮| 精品熟女少妇av免费看| 色哟哟·www| 亚洲成人一二三区av| 久久国产精品大桥未久av| 国产视频首页在线观看| 99热这里只有精品一区| 成年美女黄网站色视频大全免费 | 新久久久久国产一级毛片| 国产成人精品久久久久久| 九色成人免费人妻av| 飞空精品影院首页| 男女边摸边吃奶| 一区二区三区乱码不卡18| 在线播放无遮挡| av又黄又爽大尺度在线免费看| 亚洲成人一二三区av| 人成视频在线观看免费观看| 久久青草综合色| 美女视频免费永久观看网站| 一级,二级,三级黄色视频| 嫩草影院入口| 人妻一区二区av| 在线观看三级黄色| 欧美成人午夜免费资源| 午夜日本视频在线| 卡戴珊不雅视频在线播放| 精品视频人人做人人爽| 91aial.com中文字幕在线观看| 黑人欧美特级aaaaaa片| 午夜福利视频在线观看免费| 一级,二级,三级黄色视频| 精品久久久精品久久久| 亚洲精品一二三| 九九久久精品国产亚洲av麻豆| 天堂俺去俺来也www色官网| 人成视频在线观看免费观看| 亚洲综合精品二区| 久久鲁丝午夜福利片| 黑人猛操日本美女一级片| 特大巨黑吊av在线直播| 伊人亚洲综合成人网| 亚洲色图综合在线观看| 精品亚洲成a人片在线观看| 亚洲精品,欧美精品| av电影中文网址| 十八禁网站网址无遮挡| 日韩大片免费观看网站| 在线观看www视频免费| 成人毛片60女人毛片免费| 久久青草综合色| 中文字幕久久专区| 看非洲黑人一级黄片| 亚洲精品日本国产第一区| 久久久久久久久久成人| 国产欧美日韩综合在线一区二区| 国产成人精品久久久久久| 一级毛片黄色毛片免费观看视频| 狠狠婷婷综合久久久久久88av| 岛国毛片在线播放| 又粗又硬又长又爽又黄的视频| 亚洲国产色片| 国产一区二区三区综合在线观看 | av有码第一页| 成人漫画全彩无遮挡| 天天影视国产精品| 精品一区二区免费观看| 性色av一级| av网站免费在线观看视频| 毛片一级片免费看久久久久| 成年女人在线观看亚洲视频| 久久人妻熟女aⅴ| 少妇猛男粗大的猛烈进出视频| av在线老鸭窝| 一区二区三区精品91| 老司机影院成人| 尾随美女入室| 2018国产大陆天天弄谢| 免费黄网站久久成人精品| 亚洲一区二区三区欧美精品| 高清不卡的av网站| 亚洲国产毛片av蜜桃av| 五月开心婷婷网| 不卡视频在线观看欧美| 成人手机av| 寂寞人妻少妇视频99o| 日本爱情动作片www.在线观看| 在线观看人妻少妇| 欧美精品一区二区免费开放| 最近的中文字幕免费完整| 99re6热这里在线精品视频| 成人二区视频| 久久鲁丝午夜福利片| 777米奇影视久久| 国产日韩欧美亚洲二区| 欧美日韩成人在线一区二区| 国产精品久久久久久精品电影小说| 99精国产麻豆久久婷婷| 丝袜美足系列| www.av在线官网国产| 中国国产av一级| 午夜免费观看性视频| 五月玫瑰六月丁香| 久久精品国产鲁丝片午夜精品| 亚洲色图 男人天堂 中文字幕 | 一本—道久久a久久精品蜜桃钙片| 久久久国产欧美日韩av| 一本—道久久a久久精品蜜桃钙片| 亚洲精品一区蜜桃| 亚洲av国产av综合av卡| 国产片特级美女逼逼视频| 久久精品人人爽人人爽视色| 91精品国产国语对白视频| 在线精品无人区一区二区三| 中国国产av一级| 精品人妻在线不人妻| 五月玫瑰六月丁香| 丝袜喷水一区| 亚洲欧洲国产日韩| 欧美丝袜亚洲另类| 永久网站在线| 国产精品久久久久成人av| 国产探花极品一区二区| 国产亚洲最大av| 精品亚洲成国产av| 日韩中文字幕视频在线看片| 极品少妇高潮喷水抽搐| 国产欧美日韩综合在线一区二区| 精品99又大又爽又粗少妇毛片| 国产 一区精品| 另类精品久久| 国产一区二区三区av在线| 在线观看www视频免费| 国产永久视频网站| 欧美精品亚洲一区二区| 亚洲精品久久久久久婷婷小说| 麻豆精品久久久久久蜜桃| 最新的欧美精品一区二区| 免费黄色在线免费观看| 亚洲激情五月婷婷啪啪| 在线免费观看不下载黄p国产| 国产黄色免费在线视频| 黄色视频在线播放观看不卡| 免费观看在线日韩| 免费观看的影片在线观看| 亚洲第一区二区三区不卡| 午夜福利影视在线免费观看| 五月开心婷婷网| 天堂8中文在线网| 亚洲久久久国产精品| 免费大片18禁| 黄色配什么色好看| 久久97久久精品| 黄色一级大片看看| 最近中文字幕高清免费大全6| 另类亚洲欧美激情| 国产亚洲最大av| 久久婷婷青草| √禁漫天堂资源中文www| 亚洲欧美色中文字幕在线| 亚洲国产精品专区欧美| 久久精品国产a三级三级三级| 日日撸夜夜添| 免费黄频网站在线观看国产| 精品久久蜜臀av无| 天天影视国产精品| 国产一区亚洲一区在线观看| 一级爰片在线观看| 97超视频在线观看视频| 久久精品国产鲁丝片午夜精品| 少妇人妻久久综合中文| 黑人巨大精品欧美一区二区蜜桃 | 亚洲精品aⅴ在线观看| 免费日韩欧美在线观看| 满18在线观看网站| 国产精品一区www在线观看| 国产永久视频网站| 狂野欧美激情性bbbbbb| 汤姆久久久久久久影院中文字幕| 最近2019中文字幕mv第一页| 视频在线观看一区二区三区| 国产精品国产三级专区第一集| 我要看黄色一级片免费的| 亚洲欧美精品自产自拍| 九色亚洲精品在线播放| 亚洲精品视频女| 免费黄色在线免费观看| 欧美最新免费一区二区三区| 26uuu在线亚洲综合色| 日韩一区二区三区影片| 一区二区三区精品91| 在线观看www视频免费| 男的添女的下面高潮视频| 亚洲人与动物交配视频| 国产精品偷伦视频观看了| 丝袜在线中文字幕| 一区二区三区精品91| 晚上一个人看的免费电影| 街头女战士在线观看网站| 天堂俺去俺来也www色官网| 欧美精品一区二区免费开放| 午夜精品国产一区二区电影| 又黄又爽又刺激的免费视频.| 交换朋友夫妻互换小说| 精品一区二区三区视频在线| 成人毛片a级毛片在线播放| 久久久精品区二区三区| 最黄视频免费看| 熟妇人妻不卡中文字幕| xxx大片免费视频| 蜜桃在线观看..| 亚洲欧美日韩卡通动漫| 精品国产露脸久久av麻豆| 欧美日韩av久久| 黄片无遮挡物在线观看| 日本黄色片子视频| 欧美精品人与动牲交sv欧美| 日韩免费高清中文字幕av| 黑丝袜美女国产一区| 亚洲四区av| 欧美日韩成人在线一区二区| 老司机亚洲免费影院| 国产免费一级a男人的天堂| 卡戴珊不雅视频在线播放| 欧美老熟妇乱子伦牲交| 国产一区二区在线观看日韩| 26uuu在线亚洲综合色| a级毛色黄片| 26uuu在线亚洲综合色| 老熟女久久久| 一级a做视频免费观看| 2021少妇久久久久久久久久久| 国产在线一区二区三区精| 成人国产av品久久久| 国产精品蜜桃在线观看| av福利片在线| 久久精品国产鲁丝片午夜精品| 高清av免费在线| kizo精华| 亚洲婷婷狠狠爱综合网| 成年美女黄网站色视频大全免费 |