William Zhu

Appl. Intell., November, 2024

Generalization Enhancement of Visual Reinforcement Learning through Internal States.

[BibT_eX]

[DOI]

Hanlin Yang

Sensors, July, 2024

Multi-view reinforcement learning for sequential decision-making with insufficient state information.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., April, 2024

An Overview of Advanced Deep Graph Node Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., February, 2024

Salience Interest Option: Temporal abstraction with salience interest functions.

[BibT_eX]

[DOI]

Liang Zhao

Neural Networks, 2024

2023

Multiview Deep Matrix Factorization for Shared Compact Representation.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., October, 2023

Learning matrix factorization with scalable distance metric and regularizer.

[BibT_eX]

[DOI]

Neural Networks, April, 2023

Deep graph clustering with enhanced feature representations for community detection.

[BibT_eX]

[DOI]

Jie Hao

Appl. Intell., 2023

2022

Multigraph Random Walk for Joint Learning of Multiview Clustering and Semisupervised Classification.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Soc. Syst., 2022

Layered feature representation for differentiable architecture search.

[BibT_eX]

[DOI]

Jie Hao

Soft Comput., 2022

Clustering experience replay for the effective exploitation in reinforcement learning.

[BibT_eX]

[DOI]

Pattern Recognit., 2022

Saliency: a new selection criterion of important architectures in neural architecture search.

[BibT_eX]

[DOI]

Neural Comput. Appl., 2022

ACP based reinforcement learning for long-term recommender system.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2022

MDMD options discovery for accelerating exploration in sparse-reward domains.

[BibT_eX]

[DOI]

Ruiyuan Zhang

Knowl. Based Syst., 2022

Multi-view fuzzy clustering of deep random walk and sparse low-rank embedding.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Consolidation of structure of high noise data by a new noise index and reinforcement learning.

[BibT_eX]

[DOI]

Inf. Sci., 2022

A CNN-based policy for optimizing continuous action control by learning state sequences.

[BibT_eX]

[DOI]

Neurocomputing, 2022

WDIBS: Wasserstein deterministic information bottleneck for state abstraction to balance state-compression and performance.

[BibT_eX]

[DOI]

Appl. Intell., 2022

Bipartite Graph based Spectral Clustering with Comprehensive Structure Information Learning.

[BibT_eX]

[DOI]

Ziniu Yu

Junliang Wu

Proceedings of the 5th International Conference on Data Science and Information Technology, 2022

2021

A Survey of Social Image Colocalization.

[BibT_eX]

[DOI]

Jiawei Chen

IEEE Trans. Comput. Soc. Syst., 2021

GDPC: generalized density peaks clustering algorithm based on order similarity.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2021

Adaptive exploration policy for exploration-exploitation tradeoff in continuous action control optimization.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2021

Anchor: The achieved goal to replace the subgoal for hierarchical reinforcement learning.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2021

Deep random walk of unitary invariance for large-scale data representation.

[BibT_eX]

[DOI]

Inf. Sci., 2021

Combating Fake News in "Low-Resource" Languages: Amharic Fake News Detection Accompanied by Resource Crafting.

[BibT_eX]

[DOI]

Inf., 2021

An efficient hybrid sine-cosine Harris hawks optimization for low and high-dimensional feature selection.

[BibT_eX]

[DOI]

Expert Syst. Appl., 2021

Accelerating Lifelong Reinforcement Learning via Reshaping Rewards.

[BibT_eX]

[DOI]

Kun Chu

Proceedings of the 2021 IEEE International Conference on Systems, Man, and Cybernetics, 2021

A New Hierarchical Reinforcement Learning Framework for Relation Extraction.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Digital Twins and Parallel Intelligence, 2021

Long-term Recommender System based on ACP Framework.

[BibT_eX]

[DOI]

Proceedings of the IEEE 2nd International Conference on Digital Twins and Parallel Intelligence, 2021

2020

An adaptive kernelized rank-order distance for clustering non-spherical data with high noise.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2020

A new similarity combining reconstruction coefficient with pairwise distance for agglomerative clustering.

[BibT_eX]

[DOI]

Inf. Sci., 2020

