4.6 Article

Incremental method of generating decision implication canonical basis

Journal

SOFT COMPUTING
Volume 26, Issue 3, Pages 1067-1083

Publisher

SPRINGER
DOI: 10.1007/s00500-021-06452-3

Keywords

Formal concept analysis; Decision premise; Decision implication canonical basis; Incremental method

Funding

  1. National Natural Science Foundation of China [62072294, 61972238, 61806116]
  2. Scientific and Technologial Innovation Programs of Higher Education Institutions in Shanxi(STIP) [2021L287, 2019L0500]
  3. Postgraduate Education Reform Research Project of Shanxi Province [2021YJJG041]
  4. Key R&D program of Shanxi Province [201903D421041]
  5. Natural Science Foundation of Shanxi Province [201901D211414, 201801D221175]
  6. Cultivate Scientific Research Excellence Programs of Higher Education Institutions in Shanxi (CSREP) [2019SK036]
  7. Training Program for Young Scientific Researchers of Higher Education Institutions in Shanxi

Ask authors/readers for more resources

Decision implication is a fundamental representation of decision knowledge in formal concept analysis, with Decision implication canonical basis (DICB) being the most compact and complete representation. The method based on true premises (MBTP) for DICB generation is currently the most efficient one, but lacks an update mechanism for dynamically changing data. An incremental algorithm for DICB generation is proposed in this paper, which is significantly superior to MBTP especially when samples in data are much more than condition attributes. The experimental results also suggest that the incremental algorithm is more efficient than MBTP even when new samples are continually added into data, due to its ability to modify existing DICB.
Decision implication is an elementary representation of decision knowledge in formal concept analysis. Decision implication canonical basis (DICB), a set of decision implications with completeness and non-redundancy, is the most compact representation of decision implications. The method based on true premises (MBTP) for DICB generation is the most efficient one at present. In practical applications, however, data are always changing dynamically, and MBTP, lacking an update mechanism of DICB, still needs to re-generate inefficiently the whole DICB. This paper proposes an incremental algorithm for DICB generation, which obtains a new DICB just by modifying and updating the existing one. Experimental results verify that when samples in data are much more than condition attributes, which is actually a general case in practical applications, the incremental algorithm is significantly superior to MBTP. Furthermore, we conclude that even for the data in which samples are less than condition attributes, when new samples are continually added into data, the incremental algorithm must be also more efficient than MBTP, because the incremental algorithm just needs to modify the existing DICB, which is only a part of work of MBTP.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available