Kun He

Orcid: 0000-0001-7627-4604

Affiliations:
  • Huazhong University of Science and Technology, School of Computer Science and Technology, Wuhan, China (PhD 2006)


According to our database1, Kun He authored at least 188 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
LUSTC: A Novel Approach for Predicting Link States on Dynamic Attributed Networks.
IEEE Trans. Comput. Soc. Syst., February, 2024

Centroid-Based Multiple Local Community Detection.
IEEE Trans. Comput. Soc. Syst., February, 2024

Streaming Local Community Detection Through Approximate Conductance.
IEEE Trans. Big Data, February, 2024

FABind+: Enhancing Molecular Docking through Improved Pocket Prediction and Pose Generation.
CoRR, 2024

Solution-Hashing Search Based on Layout-Graph Transformation for Unequal Circle Packing.
CoRR, 2024

Boosting Meta-Training with Base Class Information for Few-Shot Learning.
CoRR, 2024

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum s-Bundle Problem.
CoRR, 2024

Fast Adversarial Training against Textual Adversarial Attacks.
CoRR, 2024

Rethinking the Soft Conflict Pseudo Boolean Constraint on MaxSAT Local Search Solvers.
CoRR, 2024

KD-Club: An Efficient Exact Algorithm with New Coloring-Based Upper Bound for the Maximum k-Defective Clique Problem.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Semantic Adversarial Attacks on Face Recognition Through Significant Attributes.
Int. J. Comput. Intell. Syst., December, 2023

A reinforced hybrid genetic algorithm for the traveling salesman problem.
Comput. Oper. Res., September, 2023

Uncovering the Local Hidden Community Structure in Social Networks.
ACM Trans. Knowl. Discov. Data, June, 2023

Link Prediction and Unlink Prediction on Dynamic Networks.
IEEE Trans. Comput. Soc. Syst., April, 2023

A Simulated Annealing approach for the Circle Bin Packing Problem with Rectangular Items.
Comput. Ind. Eng., February, 2023

Reinforced Lin-Kernighan-Helsgaun algorithms for the traveling salesman problems.
Knowl. Based Syst., 2023

AutoAugment Input Transformation for Highly Transferable Targeted Attacks.
CoRR, 2023

BCN: Batch Channel Normalization for Image Classification.
CoRR, 2023

Diversified Node Sampling based Hierarchical Transformer Pooling for Graph Representation Learning.
CoRR, 2023

SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning.
CoRR, 2023

Long-range Dependency based Multi-Layer Perceptron for Heterogeneous Information Networks.
CoRR, 2023

Sampling-based Fast Gradient Rescaling Method for Highly Transferable Adversarial Attacks.
CoRR, 2023

Knowledge Distillation via Token-level Relationship Graph.
CoRR, 2023

Two Independent Teachers are Better Role Model.
CoRR, 2023

Tokenized Graph Transformer with Neighborhood Augmentation for Node Classification in Large Graphs.
CoRR, 2023

An Efficient Solution Space Exploring and Descent Method for Packing Equal Spheres in a Sphere.
CoRR, 2023

Meta-multigraph Search: Rethinking Meta-structure on Heterogeneous Information Networks.
CoRR, 2023

PIAT: Parameter Interpolation based Adversarial Training for Image Classification.
CoRR, 2023

Geometric Batch Optimization for the Packing Equal Circles in a Circle Problem on Large Scale.
CoRR, 2023

Gaussian Mask Convolution for Convolutional Neural Networks.
CoRR, 2023

Relaxed Graph Color Bound for the Maximum k-plex Problem.
CoRR, 2023

All in Tokens: Unifying Output Space of Visual Tasks via Soft Token.
CoRR, 2023

Randomized Algorithm for MPMD on Two Sources.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Rethinking the Backward Propagation for Adversarial Transferability.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

FABind: Fast and Accurate Protein-Ligand Binding.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Pre-training Antibody Language Models for Antigen-Specific Computational Antibody Design.
Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023

On the Complexity of Bayesian Generalization.
Proceedings of the International Conference on Machine Learning, 2023

NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

All in Tokens: Unifying Output Space of Visual Tasks via Soft Token.
Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

Sparse Black-Box Multimodal Attack for Vision-Language Adversary Generation.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2023, 2023

Generating Pseudo-labels Adaptively for Few-shot Model-Agnostic Meta-Learning.
Proceedings of the 34th British Machine Vision Conference 2023, 2023

Robustness-Aware Word Embedding Improves Certified Robustness to Adversarial Word Substitutions.
Proceedings of the Findings of the Association for Computational Linguistics: ACL 2023, 2023

