title: ÐÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ðµ CbO Ð¿Ð¾Ð´Ð¾Ð±Ð½ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð±ÑÑÑÑÐ¾Ð³Ð¾ Ð¿Ð¾Ð¸ÑÐºÐ° ÑÐ¾ÑÐ¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾Ð½ÑÑÐ¸Ð¹
title: Ð²ÑÐ¿ÑÑÐºÐ½Ð°Ñ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð°Ñ ÑÐ°Ð±Ð¾ÑÐ° Ð¼Ð°Ð³Ð¸ÑÑÑÐ°
titleType: Subtitle
title: Investigation of CbO-like algorithms for fast search of formal concepts
Creators: name: ÐÐ»ÑÐ¸Ð½ÑÑ, Ð®Ð»Ð¸Ñ
Publisher: name: Ð¡Ð°Ð½ÐºÑ-ÐÐµÑÐµÑÐ±ÑÑÐ³ÑÐºÐ¸Ð¹ Ð¿Ð¾Ð»Ð¸ÑÐµÑÐ½Ð¸ÑÐµÑÐºÐ¸Ð¹ ÑÐ½Ð¸Ð²ÐµÑÑÐ¸ÑÐµÑ ÐÐµÑÑÐ° ÐÐµÐ»Ð¸ÐºÐ¾Ð³Ð¾
Year: 2022
Subjects: ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ
Ð°Ð½Ð°Ð»Ð¸Ð· ÑÐ¾ÑÐ¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾Ð½ÑÑÐ¸Ð¹
formal concept analysis

