Share Email Print

Proceedings Paper

An incremental algorithm based on rough set for concept hierarchy tree
Author(s): Junpeng Yuan; Jie Su
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 14 March 2013
PDF: 7 pages
Proc. SPIE 8768, International Conference on Graphic and Image Processing (ICGIP 2012), 87680U (14 March 2013); doi: 10.1117/12.2010655
Show Author Affiliations
Junpeng Yuan, Scientific and Technical of Information of China (China)
Jie Su, Central Univ. of Finance and Economics (China)

Published in SPIE Proceedings Vol. 8768:
International Conference on Graphic and Image Processing (ICGIP 2012)
Zeng Zhu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?