• <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,

    99精品在免费线老司机午夜| 国产av在哪里看| 欧美日韩福利视频一区二区| 久久久水蜜桃国产精品网| 一本综合久久免费| svipshipincom国产片| 91麻豆av在线| 在线av久久热| 99精品久久久久人妻精品| 午夜免费激情av| 91国产中文字幕| tocl精华| 淫秽高清视频在线观看| 男女床上黄色一级片免费看| 男女午夜视频在线观看| 亚洲一区二区三区色噜噜 | 婷婷六月久久综合丁香| 成人黄色视频免费在线看| 在线免费观看的www视频| av免费在线观看网站| 一区二区三区激情视频| 欧美 亚洲 国产 日韩一| 最新美女视频免费是黄的| x7x7x7水蜜桃| 国产极品粉嫩免费观看在线| 美女 人体艺术 gogo| 久久午夜亚洲精品久久| 在线看a的网站| 亚洲av成人av| 97碰自拍视频| 精品电影一区二区在线| 精品一区二区三区视频在线观看免费 | 色在线成人网| 老汉色∧v一级毛片| 黄网站色视频无遮挡免费观看| 国产精品国产高清国产av| 亚洲人成网站在线播放欧美日韩| 国产精品野战在线观看 | 在线观看午夜福利视频| 乱人伦中国视频| 老司机在亚洲福利影院| 女人爽到高潮嗷嗷叫在线视频| 中文字幕av电影在线播放| 黄片播放在线免费| 成人18禁高潮啪啪吃奶动态图| 夫妻午夜视频| svipshipincom国产片| 黑人猛操日本美女一级片| av片东京热男人的天堂| 男人的好看免费观看在线视频 | 免费日韩欧美在线观看| 最新美女视频免费是黄的| 亚洲第一欧美日韩一区二区三区| 欧美日韩福利视频一区二区| 如日韩欧美国产精品一区二区三区| 精品免费久久久久久久清纯| 欧美黄色片欧美黄色片| 欧美中文日本在线观看视频| 国产免费现黄频在线看| av中文乱码字幕在线| 最好的美女福利视频网| 波多野结衣av一区二区av| 在线观看一区二区三区| 欧美日韩黄片免| 精品福利观看| 热re99久久国产66热| 极品教师在线免费播放| 12—13女人毛片做爰片一| 怎么达到女性高潮| 啦啦啦在线免费观看视频4| 美女扒开内裤让男人捅视频| 操出白浆在线播放| 男人的好看免费观看在线视频 | 国产一区二区三区视频了| 欧美激情 高清一区二区三区| 久久久国产精品麻豆| 丝袜人妻中文字幕| 久久久久久久久久久久大奶| svipshipincom国产片| 美国免费a级毛片| 精品少妇一区二区三区视频日本电影| 亚洲国产精品sss在线观看 | 欧洲精品卡2卡3卡4卡5卡区| av电影中文网址| 亚洲五月色婷婷综合| 国产真人三级小视频在线观看| 成人三级黄色视频| 丝袜在线中文字幕| 久久精品成人免费网站| 天堂中文最新版在线下载| 丝袜美足系列| 热99re8久久精品国产| 国产一区二区三区综合在线观看| 午夜a级毛片| 欧美一区二区精品小视频在线| 亚洲三区欧美一区| 美女国产高潮福利片在线看| 69av精品久久久久久| 久久久久九九精品影院| 69精品国产乱码久久久| 精品无人区乱码1区二区| bbb黄色大片| av视频免费观看在线观看| 乱人伦中国视频| 亚洲av成人不卡在线观看播放网| 新久久久久国产一级毛片| 亚洲精品久久成人aⅴ小说| 国产男靠女视频免费网站| 好男人电影高清在线观看| av天堂在线播放| 亚洲熟妇熟女久久| 大型av网站在线播放| 国产成人精品久久二区二区91| 高清毛片免费观看视频网站 | 亚洲性夜色夜夜综合| 精品免费久久久久久久清纯| 久久天躁狠狠躁夜夜2o2o| 高清毛片免费观看视频网站 | 免费在线观看完整版高清| 亚洲av美国av| 国产成人系列免费观看| av欧美777| 久久精品国产亚洲av香蕉五月| 精品国产一区二区三区四区第35| a级片在线免费高清观看视频| 亚洲成av片中文字幕在线观看| 午夜福利一区二区在线看| 亚洲自拍偷在线| 国产成人欧美| 色哟哟哟哟哟哟| 国产精品99久久99久久久不卡| 丝袜在线中文字幕| 亚洲少妇的诱惑av| 亚洲精品国产区一区二| www.精华液| 黄片播放在线免费| 757午夜福利合集在线观看| 国产av在哪里看| 日韩三级视频一区二区三区| 久久午夜亚洲精品久久| 国产亚洲欧美精品永久| 亚洲 欧美一区二区三区| 手机成人av网站| 亚洲美女黄片视频| 99热只有精品国产| 少妇裸体淫交视频免费看高清 | 水蜜桃什么品种好| a级毛片黄视频| 一本综合久久免费| 91av网站免费观看| 黑丝袜美女国产一区| 亚洲熟妇熟女久久| 99久久99久久久精品蜜桃| 久久久久九九精品影院| 在线观看免费日韩欧美大片| 亚洲人成电影免费在线| 午夜免费激情av| 亚洲一区高清亚洲精品| 亚洲精品国产色婷婷电影| 99精国产麻豆久久婷婷| 丝袜人妻中文字幕| 中出人妻视频一区二区| 久久九九热精品免费| 91国产中文字幕| 视频区图区小说| 欧美日韩亚洲国产一区二区在线观看| √禁漫天堂资源中文www| 国产激情久久老熟女| 黄色丝袜av网址大全| a在线观看视频网站| 一区二区三区国产精品乱码| 国产人伦9x9x在线观看| 女生性感内裤真人,穿戴方法视频| 18禁国产床啪视频网站| 国产又爽黄色视频| 亚洲成av片中文字幕在线观看| 一区福利在线观看| 精品国产一区二区三区四区第35| 一二三四在线观看免费中文在| 中文字幕高清在线视频| 757午夜福利合集在线观看| 黄网站色视频无遮挡免费观看| 精品国产超薄肉色丝袜足j| 亚洲精品成人av观看孕妇| 国产免费男女视频| 欧美乱码精品一区二区三区| 午夜福利影视在线免费观看| 日韩国内少妇激情av| 欧美精品亚洲一区二区| 99国产极品粉嫩在线观看| 亚洲国产毛片av蜜桃av| 亚洲成人国产一区在线观看| 老汉色av国产亚洲站长工具| a级片在线免费高清观看视频| 亚洲av日韩精品久久久久久密| 日本免费a在线| 黑丝袜美女国产一区| 成在线人永久免费视频| 成在线人永久免费视频| 亚洲国产欧美一区二区综合| 久久久久国内视频| 高清毛片免费观看视频网站 | 精品一品国产午夜福利视频| 在线观看一区二区三区激情| 大型黄色视频在线免费观看| 99久久久亚洲精品蜜臀av| 伊人久久大香线蕉亚洲五| 亚洲片人在线观看| 久久天堂一区二区三区四区| 在线永久观看黄色视频| 日本黄色日本黄色录像| 狠狠狠狠99中文字幕| 成人手机av| 香蕉国产在线看| 操出白浆在线播放| e午夜精品久久久久久久| 久久这里只有精品19| x7x7x7水蜜桃| 久久久久国产一级毛片高清牌| 老司机午夜福利在线观看视频| 国产aⅴ精品一区二区三区波| 欧美大码av| 国产1区2区3区精品| 欧美最黄视频在线播放免费 | 黄色a级毛片大全视频| 欧美最黄视频在线播放免费 | xxxhd国产人妻xxx| 日日爽夜夜爽网站| 国产成人一区二区三区免费视频网站| 色精品久久人妻99蜜桃| 青草久久国产| 91国产中文字幕| 国产欧美日韩综合在线一区二区| 国产麻豆69| 很黄的视频免费| 国产精品成人在线| 午夜福利一区二区在线看| 色综合站精品国产| av有码第一页| 黄色视频不卡| 精品人妻在线不人妻| 欧美黑人欧美精品刺激| www.999成人在线观看| 免费av毛片视频| 日韩精品免费视频一区二区三区| 18禁国产床啪视频网站| 嫁个100分男人电影在线观看| 久久国产精品人妻蜜桃| 丝袜美足系列| 欧美日韩国产mv在线观看视频| 9热在线视频观看99| 国产精品一区二区精品视频观看| 国产亚洲av高清不卡| 亚洲精品一卡2卡三卡4卡5卡| 一二三四在线观看免费中文在| 日韩免费av在线播放| 午夜影院日韩av| 精品一区二区三卡| 国产高清激情床上av| 欧美黄色片欧美黄色片| 亚洲熟妇中文字幕五十中出 | 国产精品 国内视频| 操出白浆在线播放| aaaaa片日本免费| 首页视频小说图片口味搜索| 国产亚洲欧美精品永久| 国产激情欧美一区二区| 99国产精品一区二区三区| 成年版毛片免费区| 色在线成人网| 国产精品香港三级国产av潘金莲| 成年人免费黄色播放视频| 久久久国产精品麻豆| 人成视频在线观看免费观看| 最近最新免费中文字幕在线| 99久久国产精品久久久| 人人澡人人妻人| 高清欧美精品videossex| 日韩免费av在线播放| 99国产精品免费福利视频| 一级,二级,三级黄色视频| av片东京热男人的天堂| 国产在线精品亚洲第一网站| 亚洲中文字幕日韩| 国产黄a三级三级三级人| 嫁个100分男人电影在线观看| 丰满人妻熟妇乱又伦精品不卡| 色老头精品视频在线观看| 亚洲人成网站在线播放欧美日韩| 国产又爽黄色视频| 国产一区二区三区综合在线观看| 国产精品 国内视频| 十分钟在线观看高清视频www| 欧美久久黑人一区二区| 成人18禁高潮啪啪吃奶动态图| 欧美日韩瑟瑟在线播放| 国产高清视频在线播放一区| 丁香六月欧美| 色哟哟哟哟哟哟| 亚洲国产精品999在线| 久久久久久大精品| 久99久视频精品免费| 国产1区2区3区精品| 精品国产亚洲在线| 一区福利在线观看| 精品福利永久在线观看| 亚洲在线自拍视频| 一区二区三区激情视频| 一区福利在线观看| 日韩av在线大香蕉| 女人被狂操c到高潮| 脱女人内裤的视频| 757午夜福利合集在线观看| 久久久国产欧美日韩av| 久久精品国产清高在天天线| 91成年电影在线观看| 黄色片一级片一级黄色片| 国产日韩一区二区三区精品不卡| 久热爱精品视频在线9| 国产不卡一卡二| 国产精品日韩av在线免费观看 | 成人特级黄色片久久久久久久| 每晚都被弄得嗷嗷叫到高潮| 久久天堂一区二区三区四区| 国产亚洲精品久久久久5区| 性欧美人与动物交配| 麻豆一二三区av精品| 99久久久亚洲精品蜜臀av| 亚洲久久久国产精品| 亚洲人成电影免费在线| 国产精品野战在线观看 | 国产精品自产拍在线观看55亚洲| 欧洲精品卡2卡3卡4卡5卡区| 成年版毛片免费区| 99精国产麻豆久久婷婷| xxx96com| 亚洲国产看品久久| bbb黄色大片| 99久久人妻综合| 青草久久国产| 动漫黄色视频在线观看| 这个男人来自地球电影免费观看| 在线十欧美十亚洲十日本专区| 亚洲久久久国产精品| 国产av一区在线观看免费| 亚洲 国产 在线| 日韩人妻精品一区2区三区| 在线国产一区二区在线| 深夜精品福利| 亚洲欧洲精品一区二区精品久久久| 纯流量卡能插随身wifi吗| 一二三四社区在线视频社区8| 午夜久久久在线观看| 精品电影一区二区在线| 成人手机av| 精品少妇一区二区三区视频日本电影| 亚洲七黄色美女视频| 级片在线观看| 欧美丝袜亚洲另类 | 人人妻人人澡人人看| 欧美日韩精品网址| 国产精品爽爽va在线观看网站 | 国产蜜桃级精品一区二区三区| 免费在线观看黄色视频的| 欧美性长视频在线观看| 少妇裸体淫交视频免费看高清 | 欧美乱色亚洲激情| 亚洲中文av在线| 久久久久国产一级毛片高清牌| 好男人电影高清在线观看| www.www免费av| 久久精品国产综合久久久| 久久久久久久午夜电影 | 日韩成人在线观看一区二区三区| 在线观看日韩欧美| 精品国产超薄肉色丝袜足j| 99riav亚洲国产免费| 不卡av一区二区三区| 少妇裸体淫交视频免费看高清 | 水蜜桃什么品种好| 男女之事视频高清在线观看| 啦啦啦在线免费观看视频4| 亚洲熟妇中文字幕五十中出 | 国产欧美日韩一区二区三| 成人国语在线视频| 女人被躁到高潮嗷嗷叫费观| 99在线视频只有这里精品首页| 亚洲国产欧美网| 久久天堂一区二区三区四区| 亚洲精品国产一区二区精华液| 亚洲伊人色综图| 久久精品91无色码中文字幕| 亚洲一区中文字幕在线| 国产精品av久久久久免费| 一区二区三区国产精品乱码| 99在线人妻在线中文字幕| www国产在线视频色| 天天躁夜夜躁狠狠躁躁| 69精品国产乱码久久久| ponron亚洲| 国产精品偷伦视频观看了| 精品少妇一区二区三区视频日本电影| 母亲3免费完整高清在线观看| www日本在线高清视频| 欧美日韩一级在线毛片| 两个人看的免费小视频| 侵犯人妻中文字幕一二三四区| 99re在线观看精品视频| 免费av毛片视频| 一边摸一边抽搐一进一小说| 两个人看的免费小视频| 男人舔女人的私密视频| 日日干狠狠操夜夜爽| 在线av久久热| 无限看片的www在线观看| 91字幕亚洲| 国产精品av久久久久免费| 高清av免费在线| 热re99久久精品国产66热6| 亚洲人成77777在线视频| 欧洲精品卡2卡3卡4卡5卡区| 国产精品久久久久成人av| 自线自在国产av| 19禁男女啪啪无遮挡网站| 亚洲人成电影免费在线| 可以在线观看毛片的网站| 动漫黄色视频在线观看| 久久中文看片网| 久久午夜亚洲精品久久| 人妻丰满熟妇av一区二区三区| 12—13女人毛片做爰片一| 美女高潮到喷水免费观看| x7x7x7水蜜桃| 欧美乱色亚洲激情| 亚洲第一av免费看| 日本a在线网址| www.精华液| 在线观看www视频免费| 丰满的人妻完整版| 久久九九热精品免费| 9色porny在线观看| 亚洲精品在线观看二区| 精品免费久久久久久久清纯| 国产片内射在线| 亚洲一区二区三区色噜噜 | 国产精品久久久人人做人人爽| 日本免费a在线| 性少妇av在线| 美女国产高潮福利片在线看| 美女高潮喷水抽搐中文字幕| 99久久精品国产亚洲精品| 韩国av一区二区三区四区| 国产在线观看jvid| 国产精品久久视频播放| xxx96com| 嫩草影视91久久| 一夜夜www| 黑人猛操日本美女一级片| av免费在线观看网站| 国产精品二区激情视频| 成人亚洲精品av一区二区 | 亚洲精品一二三| 精品无人区乱码1区二区| av免费在线观看网站| 亚洲熟妇中文字幕五十中出 | 变态另类成人亚洲欧美熟女 | 午夜亚洲福利在线播放| 18禁黄网站禁片午夜丰满| 不卡av一区二区三区| 18禁国产床啪视频网站| 国产成人一区二区三区免费视频网站| 曰老女人黄片| 啦啦啦 在线观看视频| 99久久综合精品五月天人人| 亚洲午夜精品一区,二区,三区| 欧美av亚洲av综合av国产av| 麻豆国产av国片精品| 两性午夜刺激爽爽歪歪视频在线观看 | 亚洲专区字幕在线| 亚洲熟妇中文字幕五十中出 | 一边摸一边做爽爽视频免费| 又紧又爽又黄一区二区| 母亲3免费完整高清在线观看| 亚洲精品国产一区二区精华液| 97人妻天天添夜夜摸| 女同久久另类99精品国产91| 久久精品亚洲精品国产色婷小说| 女人被躁到高潮嗷嗷叫费观| 精品国产乱码久久久久久男人| 色尼玛亚洲综合影院| 亚洲欧美日韩另类电影网站| 黄色女人牲交| 无人区码免费观看不卡| 亚洲va日本ⅴa欧美va伊人久久| 国产欧美日韩精品亚洲av| 色综合欧美亚洲国产小说| 亚洲欧美激情在线| 一二三四社区在线视频社区8| 精品一区二区三区四区五区乱码| www日本在线高清视频| 国产精品免费一区二区三区在线| 一进一出抽搐动态| 国产精品乱码一区二三区的特点 | 老熟妇仑乱视频hdxx| 日本a在线网址| 欧美大码av| 神马国产精品三级电影在线观看 | av在线天堂中文字幕 | 国产免费男女视频| 国产成年人精品一区二区 | 国产男靠女视频免费网站| 黄片大片在线免费观看| 咕卡用的链子| 国产91精品成人一区二区三区| 国产麻豆69| 在线观看www视频免费| а√天堂www在线а√下载| 老司机福利观看| 精品电影一区二区在线| 一边摸一边抽搐一进一小说| 在线观看舔阴道视频| 99国产精品免费福利视频| 国产激情久久老熟女| 精品人妻1区二区| 嫁个100分男人电影在线观看| 又黄又粗又硬又大视频| 日韩三级视频一区二区三区| 国产激情久久老熟女| 日本五十路高清| 十八禁人妻一区二区| 女警被强在线播放| 午夜两性在线视频| 午夜福利在线免费观看网站| 久久人妻av系列| 国产精品久久久人人做人人爽| 在线av久久热| 黄色 视频免费看| 亚洲aⅴ乱码一区二区在线播放 | 亚洲色图综合在线观看| 一区二区日韩欧美中文字幕| 免费在线观看黄色视频的| 老司机在亚洲福利影院| 极品教师在线免费播放| 黄色怎么调成土黄色| 欧美黑人精品巨大| 欧美黄色淫秽网站| 午夜精品国产一区二区电影| 久久久久九九精品影院| 欧美激情久久久久久爽电影 | 精品人妻在线不人妻| www国产在线视频色| 亚洲精品一区av在线观看| 亚洲国产欧美一区二区综合| 国产亚洲精品一区二区www| 长腿黑丝高跟| 成人影院久久| 久久精品aⅴ一区二区三区四区| 日本撒尿小便嘘嘘汇集6| 麻豆久久精品国产亚洲av | 一级毛片精品| 黄片小视频在线播放| 日本vs欧美在线观看视频| 亚洲精品成人av观看孕妇| 99国产精品一区二区蜜桃av| 麻豆一二三区av精品| 一二三四社区在线视频社区8| 国产精品一区二区在线不卡| 日韩精品免费视频一区二区三区| 亚洲欧美精品综合久久99| 日韩欧美国产一区二区入口| 成人黄色视频免费在线看| 精品少妇一区二区三区视频日本电影| 天天添夜夜摸| 亚洲国产欧美网| 天堂√8在线中文| 人人澡人人妻人| 18禁国产床啪视频网站| 夫妻午夜视频| 国产精品久久久av美女十八| 亚洲成a人片在线一区二区| 国产欧美日韩一区二区三区在线| 中文欧美无线码| 亚洲三区欧美一区| 久久精品成人免费网站| 老司机亚洲免费影院| 久久精品人人爽人人爽视色| 免费观看精品视频网站| 啦啦啦 在线观看视频| 久久人妻av系列| 美女高潮喷水抽搐中文字幕| 9色porny在线观看| avwww免费| 国产亚洲欧美精品永久| 丁香欧美五月| 亚洲一区高清亚洲精品| 亚洲成人精品中文字幕电影 | 女人精品久久久久毛片| 亚洲精品成人av观看孕妇| av超薄肉色丝袜交足视频| av国产精品久久久久影院| 日韩欧美国产一区二区入口| bbb黄色大片| 久久婷婷成人综合色麻豆| 国产欧美日韩一区二区精品| 国产精品综合久久久久久久免费 | 午夜福利,免费看| 久久青草综合色| videosex国产| 91在线观看av| 亚洲av第一区精品v没综合| 岛国在线观看网站| 免费搜索国产男女视频| 亚洲人成网站在线播放欧美日韩| 亚洲精华国产精华精| 久热爱精品视频在线9|