×

Incremental construction of three-way concept lattice for knowledge discovery in social networks. (English) Zbl 1530.68252

Summary: Three-way concept analysis (3WCA), a combination of three-way decision and formal concept analysis, is widely used in the field of knowledge discovery. Generally, constructing three-way concept lattices requires the original formal context and its complement context simultaneously. Additionally, the existing three-way concept lattice construction algorithms focus on the static formal context, and cannot cope with the dynamic formal context that is an essential representation in social networks. Toward this end, this paper pioneers a novel problem and method for the incremental construction of three-way concept lattice for knowledge discovery in social networks. Aiming to facilitate the construction efficiency, this paper firstly investigates the three-way concept lattice construction for attribute-incremental/object-incremental formal contexts, respectively. Then, the dynamic formal context of a social network can be viewed as a special formal context with both attribute-increment and object-increment. Further, we develop the AE/OE concept lattice incremental construction algorithms, called SNS-AE and SNS-OE. Extensive experiments are conducted on various formal contexts to evaluate the effectiveness of our incremental algorithms. The experimental results demonstrate that our proposed incremental algorithms can significantly decrease the construction time of three-way concept lattice compared to the non-incremental algorithm.

MSC:

68T30 Knowledge representation
91D30 Social networks; opinion dynamics

References:

[1] R. Wille, Formal concept analysis as mathematical theory of concepts and concept hierarchies, in: Formal concept analysis, Springer, 2005, pp. 1-33. · Zbl 1152.68636
[2] Zou, C.; Zhang, D.; Wan, J.; Hassan, M. M.; Lloret, J., Using concept lattice for personalized recommendation system design, IEEE Systems Journal, 11, 1, 305-314 (2015)
[3] Hao, F.; Pang, G.; Pei, Z.; Qin, K.; Zhang, Y.; Wang, X., Virtual machines scheduling in mobile edge computing: A formal concept analysis approach, IEEE Transactions on Sustainable Computing, 5, 3, 319-328 (2020)
[4] Hao, F.; Min, G.; Pei, Z.; Park, D.-S.; Yang, L. T., k-clique community detection in social networks based on formal concept analysis, IEEE Systems Journal, 11, 1, 250-259 (2017)
[5] Hao, F.; Park, D.-S.; Min, G.; Jeong, Y.-S.; Park, J.-H., k-cliques mining in dynamic social networks based on triadic formal concept analysis, Neurocomputing, 209, 57-66 (2016)
[6] Y. Yang, F. Hao, B. Pang, G. Min, Y. Wu, Dynamic maximal cliques detection and evolution management in social internet of things: A formal concept analysis approach, IEEE Transactions on Network Science and Engineering.
[7] Shao, M.-W.; Lv, M.-M.; Li, K.-W.; Wang, C.-Z., The construction of attribute (object)-oriented multi-granularity concept lattices, International Journal of Machine Learning and Cybernetics, 1-16 (2019)
[8] Zhang, J.; Liu, R.; Zou, L.; Zeng, L., A new rapid incremental algorithm for constructing concept lattices, Information, 10, 2, 78 (2019)
[9] Qian, T.; Wei, L., A novel concept acquisition approach based on formal contexts, The Scientific World Journal (2014)
[10] Hao, F.; Yang, Y.; Pang, B.; Yen, N. Y.; Park, D.-S., A fast algorithm on generating concept lattice for symmetry formal context constructed from social networks, Journal of Ambient Intelligence and Humanized Computing, 1-8 (2019)
[11] Wang, T.; Li, H.; Zhang, L.; Zhou, X.; Huang, B., A three-way decision model based on cumulative prospect theory, Information Sciences, 519, 74-92 (2020) · Zbl 1457.91160
[12] Sun, B.; Chen, X.; Zhang, L.; Ma, W., Three-way decision making approach to conflict analysis and resolution using probabilistic rough set over two universes, Information Sciences, 507, 809-822 (2020) · Zbl 1456.68202
[13] F. Hao, J. Gao, C. Bisogni, G. Min, V. Loia, C. De Maio, Stability of three-way concepts and its application to natural language generation, Pattern Recognition Letters.
[14] Qi, J.; Wei, L.; Yao, Y., Three-way formal concept analysis, (International Conference on Rough Sets and Knowledge Technology, Springer (2014)), 732-741 · Zbl 1323.68474
[15] Qian, T.; Wei, L.; Qi, J., Constructing three-way concept lattices based on apposition and subposition of formal contexts, Knowledge-Based Systems, 116, 39-48 (2017)
[16] Wang, W.; Qi, J., Algorithm for constructing three-way concepts, Journal of Xidian University, 44, 71-76 (2017)
[17] Yu, H.; Li, Q.; Cai, M., Characteristics of three-way concept lattices and three-way rough concept lattices, Knowledge-Based Systems, 146, 181-189 (2018)
[18] Yang, S.; Lu, Y.; Jia, X.; Li, W., Constructing three-way concept lattice based on the composite of classical lattices, International Journal of Approximate Reasoning, 121, 174-186 (2020) · Zbl 1445.68213
[19] Yao, Y., Three-way decision and granular computing, International Journal of Approximate Reasoning, 103, 107-123 (2018) · Zbl 1448.68427
[20] Hao, F.; Pei, Z.; Yang, L. T., Diversified top-k maximal clique detection in social internet of things, Future Generation Computer Systems, 107, 408-417 (2020)
[21] Qi, J.; Qian, T.; Wei, L., The connections between three-way and classical concept lattices, Knowledge-Based Systems, 91, 143-151 (2016)
[22] Lin, L.; Ting, Q.; Ling, W., Rules extraction in formal decision contexts based on attribute-induced three-way concept lattices, Journal of Northwest University (Natural Science Edition), 46, 4, 481-487 (2016) · Zbl 1374.68546
[23] T. Qian, The constructions of classical concept lattices and three-way concept lattices and knowledge acquisition, Ph.D. thesis, Northwest University (2016).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.