Hybrid channel based pedestrian detection.

[BibT_eX]

[DOI]

Neurocomputing, 2020

Optimal Sink Node Placement in Large Scale Wireless Sensor Networks Based on Harris' Hawk Optimization Algorithm.

[BibT_eX]

[DOI]

IEEE Access, 2020

Enhanced Bat Algorithm for Solving Non-Convex Economic Dispatch Problem.

[BibT_eX]

[DOI]

Kashif Hussain

Mohd. Najib Mohd. Salleh

Proceedings of the Recent Advances on Soft Computing and Data Mining, 2020

Fighting Fake News Using Deep Learning: Pre-trained Word Embeddings and the Embedding Layer Investigated.

[BibT_eX]

[DOI]

Fantahun Bogale Gereme

Proceedings of the CIIS 2020: The 3rd International Conference on Computational Intelligence and Intelligent Systems, 2020

2019

Characteristic matrices of compound operations of coverings and their relationships with rough sets.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2019

Local gap density for clustering high-dimensional data with varying densities.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2019

Long-Term Memory Harris' Hawk Optimization for High Dimensional and Optimal Power Flow Problems.

[BibT_eX]

[DOI]

Kashif Hussain

Mohd. Najib Mohd. Salleh

IEEE Access, 2019

Early Detection of Fake News "Before It Flies High".

[BibT_eX]

[DOI]

Fantahun Bogale Gereme

Proceedings of the 2nd International Conference on Big Data Technologies, 2019

2018

Sparse Graph Embedding Unsupervised Feature Selection.

[BibT_eX]

[DOI]

IEEE Trans. Syst. Man Cybern. Syst., 2018

Dependence space of topology and its application to attribute reduction.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2018

Multi-label feature selection via feature manifold learning and sparsity regularization.

[BibT_eX]

[DOI]

Zhiling Cai

Int. J. Mach. Learn. Cybern., 2018

Feature selection for multi-label classification using neighborhood preservation.

[BibT_eX]

[DOI]

Zhiling Cai

IEEE CAA J. Autom. Sinica, 2018

A New Local Density for Density Peak Clustering.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

Human Segmentation with Deep Contour-Aware Network.

[BibT_eX]

[DOI]

Fiseha B. Tesema

Hong Wu

Proceedings of the 2018 International Conference on Computing and Artificial Intelligence, 2018

2017

Rough set methods in feature selection via submodular function.

[BibT_eX]

[DOI]

Xiaozhong Zhu

Xin-Nan Fan

Soft Comput., 2017

Another approach to rough soft hemirings and corresponding decision making.

[BibT_eX]

[DOI]

Jianming Zhan

Qi Liu

Soft Comput., 2017

Generative classification model for categorical data based on latent Gaussian process.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 2017

Closed-set lattice and modular matroid induced by covering-based rough sets.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2017

Unsupervised feature selection with the largest angle coding.

[BibT_eX]

[DOI]

Int. J. Comput. Math. Comput. Syst. Theory, 2017

Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2017

2016

Connectedness of graphs and its application to connected matroids through covering-based rough sets.

[BibT_eX]

[DOI]

Soft Comput., 2016

Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model.

[BibT_eX]

[DOI]

Anjing Fan

Soft Comput., 2016

Applications of repeat degree to coverings of neighborhoods.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2016

On the matroidal structure of generalized rough set based on relation via definable sets.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2016

An exponent weighted algorithm for minimal cost feature selection.

[BibT_eX]

[DOI]

Xiangju Li

Int. J. Mach. Learn. Cybern., 2016

2015

A Self-Adaptive Parameter Selection Trajectory Prediction Approach via Hidden Markov Models.

[BibT_eX]

[DOI]

IEEE Trans. Intell. Transp. Syst., 2015

TraPlan: An Effective Three-in-One Trajectory-Prediction Model in Transportation Networks.

[BibT_eX]

[DOI]

Shaojie Qiao

Nan Han

Louis Alberto Gutierrez

IEEE Trans. Intell. Transp. Syst., 2015

Subspace learning for unsupervised feature selection via matrix factorization.

[BibT_eX]

