Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleJuly 2024
A novel multi-label feature selection method based on knowledge consistency-independence index
Information Sciences: an International Journal (ISCI), Volume 677, Issue Chttps://doi.org/10.1016/j.ins.2024.120870AbstractMulti-label classification encounters the challenge of dealing with high dimensional data. In response to this challenge, numerous researchers have proposed various multi-label feature selection methods from different perspectives. However, ...
- research-articleJune 2024
Multilabel Feature Selection Based on Fuzzy Mutual Information and Orthogonal Regression
IEEE Transactions on Fuzzy Systems (TOFS), Volume 32, Issue 9Pages 5136–5148https://doi.org/10.1109/TFUZZ.2024.3415176With the increase of high-dimensional multilabel data, multilabel feature selection (MFS) has received more and more widespread attention. Embedded feature selection methods have been widely studied due to their high efficiency and low computational cost. ...
- research-articleJanuary 2024
L2‐gain analysis and fault‐tolerant control for uncertain nonlinear switched system with actuator saturation and time‐varying delay
AbstractFor the nonlinear continuous‐time switched system with input saturation and time‐varying delay, the problem of actuator failure is investigated in the presence of external disturbances. First, the sufficient conditions for the tolerance ...
- research-articleJune 2023
LDSSNV: A Linkage Disequilibrium-Based Method for the Detection of Somatic Single-Nucleotide Variants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), Volume 20, Issue 5Pages 3020–3032https://doi.org/10.1109/TCBB.2023.3291134Single nucleotide variants (SNVs) are very common in human genome and pose a significant effect on cellular proliferation and tumorigenesis in various cancers. Somatic variant and germline variant are the two forms of SNVs. They are the major drivers of ...
- research-articleJanuary 2022
Research on the Trust Mechanism of Individual Consumers in Rural Financial Markets Based on the Dynamic CGE Model
In order to obtain the complete equilibrium state of rural financial market and ensure the stable development of rural financial consumer market, this paper introduces CGE model and analyzes the dynamic trust mechanism of individual consumers in rural ...
- ArticleJuly 2020
Comparison of Pedestrians’ Gap Acceptance Behavior Towards Automated and Human-Driven Vehicles
Engineering Psychology and Cognitive Ergonomics. Cognition and DesignPages 253–261https://doi.org/10.1007/978-3-030-49183-3_20AbstractTo protect pedestrian safety, automated vehicles can adopt a conservative strategy by yielding to pedestrians in all interactions and external human-machine interface was suggested to convey vehicle intentions to pedestrians. However, automated ...
- articleJanuary 2020
A Visual Detection Method for Foreign Objects in Power Lines Based on Mask R-CNN
International Journal of Ambient Computing and Intelligence (IJACI-IGI), Volume 11, Issue 1Pages 34–47https://doi.org/10.4018/IJACI.2020010102The high-voltage power lines and transmission towers are large in volume, large in number, and wide in coverage, so they are easily attached to foreign objects, which may cause failure of the transmission line. The existing object detection methods ...
- research-articleJuly 2018
Tunneling between plateaus: improving on a state-of-the-art MAXSAT solver using partition crossover
GECCO '18: Proceedings of the Genetic and Evolutionary Computation ConferencePages 921–928https://doi.org/10.1145/3205455.3205482There are two important challenges for local search algorithms when applied to Maximal Satisfiability (MAXSAT). 1) Local search spends a great deal of time blindly exploring plateaus in the search space and 2) local search is less effective on ...
- research-articleAugust 2014
Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem
- Thomas Weise,
- Raymond Chiong,
- Jorg Lassig,
- Ke Tang,
- Shigeyoshi Tsutsui,
- Wenxiang Chen,
- Zbigniew Michalewicz,
- Xin Yao
IEEE Computational Intelligence Magazine (COMPINT), Volume 9, Issue 3Pages 40–52https://doi.org/10.1109/MCI.2014.2326101We introduce an experimentation procedure for evaluating and comparing optimization algorithms based on the Traveling Salesman Problem (TSP). We argue that end-of-run results alone do not give sufficient information about an algorithm's performance, so ...
- research-articleJuly 2013
Hyperplane initialized local search for MAXSAT
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computationPages 805–812https://doi.org/10.1145/2463372.2463468By converting the MAXSAT problem to Walsh polynomials, we can efficiently and exactly compute the hyperplane averages of fixed order k. We use this fact to construct initial solutions based on variable configurations that maximize the sampling of ...
- research-articleJuly 2013
Second order partial derivatives for NK-landscapes
GECCO '13: Proceedings of the 15th annual conference on Genetic and evolutionary computationPages 503–510https://doi.org/10.1145/2463372.2463437Local search methods based on explicit neighborhood enumeration require at least $O(n)$ time to identify all possible improving moves. For k-bounded pseudo-Boolean optimization problems, recent approaches have achieved $O(k^2*2^{k})$ runtime cost per ...
- ArticleSeptember 2012
An empirical evaluation of o(1) steepest descent for NK-Landscapes
PPSN'12: Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part IPages 92–101https://doi.org/10.1007/978-3-642-32937-1_10New methods make it possible to do approximate steepest descent in O(1) time per move for k-bounded pseudo-Boolean functions using stochastic local search. It is also possible to use the average fitness over the Hamming distance 2 neighborhood as a ...
- research-articleJuly 2012
Constant time steepest descent local search with lookahead for NK-landscapes and MAX-kSAT
GECCO '12: Proceedings of the 14th annual conference on Genetic and evolutionary computationPages 1357–1364https://doi.org/10.1145/2330163.2330351A modified form of steepest descent local search is proposed that displays an average complexity of O(1) time per move for NK-Landscape and MAX-kSAT problems. The algorithm uses a Walsh decomposition to identify improving moves. In addition, it is ...
- ArticleSeptember 2010
Large-scale global optimization using cooperative coevolution with variable interaction learning
PPSN'10: Proceedings of the 11th international conference on Parallel problem solving from nature: Part IIPages 300–309In recent years, Cooperative Coevolution (CC) was proposed as a promising framework for tackling high-dimensional optimization problems. The main idea of CC-based algorithms is to discover which decision variables, i.e, dimensions, of the search space ...
- ArticleApril 2009
New Method for Suppressing Lift-Off Effects Based on Hough Transform
ICMTMA '09: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02Pages 653–656https://doi.org/10.1109/ICMTMA.2009.543A major problem for crack or electromagnetic property measurement in eddy current detection technique is the lift-off effect. The nonzero value of lift-off distance tends to smear out the discontinuity in the detected signal, causing errors detection. ...