Finding Frequent Elements for a Product of Partial Orders and Association Rules

Авторы: Genrikhov I., Djukova E.
Сборник: 2020 International Conference on Information Technology and Nanotechnology (ITNT-2020)
Год издания: 2020
Место издания: IEEE Samara, Russia
Первая страница: 1
Последняя страница: 5
DOI: 10.1109/ITNT49337.2020.9253275
Аннотация: A known method for finding frequent sets of attributes in the search for association rules in a binary database is based on constructing an FP-tree (Frequent Pattern Growth Tree). In the case of nonbinary data, the values of each nonbinary attribute are usually binarized using a numerical threshold, and the problem is reduced to constructing the classical FP-tree. The result significantly depends on the choice of thresholds. In this paper, it isproposed to modify the structure of the classical FP-tree by introducing an additional vertex for each nonbinary attribute;this vertex is called full, and it contains information about possible variants of binarization of this attribute values. The proposed model of the FP-tree is called full FP-tree. The application of the full FP-tree for the analysis of nonbinary data under the condition that partial orders on the attribute values are specified. Illustrative and generated examples are discussed.
Добавил в систему: Дюкова Елена Всеволодовна

	ИСТИНА	Войти в систему Регистрация
	Интеллектуальная Система Тематического Исследования НАукометрических данных
	Главная Поиск Статистика О проекте Помощь

ИСТИНА