[DOI]

Pattern Recognit., 2015

Fast randomized algorithm with restart strategy for minimal test cost feature selection.

[BibT_eX]

[DOI]

Jingkuan Li

Int. J. Mach. Learn. Cybern., 2015

Unsupervised feature selection via maximum projection and minimum redundancy.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2015

A cost sensitive decision tree algorithm with two adaptive mechanisms.

[BibT_eX]

[DOI]

Xiangju Li

Knowl. Based Syst., 2015

Parametric Matroid of Rough Set.

[BibT_eX]

[DOI]

Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2015

The Connectivity of the Covering Approximation Space.

[BibT_eX]

[DOI]

Duixia Ma

Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

The Matroidal Structures of the Second Type of Covering-Based Rough Set.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

The Lower Approximation Number in Covering-Based Rough Set.

[BibT_eX]

[DOI]

Hui Liu

Proceedings of the Rough Sets and Knowledge Technology - 10th International Conference, 2015

Sparse Matrix Feature Selection in Multi-label Learning.

[BibT_eX]

[DOI]

Wenyuan Yang

Bufang Zhou

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

A Comparison of Two Types of Covering-Based Rough Sets Through the Complement of Coverings.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Connectedness of Graph and Matroid by Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Hui Li

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2015

Cost-sensitive decision tree with probabilistic pruning mechanism.

[BibT_eX]

[DOI]

Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

Optimal feature subset with positive region constraints.

[BibT_eX]

[DOI]

Junxia Niu

Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

A matroidal structure for formal context and its applications on epidemiological study.

[BibT_eX]

[DOI]

Duixia Ma

Proceedings of the 2015 International Conference on Machine Learning and Cybernetics, 2015

2014

Feature Selection with Positive Region Constraint for Test-Cost-Sensitive Data.

[BibT_eX]

[DOI]

Trans. Rough Sets, 2014

Secondary basis unique augmentation matroids and union minimal matroids.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2014

Conditions for coverings to induce matroids.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2014

Closed-set lattice of regular sets based on a serial and transitive relation through matroids.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2014

An improved artificial bee colony algorithm for minimal time cost reduction.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2014

Optimal cost-sensitive granularization based on rough sets for variable costs.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2014

Geometric Lattice Structure of Covering and Its Application to Attribute Reduction through Matroids.

[BibT_eX]

[DOI]

J. Appl. Math., 2014

Graph and matrix approaches to rough sets through matroids.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Characteristic matrix of covering and its application to Boolean matrix decomposition.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Nullity-based matroid of rough sets and its application to attribute reduction.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Condition for neighbourhoods induced by a covering to be equal to the covering itself.

[BibT_eX]

[DOI]

Int. J. Granul. Comput. Rough Sets Intell. Syst., 2014

Matrix approaches to rough sets through vector matroids over fields.

[BibT_eX]

[DOI]

Ziqiong Lin

Int. J. Granul. Comput. Rough Sets Intell. Syst., 2014

Feature selection with test cost constraint.

[BibT_eX]

[DOI]

Qinghua Hu

Int. J. Approx. Reason., 2014

Rough Set Characterization for 2-circuit Matroid.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Covering Approximations in Set-Valued Information Systems.

[BibT_eX]

[DOI]

Yanqing Zhu

Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

A New Type of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

A Logarithmic Weighted Algorithm for Minimal Test Cost Attribute Reduction.

[BibT_eX]

[DOI]

Junxia Niu

Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Top-N Recommendation Based on Granular Association Rules.

[BibT_eX]

[DOI]

Xu He

Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Global Best Artificial Bee Colony for Minimal Test Cost Attribute Reduction.

[BibT_eX]

[DOI]

Anjing Fan

Proceedings of the Rough Sets and Knowledge Technology - 9th International Conference, 2014

Mining Significant Granular Association Rules for Diverse Recommendation.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2014

An approach to covering-based rough sets through bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Fuzzy Systems, 2014

On three types of covering-based rough sets via definable sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Fuzzy Systems, 2014

Covering-based rough sets on covering-circuit matroids.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Fuzzy Systems and Knowledge Discovery, 2014

2013

