Nonparametric Hyperbox Granular Computing Classification Algorithms
نویسندگان
چکیده
منابع مشابه
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملHyperbox Granular Computing Based on Distance Measure
A bottle up hyperbox granular computing (HBGrC) is developed based on distance measure. Firstly, hyperbox granule is represented by the beginning point and the end point. Secondly, the distance measure between two hyperbox granules is defined by the beginning points and the end points. Thirdly, operations between two hyperbox granules are designed to the transformation between two hyperbox gran...
متن کاملBottle Up Granular Computing Classification Algorithms
Shape of granule is one of the important issues in granular computing classification problems and related to the classification accuracy, the number of granule, and the join process of two granules. A bottle up granular computing classification algorithm (BUGrC) is developed in the frame work of fuzzy lattices. Firstly, the granules are represented as 4 shapes, namely hyperdiamond granule, hype...
متن کاملInduction of Classification Rules by Granular Computing
A granular computing model is used for learning classification rules by considering the two basic issues: concept formation and concept relationships identification. A classification rule induction method is proposed. Instead of focusing on the selection of a suitable partition, i.e., a family of granules defined by values of an attribute, in each step, we concentrate on the selection of a sing...
متن کاملGranular Computing Classification Algorithms Based on Distance Measures between Granules from the View of Set
Granular computing classification algorithms are proposed based on distance measures between two granules from the view of set. Firstly, granules are represented as the forms of hyperdiamond, hypersphere, hypercube, and hyperbox. Secondly, the distance measure between two granules is defined from the view of set, and the union operator between two granules is formed to obtain the granule set in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information
سال: 2019
ISSN: 2078-2489
DOI: 10.3390/info10020076