Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Thi Vu Duc"'
Publikováno v:
Cybernetics and Information Technologies, Vol 22, Iss 3, Pp 18-28 (2022)
As a basic notion in algebra, closure operations have been successfully applied to many fields of computer science. In this paper we study dense family in the closure operations. In particular, we prove some families to be dense in any closure operat
Externí odkaz:
https://doaj.org/article/cbf415703d9a4d0a88a7f2c1e083e868
Publikováno v:
Cybernetics and Information Technologies, Vol 21, Iss 2, Pp 3-9 (2021)
Reduct of decision systems is the topic that has been attracting the interest of many researchers in data mining and machine learning for more than two decades. So far, many algorithms for finding reduct of decision systems by rough set theory have b
Externí odkaz:
https://doaj.org/article/44709279cd1b4e07a4c46ba3c66abf26
Publikováno v:
Cybernetics and Information Technologies, Vol 19, Iss 4, Pp 3-16 (2019)
Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In re
Externí odkaz:
https://doaj.org/article/8003f8598cc04b629f3cfe0855917294
Publikováno v:
Cybernetics and Information Technologies, Vol 16, Iss 4, Pp 13-28 (2016)
According to traditional rough set theory approach, attribute reduction methods are performed on the decision tables with the discretized value domain, which are decision tables obtained by discretized data methods. In recent years, researches have p
Externí odkaz:
https://doaj.org/article/5b3170dbc92d4986b208c62317e3a07e
Publikováno v:
Cybernetics and Information Technologies, Vol 16, Iss 2, Pp 3-15 (2016)
Feature selection is a vital problem which needs to be effectively solved in knowledge discovery in databases and pattern recognition due to two basic reasons: minimizing costs and accurately classifying data. Feature selection using rough set theory
Externí odkaz:
https://doaj.org/article/4b34e3227de7464a87d29d17452bfb47
Publikováno v:
Cybernetics and Information Technologies, Vol 13, Iss 4, Pp 118-126 (2013)
In rough set theory, the number of all reducts for a given decision table can be exponential with respect to the number of attributes. This paper investigates the problem of determining the set of all reductive attributes which are present in at leas
Externí odkaz:
https://doaj.org/article/1b4f9ae096894c78928582fcafaee8de
Autor:
Dai, Tran Thanh, Giang, Nguyen Long, Thi, Vu Duc, Ngan, Tran Thi, Chau, Hoang Thi Minh, Son, Le Hoang
Publikováno v:
Soft Computing - A Fusion of Foundations, Methodologies & Applications; Oct2024, Vol. 28 Issue 20, p11799-11822, 24p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Serdica Journal of Computing. 14:27-41
Over recent years, the research of attribute reduction for general decision systems and, in particular, for consistent decision tables has attracted great attention from the computer science community due to the emerge of big data. It has been known
Publikováno v:
Serdica Journal of Computing. 9:105-122
Sequential pattern mining is an important subject in data mining with broad applications in many different areas. However, previous sequential mining algorithms mostly aimed to calculate the number of occurrences (the support) without regard to the d