Please use this identifier to cite or link to this item:
|Title:||Fast incremental algorithm for building concept lattice|
|Authors:||Xie, Z.-P. |
|Citation:||Xie, Z.-P.,Liu, Z.-T. (2002). Fast incremental algorithm for building concept lattice. Jisuanji Xuebao/Chinese Journal of Computers 25 (5) : 490-496. ScholarBank@NUS Repository.|
|Abstract:||To incrementally update the existing concept lattice with the inserted new object, this paper first identifies the basic problems to solve, through analyzing the process of incremental updating. Then, tree structure is employed to organize the set of concepts in concept lattice. Based on the tree structure, a fast incremental algorithm is developed to incrementally update the existing concept lattice by traversing its set of concepts with the defined visiting order. On visiting each concept node, the node type will be identified and the corresponding updating operation will be executed. The organization of concepts in tree structure and the defined visiting order on it can greatly reduce the search space of parents and children of newborn concept node and help to identify the node type, and consequently improve the speed of the algorithm. In the end, experimental results on artificially generated datasets are produced, which manifest that the algorithm in this paper runs much faster than the famous Godin's algorithm.|
|Source Title:||Jisuanji Xuebao/Chinese Journal of Computers|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 8, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.