位置：成果数据库 > 期刊 > 期刊详情页
A genetic algorithm to attribute reduction with test cost constraint
  • 期刊名称：Journal of Information and Computational Science
  • 时间：2013.3.1
  • 页码：839-849
  • 相关项目：覆盖粗糙集的抽象结构及其应用
作者： 刘家斌|闵帆|祝峰|
同期刊论文项目
覆盖粗糙集的抽象结构及其应用
期刊论文 72
同项目期刊论文
Covering Bases
Attribute reduction of data with error ranges and test costs
横贯拟阵与覆盖粗糙集
Relationship between covering-based rough sets and free matroids
Inducing covering rough sets from error distribution
Rough matroids based on relations
Characteristics of 2-circuit matroids through rough sets
Ant colony optimization with three stages for independent test cost attribute reduction
Equivalent characterizations of some graph problems by covering-based rough sets
Covering-based rough sets on Eulerian matroids
Parametric matroid of rough set
Applications of matrices to a matroidal structure of rough sets
Parametric Rough Sets with Application to Granular Association Rule Mining
Test-Cost-Sensitive Attribute Reduction of Data with Normal Distribution Measurement Errors
Cost-sensitive feature selection of numeric data with measurement errors
Matroidal structure of rough sets from the viewpoint of graph theory
Quantitative analysis for covering-based rough sets using the upper approximation number
Matroidal structure based on serial and transitive relations
Characteristic matrix of covering and its application to Boolean matrix decomposition
Closed-set lattice of regular sets based on a serial and transitive relation through matroids
A cost sensitive decisiontree algorithm with two adaptive mechanisms
An exponent weighted algorithm for minimal cost feature selection
Matroidal approaches to generalized rough sets based on relations
An improved artificial beecolony algorithm for minimal time cost reduction
Geometric lattice structure of covering-based rough sets through matroids
Rough set methods in feature selection via submodularfunction
Parametric matroid of roughset
Test-cost-sensitiveattribute reduction on heterogeneous data for adaptive neighborhood model
Connectedness of graphs and its application to connected matroids through covering-based rough sets
Subspace learning for unsupervised feature selection via matrix factorization
Comparison of Discretization Approaches for Granular Association Rule Mining
Graph and matrix approaches to rough sets through matroids
Geometric lattice structure of covering and its application to attribute reduction through matroids
Nullity-based matroidal structure of rough sets and its applications to attribute reduction
Secondary basis unique augmentation matroids and union minimal matroids
Conditions for coverings to induce matroids
Applications of repeat degree to coverings of neighborhoods
Fast Randomized Algorithm with Restart Strategy for Minimal Test Cost Feature Selection
Feature selection with test cost constraint through a simulated annealing algorithm
Feature selection with multi-cost constraint
覆盖拟阵及其可图性
Feature selection with test cost constraint
Four matroidal structures of covering and their relationships with rough sets
Unsupervised feature selection via maximum projection and minimum redundancy
Relationship between partition matroid and rough set through k-rank matroid
A matroidal approach to rough set theory
Matroidal structure of rough sets and its characterization to attribute reduction
Rough matroid based on relations
Optimal cost-sensitive granularization based on rough sets for variable costs
矩阵方法计算覆盖粗糙集中最小、最大描述
直觉模糊信息系统中的信息粒度
基于强对称关系的广义粗糙集模型
对划分的一个粒度公式的研究
一种覆盖粗糙集的拟阵结构
基于等价关系的粗糙拟阵的性质