Aiming at some shortcomings of existing on computing attribute core and attribute reduction in rough sets, an
improved discernibility matrix definition is introduced. By using this foundation, based on improved discernibility matrix,
an incremental updating algorithm for computing core is proposed, which is mainly used to solve core updating when objects
are dynamically increased and deleted. In order to decrease time and space complexity on the existence incremental attribute
reduction algorithm, an effective algorithm for attribute reduction is proposed, which does not storage discernibility matrix.
This algorithm is mainly used to process attribute reduction updating when objects are dynamically increased. Theoretical
analysis and experimental results show the feasibility and effectiveness of the proposed algorithm.