Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Vu Duc Thi"'
Publikováno v:
IEEE Access, Vol 11, Pp 138095-138107 (2023)
Attribute reduction, often referred to as feature selection, is a vital step in data preprocessing aimed at eliminating unnecessary attributes and enhancing the efficiency of classification models. Intuitionistic fuzzy sets are widely acknowledged fo
Externí odkaz:
https://doaj.org/article/0b76305b55ce4f319ab37924badb1e87
Publikováno v:
International Journal of Mathematical, Engineering and Management Sciences, Vol 7, Iss 2, Pp 288-298 (2022)
In multi-criteria decision making, attribute reduction has attracted the attention of researchers for more than two decades. So far, numerous scientists have proposed algorithms to construct reducts in decision tables. However, most of the suggested
Externí odkaz:
https://doaj.org/article/57bad4995df14e459042f2e4d3195eec
Publikováno v:
Serdica Journal of Computing. 16:24-38
Attribute reduction is a key problem in the process of data mining and knowledge discovery. Up to now, many attribute reduction algorithms in incomplete decision tables have been proposed. However, the research results related to conditional attribut
Autor:
Tran Thanh Dai, GIANG NGUYEN LONG, Vu Duc Thi, Tran Thi Ngan, Hoang Thi Minh Chau, Le Hoang Son
Most of the current attribute reduction methods use the measure to define the reduct, such as positive region of rough set theory (RST), granular information entropy, and granular distance measures. However, the reducts defined based on the measures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::033ad448bce9d3caa9d14f4d64953055
https://doi.org/10.21203/rs.3.rs-1962484/v1
https://doi.org/10.21203/rs.3.rs-1962484/v1
Publikováno v:
Cybernetics and Information Technologies. 21:3-9
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
Publikováno v:
Journal of Computer Science and Cybernetics. 36:1-15
High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most
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://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff624888008120bb82eb8f5cfadad15b
https://eprints.sztaki.hu/10409/
https://eprints.sztaki.hu/10409/
Publikováno v:
PROCEEDINGS OF THE 14TH NATIONAL CONFERENCE ON FUNDAMENTAL AND APPLIED INFORMATION TECHNOLOGY RESEARCH.
Publikováno v:
Journal of Computer Science and Cybernetics. 37
This Special Issue of Journal of Computer Science and Cybernetics is dedicated to Professor Phan Dinh Dieu on the occasion of his 85th birth anniversary.
Publikováno v:
Cybernetics and Information Technologies. 19:3-16
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