A matroidal approach to rough set theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Cost-Sensitive Feature Selection of Numeric Data with Measurement Errors.

[BibT_eX]

[DOI]

J. Appl. Math., 2013

Covering-Based Rough Sets on Eulerian Matroids.

[BibT_eX]

[DOI]

Ziqiong Lin

J. Appl. Math., 2013

Equivalent Characterizations of Some Graph Problems by Covering-Based Rough Sets.

[BibT_eX]

[DOI]

J. Appl. Math., 2013

Applications of Matrices to a Matroidal Structure of Rough Sets.

[BibT_eX]

[DOI]

J. Appl. Math., 2013

Rough matroids based on relations.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Quantitative analysis for covering-based rough sets through the upper approximation number.

[BibT_eX]

[DOI]

Inf. Sci., 2013

Condition for covering-based upper approximation operators to be closure operators of matroids.

[BibT_eX]

[DOI]

Int. J. Granul. Comput. Rough Sets Intell. Syst., 2013

Four matroidal structures of covering and their relationships with rough sets.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2013

Cold-start recommendation through granular association rules

[BibT_eX]

[DOI]

CoRR, 2013

A necessary and sufficient condition for two relations to induce the same definable set family.

[BibT_eX]

[DOI]

CoRR, 2013

Unique expansion matroids and union minimal matroids.

[BibT_eX]

[DOI]

CoRR, 2013

Applications of repeat degree on coverings of neighborhoods.

[BibT_eX]

[DOI]

CoRR, 2013

Rough matroids based on coverings.

[BibT_eX]

[DOI]

CoRR, 2013

Connectivity for matroids based on rough sets.

[BibT_eX]

[DOI]

CoRR, 2013

Dependence space of matroids and its application to attribute reduction.

[BibT_eX]

[DOI]

CoRR, 2013

Contraction to Matroidal Structure of Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 8th International Conference, 2013

Comparative Study between Extension of Covering Approximation Space and Its Induction through Transversal Matroid.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

Topological Characterizations for Three Covering Approximation Operators.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 2013

Multi-objective cost-sensitive attribute reduction.

[BibT_eX]

[DOI]

Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

Mining top-k granular association rules for recommendation.

[BibT_eX]

[DOI]

Proceedings of the Joint IFSA World Congress and NAFIPS Annual Meeting, 2013

Matroidal structure of generalized rough sets based on symmetric and transitive relations.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

Granular association rules for multi-valued data.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

A comparative study of discretization approaches for granular association rule mining.

[BibT_eX]

[DOI]

Xu He

Proceedings of the 26th IEEE Canadian Conference on Electrical and Computer Engineering CCECE 2013, 2013

2012

Matroidal structure of rough sets and its characterization to attribute reduction.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2012

Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory.

[BibT_eX]

[DOI]

J. Appl. Math., 2012

Matroidal Structure of Rough Sets Based on Serial and Transitive Relations.

[BibT_eX]

[DOI]

J. Appl. Math., 2012

Geometric Lattice Structure of Covering-Based Rough Sets through Matroids.

[BibT_eX]

[DOI]

J. Appl. Math., 2012

The fourth type of covering-based rough sets.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Attribute reduction of data with error ranges and test costs.

[BibT_eX]

[DOI]

Inf. Sci., 2012

Cost-sensitive C4.5 with post-pruning and competition

[BibT_eX]

[DOI]

Zilong Xu

CoRR, 2012

Matrix approach to rough sets through representable matroids over a field

[BibT_eX]

[DOI]

CoRR, 2012

Relationship between the second type of covering-based rough set and matroid via closure operator

[BibT_eX]

[DOI]

CoRR, 2012

Topological characterizations to three types of covering approximation operators

[BibT_eX]

[DOI]

CoRR, 2012

Granular association rules on two universes with four measures

[BibT_eX]

[DOI]

Qinghua Hu

CoRR, 2012

Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets

[BibT_eX]

[DOI]

CoRR, 2012

Matroidal structure of regular set based on serial and transitive relation

[BibT_eX]

[DOI]

CoRR, 2012

Condition for neighborhoods induced by a covering to be equal to the covering itself

