Enhui Shi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Enhui Shi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Hui Xu
School of Information Science Technology, Nantong University,Nantong,China
1 shared publication - Jie-Hua Mai
Institute of Mathematics, Shantou University, Shantou, Guangdong, 515063, PR China
1 shared publication - Jiucheng Xu
College of Computer and Information Engineering, Henan Normal University, Xinxiang, China
1 shared publication - Lin Sun
College of Artificial Intelligence, Tianjin University of Science and Technology, Tianjin, China
1 shared publication - Ming Yang
Nanjing Normal University, Nanjing, China
1 shared publication - Shiguang Zhang
School of Information Engineering, Shandong Management university, Jinan, China
1 shared publication
Latest Publications
- 15 December 2023
- Published by Springer Nature
- p. 61-75
The Convolutional Neural Network Combing Feature-Aligned and Attention Pyramid for Fine-Grained Visual Classification
- 15 December 2023
- Published by Springer Nature
- p. 61-75
The Convolutional Neural Network Combing Feature-Aligned and Attention Pyramid for Fine-Grained Visual Classification
- Open AccessThe nonexistence of expansive polycyclic group actions on the circle $\mathbb S^1$We show that the circle $\mathbb S^1$ admits no expansive polycyclic group actions.Open AccessThe nonexistence of expansive polycyclic group actions on the circle $\mathbb S^1$We show that the circle $\mathbb S^1$ admits no expansive polycyclic group actions.
- Open Access
- 7 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 145381-145400
Multilabel Feature Selection Using Mutual Information and ML-ReliefF for Multilabel Classification
Recently, multilabel classification algorithms play an increasingly significant role in data mining and machine learning. However, some existing mutual information-based algorithms ignore the influence of the proportions of labels on the correlation degree between features and label sets. Besides, the correlation degree of label sets cannot be accurately measured in most traditional ReliefF algorithms, and the repeated calculation arises from the division of heterogeneous neighbors. To overcome these shortcomings, this paper proposes a multilabel feature selection method using mutual information and improved multilabel ReliefF (ML-ReliefF). First, the proportion of each label is calculated in label space and combined with the mutual information of features and labels to construct a novel correlation degree between features and label sets to preprocess multilabel datasets, which is used to reduce runtime of ML-ReliefF. Second, the mutual information of label sets is introduced into improving accuracy of the correlation degree among label sets. Furthermore, two types of correlation degree for label sets based on ML-ReliefF are developed to divide similar and heterogeneous samples more clearly. Third, a divided method of heterogeneous neighbors is presented to effectively avoid the repeated calculation in ML-ReliefF, and a novel method of feature weighting based on ML-ReliefF is constructed to evaluate the importance of features. Finally, a multilabel feature selection algorithm based on mutual information and ML-ReliefF for multilabel classification is designed to improve the performance of multilabel classification. Experiments under fourteen multilabel datasets show the effectiveness of our algorithm and improve the classification performance for multilabel datasets.
- 7 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 145381-145400
Open AccessMultilabel Feature Selection Using Mutual Information and ML-ReliefF for Multilabel Classification
Recently, multilabel classification algorithms play an increasingly significant role in data mining and machine learning. However, some existing mutual information-based algorithms ignore the influence of the proportions of labels on the correlation degree between features and label sets. Besides, the correlation degree of label sets cannot be accurately measured in most traditional ReliefF algorithms, and the repeated calculation arises from the division of heterogeneous neighbors. To overcome these shortcomings, this paper proposes a multilabel feature selection method using mutual information and improved multilabel ReliefF (ML-ReliefF). First, the proportion of each label is calculated in label space and combined with the mutual information of features and labels to construct a novel correlation degree between features and label sets to preprocess multilabel datasets, which is used to reduce runtime of ML-ReliefF. Second, the mutual information of label sets is introduced into improving accuracy of the correlation degree among label sets. Furthermore, two types of correlation degree for label sets based on ML-ReliefF are developed to divide similar and heterogeneous samples more clearly. Third, a divided method of heterogeneous neighbors is presented to effectively avoid the repeated calculation in ML-ReliefF, and a novel method of feature weighting based on ML-ReliefF is constructed to evaluate the importance of features. Finally, a multilabel feature selection algorithm based on mutual information and ML-ReliefF for multilabel classification is designed to improve the performance of multilabel classification. Experiments under fourteen multilabel datasets show the effectiveness of our algorithm and improve the classification performance for multilabel datasets.
- Open Access
Continua having distal minimal actions by amenable groups
Let $X$ be a non-degenerate connected compact metric space. If $X$ admits a distal minimal action by a finitely generated amenable group, then the first \vCech cohomology group $ {\check H}^1(X)$ with integer coefficients is nontrivial. In particular, if $X$ is homotopically equivalent to a CW complex, then $X$ cannot be simply connected.Open AccessContinua having distal minimal actions by amenable groups
Let $X$ be a non-degenerate connected compact metric space. If $X$ admits a distal minimal action by a finitely generated amenable group, then the first \vCech cohomology group $ {\check H}^1(X)$ with integer coefficients is nontrivial. In particular, if $X$ is homotopically equivalent to a CW complex, then $X$ cannot be simply connected. - Open Access
- 1 January 2012
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 217 (1) , 1-12
A class of spaces that admit no sensitive commutative group actions
We show that a metric space $X$ admits no sensitive commutative group action if it satisfies the following two conditions: (1) $X$ has property S, that is, for each $\varepsilon>0$ there exists a cover of $X$ which consists of finitely many connected se- 1 January 2012
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 217 (1) , 1-12
Open AccessA class of spaces that admit no sensitive commutative group actions
We show that a metric space $X$ admits no sensitive commutative group action if it satisfies the following two conditions: (1) $X$ has property S, that is, for each $\varepsilon>0$ there exists a cover of $X$ which consists of finitely many connected se - Open Access
- 1 January 2009
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 203 (1) , 21-37
The ping-pong game, geometric entropy and expansiveness for group actions on Peano continua having free dendrites
- 1 January 2009
- Published by Institute of Mathematics, Polish Academy of Sciences in Fundamenta Mathematicae
- Vol. 203 (1) , 21-37
Open AccessThe ping-pong game, geometric entropy and expansiveness for group actions on Peano continua having free dendrites