Journal of software incremental updating algorithm dating sites for people with diabilities
In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them.
Most algorithms are designed to work with inputs of arbitrary length.
A new algorithm, called MA_D (Maintenance Algorithm when Deleting some information), is presented in order to deal with the maintenance of sequential patternsmining resulted from the updating of database and the algorithm makes full use of the informationobtained from previous mining results to cut down the cost of finding new sequential patterns in anupdated database.
Our experimental analysis shows that the new algorithm is more efficient.
Usually the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps or storage locations (space complexity).
Experiments use software from different operating systems as samples, and the average data transmission saving is as high as 69.3%. (2007) An Incremental Updating Algorithm for Core Computing in Dominance-Based Rough Set Model. In this algorithm, when new samples arrive, the proposed solution only involves a few modifications to relevant rows and columns in the dominance discernibility matrix instead of recalculation. (eds) Rough Sets, Fuzzy Sets, Data Mining and Granular Computing. Then we redefine the dominance discernibility matrix and present an incremental updating algorithm.In computer science, a rough set, first described by a Polish computer scientist Zdzis¿aw I.Pawlak, is a formal approximation of a crisp set (i.e.