[BibT_eX]

[DOI]

CoRR, 2012

Rough sets and matroidal contraction

[BibT_eX]

[DOI]

CoRR, 2012

Condition for neighborhoods in covering based rough sets to form a partition

[BibT_eX]

[DOI]

CoRR, 2012

Some characteristics of matroids through rough sets

[BibT_eX]

[DOI]

CoRR, 2012

Matroidal Structure of Generalized Rough Sets based on Symmetric and Transitive Relation

[BibT_eX]

[DOI]

CoRR, 2012

Relation matroid and its relationship with generalized rough set based on relation

[BibT_eX]

[DOI]

CoRR, 2012

The role of covering matroid in covering-based rough set and matroid

[BibT_eX]

[DOI]

CoRR, 2012

Matroidal structure based on serial and transitive relation

[BibT_eX]

[DOI]

CoRR, 2012

Parametric matroid of rough set

[BibT_eX]

[DOI]

CoRR, 2012

Boolean matrix decomposition through covering-based rough sets

[BibT_eX]

[DOI]

CoRR, 2012

A Competition Strategy to Cost-Sensitive Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 7th International Conference, 2012

Minimal Test Cost Feature Selection with Positive Region Constraint.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Current Trends in Computing, 2012

Ant colony optimization to minimal test cost reduction.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Granular and rough computing on covering.

[BibT_eX]

[DOI]

Jun Xie

Tsau Young Lin

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characteristics of 2-circuit matroids through rough sets.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characterization of attribute reduction of decision system through matroid theory.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Attribute reduction algorithms based on the matroidal structure of rough set.

[BibT_eX]

[DOI]

Feng Sun

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Granular association rules with four subtypes.

[BibT_eX]

[DOI]

Qinghua Hu

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Characteristic of partition-circuit matroid through approximation number.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

An improved genetic algorithm to minimal test cost reduction.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Covering-based approximation operators by boolean matrix.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Matroidal structure of covering rough sets based on multigranulation.

[BibT_eX]

[DOI]

Jing Huang

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

On matrix representation of three types of covering-based rough sets.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Conference on Granular Computing, 2012

Rough sets and partition matroids.

[BibT_eX]

[DOI]

Qing Zhao

Proceedings of the 9th International Conference on Fuzzy Systems and Knowledge Discovery, 2012

Granular Association Rule Mining through Parametric Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Brain Informatics - International Conference, 2012

2011

Matroidal approaches to generalized rough sets based on relations.

[BibT_eX]

[DOI]

Int. J. Mach. Learn. Cybern., 2011

Test-cost-sensitive attribute reduction.

[BibT_eX]

[DOI]

Inf. Sci., 2011

Special issue: Rough and Fuzzy Methods for Data Mining.

[BibT_eX]

[DOI]

Int. J. Hybrid Intell. Syst., 2011

Matroidal structure of covering-based rough sets through the upper approximation number.

[BibT_eX]

[DOI]

Int. J. Granul. Comput. Rough Sets Intell. Syst., 2011

Bipartite Graphs and Coverings.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Transversal and Function Matroidal Structures of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Optimal Sub-Reducts with Test Cost Constraint.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology - 6th International Conference, 2011

Covering Numbers in Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, 2011

Rough matroid.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Test-cost-sensitive attribute reduction based on neighborhood rough set.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Reducible matroid and its relationship with covering-based rough sets.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

The vectorially matroidal structure of generalized rough sets based on relations.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

The refinement in covering-based rough sets.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

A genetic algorithm to the minimal test cost reduct problem.

[BibT_eX]

[DOI]

Guiying Pan

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Optimal sub-reducts in the dynamic environment.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Conference on Granular Computing, 2011

Test Cost Constraint Reduction with Common Cost.

[BibT_eX]

[DOI]

Guiying Pan

Proceedings of the Future Generation Information Technology, 2011

Minimal Cost Attribute Reduction through Backtracking.

[BibT_eX]

[DOI]

Proceedings of the Database Theory and Application, Bio-Science and Bio-Technology, 2011

2010

Approximations in Rough Sets vs Granular Computing for Coverings.