Farsighted Probabilistic Sampling: A General Strategy for Boosting Local Search MaxSAT Solvers.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Differentiable Meta Multigraph Search with Partial Message Propagation on Heterogeneous Information Networks.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Pointerformer: Deep Reinforced Multi-Pointer Transformer for the Traveling Salesman Problem.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Hybrid Learning with New Value Function for the Maximum Common Induced Subgraph Problem.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Clustering Driven Iterated Hybrid Search for Vertex Bisection Minimization.
IEEE Trans. Computers, 2022

Quadratic Optimization based Clique Expansion for overlapping community detection.
Knowl. Based Syst., 2022

HoSIM: Higher-order Structural Importance based method for multiple local community detection.
Knowl. Based Syst., 2022

A new allocation rule for the housing market problem with ties.
J. Comb. Optim., 2022

Two-phase Multi-document Event Summarization on Core Event Graphs.
J. Artif. Intell. Res., 2022

Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem.
Int. J. Comput. Intell. Syst., 2022

On fast enumeration of maximal cliques in large graphs.
Expert Syst. Appl., 2022

Incorporating Multi-armed Bandit with Local Search for MaxSAT.
CoRR, 2022

Class-aware Information for Logit-based Knowledge Distillation.
CoRR, 2022

Incorporating Pre-training Paradigm for Antibody Sequence-Structure Co-design.
CoRR, 2022

Adaptive Multi-Neighborhood Attention based Transformer for Graph Representation Learning.
CoRR, 2022

Local Magnification for Data and Feature Augmentation.
CoRR, 2022

Neighborhood Convolutional Network: A New Paradigm of Graph Neural Networks for Node Classification.
CoRR, 2022

Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem.
CoRR, 2022

Propagation with Adaptive Mask then Training for Node Classification on Attributed Networks.
CoRR, 2022

NAGphormer: Neighborhood Aggregation Graph Transformer for Node Classification in Large Graphs.
CoRR, 2022

Enhancing the Robustness, Efficiency, and Diversity of Differentiable Architecture Search.
CoRR, 2022

An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem.
CoRR, 2022

Learning-based Hybrid Local Search for the Hard-label Textual Attack.
CoRR, 2022

Adaptive simulated annealing with greedy search for the circle bin packing problem.
Comput. Oper. Res., 2022

Reinforcement learning based coarse-to-fine search for the maximum k-plex problem.
Appl. Soft Comput., 2022

Boosting branch-and-bound MaxSAT solvers with clause learning.
AI Commun., 2022

Detecting textual adversarial examples through randomized substitution and vote.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

Robust textual embedding against word-level adversarial attacks.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract).
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Structural Robust Label Propagation on Homogeneous Graphs.
Proceedings of the IEEE International Conference on Data Mining, 2022

Position-Invariant Adversarial Attacks on Neural Modulation Recognition.
Proceedings of the IEEE International Conference on Acoustics, 2022

TextHacker: Learning based Hybrid Local Search Algorithm for Text Hard-label Adversarial Attack.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2022, 2022

Graph Hawkes Transformer for Extrapolated Reasoning on Temporal Knowledge Graphs.
Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing, 2022

Triangle Attack: A Query-Efficient Decision-Based Adversarial Attack.
Proceedings of the Computer Vision - ECCV 2022, 2022

Stochastic Variance Reduced Ensemble Adversarial Attack for Boosting the Adversarial Transferability.
Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

A 4-Space Bounded Approximation Algorithm for Online Bin Packing Problem.
Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

GI Tract Lesion Classification Using Multi-task Capsule Networks with Hierarchical Convolutional Layers.
Proceedings of the Biometric Recognition - 16th Chinese Conference, 2022

2021
Error-feedback stochastic modeling strategy for time series forecasting with convolutional neural networks.
Neurocomputing, 2021

Probability learning based tabu search for the budgeted maximum coverage problem.
Expert Syst. Appl., 2021

TraSw: Tracklet-Switch Adversarial Attacks against Multi-Object Tracking.
CoRR, 2021

Randomized Substitution and Vote for Textual Adversarial Example Detection.
CoRR, 2021

Regional Adversarial Training for Better Robust Generalization.
CoRR, 2021

Farsighted Probabilistic Sampling based Local Search for (Weighted) Partial MaxSAT.
CoRR, 2021

Structure Amplification on Multi-layer Stochastic Block Models.
CoRR, 2021

Integrating Circle Kernels into Convolutional Neural Networks.
CoRR, 2021

Multi-stage Optimization based Adversarial Training.
CoRR, 2021

Unsupervised Link and Unlink Prediction on Dynamic Networks.
CoRR, 2021

A Quasi-Newton-based Floorplanner for fixed-outline floorplanning.
Comput. Oper. Res., 2021

Adaptive large neighborhood search for solving the circle bin packing problem.
Comput. Oper. Res., 2021

Natural language adversarial defense through synonym encoding.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

