Search Results - INCREMENTAL ALGORITHMS

Refine Results
  1. 1
  2. 2

    An Improved Incremental Update Algorithm for Firmware by WANG Yuxin, GAO Meifeng

    Published in Jisuanji gongcheng (2020-10-01)
    “…In order to solve the high memory consumption of bsdiff algorithm when building new versions of firmware in the firmware update of embedded devices,this paper proposes an incremental update algorithm that saves memory.The improved patch file format of the bsdiff algorithm is used to avoid recording and calculating the address offset frequently in the application of the patch files.The parallel decompression process in the bsdiff algorithm is replaced by serial decompression,and the required auxiliary space is reduced by processing data in batches.At the same time,the asymmetric lossless compression algorithm is applied to the compression and decompression process of the improved incremental update algorithm,which reduces the memory consumption caused by the decompression of patch files.Experimental results show that,compared with bsdiff algorithm,xdelta algorithm,vcdif algorithm and zdelta algorithm,the proposed algorithm can effectively reduce the memory consumption when building new versions of firmware,and has good compression performance.…”
    Get full text
    Article
  3. 3

    Improved incremental algorithm of Naive Bayes by Shui-fei ZENG, Xiao-yan ZHANG, Xiao-feng DU, Tian-bo LU

    Published in Tongxin xuebao (2016-10-01)
    Subjects: “…Naive Bayes;incremental algorithm;feature space;evaluation index…”
    Get full text
    Article
  4. 4
  5. 5

    Incremental Localization Algorithm Based on Multivariate Analysis by Xiaoyong Yan, Huanyan Qian, Jiguang Chen

    “…In view of the traditional increment localization method, only the heteroscedasticity caused by the error accumulation is considered unilaterally a kind of incremental localization algorithm based on multivariate analysis is proposed. …”
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    An Incremental High-Utility Mining Algorithm with Transaction Insertion by Jerry Chun-Wei Lin, Wensheng Gan, Tzung-Pei Hong, Binbin Zhang

    Published in The Scientific World Journal (2015-01-01)
    “…In this paper, an efficient incremental algorithm with transaction insertion is designed to reduce computations without candidate generation based on the utility-list structures. …”
    Get full text
    Article
  9. 9
  10. 10

    Research on Dynamic Incremental Backward Cloud Transformation Algorithm by XU Changlin, KONG Lingzhuo

    Published in Jisuanji kexue (2025-05-01)
    “…As a tool for studying uncertain information,cloud model is of great significance in uncertain artificial intelligence and data mining.The backward cloud transformation algorithm is one of the important algorithms of cloud model,which can realize the transformation from quantitative data to qualitative concepts.This paper mainly studies the backward cloud transformation algorithm from the perspective of dynamic increment.Firstly,the irrationality of parameter estimation in the existing classical backward cloud transformation algorithm based on the first-order absolute central moment is analyzed theoretically.Secondly,on the basis of theoretical analysis,combined with the characteristics of cloud droplets generated by the forward cloud transformation algorithm,the normal random variable is used to dynamically generate new cloud droplets as new samples,then the randomly generated samples and the original samples are fused as the final samples to estimate the parameters,which effectively solves the estimation problems existing in the existing algorithms.Therefore,two dynamic incremental backward cloud transformation algorithms are proposed.Thirdly,through random simulation experiments,this paper compares the proposed backward cloud transform algorithm with existing algorithms from four aspects:effectiveness,stability,convergence and parameter robustness.The experimental results show that the dynamic incremental backward cloud transformation algorithm proposed in this paper has smaller estimation error,better stability and convergence,and has strong robustness to parameter changes.Finally,the proposed backward cloud transform algorithm is applied to the simulation and evaluation of Shooters' shooting level.The experimental results further show that the proposed algorithms have preferably practicability.…”
    Get full text
    Article
  11. 11
  12. 12

    Parallel association rules incremental mining algorithm based on information entropy and genetic algorithm by Yimin MAO, Qianhu DENG, Zhigang CHEN

    Published in Tongxin xuebao (2021-05-01)
    “…Aiming at the problems that in the big data environment, the Can-tree based incremental association rule algorithm had problems such as too much space occupation of the tree structure, inability to dynamically set the support threshold, and too much time consumption during the data transfer process between the Map and Reduce stages, the Map Reduce-based parallel association rules incremental mining algorithm using information entropy and genetic algorithm (MR-PARIMIEG)was proposed.Firstly, a similar items merging based on information entropy (SIM-IE) was designed to merge similar data items, and a Can tree based on the merged data set was constructed, thereby reducing the space occupation of the tree structure.Secondly, the dynamic support threshold obtaining using genetic algorithm (DST-GA) was proposed to obtain the relatively optimal dynamic support threshold in the big data environment, and frequent itemset mining was performed according to this threshold to avoid the unnecessary time consumption caused by mining redundant frequent patterns.Finally, in the process of MapReduce parallel operation, the parallel LZO data compression algorithm was used to compress the output data of the Map stage, thereby reducing the size of the transmitted data, and finally improving the running speed of the algorithm.Experimental simulation results show that MR-PARIMIEG has better performance when mining frequent item sets in the big data environment, and it is suitable for parallel processing of larger data sets.…”
    Get full text
    Article
  13. 13

    Parallel association rules incremental mining algorithm based on information entropy and genetic algorithm by Yimin MAO, Qianhu DENG, Zhigang CHEN

    Published in Tongxin xuebao (2021-05-01)
    “…Aiming at the problems that in the big data environment, the Can-tree based incremental association rule algorithm had problems such as too much space occupation of the tree structure, inability to dynamically set the support threshold, and too much time consumption during the data transfer process between the Map and Reduce stages, the Map Reduce-based parallel association rules incremental mining algorithm using information entropy and genetic algorithm (MR-PARIMIEG)was proposed.Firstly, a similar items merging based on information entropy (SIM-IE) was designed to merge similar data items, and a Can tree based on the merged data set was constructed, thereby reducing the space occupation of the tree structure.Secondly, the dynamic support threshold obtaining using genetic algorithm (DST-GA) was proposed to obtain the relatively optimal dynamic support threshold in the big data environment, and frequent itemset mining was performed according to this threshold to avoid the unnecessary time consumption caused by mining redundant frequent patterns.Finally, in the process of MapReduce parallel operation, the parallel LZO data compression algorithm was used to compress the output data of the Map stage, thereby reducing the size of the transmitted data, and finally improving the running speed of the algorithm.Experimental simulation results show that MR-PARIMIEG has better performance when mining frequent item sets in the big data environment, and it is suitable for parallel processing of larger data sets.…”
    Get full text
    Article
  14. 14
  15. 15
  16. 16
  17. 17

    Actor-critic algorithm with incremental dual natural policy gradient by Peng ZHANG, Quan LIU, Shan ZHONG, Jian-wei ZHAI, Wei-sheng QIAN

    Published in Tongxin xuebao (2017-04-01)
    “…The existed algorithms for continuous action space failed to consider the way of selecting optimal action and utilizing the knowledge of the action space,so an efficient actor-critic algorithm was proposed by improving the natural gradient.The objective of the proposed algorithm was to maximize the expected return.Upper and the lower bounds of the action range were weighted to obtain the optimal action.The two bounds were approximated by linear function.Afterward,the problem of obtaining the optimal action was transferred to the learning of double policy parameter vectors.To speed the learning,the incremental Fisher information matrix and the eligibilities of both bounds were designed.At three reinforcement learning problems,compared with other representative methods with continuous action space,the simulation results show that the proposed algorithm has the advantages of rapid convergence rate and high convergence stability.…”
    Get full text
    Article
  18. 18

    Efficient incremental density-based algorithm for clustering large datasets by Ahmad M. Bakr, Nagia M. Ghanem, Mohamed A. Ismail

    Published in Alexandria Engineering Journal (2015-12-01)
    “…With such dynamic nature, incremental clustering algorithms are always preferred compared to traditional static algorithms. …”
    Get full text
    Article
  19. 19
  20. 20

    Performance Analysis of Distributed Incremental LMS Algorithm with Noisy Links by Azam Khalili, Mohammad Ali Tinati, Amir Rastegarnia

    “…In this paper, we study the effect of noisy links on the performance of distributed incremental least-mean-square (DILMS) algorithm for the case of Gaussian regressors. …”
    Get full text
    Article

Search Tools: