At present, a lot of incremental algorithms of updating the core are based on the distinguishable matrix, which are
disadvantageous to the larger database, and the efficiency of algorithms is not ideal. To overcome above shortcomings, on the
basis of the improved algorithm for computing the core based on the conflict region, the algorithm of incremental computing
core based on the collision is proposed. The algorithm is unnecessary to create the distinguishable matrix and only needs
to traverse the decision table one time, when a new object is added into the decision table. The time complexity and space
complexity of the algorithm are ??(∣??∣∣??
′∣) and ??(∣??∣) respectively. Both of theoretical analysis and experimental results
show that the algorithm is effective and efficient.
Key words：rough set；conflict region；core att