A Multi-Graph Attributed Reinforcement Learning based Optimization Algorithm for Large-scale Hybrid Flow Shop Scheduling Problem.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Admix: Enhancing the Transferability of Adversarial Attacks.
Proceedings of the 2021 IEEE/CVF International Conference on Computer Vision, 2021

TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting.
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

Enhancing the Transferability of Adversarial Attacks Through Variance Tuning.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2021

Combining Clause Learning and Branch and Bound for MaxSAT.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Boosting Adversarial Transferability through Enhanced Momentum.
Proceedings of the 32nd British Machine Vision Conference 2021, 2021

Crafting Adversarial Examples for Neural Machine Translation.
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, 2021

Combining Reinforcement Learning with Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problem.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Adversarial Training with Fast Gradient Projection Method against Synonym Substitution Based Text Attacks.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
The Orthogonal Packing and Scheduling Problem: Model, Heuristic, and Benchmark.
IEEE Trans. Syst. Man Cybern. Syst., 2020

Hierarchical Ensemble Reduction and Learning for Resource-constrained Computing.
ACM Trans. Design Autom. Electr. Syst., 2020

Sparse Nonnegative Matrix Factorization for Multiple-Local-Community Detection.
IEEE Trans. Comput. Soc. Syst., 2020

A new iterated local search algorithm for the cyclic bandwidth problem.
Knowl. Based Syst., 2020

SAANet: Siamese action-units attention network for improving dynamic facial expression recognition.
Neurocomputing, 2020

Tight Lower Complexity Bounds for Strongly Convex Finite-Sum Optimization.
CoRR, 2020

Local Generalization and Bucketization Technique for Personalized Privacy Preservation.
CoRR, 2020

Error-feedback Stochastic Configuration Strategy on Convolutional Neural Networks for Time Series Forecasting.
CoRR, 2020

Stochastic Item Descent Method for Large Scale Equal Circle Packing Problem.
CoRR, 2020

Adaptive Large Neighborhood Search for Circle Bin Packing Problem.
CoRR, 2020

Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Prospective.
CoRR, 2020

Hidden Community Detection on Two-Layer Stochastic Models: A Theoretical Perspective.
Proceedings of the Theory and Applications of Models of Computation, 2020

Robust Local Features for Improving the Generalization of Adversarial Training.
Proceedings of the 8th International Conference on Learning Representations, 2020

Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attacks.
Proceedings of the 8th International Conference on Learning Representations, 2020

Single Image Reflection Removal Through Cascaded Refinement.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

Exploring Graphical Models with Bayesian Learning and MCMC for Failure Diagnosis.
Proceedings of the 25th Asia and South Pacific Design Automation Conference, 2020

A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
A new anchor word selection method for the separable topic discovery.
WIREs Data Mining Knowl. Discov., 2019

A Novel Task-Duplication Based Clustering Algorithm for Heterogeneous Computing Environments.
IEEE Trans. Parallel Distributed Syst., 2019

Improving Test and Diagnosis Efficiency through Ensemble Reduction and Learning.
ACM Trans. Design Autom. Electr. Syst., 2019

Krylov Subspace Approximation for Local Community Detection in Large Networks.
ACM Trans. Knowl. Discov. Data, 2019

Locally-biased spectral approximation for community detection.
Knowl. Based Syst., 2019

Natural Language Adversarial Attacks and Defenses in Word Level.
CoRR, 2019

Nesterov Accelerated Gradient and Scale Invariance for Improving Transferability of Adversarial Examples.
CoRR, 2019

Adversarially Robust Generalization Just Requires More Unlabeled Data.
CoRR, 2019

A Learning based Branch and Bound for Maximum Common Subgraph Problems.
CoRR, 2019

AT-GAN: A Generative Attack Model for Adversarial Transferring on Generative Adversarial Nets.
CoRR, 2019

Effective reinforcement learning based local search for the maximum k-plex problem.
CoRR, 2019

An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem.
Comput. Oper. Res., 2019

Improving the Generalization of Adversarial Training with Domain Adaptation.
Proceedings of the 7th International Conference on Learning Representations, 2019

Adaptive Wavelet Clustering for Highly Noisy Data.
Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

Multi-task Deep Learning for Child Gender and Age Determination on Hand Radiographs.
Proceedings of the Biometric Recognition - 14th Chinese Conference, 2019

Generating Natural Language Adversarial Examples through Probability Weighted Word Saliency.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

2018
Local Spectral Clustering for Overlapping Community Detection.
ACM Trans. Knowl. Discov. Data, 2018

Neighbourhood-preserving dimension reduction via localised multidimensional scaling.
Theor. Comput. Sci., 2018

考虑时间因素的0-1背包调度问题 (0-1 Knapsack Variant with Time Scheduling).
计算机科学, 2018

