Results 41 to 50 of about 3,182,929 (347)
Matroidal Structure of Rough Sets Based on Serial and Transitive Relations
Journal of Applied Mathematics, 2012 The theory of rough sets is concerned with the lower and upper approximations of objects through a binary relation on a universe. It has been applied to machine learning, knowledge discovery, and data mining. The theory of matroids is a generalization of
Yanfang Liu, William Zhu
doaj +1 more source
Supervised Learning via Unsupervised Sparse Autoencoder
IEEE Access, 2018 Dimensionality reduction is commonly used to preprocess high-dimensional data, which is an essential step in machine learning and data mining. An outstanding low-dimensional feature can improve the efficiency of subsequent learning tasks.
Jianran Liu, Chan Li, Wenyuan Yang
doaj +1 more source
Geometric Lattice Structure of Covering-Based Rough Sets through Matroids
Journal of Applied Mathematics, 2012 Covering-based rough set theory is a useful tool to deal with inexact, uncertain, or vague knowledge in information systems. Geometric lattice has been widely used in diverse fields, especially search algorithm design, which plays an important role in ...
Aiping Huang, William Zhu
doaj +1 more source
Distributed Decisions on TV Spectrum Allocation Considering Spatial and Temporal Variation
IEEE Access, 2018 TV spectrum has lower path loss, longer transmission range, and higher penetration capability, resulting in a wide range of potential important applications.
Zhenwei Chen +4 more
doaj +1 more source
Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids
Journal of Applied Mathematics, 2014 The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem.
Aiping Huang, William Zhu
doaj +1 more source
A Variable Precision Covering-Based Rough Set Model Based on Functions
The Scientific World Journal, 2014 Classical rough set theory is a technique of granular computing for handling the uncertainty, vagueness, and granularity in information systems. Covering-based rough sets are proposed to generalize this theory for dealing with covering data.
Yanqing Zhu, William Zhu
doaj +1 more source
Applications of Matrices to a Matroidal Structure of Rough Sets
Journal of Applied Mathematics, 2013 Rough sets provide an efficient tool for dealing with the vagueness and granularity in information systems. They are widely used in attribute reduction in data mining. There are many optimization issues in attribute reduction.
Jingqian Wang, William Zhu
doaj +1 more source
Fuzzy Granular Hyperplane Classifiers
IEEE Access, 2020 Granular computing has advantage of knowledge discovery for complex data. In the paper, we present Fuzzy Granular Hyperplane Classifiers (FGHCs) for data classification from a new angle of Granular Computing.
Wei Li +4 more
doaj +1 more source
Using Granular Computing theories for service-oriented systems analysis and design
, 2009 Over the past decade, granular computing has rapidly emerged as a new paradigm for distributed information systems. This paper describes an approach to develop service-oriented systems with granular computing theories and OMG standard UML (Unified ...
Huang, W., El-Darzi, E.
core +1 more source
A Novel Neighborhood Granular Meanshift Clustering Algorithm
Mathematics, 2022 The most popular algorithms used in unsupervised learning are clustering algorithms. Clustering algorithms are used to group samples into a number of classes or clusters based on the distances of the given sample features.
Qiangqiang Chen +5 more
doaj +1 more source