default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLixin Ding
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j31]Lan Song, Lixin Ding
, Tangliu Wen, Mengjia Yin, Zhigao Zeng:
Time series change detection using reservoir computing networks for remote sensing data. Int. J. Intell. Syst. 37(12): 10845-10860 (2022)- 2021
- [i2]Gongshan He, Dongxing Zhao, Lixin Ding:
Dual-embedding based Neural Collaborative Filtering for Recommender Systems. CoRR abs/2102.02549 (2021)
2010 – 2019
- 2019
- [j30]Zhirong Gao, Lixin Ding, Qiming Xiong, Zhongyi Gong, Chengyi Xiong:
Image Compressive Sensing Reconstruction Based on z-Score Standardized Group Sparse Representation. IEEE Access 7: 90640-90651 (2019) - [j29]Lingyun Zhou, Lixin Ding, Maode Ma, Wan Tang:
An accurate partially attracted firefly algorithm. Computing 101(5): 477-493 (2019) - [j28]Runze Wan, Lixin Ding, Naixue Xiong, Wanneng Shu, Li Yang:
Dynamic dual threshold cooperative spectrum sensing for cognitive radio under noise power uncertainty. Hum. centric Comput. Inf. Sci. 9: 22 (2019) - [j27]Runze Wan, Lixin Ding, Naixue Xiong, Xing Zhou:
Mitigation strategy against spectrum-sensing data falsification attack in cognitive radio sensor networks. Int. J. Distributed Sens. Networks 15(9) (2019) - [j26]Ming Chen, Yunwen Lei, Lixin Ding, Zhao Tong:
Convergence in Probability on a Big Class of Time-Variant Evolutionary Algorithms. Int. J. Pattern Recognit. Artif. Intell. 33(6): 1959018:1-1959018:34 (2019) - [j25]Lingyun Zhou, Maode Ma, Lixin Ding, Wan Tang:
Centroid opposition with a two-point full crossover for the partially attracted firefly algorithm. Soft Comput. 23(23): 12241-12254 (2019) - [c33]Zhirong Gao, Lixin Ding, Chengyi Xiong, Zhongyi Gong, Qiming Xiong:
Compressive Sensing Reconstruction Based on Standardized Group Sparse Representation. ICIP 2019: 2095-2099 - 2018
- [c32]Lingyun Zhou, Lixin Ding, Yunwen Lei:
An Enhanced Firefly Algorithm with Orthogonal Centroid Opposition-Based Learning. CEC 2018: 1-8 - 2017
- [j24]Xing Zhou, Lixin Ding, Zhaokui Li, Runze Wan:
Collaborator recommendation in heterogeneous bibliographic networks using random walks. Inf. Retr. J. 20(4): 317-337 (2017) - [j23]Jinrong He, Yingzhou Bi, Lixin Ding, Zhaokui Li, Shenwen Wang:
Unsupervised feature selection based on decision graph. Neural Comput. Appl. 28(10): 3047-3059 (2017) - 2016
- [j22]Qiongbing Zhang, Lixin Ding:
A new crossover mechanism for genetic algorithms with variable-length chromosomes for path optimization problems. Expert Syst. Appl. 60: 183-189 (2016) - [j21]Jun Li, Lixin Ding, Bo Li:
Differential evolution-based parameters optimisation and feature selection for support vector machine. Int. J. Comput. Sci. Eng. 13(4): 355-363 (2016) - [j20]Yunwen Lei, Lixin Ding, Yingzhou Bi:
Local Rademacher complexity bounds based on covering numbers. Neurocomputing 218: 320-330 (2016) - [j19]Zhaokui Li, Lixin Ding, Yan Wang:
Score level fusion method based on multiple oblique gradient operators for face recognition. Multim. Tools Appl. 75(2): 819-837 (2016) - 2015
- [j18]Lingyun Zhou, Lixin Ding, Jinrong He:
精英正交学习萤火虫算法 (Elite Orthogonal Learning Firefly Algorithm). 计算机科学 42(10): 211-216 (2015) - [j17]Shenwen Wang, Wensheng Zhang, Lixin Ding, Chengwang Xie, Zhaolu Guo:
差分进化算法中参数自适应选择策略研究 (Research on Parameter Self-selection Strategy of Differential Evolution). 计算机科学 42(11): 256-259 (2015) - [j16]Yunwen Lei, Lixin Ding, Wensheng Zhang:
Generalization Performance of Radial Basis Function Networks. IEEE Trans. Neural Networks Learn. Syst. 26(3): 551-564 (2015) - [i1]Yunwen Lei, Lixin Ding, Yingzhou Bi:
Local Rademacher Complexity Bounds based on Covering Numbers. CoRR abs/1510.01463 (2015) - 2014
- [j15]Zhaokui Li, Lixin Ding, Yan Wang, Jinrong He:
Face Representation with Gradient orientations and Euler Mapping: Application to Face Recognition. Int. J. Pattern Recognit. Artif. Intell. 28(8) (2014) - [j14]Jinrong He, Lixin Ding, Lei Jiang, Zhaokui Li, Qinghui Hu:
Intrinsic dimensionality estimation based on manifold assumption. J. Vis. Commun. Image Represent. 25(5): 740-747 (2014) - [j13]Yunwen Lei, Lixin Ding:
Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem. Neural Comput. 26(4): 739-760 (2014) - [j12]Yunwen Lei, Lixin Ding, Yiming Ding:
Generalization ability of fractional polynomial models. Neural Networks 49: 59-73 (2014) - [c31]Lingyun Zhou, Lixin Ding, Xiaoli Qiang:
A Multi-population Discrete Firefly Algorithm to Solve TSP. BIC-TA 2014: 648-653 - [c30]Rui Liu, Lixin Ding, Lan Xie:
Catlinks - a category clustering algorithm based on multi-class regression. CCIS 2014: 323-326 - [c29]Jinrong He, Lixin Ding, Lei Jiang, Ling Ma:
Kernel ridge regression classification. IJCNN 2014: 2263-2267 - [c28]Jinrong He, Lixin Ding, Lei Jiang, Li Huang:
A flexible and efficient algorithm for regularized Marginal Fisher analysis. IJCNN 2014: 4198-4205 - 2013
- [j11]Yunwen Lei, Lixin Ding:
Approximation and estimation bounds for free knot splines. Comput. Math. Appl. 65(7): 1006-1024 (2013) - [j10]Yunwen Lei, Lixin Ding, Weili Wu:
Universal learning using free multivariate splines. Neurocomputing 119: 253-263 (2013) - [j9]Datong Xie, Lixin Ding, Yurong Hu, Shenwen Wang, Chengwang Xie, Lei Jiang:
A Multi-Algorithm Balancing Convergence and Diversity for Multi-Objective Optimization. J. Inf. Sci. Eng. 29(5): 811-834 (2013) - [j8]Zhirong Gao, Chengyi Xiong, Lixin Ding, Cheng Zhou:
Image representation using block compressive sensing for compression applications. J. Vis. Commun. Image Represent. 24(7): 885-894 (2013) - [c27]Jun Li, Lixin Ding, Ying Xing:
Differential Evolution Based Parameters Selection for Support Vector Machine. CIS 2013: 284-288 - [c26]Zhaokui Li, Lixin Ding, Yan Wang:
A Robust Dimensionality Reduction Method from Laplacian Orientations. HPCC/EUC 2013: 345-351 - 2012
- [j7]Lei Jiang, Lixin Ding, Jianxun Liu, Jinjun Chen:
Reputation rating modeling for open environment lack of communication by using online social cognition. J. Netw. Comput. Appl. 35(3): 881-891 (2012) - [j6]Wei Huang, Lixin Ding:
The Shortest Path Problem on a Fuzzy Time-Dependent Network. IEEE Trans. Commun. 60(11): 3376-3385 (2012) - [c25]Datong Xie, Lixin Ding, Shenwen Wang, Zhaolu Guo, Yurong Hu, Chengwang Xie:
Self-adaptive Differential Evolution Based Multi-objective Optimization Incorporating Local Search and Indicator-Based Selection. ICIC (1) 2012: 25-33 - 2011
- [j5]Wei Huang, Lixin Ding:
Project-Scheduling Problem With Random Time-Dependent Activity Duration Times. IEEE Trans. Engineering Management 58(2): 377-387 (2011) - [c24]Lei Jiang, Lixin Ding, Yang Peng, Chenhong Zhao:
An efficient clustering approach using ant colony algorithm in mutidimensional search space. FSKD 2011: 1085-1089 - [c23]Wei Huang, Lixin Ding, Sung-Kwun Oh:
Design of Fuzzy Radial Basis Function Neural Networks with the Aid of Multi-objective Optimization Based on Simultaneous Tuning. ISNN (3) 2011: 264-273 - 2010
- [j4]Xin Du, Lixin Ding:
About the convergence rates of a class of gene expression programming. Sci. China Inf. Sci. 53(4): 715-728 (2010) - [j3]Wei Huang, Lixin Ding, Sung-Kwun Oh, Chang-Won Jeong, Su-Chong Joo:
Identification of Fuzzy Inference System Based on Information Granulation. KSII Trans. Internet Inf. Syst. 4(4): 575-594 (2010) - [c22]Yingzhou Bi, Peng Zou, Zhi Zhong, Lixin Ding:
A novel pheromone update with important solution components. ICNC 2010: 2551-2555 - [c21]Wei Huang, Lixin Ding, Sung-Kwun Oh:
A Experimental Study on Space Search Algorithm in ANFIS-Based Fuzzy Models. ISNN (1) 2010: 199-206
2000 – 2009
- 2009
- [c20]Yingzhou Bi, Lixin Ding, Jianbo Lu:
On the Faster Ant Colony Optimization Algorithm. ICNC (3) 2009: 45-49 - [c19]Wei Huang, Lixin Ding, Bin Wen, Buqing Cao:
Project Scheduling Problem for Software Development with Random Fuzzy Activity Duration Times. ISNN (2) 2009: 60-69 - 2008
- [c18]Qing Zhang, Sanyou Zeng, Rui Wang, Hui Shi, Guang Chen, Lixin Ding, Lishan Kang:
Constrained optimization by the evolutionary algorithm with lower dimensional crossover and gradient-based mutation. IEEE Congress on Evolutionary Computation 2008: 273-279 - [c17]Sanyou Zeng, Guang Chen, Rui Wang, Hui Li, Hui Shi, Lixin Ding, Lishan Kang:
A new technique for assessing the diversity of close-Pareto-optimal front. IEEE Congress on Evolutionary Computation 2008: 344-349 - [c16]Xin Du, Lixin Ding, Liyuan Jia:
Asynchronous Distributed Parallel Gene Expression Programming Based on Estimation of Distribution Algorithm. ICNC (1) 2008: 433-437 - [c15]Lixin Ding, Jinghu Yu:
About the Computation Time of Adaptive Evolutionary Algorithms. ISICA 2008: 669-679 - 2007
- [c14]Sanyou Zeng, Hui Shi, Hui Li, Guang Chen, Lixin Ding, Lishan Kang:
A lower-dimensional-search evolutionary algorithm and its application in constrained optimization problems. IEEE Congress on Evolutionary Computation 2007: 1255-1260 - [c13]Yingzhou Bi, Lixin Ding, Weiqin Ying:
Towards a Less Destructive Crossover Operator Using Immunity Theory. International Conference on Computational Science (4) 2007: 1061-1067 - [c12]Lixin Ding, Sanyou Zeng:
About the Limit Behaviors of the Transition Operators Associated with EAs. ISICA 2007: 110-119 - [c11]Yingzhou Bi, Lixin Ding, Weiqin Ying:
Towards the Role of Heuristic Knowledge in EA. ISICA 2007: 621-630 - [p1]Sanyou Zeng, Hui Shi, Lishan Kang, Lixin Ding:
Orthogonal Dynamic Hill Climbing Algorithm: ODHC. Evolutionary Computation in Dynamic and Uncertain Environments 2007: 79-104 - 2006
- [c10]Rui Liu, Sanyou Zeng, Lixin Ding, Lishan Kang, Hui Li, Yuping Chen, Yong Liu, Yueping Han:
An Efficient Multi-Objective Evolutionary Algorithm for Combinational Circuit Design. AHS 2006: 215-221 - [c9]Sangyou Zeng, Guang Chen, Liang Zheng, Hui Shi, Hugo de Garis, Lixin Ding, Lishan Kang:
A Dynamic Multi-Objective Evolutionary Algorithm Based on an Orthogonal Design. IEEE Congress on Evolutionary Computation 2006: 573-580 - [c8]Sanyou Zeng, Hui Shi, Guang Chen, Hugo de Garis, Lishan Kang, Lixin Ding:
Orthogonal Dynamic Hill-Climbing Algorithm for Dynamic Optimization Problems. IEEE Congress on Evolutionary Computation 2006: 1331-1338 - [c7]Lixin Ding, Jinghu Yu:
An Analysis About the Asymptotic Convergence of Evolutionary Algorithms. CIS 2006: 156-166 - [c6]Lixin Ding, Yingzhou Bi:
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space. CIS 2006: 209-219 - [c5]Sanyou Zeng, Rui Wang, Hui Shi, Guang Chen, Hugo de Garis, Lishan Kang, Lixin Ding:
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design. GECCO 2006: 1437-1438 - 2005
- [c4]Lixin Ding, Jinghu Yu:
Some theoretical results about the computation time of evolutionary algorithms. GECCO 2005: 1409-1415 - [c3]Sanyou Zeng, Deyou Tang, Lishan Kang, Shuzhen Yao, Lixin Ding:
An Orthogonal Dynamic Evolutionary Algorithm with Niches. ICNC (2) 2005: 1049-1063 - 2004
- [j2]Sanyou Zeng, Lishan Kang, Lixin Ding:
An Orthogonal Multi-objective Evolutionary Algorithm for Multi-objective Optimization Problems with Constraints. Evol. Comput. 12(1): 77-98 (2004) - 2003
- [c2]Sanyou Zeng, Lixin Ding, Yuping Chen, Lishan Kang:
A new multiobjective evolutionary algorithm: OMOEA. IEEE Congress on Evolutionary Computation 2003: 898-905 - [c1]Lixin Ding, Sanyou Zeng, Lishan Kang:
A fast algorithm on finding the non-dominated set in multi-objective optimization. IEEE Congress on Evolutionary Computation 2003: 2565-2571 - 2000
- [j1]Lixin Ding, Lishan Kang:
Convergence properties of evolutionary algorithms under elitist strategy. Neural Parallel Sci. Comput. 8(2): 105-114 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