用于求解混合车辆路径问题的混合进化算法 (Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem).
计算机科学, 2018

Hidden community detection in social networks.
Inf. Sci., 2018

Multi-objective particle swarm optimization algorithm based on objective space division for the unequal-area facility layout problem.
Expert Syst. Appl., 2018

Child Gender Determination with Convolutional Neural Networks on Hand Radio-Graphs.
CoRR, 2018

An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container.
Comput. Oper. Res., 2018

Packing unequal circles into a square container based on the narrow action spaces.
Sci. China Inf. Sci., 2018

Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square.
Appl. Soft Comput., 2018

Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Hierarchical ensemble learning for resource-aware FPGA computing: work-in-progress.
Proceedings of the International Conference on Hardware/Software Codesign and System Synthesis, 2018

A Nonnegative Matrix Factorization Approach for Multiple Local Community Detection.
Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017
Combining Wang-Landau sampling algorithm and heuristics for solving the unequal-area dynamic facility layout problem.
Eur. J. Oper. Res., 2017

Krylov Subspace Approximation for Local Community Detection.
CoRR, 2017

The Local Dimension of Deep Manifold.
CoRR, 2017

Understanding Deep Representations through Random Weights.
CoRR, 2017

Packing Unequal Circles into a Square Container by Partitioning Narrow Action Spaces and Circle Items.
CoRR, 2017

An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules.
Comput. Oper. Res., 2017

Computer Science in the Information Age.
IEEE Intell. Informatics Bull., 2017

Local Lanczos Spectral Approximation for Community Detection.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Learning Latent Topics from the Word Co-occurrence Network.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

Deep Compression on Convolutional Neural Network for Artistic Style Transfer.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

A Greedy Heuristic Based on Corner Occupying Action for the 2D Circular Bin Packing Problem.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

2016
Iterated Tabu Search and Variable Neighborhood Descent for packing unequal circles into a circular container.
Eur. J. Oper. Res., 2016

An Efficient Quasi-physical Algorithm for Packing Equal Circles in a Circular Container.
CoRR, 2016

A Powerful Generative Model Using Random Weights for the Deep Image Representation.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Nonlinear Dimension Reduction by Local Multidimensional Scaling.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

Breaking Cycle Structure to Improve Lower Bound for Max-SAT.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
Dynamic reduction heuristics for the rectangle packing area minimization problem.
Eur. J. Oper. Res., 2015

Overlapping Community Detection via Local Spectral Clustering.
CoRR, 2015

Revealing Multiple Layers of Hidden Community Structure in Networks.
CoRR, 2015

An action-space-based global optimization algorithm for packing circles into a square container.
Comput. Oper. Res., 2015

Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach.
Proceedings of the 24th International Conference on World Wide Web, 2015

Detecting Overlapping Communities from Local Spectral Subspaces.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014
An iterative merging placement algorithm for the fixed-outline floorplanning.
CoRR, 2014

2013
On the weak computability of a four dimensional orthogonal packing and time scheduling problem.
Theor. Comput. Sci., 2013

Heuristics for two-dimensional strip packing problem with 90° rotations.
Expert Syst. Appl., 2013

A coarse-to-fine quasi-physical optimization method for solving the circle packing problem with equilibrium constraints.
Comput. Ind. Eng., 2013

2012
An efficient deterministic heuristic for two-dimensional rectangular packing.
Comput. Oper. Res., 2012

2011
Analysis on the computability over the efficient utilization problem of the four-dimensional space-time
CoRR, 2011

An efficient placement heuristic for three-dimensional rectangular packing.
Comput. Oper. Res., 2011

2010
Solving the single-container loading problem by a fast heuristic method.
Optim. Methods Softw., 2010

A quasi-human algorithm for solving the three-dimensional rectangular packing problem.
Sci. China Inf. Sci., 2010

A caving degree based flake arrangement approach for the container loading problem.
Comput. Ind. Eng., 2010

2009
A caving degree approach for the single container loading problem.
Eur. J. Oper. Res., 2009

A new heuristic algorithm for cuboids packing with no orientation constraints.
Comput. Oper. Res., 2009

A pure quasi-human algorithm for solving the cuboid packing problem.
Sci. China Ser. F Inf. Sci., 2009

2008
A New Method for Container Loading Problem.
Proceedings of the 2008 International Conference on Scientific Computing, 2008

2007
A New Quasi-Human Algorithm for the Strongly Heterogeneous Container Loading Problem.
Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology, 2007

An Efficient Algorithm for Solving the Container Loading Problem.
Proceedings of the Combinatorics, 2007

2006
A New Task Duplication Based Multitask Scheduling Method.
Proceedings of the Grid and Cooperative Computing, 2006


  Loading...