14 March 2013 An incremental algorithm based on rough set for concept hierarchy tree
Author Affiliations +
Proceedings Volume 8768, International Conference on Graphic and Image Processing (ICGIP 2012); 87680U (2013) https://doi.org/10.1117/12.2010655
Event: 2012 International Conference on Graphic and Image Processing, 2012, Singapore, Singapore
Abstract
In an open dynamic concept hierarchy tree of technological terms, universe keeps changing and then leads to changes in the system’s structure and size characteristics. This study presents an efficient incremental algorithm based on rough set for maintaining the concept hierarchy tree in dynamic datasets. While taking into account the relationship between the new terms and the original concept hierarchy tree, the paper focus on when the condition attributes is known and the decision attributes is unknown, how to add a new term into the original concept hierarchy tree. The paper proposes a novel algorithm which can be used for updating concept hierarchy tree dynamically and proves the rationality of the algorithm theoretically. The paper has furthermore proved its efficiency and reliability with an empirical study of the Micro-Electro-Mechanical System, MEMS.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Junpeng Yuan, Junpeng Yuan, Jie Su, Jie Su, } "An incremental algorithm based on rough set for concept hierarchy tree", Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680U (14 March 2013); doi: 10.1117/12.2010655; https://doi.org/10.1117/12.2010655
PROCEEDINGS
7 PAGES


SHARE
Back to Top