Aiming at the problems that the number of three-way concepts is large and the time constructing three-way concepts is lengthy
a parallel algorithm named PCbO3C was proposed to construct three-way concepts in this paper. In order to enhance the efficiency of constructing three-way concepts
PCbO3C is aimed at improving the sequential construction algorithm CbO3C by parallelization of using multithreading technology to compute all the core three-way concepts of a given formal context. This parallelization idea is similar to the algorithm PCbO. Firstly
PCbO3C computes all the three-way concepts of the Lth layer by CbO3C
and puts these three-way concepts into P queues in turn to get better load balance. Secondly
PCbO3C creates P threads and parallelly processes the three-way concepts in these P queues by CbO3C
i.e.
one thread deals with one queue. This can take full advantage of CPU resources. Since there is no synchronous operation
the running speed of the algorithm is improved efficiently. To verify the efficiency of PCbO3C
experiments on some UCI databases and random datasets were conducted in the situation of 8-core CPU. The results show that the speed of PCbO3C can be increased by approximately 67% with the number of threads doubled if the number of threads is no more than 8.
关键词
Keywords
references
QI J, WEI L, YAO Y. Three-way formal concept analysis [C]∥Proceedings of 2014 International Conference on Rough Sets and Knowledge Technology. Berlin, Germany: Springer, 2014: 732-741.
QI J, QIAN T, WEI L. The connections between three-way and classical concept lattices [J]. Knowledge-Based Systems, 2016, 91: 143-151.
YAO Y. An outline of a theory of three-way decisions [C]∥Proceedings of 2012 International Conference on Rough Sets and Current Trends in Computing. Berlin, Germany: Springer, 2012: 1-17.
WANG Dexing, HU Xuegang, LIU Xiaoping. Novel attribute induction algorithm based on quantized concept lattice [J]. Journal of Xi'an Jiaotong University, 2007, 41(2): 176-179.
LI J, REN Y, MEI C, et al. A comparative study of multigranulation rough sets and concept lattices via rule acquisition [J]. Knowledge-Based Systems, 2016, 91: 152-164.
REN R, WEI L. The attribute reductions of three-way concept lattices [J]. Knowledge-Based Systems, 2016, 99: 92-102.
LIU Lin, QIAN Ting, WEI Ling, et al. Rules extraction in formal decision contexts based on attribute-Induced three-way concept lattices [J]. Journal of Northwest University, Natural Science Edition, 2016, 46(4): 481-487.
YAO Y. Interval sets and three-way concept analysis in incomplete contexts [J/OL]. International Journal of Machine Learning Cybernetics, 2016: 1-18 [2016-06-26]. http: ∥link.springer.com/article/10.1007/s13042-016-0568-1.
WANG Wenwei, QI Jianjun. An algorithm for constructing three-way concepts [J]. Journal of Xidian University, 2017, 44(1): 71-76.
NJIWOUA P, NGUIFO E M. A parallel algorithm to build concept lattice [C/OL]. Proceedings of the 4th Groningen International Information Technology Conference, 1997 [2016-06-18]. http:∥citeseerx.ist.psu. edu/viewdoc/summary?doi=10.1. 1.28.926.
FU H, NGUIFO E M. A parallel algorithm to generate formal concepts for large data [C]∥International Conference on Formal Concept Analysis. Berlin, Germany: Springer, 2004: 394-401.
KRAJCA P, OUTRATA J, VYCHODIL V. Parallel recursive algorithm for FCA [C/OL]. Proceedings of the 6th International Conference on Concept Lattices and Their Applications, 2008 [2016-06-20]. ∥http: ceur-ws.org/Vol-433/paper6.pdf.
KRAJCA P, OUTRATA J, VYCHODIL V, et al. Advances in algorithms based on CbO [C/OL]. Proceedings of the 7th International Conference on Concept Lattices and Their Applications, 2010 [2016-06-18]. http:∥ceur-ws.org/Vol-672/paper29. pdf.
GAJDO P, SNÁEL V. A new FCA algorithm enabling analyzing of complex and dynamic data sets [J]. Soft Computing, 2014, 18(4): 683-694.