2015•Unpublished venueRequires access

A Matrix-Based Incremental Attribute Reduction Approach under Knowledge Granularity on the Variation of Attribute Set

Yunge Jing, Tianrui Li

Open publisher page 0 citations

Abstract

Attribute reduction in rough sets is a key step to discover interesting patterns in decision systems with numbers of attributes available. Moreover, data processing tools have been developed rapidly in recent years, and then the information system may increase quickly in attributes with time in real-life applications. How to update attribute reduction efficiently becomes an important task in knowledge discovery related tasks. The attribute reduction of information systems may alter with the attributes increasing. This paper aims for investigation of incremental attribute reduction algorithm based on knowledge granularity in information systems on the variation of attribute set. Matrix-based incremental mechanisms to calculate the new knowledge granularity are first introduced. Then, the corresponding incremental algorithm is presented for attribute reduction based on the calculated knowledge granularity when multiple attributes are added to a decision table. Finally, experiments performed on UCI data sets and the complexity analysis show that the proposed matrix-based incremental method is effective and efficient to update attribute reduction with the increase of attributes.

About this research paper

What this paper is about

Attribute reduction in rough sets is a key step to discover interesting patterns in decision systems with numbers of attributes available. Moreover, data processing tools have been developed rapidly in recent years, and then the information system may increase quickly in attributes with time in real-life applications. How to update attribute reduction efficiently becomes an important task in knowledge discovery related tasks. The attribute reduction of information systems may alter with the attributes increasing. This paper aims for investigation of incremental attribute reduction algorithm based on knowledge granularity in information systems on the variation of attribute set. Matrix-based incremental mechanisms to calculate the new knowledge granularity are first introduced. Then, the corresponding incremental algorithm is presented for attribute reduction based on the calculated knowledge granularity when multiple attributes are added to a decision table. Finally, experiments performed on UCI data sets and the complexity analysis show that the proposed matrix-based incremental method is effective and efficient to update attribute reduction with the increase of attributes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Attribute reduction in rough sets is a key step to discover interesting patterns in decision systems with numbers of attributes available. Moreover, data processing tools have been developed rapidly in recent years, and then the information system may increase quickly in attributes with time in real-life applications. How to update attribute reduction efficiently becomes an important task in knowledge discovery related tasks. The attribute reduction of information systems may alter with the attributes increasing. This paper aims for investigation of incremental attribute reduction algorithm based on knowledge granularity in information systems on the variation of attribute set. Matrix-based incremental mechanisms to calculate the new knowledge granularity are first introduced. Then, the corresponding incremental algorithm is presented for attribute reduction based on the calculated knowledge granularity when multiple attributes are added to a decision table. Finally, experiments performed on UCI data sets and the complexity analysis show that the proposed matrix-based incremental method is effective and efficient to update attribute reduction with the increase of attributes.

Key concepts: Granularity, Rough set, Reduction (mathematics), Data mining, Attribute domain, Computer science, Decision table, Granular computing

Related papers

Back to paper searchBrowse research topicsOriginal source
A Matrix-Based Incremental Attribute Reduction Approach under Knowledge Granularity on the Variation of Attribute Set — Research Paper | ScholarLens