description: Ð¢ÐµÐ¼Ð° Ð²ÑÐ¿ÑÑÐºÐ½Ð¾Ð¹ ÐºÐ²Ð°Ð»Ð¸ÑÐ¸ÐºÐ°ÑÐ¸Ð¾Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÑ: Â«ÐÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ðµ CbO Ð¿Ð¾Ð´Ð¾Ð±Ð½ÑÑ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð² Ð±ÑÑÑÑÐ¾Ð³Ð¾ Ð¿Ð¾Ð¸ÑÐºÐ° ÑÐ¾ÑÐ¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾Ð½ÑÑÐ¸Ð¹Â». Ð Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÐµ ÑÐ°ÑÑÐ¼Ð°ÑÑÐ¸Ð²Ð°ÑÑÑÑ Close-by-One Ð¿Ð¾Ð´Ð¾Ð±Ð½ÑÐµ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ñ Ð´Ð»Ñ Ð±ÑÑÑÑÐ¾Ð³Ð¾ Ð¿Ð¾Ð¸ÑÐºÐ° ÑÐ¾ÑÐ¼Ð°Ð»ÑÐ½ÑÑ Ð¿Ð¾Ð½ÑÑÐ¸Ð¹ Ð² Ð¿Ð¾ÑÑÐ´ÐºÐµ ÑÐ²ÐµÐ»Ð¸ÑÐµÐ½Ð¸Ñ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÐ¸. ÐÐ°Ð¶Ð´Ð°Ñ Ð¿Ð¾ÑÐ»ÐµÐ´ÑÑÑÐ°Ñ Ð²ÐµÑÑÐ¸Ñ ÑÐ°Ð±Ð¾ÑÐ°ÐµÑ Ð»ÑÑÑÐµ Ð½Ð° Ð¾Ð¿ÑÐµÐ´ÐµÐ»ÐµÐ½Ð½ÑÑ Ð½Ð°Ð±Ð¾ÑÐ°Ñ Ð´Ð°Ð½Ð½ÑÑ. Ð Ð°Ð·Ð±Ð¸ÑÐ°ÐµÑÑÑ ÑÐ°Ð¼ÑÐ¹ ÑÑÑÐµÐºÑÐ¸Ð²Ð½ÑÐ¹ LCM (Linear time Closed item set Miner) Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼, Ð½Ð°Ð¿Ð¸ÑÐ°Ð½Ð½ÑÐ¹ Ð¿ÑÐ¾ÑÐµÑÑÐ¾ÑÐ¾Ð¼ Takeaki Uno Ð¸Ð· ÐÐ°ÑÐ¸Ð¾Ð½Ð°Ð»ÑÐ½Ð¾Ð³Ð¾ Ð¸Ð½ÑÑÐ¸ÑÑÑÐ° Ð¸Ð½ÑÐ¾ÑÐ¼Ð°ÑÐ¸ÐºÐ¸ Ð¯Ð¿Ð¾Ð½Ð¸Ð¸. ÐÐ»Ð³Ð¾ÑÐ¸ÑÐ¼ ÑÑÑÐ´Ð½Ð¾Ð´Ð¾ÑÑÑÐ¿ÐµÐ½ Ð´Ð»Ñ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ, Ñ. Ðº. Ð½Ð°Ð¿Ð¸ÑÐ°Ð½ Ñ Ð±Ð¾Ð»ÑÑÐ¸Ð¼ ÐºÐ¾Ð»Ð¸ÑÐµÑÑÐ²Ð¾Ð¼ Ð·Ð°Ð²Ð¸ÑÐ¸Ð¼Ð¾ÑÑÐµÐ¹, ÑÐµÐºÑÑÑÐ¸Ð¹. ÐÐ¾ÑÑÐ¾Ð¼Ñ Ð¼Ð½Ð¾Ð³Ð¸Ðµ ÑÑÐµÐ½ÑÐµ Ð¿ÑÑÐ°ÑÑÑÑ ÐµÐ³Ð¾ ÑÐ°Ð·Ð¾Ð±ÑÐ°ÑÑ Ð¸ Ð¾Ð¿Ð¸ÑÐ°ÑÑ. Ð Ð´Ð°Ð½Ð½Ð¾Ð¹ ÑÐ°Ð±Ð¾ÑÐµ ÑÐ°Ð·Ð¾Ð±ÑÐ°Ð½ Ð¸ ÑÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ LCM Ð² Ð¸Ð½ÑÐµÑÐ¿ÑÐµÑÐ°ÑÐ¸Ð¸ ÑÐµÑÑÐºÐ¸Ñ ÑÑÐµÐ½ÑÑ Radek Janostik, Jan Konecny and Petr KrajËca.Â Ð¢Ð°ÐºÐ¶Ðµ Ð¿ÑÐµÐ´Ð»Ð¾Ð¶ÐµÐ½Ñ Ð²Ð°ÑÐ¸Ð°Ð½ÑÑ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸. Ð ÐµÐ°Ð»Ð¸Ð·Ð¾Ð²Ð°Ð½ Ð½Ð¾Ð²ÑÐ¹ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼ Ñ Ð¿ÑÐ¸Ð¼ÐµÐ½ÐµÐ½Ð¸ÐµÐ¼ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸ ÑÐ¾ÐºÑÐ°ÑÐµÐ½Ð¸Ñ ÑÐ¸ÑÐ»Ð° Ð²ÑÐ·Ð¾Ð²Ð° Ð¼ÐµÑÐ¾Ð´Ð°, Ð¾ÑÐ²ÐµÑÐ°ÑÑÐµÐ³Ð¾ Ð·Ð° ÑÐ°Ð·Ð±Ð¸ÐµÐ½Ð¸Ðµ ÑÐ°Ð±Ð»Ð¸ÑÑ Ð½Ð° Ð¿Ð¾Ð´ÑÐ°Ð±Ð»Ð¸ÑÑ. ÐÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÐµÑÑÐ¸ÑÐ¾Ð²Ð°Ð½Ð¸Ðµ Ð½Ð° Ð½ÐµÑÐºÐ¾Ð»ÑÐºÐ¸Ñ Ð´Ð°ÑÐ°ÑÐµÑÐ°Ñ, ÐºÐ¾ÑÐ¾ÑÐ¾Ðµ Ð¿Ð¾ÐºÐ°Ð·ÑÐ²Ð°ÐµÑ ÑÑÑÐµÐºÑÐ¸Ð²Ð½Ð¾ÑÑÑ Ð¾Ð¿ÑÐ¸Ð¼Ð¸Ð·Ð°ÑÐ¸Ð¸. Ð¢Ð°ÐºÐ¶Ðµ Ð¿ÑÐ¾Ð²ÐµÐ´ÐµÐ½Ð¾ ÑÑÐ°Ð²Ð½ÐµÐ½Ð¸Ðµ Ð±ÑÑÑÑÐ¾Ð´ÐµÐ¹ÑÑÐ²Ð¸Ñ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð¾Ð³Ð¾ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð¾Ð¼ LCM Takeaki Uno. Ð ÐµÐ·ÑÐ»ÑÑÐ°ÑÑ Ð¸ÑÑÐ»ÐµÐ´Ð¾Ð²Ð°Ð½Ð¸Ñ Ð¼Ð¾Ð¶Ð½Ð¾ Ð¸ÑÐ¿Ð¾Ð»ÑÐ·Ð¾Ð²Ð°ÑÑ Ð´Ð»Ñ Ð´Ð°Ð»ÑÐ½ÐµÐ¹ÑÐµÐ³Ð¾ Ð¸Ð·ÑÑÐµÐ½Ð¸Ñ Ð°Ð»Ð³Ð¾ÑÐ¸ÑÐ¼Ð° LCM Ð° ÑÐ°ÐºÐ¶Ðµ Ð´Ð»Ñ Ð·Ð°Ð´Ð°Ñ Ð°Ð½Ð°Ð»Ð¸Ð·Ð° Ð´Ð°Ð½Ð½ÑÑ, Ð³Ð´Ðµ Ð¼Ð¾Ð¶ÐµÑ Ð¿Ð¾ÑÑÐµÐ±Ð¾Ð²Ð°ÑÑÑÑ ÑÐ°Ð·ÑÐ°Ð±Ð¾ÑÐ°Ð½Ð½Ð°Ñ Ð±Ð¸Ð±Ð»Ð¸Ð¾ÑÐµÐºÐ° Ð½Ð° ÑÐ·ÑÐºÐµ Ð¿ÑÐ¾Ð³ÑÐ°Ð¼Ð¼Ð¸ÑÐ¾Ð²Ð°Ð½Ð¸Ñ C#.
description: The topic of the master's thesis is "Investigation of CbO-like algorithms for fast search of formal concepts". In this paper, we consider Close-by-One similar algorithms for fast search of formal concepts in order of increasing efficiency. Each successive version performs better on certain datasets. The most efficient LCM (Linear time Closed item set Miner) algorithm written by Professor Takeaki Uno from the National Institute of Informatics of Japan is analyzed. The algorithm is difficult to study, because written with a lot of dependencies, recursions. Therefore, many scientists are trying to disassemble and describe it. In this paper, the LCM algorithm was analyzed and implemented in the interpretation of Czech scientists Radek Janostik, Jan Konecny ââand Petr KrajËca. Optimization options are also proposed. A new algorithm has been implemented using optimization to reduce the number of calls to the method responsible for splitting the table into subtables. Testing was carried out on several datasets, which shows the effectiveness of optimization. The performance of the developed algorithm was also compared with Takeaki Uno's LCM algorithm. The results of the study can be used for further study of the Takeaki Uno LCM algorithm, as well as for data analysis tasks, where a developed library in the C# programming language may be required.