[BibT_eX]

[DOI]

Guilong Liu

Int. J. Cogn. Informatics Nat. Intell., 2010

Poset Approaches to Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Peiyong Zhu

Proceedings of the Rough Set and Knowledge Technology - 5th International Conference, 2010

Application of Covering Rough Sets to Linguistic Dynamic Systems.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

The Covering Upper Approximation by Subcovering.

[BibT_eX]

[DOI]

Peiyong Zhu

Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

Rough Sets in Partially Ordered Sets.

[BibT_eX]

[DOI]

Kai Li

Proceedings of the 2010 IEEE International Conference on Granular Computing, 2010

2009

Relationship among basic concepts in covering-based rough sets.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Relationship between generalized rough sets based on binary relation and covering.

[BibT_eX]

[DOI]

Inf. Sci., 2009

Using Wavelets and Independent Component Analysis for Quantization Index Modulation Watermarking.

[BibT_eX]

[DOI]

Jinhua Liu

Proceedings of the Rough Sets and Knowledge Technology, 4th International Conference, 2009

A Web Text Filter Based on Rough Set Weighted Bayesian.

[BibT_eX]

[DOI]

Proceedings of the Eighth IEEE International Conference on Dependable, 2009

2008

The algebraic structures of generalized rough set theory.

[BibT_eX]

[DOI]

Guilong Liu

Inf. Sci., 2008

An intelligent design system for military situation assessment.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Intelligent System and Knowledge Engineering, 2008

Optimal and adaptive pairwise DNA sequence correlation analysis in natural gradient.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Intelligent System and Knowledge Engineering, 2008

Covering-based Granular Computing.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008

Adaptive Lagrange Constraints Neural Network under Multisensing.

[BibT_eX]

[DOI]

Jinhua Liu

Proceedings of the 2008 IEEE International Conference on Granular Computing, 2008

2007

On Three Types of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2007

Generalized rough sets based on relations.

[BibT_eX]

[DOI]

Inf. Sci., 2007

Topological approaches to covering rough sets.

[BibT_eX]

[DOI]

Inf. Sci., 2007

Informed Recognition in Software Watermarking.

[BibT_eX]

[DOI]

Proceedings of the Intelligence and Security Informatics, Pacific Asia Workshop, 2007

Basic Concepts in Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Natural Computation, 2007

Topological Properties in Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

A Class of Covering-Based Fuzzy Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

Mining Privilege Escalation Paths for Network Vulnerability Analysis.

[BibT_eX]

[DOI]

Baowen Zhang

Zhi Xue

Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, 2007

2006

Applications of Homomorphic Functions to Software Obfuscation.

[BibT_eX]

[DOI]

Proceedings of the Intelligence and Security Informatics, International Workshop, 2006

Axiomatic Systems of Generalized Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Rough Sets and Knowledge Technology, First International Conference, 2006

Extraction in software watermarking.

[BibT_eX]

[DOI]

Proceedings of the 8th workshop on Multimedia & Security, 2006

Covering Based Granular Computing for Conflict Analysis.

[BibT_eX]

[DOI]

Proceedings of the Intelligence and Security Informatics, 2006

Properties of the First Type of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 2006

Properties of the Second Type of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, 2006

Properties of the Fourth Type of Covering-Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Hybrid Intelligent Systems (HIS 2006), 2006

Relationships among three types of covering rough sets.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Obfuscate arrays by homomorphic functions.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Binary Relation Based Rough Sets.

[BibT_eX]

[DOI]

Proceedings of the Fuzzy Systems and Knowledge Discovery, Third International Conference, 2006

2005

A Survey of Software Watermarking.

[BibT_eX]

[DOI]

Proceedings of the Intelligence and Security Informatics, 2005

On the QP Algorithm in Software Watermarking.

[BibT_eX]

[DOI]

Proceedings of the Intelligence and Security Informatics, 2005

Algorithms to Watermark Software Through Register Allocation.

[BibT_eX]

[DOI]

Proceedings of the Digital Rights Management: Technologies, 2005

2003

Reduction and axiomization of covering generalized rough sets.

[BibT_eX]

[DOI]