Pith. sign in

REVIEW 4 major objections 7 minor 1 cited by

Differential Evolution Integrated Hybrid Deep Learning Model for Object Detection in Pre-made Dishes

T0 review · 4 major / 7 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that combining three diverse object detectors with differential evolution–tuned weights and weighted boxes fusion yields higher accuracy on pre-made dish images than any single detector alone, reaching 90.92 mAP50 against…

desk verdict Reasonable ensemble idea, but the reported evaluation does not support the headline gain; the paper needs a clear test/validation separation, an equal-weight WBF baseline, and error bars. read the letter →

arxiv 2412.20370 v1 pith:J6Q25NOT submitted 2024-12-29 cs.CV

Lujia Lv , Di Wu , Yangyi Xia , Jia Wu , Xiaojing Liu , Yi He This is my paper · ORCID
classification cs.CV
keywords objectdetectionensemblelearningdifferentialevolutionweightedboxesfusionpre-madedishesfoodYOLODETR
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper claims that no single object detector works well enough on pre-made dishes, where ingredients overlap, look alike, and appear in poor lighting. Its proposed DEIHDL model combines three diverse detectors—YOLOv5, YOLOv8, and DETR—by giving each a weight found through differential evolution and merging their boxes with weighted boxes fusion. On a real dataset of 2,200 dish images across 11 ingredient categories, the ensemble reaches 90.92 mAP50, above the best single model YOLOX at 88.41. The authors argue this shows ensemble integration is a practical way to raise detection accuracy in complex food scenes.

What carries the argument

The mechanism is a three-way ensemble whose fusion weights are tuned by differential evolution. Each individual in the population is a triple of weights for the three detectors; mutation (DE/rand/1 with an adaptive scaling factor), arithmetic crossover, and selection on validation performance drive the search. Weighted boxes fusion then merges the three models' predicted boxes, assigning scores to candidate boxes rather than discarding overlapping detections. The load-bearing identity is that the combined mAP is higher than any single model's because the weight search is guided by the metric being optimized.

What would settle it

Run the same DE weight search on the test set (or perform repeated cross-validation) and compare against uniform average weights of the three base models; if the mAP advantage over the uniform average shrinks to near zero, the claim that DE-tuned weights are the source of the gain is falsified. Alternatively, reshuffle the dataset into a different train/validation/test split and check whether DEIHDL still beats YOLOX by a comparable margin.

Watch

Extended reading notes

Core claim

The central claim is that an ensemble of heterogeneous detectors, fused by weights optimized with differential evolution and then merged by weighted boxes fusion, can outperform every single detector it is built from. The authors build three base models—YOLOv5, a single-stage CNN detector; YOLOv8, an anchor-free single-stage detector; and DETR, a transformer-based detector—to capture different inductive biases. Differential evolution searches for the three fusion weights by evaluating each candidate weight set's performance on a validation set according to the weighted boxes fusion result. The final DEIHDL model reports mAP50 of 90.92 and mAP50-95 of 72.25, versus 88.41 and 68.27 for the best single model (YOLOX). The paper's point is that this integration, not any single architecture, is what handles the overlapping-occlusion and low-light difficulties of pre-made dish scenes.

Load-bearing premise

The reported mAP gain assumes the test set was not used, directly or indirectly, to choose the differential evolution weights or the hyperparameters; if the same images influenced both the weight search and the final score, the gain could be an artifact of overfitting.

Editorial extensions

If this is right

  • DEIHDL outperforms each of its three base models on both mAP50 and mAP50-95, so the ensemble gain is consistent across metrics.
  • The differential evolution search converges over generations, showing the fusion weights stabilize rather than wander.
  • The best population size is small (5 to 15 individuals) and the best generation count is 40, indicating the weight search is computationally cheap.
  • The weighted boxes fusion step means confidence scores are recomputed from the ensemble, which the paper argues reduces false positives from overlapping ingredient boxes.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same ensemble recipe could be tried on other occlusion-heavy detection tasks, such as medical image analysis or warehouse picking, where a single model struggles.
  • A natural test would be to compare DE-tuned weights against simple uniform averaging of the three base models' WBF outputs; if uniform averaging matches the reported mAP, the differential evolution step may be adding little.
  • The reported gain is on a single dataset of 2,200 images; evaluating on larger public food datasets or cross-domain shifts would show whether the advantage generalizes.
  • Since the hyperparameter analysis varies one parameter at a time, an automatic joint tuning of population size and generations could change the optimal settings.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 7 minor

Summary. The paper proposes DEIHDL, an ensemble object detector for pre-made dish ingredients that combines YOLOv5, YOLOv8, and DETR using weighted boxes fusion (WBF) with integration weights optimized by differential evolution (DE). Section III presents the three base models, the DE operations (initialization, mutation, crossover, selection), and WBF, including pseudo-code and complexity analysis. Section IV reports experiments on a Dish Ingredients dataset of 2,200 images and 11 classes, comparing DEIHDL with six detectors. DEIHDL achieves mAP50 of 90.92% and mAP50-95 of 72.25%, outperforming the best single model YOLOX (88.41% mAP50). Section IV.C analyzes the influence of population size NP and generations G. The authors claim significant improvement and discuss limitations and future work.

Significance. If the reported gain is real, the paper offers a straightforward, practical recipe for improving detection accuracy in a niche domain by combining off-the-shelf detectors with a standard optimizer, which could be useful for food-industry applications. The manuscript provides algorithm-level details and complexity estimates, and it is commendable that the authors expose the DE hyperparameter influence. However, the scientific claim hinges entirely on the empirical comparison, and the current protocol does not yet establish that the DE-tuned WBF ensemble outperforms a simple equal-weight WBF ensemble or that the gain is statistically reliable. Thus the significance is conditional on the missing experiments.

major comments (4)
  1. [Section IV.A and Table V] The paper does not state whether the mAP values reported in Table V come from a held-out test set or from the same validation set used by DE for weight selection. Equation (13) explicitly defines the selection criterion as performance on the validation set, so if Table V is computed on that validation set, the reported superiority could be an artifact of selection. Please specify the exact train/validation/test split of the 2,200 images, and report the DEIHDL results on a test set that is never used for weight selection or hyperparameter choice.
  2. [Section IV.B, Table V] The comparison includes only the three base models plus three other single models; there is no ensemble baseline with equal weights. Since WBF itself typically improves mAP over individual models, the 90.92 versus 88.41 gap cannot be attributed to the DE-optimized weights without also reporting a WBF ensemble with equal (or hand-set) weights on the same three base models. Add this ablation to isolate the contribution of DE.
  3. [Section IV.B, Table V] All results are single-point estimates without variance, confidence intervals, or tests of significance. Given the 2.51-point gap between DEIHDL and YOLOX and the variability typical of object detection training, repeated runs (e.g., 3-5 seeds) and, if appropriate, a paired statistical test over the test images are needed to substantiate the claim that DEIHDL 'significantly outperforms' the base models.
  4. [Section IV.C] The hyperparameter analysis for NP and G is presented as influencing DEIHDL performance, but the manuscript does not specify whether these values were selected using the same validation set and whether the final Table V entry uses those tuned values. This creates a possible selection-on-validation bias. Please describe the hyperparameter selection protocol and, ideally, use an independent validation split for the DE and hyperparameter tuning.
minor comments (7)
  1. [Section III.A, Eqs. (1), (2), (3), (10)] Several equations are corrupted by incomplete or missing symbols (e.g., undefined \lambda*, \tau, \alpha, and garbled subscripts in Eq. (10)); please regenerate them with a proper equation editor to make the method verifiable.
  2. [Section III.C, Tables I and II] Tables I and II, referenced as the pseudo-code of DEIHDL and WBF, do not appear in the provided manuscript; please include them in the final version.
  3. [Equation (8), Section III.B] The individual X_{i,g} is represented by three weights, but no constraints such as non-negativity or sum-to-one are stated; please describe the search space and any normalization applied within the WBF step.
  4. [Figures 2-4] The figures in Section IV.C do not state which metric is plotted on the y-axis; please specify whether it is mAP50, mAP50-95, or another metric.
  5. [References [2] and [30]] References [2] and [30] are the same paper (Grab, Pay, and Eat); one duplicate should be removed.
  6. [Section V, Conclusion] The conclusion states that the model is 'limited by data integrity' but gives no details; if the dataset has missing or noisy labels, please describe them and how they may affect the comparison.
  7. [Section IV.A, Dataset] The dataset 'Dish Ingredients' is not described beyond counts; at minimum, state class names, image distribution, and availability to enable reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reasoning: DE weight selection and WBF evaluation are standard model selection, and the self-citations to prior DE work are motivational rather than load-bearing.

full rationale

The claimed derivation chain is an empirical ensemble pipeline, not a derivation that reduces to its inputs. The three base models are specified independently using standard loss functions, and the integration uses differential evolution to choose fusion weights via Performance(X) = Evaluate(WBF(X)) on the validation set (Eq. 13). The reported mAP values in Table V are measurements of the resulting detector; they are not defined by construction as functions of the optimized weights. No equation in the paper labels a fitted quantity as a prediction. The self-citations to D. Wu et al. [8] and [15] appear only as motivational examples that DE has been used in model training and optimization; they do not carry the central claim that DEIHDL outperforms the base models, and no uniqueness theorem or ansatz is imported from those papers. The WBF strategy itself is cited to external work [23], and the scale-factor adaptation is cited to external work [20]. The absence of a reported train/validation/test split and error bars is a legitimate experimental-conduct concern about whether the 90.92 vs. 88.41 mAP50 gap generalizes, but it is not circularity: the gap is an empirical result, not an identity or a fitted parameter renamed as an outcome. The paper's own limitation statement that the model is 'limited by data integrity and hyperparameter tuning' is an empirical caveat, not evidence of circular reasoning. Accordingly, the circularity score is 0.

Assumptions & free parameters 3 free parameters · 4 assumptions · 0 invented entities

The central claim rests on domain assumptions about the dataset and the fusion procedure rather than on new mathematical axioms. No new entities are introduced. The main free parameters are DE hyperparameters and the learned integration weights.

free parameters (3)
  • Population size NP = 5 to 15
    Selected by hyperparameter experiment in Fig. 2; no theoretical derivation.
  • Number of generations G = 40
    Selected by hyperparameter experiment in Fig. 3; no theoretical derivation.
  • Model integration weights = Converged values shown in Fig. 4
    Optimized by differential evolution on the validation set via WBF; final numeric values are not listed.
assumptions (4)
  • domain assumption The three base models are sufficiently diverse for ensemble improvement.
    Invoked in Section III.A and III.B without a quantitative diversity measure.
  • domain assumption Weighted boxes fusion is a valid way to merge predictions from YOLO and DETR models.
    Borrowed from [23] and applied in Section III.B; no adaptation is made for the different detector confidence distributions.
  • domain assumption The Dish Ingredients dataset is representative of real pre-made dish scenes and is accurately annotated.
    Section IV.A states the dataset is collected from the Internet but gives no annotation protocol or quality check.
  • domain assumption Differential evolution converges to near-optimal weights within the selected generations.
    Section III.B uses standard DE with SFLSDE; the paper does not prove convergence or compare with other optimizers.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Differential Evolution Integrated Hybrid Deep Learning Model for Object Detection in Pre-made Dishes." pith.science (2026). https://pith.science/paper/J6Q25NOT

@misc{pith2026241220370,
  author       = {Pith},
  title        = {Pith review of: Differential Evolution Integrated Hybrid Deep Learning Model for Object Detection in Pre-made Dishes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/J6Q25NOT}},
  note         = {Machine review of arXiv:2412.20370}
}
read the original abstract

With the continuous improvement of people's living standards and fast-paced working conditions, pre-made dishes are becoming increasingly popular among families and restaurants due to their advantages of time-saving, convenience, variety, cost-effectiveness, standard quality, etc. Object detection is a key technology for selecting ingredients and evaluating the quality of dishes in the pre-made dishes industry. To date, many object detection approaches have been proposed. However, accurate object detection of pre-made dishes is extremely difficult because of overlapping occlusion of ingredients, similarity of ingredients, and insufficient light in the processing environment. As a result, the recognition scene is relatively complex and thus leads to poor object detection by a single model. To address this issue, this paper proposes a Differential Evolution Integrated Hybrid Deep Learning (DEIHDL) model. The main idea of DEIHDL is three-fold: 1) three YOLO-based and transformer-based base models are developed respectively to increase diversity for detecting objects of pre-made dishes, 2) the three base models are integrated by differential evolution optimized self-adjusting weights, and 3) weighted boxes fusion strategy is employed to score the confidence of the three base models during the integration. As such, DEIHDL possesses the multi-performance originating from the three base models to achieve accurate object detection in complex pre-made dish scenes. Extensive experiments on real datasets demonstrate that the proposed DEIHDL model significantly outperforms the base models in detecting objects of pre-made dishes.

Figures

Figures reproduced from arXiv: 2412.20370 by the authors.

Figure 1
Figure 1. The overall architecture of the DEIHDL. A. Model Building 1) YOLOv5. YOLOv5 [10] is the fifth version of the You Only Look Once (YOLO) series of algorithms, which is representative of single￾stage object detection algorithms. It achieves high accuracy, efficiency and ease of use at that time. It should be declared that S is the number of grid cells, B is the number of anchors on each grid cell, and IoU is the overla… view at source ↗
Figure 2
Figure 2. The influence of NP on the dataset. 2) Number of evolutionary generations. To explore the effect of generation size G on the effectiveness of DEIHDL, we implemented experiments with multiple G configurations. As demonstrated in [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. The influence of G on the dataset. 3) Different weights. The weighting curves in [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The influence of weights on the dataset [PITH_FULL_IMAGE:figures/full_fig_p006_4.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. DishSeg24k: A Large-Scale Benchmark for Food Segmentation with Stochastic Expert Decoding

    cs.CV 2026-07 conditional novelty 6.0 of 10

    DishSeg24k is a 24k-image dish-level food segmentation benchmark, and the FEAST model reports +3.21 mIoU over prior methods, mostly from its mixture-of-experts decoder.

Reference graph

Works this paper leans on

73 extracted references · 28 canonical work pages · cited by 1 Pith paper

  1. [1]

    Multiple -food recognition considering co -occurrence employing manifold ranking,

    Y. Matsuda and K. Yanai, “Multiple -food recognition considering co -occurrence employing manifold ranking,” in Proceedings of the 21st International Conference on Pattern Recognition, ICPR 2012, Tsukuba, Japan, November 11 -15, 2012, 2012, pp. 2017 –2020

    work page 2012

  2. [3]

    Large Scale Visual Food Recognition,

    W. Min et al., “Large Scale Visual Food Recognition,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 45, no. 8, pp. 9932 –9949, 2023, doi: 10.1109/TPAMI.2023.3237871

    arXiv 2023

  3. [4]

    Multi -Task Learning for Food Identification and Analysis with Deep Convolutional Neural Networks,

    X.-J. Zhang, Y. -F. Lu, and S. -H. Zhang, “Multi -Task Learning for Food Identification and Analysis with Deep Convolutional Neural Networks,” J. Comput. Sci. Technol., vol. 31, no. 3, pp. 489 –500, 2016, doi: 10.1007/S11390 -016-1642-6

    work page doi:10.1007/s11390 2016

  4. [5]

    Gold-YOLO: Efficient Object Detector via Gather -and-Distribute Mechanism,

    C. Wang et al., “Gold-YOLO: Efficient Object Detector via Gather -and-Distribute Mechanism,” in Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, Decemb er 10 - 16, 2023, 2023

    work page 2023

  5. [6]

    DAMO -YOLO : A Report on Real -Time Object Detection Design,

    X. Xu, Y. Jiang, W. Chen, Y. Huang, Y. Zhang, and X. Sun, “DAMO -YOLO : A Report on Real -Time Object Detection Design,” CoRR, vol. abs/2211.15444, 2022, doi: 10.48550/ARXIV.2211.15444

    arXiv doi:10.48550/arxiv.2211.15444 2022

  6. [7]

    YOLOX: Exceeding YOLO Series in 2021,

    Z. Ge, S. Liu, F. Wang, Z. Li, and J. Sun, “YOLOX: Exceeding YOLO Series in 2021,” CoRR, vol. abs/2107.08430, 2021

    arXiv 2021

  7. [8]

    Hyperparameter Learning for Deep Learning -Based Recommender Systems,

    D. Wu, B. Sun, and M. Shang, “Hyperparameter Learning for Deep Learning -Based Recommender Systems,” IEEE Trans. Serv. Comput., vol. 16, no. 4, pp. 2699–2712, 2023, doi: 10.1109/TSC.2023.3234623

    arXiv 2023

  8. [9]

    YOLO9000: Better, Faster, Stronger,

    J. Redmon and A. Farhadi, “YOLO9000: Better, Faster, Stronger,” in 2017 IEEE Conference on Computer Vision and Pattern Recogn ition, CVPR 2017, Honolulu, HI, USA, July 21-26, 2017, 2017, pp. 6517 –6525. doi: 10.1109/CVPR.2017.690

    doi:10.1109/cvpr.2017.690 2017

Show all 73 references
  1. [10]

    Yolov5 release v7.0

    Jocher Glenn. Yolov5 release v7.0. https://github. com/ultralytics/yolov5/tree/v7.0, 2022

    2022

  2. [11]

    Jocher Glenn. Yolov8. https://github.com/ ultralytics/ultralytics/tree/main, 2023

    2023

  3. [12]

    Food Photo Recognition for Dietary Tracking: System and Experiment,

    Z. Ming, J. Chen, Y. Cao, C. Forde, C.-W. Ngo, and T.-S. Chua, “Food Photo Recognition for Dietary Tracking: System and Experiment,” in MultiMedia Modeling - 24th International Conference, MMM 2018, Bangkok, Thailand, February 5 -7, 2018, Proceedings, Part II, 2018, vol. 10705...

    2018 doi

  4. [13]

    End -to-End Object Detection with Transformers,

    N. Carion, F. Massa, G. Synnaeve, N. Usunier, A. Kirillov, and S. Zagoruyko, “End -to-End Object Detection with Transformers,” in Computer Vision - ECCV 2020 - 16th European Conference, Glasgow, UK, August 23 -28, 2020, Proceedings, Part I, 2020, vol. 12346, pp. 213 –229. doi:...

    2020 doi

  5. [14]

    Deep Residual Learning for Image Recognition,

    K. He, X. Zhang, S. Ren, and J. Sun, “Deep Residual Learning for Image Recognition,” in 2016 IEEE Conference on Computer Visi on and Pattern Recognition, CVPR 2016, Las Vegas, NV, USA, June 27 -30, 2016, 2016, pp. 770–778. doi: 10.1109/CVPR.2016.90

    2016 doi

  6. [15]

    A Highly Accurate Framework for Self -Labeled Semisupervised Classification in Industrial Applications,

    D. Wu, X. Luo, G. Wang, M. Shang, Y. Yuan, and H. Yan, “A Highly Accurate Framework for Self -Labeled Semisupervised Classification in Industrial Applications,” IEEE Trans. Ind. Informatics, vol. 14, no. 3, pp. 909 –920, 2018, doi: 10.1109/TII.2017.2737827

    2018

  7. [16]

    Combining deep residual neural network features with supervised machin e learning algorithms to classify diverse food image datasets,

    P. McAllister, H. Zheng, R. R. Bond, and A. Moorhead, “Combining deep residual neural network features with supervised machin e learning algorithms to classify diverse food image datasets,” Comput. Biol. Medicine, vol. 95, pp. 217 –233, 2018, doi: 10.1016/J.COMPBIOMED.2018.02.008

    2018 doi

  8. [17]

    Going deeper with convolutions,

    C. Szegedy et al., “Going deeper with convolutions,” in IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2015, Boston, MA, USA, June 7-12, 2015, 2015, pp. 1–9. doi: 10.1109/CVPR.2015.7298594

    2015

  9. [18]

    Intelligent system for the visual support of caloric intake of food in inhabitants of a smart city using a deep learning model,

    J. Mejí a, A. Ochoa-Zezzatti, R. Contreras-Masse, et al., "Intelligent system for the visual support of caloric intake of food in inhabitants of a smart city using a deep learning model," in Applications of Hybrid Metaheuristic Algorithms for Image Processi ng, 2020, pp. 441-455

    2020

  10. [19]

    Mask R -CNN,

    K. He, G. Gkioxari, P. Dollár, and R. B. Girshick, “Mask R -CNN,” in IEEE International Conference on Computer Vision, ICCV 2017, Venice, Italy, October 22-29, 2017, 2017, pp. 2980–2988. doi: 10.1109/ICCV.2017.322

    2017 doi

  11. [20]

    Scale factor local search in differential evolution,

    F. Neri and V. Tirronen, “Scale factor local search in differential evolution,” Memetic Comput., vol. 1, no. 2, pp. 153 –171, 2009, doi: 10.1007/S12293 - 009-0008-9

    2009 doi

  12. [21]

    MMLF: Multi-Metric Latent Feature Analysis for High -Dimensional and Incomplete Data,

    D. Wu, P. Zhang, Y. He, and X. Luo, “MMLF: Multi-Metric Latent Feature Analysis for High -Dimensional and Incomplete Data,” IEEE Trans. Serv. Comput., vol. 17, no. 2, pp. 575 –588, 2024, doi: 10.1109/TSC.2023.3331570

    2024

  13. [22]

    Online Learning From Incomplete and Imbalanced Data Streams,

    D. You et al., “Online Learning From Incomplete and Imbalanced Data Streams,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 10, pp. 10650 –10665, 2023, doi: 10.1109/TKDE.2023.3250472

    2023

  14. [23]

    Weighted boxes fusion: Ensembling boxes from different object detection models,

    R. A. Solovyev, W. Wang, and T. Gabruseva, “Weighted boxes fusion: Ensembling boxes from different object detection models,” Image Vis. Comput., vol. 107, p. 104117, 2021, doi: 10.1016/J.IMAVIS.2021.104117

    2021

  15. [24]

    An outlier-resilient autoencoder for representing high-dimensional and incomplete data,

    D. Wu, Y. Hu, K. Liu, J. Li, X. Wang, S. Deng, N. Zheng, and X. Luo, "An outlier-resilient autoencoder for representing high-dimensional and incomplete data," IEEE Trans. Emerg. Topics Comput. Intell., early access, doi: 10.1109/TETCI.2024.3437370

  16. [25]

    A state-migration particle swarm optimizer for adaptive latent factor analysis of high-dimensional and incomplete data,

    J. Chen, K. Liu, X. Luo, Y. Yuan, K. Sedraoui, Y. Al-Turki, and M. Zhou, "A state-migration particle swarm optimizer for adaptive latent factor analysis of high-dimensional and incomplete data," IEEE/CAA J. Autom. Sinica, early access, doi: 10.1109/JAS.2024.124575

  17. [26]

    Generalized Intersection Over Union: A Metric a nd a Loss for Bounding Box Regression,

    H. Rezatofighi, N. Tsoi, J. Gwak, A. Sadeghian, I. D. Reid, and S. Savarese, “Generalized Intersection Over Union: A Metric a nd a Loss for Bounding Box Regression,” in IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2019, Long Beach, CA, U SA, June 16-20, 201...

    2019

  18. [27]

    Pseudo Gradient -Adjusted Particle Swarm Optimization for Accurate Adaptive Latent Factor Analysis,

    X. Luo, J. Chen, Y. Yuan, and Z. Wang, “Pseudo Gradient -Adjusted Particle Swarm Optimization for Accurate Adaptive Latent Factor Analysis,” IEEE Trans. Syst. Man Cybern. Syst., vol. 54, no. 4, pp. 2213 –2226, 2024, doi: 10.1109/TSMC.2023.3340919

    2024

  19. [28]

    Online Semi -supervised Learning with Mix -Typed Streaming Features,

    D. Wu, S. Zhuo, Y. Wang, Z. Chen, and Y. He, “Online Semi -supervised Learning with Mix -Typed Streaming Features,” in Thirty -Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty -Fifth Conference on Innovative Applications of Artificial Inte lligence, IAAI 2...

    2023 doi

  20. [29]

    Convolutional networks for images, speech, and time series,

    Y. LeCun and Y. Bengio, “Convolutional networks for images, speech, and time series,” in The Handbook of Brain Theory and Neu ral Networks, Cambridge, MA, USA: MIT Press, 1998, pp. 255 –258

    1998

  21. [30]

    Grab, Pay, and Eat: Semantic Food Detection for Smart Restaurants,

    E. Aguilar, B. Remeseiro, M. Bolaños, and P. Radeva, “Grab, Pay, and Eat: Semantic Food Detection for Smart Restaurants,” IEE E Trans. Multim., vol. 20, no. 12, pp. 3266–3275, 2018, doi: 10.1109/TMM.2018.2831627

    2018

  22. [31]

    Mining discriminative food regions for accurate food recognition,

    J. Qiu, F. P. -W. Lo, Y. Sun, S. Wang, and B. Lo, “Mining discriminative food regions for accurate food recognition,” in Proc. Brit. Mach. V is. Conf., 2019, pp. 588–598

    2019

  23. [32]

    A Double -Space and Double -Norm Ensembled Latent Factor Model for Highly Accurate Web Service QoS Prediction,

    D. Wu, P. Zhang, Y. He, and X. Luo , “A Double -Space and Double -Norm Ensembled Latent Factor Model for Highly Accurate Web Service QoS Prediction,” IEEE Trans. Serv. Comput., vol. 16, no. 2, pp. 802 –814, 2023, doi: 10.1109/TSC.2022.3178543

    2023

  24. [33]

    Robust Low-Rank Latent Feature Analysis for Spatiotemporal Signal Recovery,

    D. Wu, Z. Li, Z. Yu, Y. He, and X. Luo, “Robust Low-Rank Latent Feature Analysis for Spatiotemporal Signal Recovery,” IEEE Transactions on Neural Networks and Learning Systems, pp. 1 –14, 2023, doi: 10.1109/TNNLS.2023.3339786

    2023

  25. [34]

    A Deep Latent Factor Model for High -Dimensional and Sparse Matrices in Recommender Systems,

    D. Wu, X. Luo, M. Shang, Y. He, G. Wang, and M. Zhou, “A Deep Latent Factor Model for High -Dimensional and Sparse Matrices in Recommender Systems,” IEEE Trans. Syst. Man Cybern. Syst., vol. 51, no. 7, pp. 4285 –4296, 2021, doi: 10.1109/TSMC.2019.2931393

    2021

  26. [35]

    PMLF: Prediction -Sampling-based Multilayer-Structured Latent Factor Analysis,

    D. Wu, L. Jin, and X. Luo, “PMLF: Prediction -Sampling-based Multilayer-Structured Latent Factor Analysis,” in 20th IEEE International Conference on Data Mining, ICDM 2020, Sorrento, Italy, November 17 -20, 2020, 2020, pp. 671–680. doi: 10.1109/ICDM50108.2020.00076

    2020

  27. [36]

    A Graph -Incorporated Latent Factor Analysis Model for High -Dimensional and Sparse Data,

    D. Wu, Y. He, and X. Luo, “A Graph -Incorporated Latent Factor Analysis Model for High -Dimensional and Sparse Data,” IEEE Trans. Emerg. Top. Comput., vol. 11, no. 4, pp. 907 –917, 2023, doi: 10.1109/TETC.2023.3292866

    2023

  28. [38]

    An Adaptive Divergence -Based Non-Negative Latent Factor Model,

    Y. Yuan, R. Wang, G. Yuan, and X. Luo, “An Adaptive Divergence -Based Non-Negative Latent Factor Model,” IEEE Trans. Syst. Man Cybern. Syst., vol. 53, no. 10, pp. 6475 –6487, 2023, doi: 10.1109/TSMC.2023.3282950

    2023

  29. [39]

    Adaptive Divergence-Based Non-Negative Latent Factor Analysis of High-Dimensional and Incomplete Matrices From Industrial Applications,

    Y. Yuan, X. Luo, and M. Zhou, “Adaptive Divergence-Based Non-Negative Latent Factor Analysis of High-Dimensional and Incomplete Matrices From Industrial Applications,” IEEE Trans. Emerg. Top. Comput. Intell., vol. 8, no. 2, pp. 1209 –1222, 2024, doi: 10.1109/TETCI.2023.3332550

    2024

  30. [40]

    A Nonlinear PID-Incorporated Adaptive Stochastic Gradient Descent Algorithm for Latent Factor Analysis,

    J. Li, X. Luo, Y. Yuan, and S. Gao, “A Nonlinear PID-Incorporated Adaptive Stochastic Gradient Descent Algorithm for Latent Factor Analysis,” IEEE Trans Autom. Sci. Eng., vol. 21, no. 3, pp. 3742 –3756, 2024, doi: 10.1109/TASE.2023.3284819

    2024

  31. [41]

    Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis,

    X. Luo, Y. Yuan, S. Chen, N. Zeng, and Z. Wang, “Position-Transitional Particle Swarm Optimization-Incorporated Latent Factor Analysis,” IEEE Trans. Knowl. Data Eng., vol. 34, no. 8, pp. 3958 –3970, 2022, doi: 10.1109/TKDE.2020.3033324

    2022

  32. [42]

    A Fuzzy PID -Incorporated Stochastic Gradient Descent Algorithm for Fast and Accurate Latent Factor Analysis,

    Y. Yuan, J. Li, and X. Luo, “A Fuzzy PID -Incorporated Stochastic Gradient Descent Algorithm for Fast and Accurate Latent Factor Analysis,” IEEE Trans. Fuzzy Syst., vol. 32, no. 7, pp. 4049 –4061, 2024, doi: 10.1109/TFUZZ.2024.3389733

    2024

  33. [43]

    A Multilayered-and-Randomized Latent Factor Model for High-Dimensional and Sparse Matrices,

    Y. Yuan, Q. He, X. Luo, and M. Shang, “A Multilayered-and-Randomized Latent Factor Model for High-Dimensional and Sparse Matrices,” IEEE Trans. Big Data, vol. 8, no. 3, pp. 784 –794, 2022, doi: 10.1109/TBDATA.2020.2988778

    2022

  34. [44]

    MKG-FENN: A multimodal knowledge graph fused end -to-end neural network for accurate drug -drug interaction prediction,

    D. Wu, W. Sun, Y. He, Z. Chen, and X. Luo, "MKG-FENN: A multimodal knowledge graph fused end -to-end neural network for accurate drug -drug interaction prediction," in Proc. AAAI Conf. Artif. Intell., early access, 2024, pp. 1-9

    2024

  35. [45]

    A Lightweight Dynamic Storage Algorithm With Adaptive Encoding for Energy Internet,

    S. Deng, Y. Zhai, D. Wu, D. Yue, X. Fu, and Y. He, “A Lightweight Dynamic Storage Algorithm With Adaptive Encoding for Energy Internet,” IEEE Trans. Serv. Comput., vol. 16, no. 5, pp. 3115 –3128, 2023, doi: 10.1109/TSC.2023.3262635

    2023

  36. [46]

    A Quantitative Risk Assessment Model for Distribution Cyber-Physical System Under Cyberattack,

    S. Deng, J. Zhang, D. Wu, Y. He, X. Xie, and X. Wu, “A Quantitative Risk Assessment Model for Distribution Cyber-Physical System Under Cyberattack,” IEEE Transactions on Industrial Informatics, vol. 19, no. 3, pp. 2899 –2908, 2023, doi: 10.1109/TII.2022.316 9456

    2023 doi

  37. [47]

    An α-β-Divergence-Generalized Recommender for Highly Accurate Predictions of Missing User Preferences,

    M. Shang, Y. Yuan, X. Luo, and M. Zhou, “An α-β-Divergence-Generalized Recommender for Highly Accurate Predictions of Missing User Preferences,” IEEE Trans. Cybern., vol. 52, no. 8, pp. 8006 –8018, 2022, doi: 10.1109/TCYB.2020.3026425

    2022

  38. [48]

    Non-Negative Latent Factor Model Based on β-Divergence for Recommender Systems,

    X. Luo, Y. Yuan, M. Zhou, Z. Liu, and M. Shang, “Non-Negative Latent Factor Model Based on β-Divergence for Recommender Systems,” IEEE Trans. Syst. Man Cybern. Syst., vol. 51, no. 8, pp. 4612 –4623, 2021, doi: 10.1109/TSMC.2019.2931468

    2021

  39. [49]

    Randomized latent factor model for high -dimensional and sparse matrices from industrial applications,

    M. Shang, X. Luo, Z. Liu, J. Chen, Y. Yuan, and M. Zhou, “Randomized latent factor model for high -dimensional and sparse matrices from industrial applications,” IEEE CAA J. Autom. Sinica, vol. 6, no. 1, pp. 131 –141, 2019, doi: 10.1109/JAS.2018.7511189

    2019

  40. [50]

    SDGNN: Symmetry-Preserving Dual-Stream Graph Neural Networks,

    J. Chen, Y. Yuan, and X. Luo, “SDGNN: Symmetry-Preserving Dual-Stream Graph Neural Networks,” IEEE CAA J. Autom. Sinica, vol. 11, no. 7, pp. 1717–1719, 2024, doi: 10.1109/JAS.2024.124410

    2024

  41. [51]

    Online Learning for Data Streams With Incomplete Features and Labels,

    D. You et al., “Online Learning for Data Streams With Incomplete Features and Labels,” IEEE Trans. Knowl. Data Eng., vol. 36, no. 9, pp. 4820–4834, 2024, doi: 10.1109/TKDE.2024.3374357

    2024

  42. [52]

    HRST -LR: A Hessian Regularization Spatio -Temporal Low Rank Algorithm for Traffic Data Imputation,

    X. Xu, M. Lin, X. Luo, and Z. Xu, “HRST -LR: A Hessian Regularization Spatio -Temporal Low Rank Algorithm for Traffic Data Imputation,” IEEE Transactions on Intelligent Transportation Systems, vol. 24, no. 10, pp. 11001 –11017, 2023, doi: 10.1109/TITS.2023.3279321

    2023

  43. [53]

    A Kalman -Filter-Incorporated Latent Factor Analysis Model for Temporally Dynamic Sparse Data,

    Y. Yuan, X. Luo, M. Shang, and Z. Wang, “A Kalman -Filter-Incorporated Latent Factor Analysis Model for Temporally Dynamic Sparse Data,” IEEE Transactions on Cybernetics, vol. 53, no. 9, pp. 5788 –5801, 2023, doi: 10.1109/TCYB.2022.3185117

    2023

  44. [54]

    An Effective Link-Based Clustering Algorithm for Detecting Overlapping Protein Complexes in Protein- Protein Interaction Networks,

    L. Hu, J. Zhang, X. Pan, X. Luo, and H. Yuan, “An Effective Link-Based Clustering Algorithm for Detecting Overlapping Protein Complexes in Protein- Protein Interaction Networks,” IEEE Transactions on Network Science and Engineering, vol. 8, no. 4, pp. 3275 –3289, 2021, doi: 10...

    2021

  45. [55]

    Neural Dynamics for Distributed Collaborative Control of Manipulators With Time Delays,

    L. Jin, X. Zheng, and X. Luo , “Neural Dynamics for Distributed Collaborative Control of Manipulators With Time Delays,” IEEE/CAA Journal of Automatica Sinica, vol. 9, no. 5, pp. 854 –863, 2022, doi: 10.1109/JAS.2022.105446

    2022

  46. [56]

    A Data -Characteristic-Aware Latent Factor Model for Web Services QoS Prediction,

    D. Wu, X. Luo, M. Shang, Y. He, G. Wang, and X. Wu, “A Data -Characteristic-Aware Latent Factor Model for Web Services QoS Prediction,” IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 6, pp. 2525 –2538, 2022, doi: 10.1109/TKDE.2020.3014302

    2022

  47. [57]

    A Fast Nonnegative Autoencoder -Based Approach to Latent Feature Analysis on High -Dimensional and Incomplete Data,

    F. Bi, T. He, and X. Luo, “A Fast Nonnegative Autoencoder -Based Approach to Latent Feature Analysis on High -Dimensional and Incomplete Data,” IEEE Transactions on Services Computing, vol. 17, no. 3, pp. 733 –746, 2024, doi: 10.1109/TSC.2023.3319713

    2024

  48. [58]

    Multi-Constrained Embedding for Accurate Community Detection on Undirected Networks,

    Q. Wang, X. Liu, T. Shang, Z. Liu, H. Yang, and X. Luo, “Multi-Constrained Embedding for Accurate Community Detection on Undirected Networks,” IEEE Transactions on Network Science and Engineering, vol. 9, no. 5, pp. 3675 –3690, 2022, doi: 10.1109/TNSE.2022.3176062

    2022

  49. [59]

    Symmetry and Nonnegativity -Constrained Matrix Factorization for Community Detection,

    Z. Liu, G. Yuan, and X. Luo , “Symmetry and Nonnegativity -Constrained Matrix Factorization for Community Detection,” IEEE/CAA Journal of Automatica Sinica, vol. 9, no. 9, pp. 1691 –1693, 2022, doi: 10.1109/JAS.2022.105794

    2022

  50. [60]

    An Alternating -Direction-Method of Multipliers -Incorporated Approach to Symmetric Non -Negative Latent Factor Analysis,

    X. Luo, Y. Zhong, Z. Wang, and M. Li, “An Alternating -Direction-Method of Multipliers -Incorporated Approach to Symmetric Non -Negative Latent Factor Analysis,” IEEE Transactions on Neural Networks and Learning Systems, vol. 34, no. 8, pp. 4826 –4840, 2023, doi: 10.1109/TNNLS...

    2023

  51. [61]

    Stochastic Modeling and Performance Analysis of Migration -Enabled and Error -Prone Clouds,

    Y. Xia, M. Zhou, X. Luo, S. Pang, and Q. Zhu, “Stochastic Modeling and Performance Analysis of Migration -Enabled and Error -Prone Clouds,” IEEE Transactions on Industrial Informatics, vol. 11, no. 2, pp. 495 –504, 2015, doi: 10.1109/TII.2015.2405792

    2015

  52. [62]

    FCAN-MOPSO: An Improved Fuzzy -Based Graph Clustering Algorithm for Complex Networks With Multiobjective Particle Swarm Optimization,

    L. Hu, Y. Yang, Z. Tang, Y. He, and X. Luo, “FCAN-MOPSO: An Improved Fuzzy -Based Graph Clustering Algorithm for Complex Networks With Multiobjective Particle Swarm Optimization,” IEEE Transactions on Fuzzy Systems, vol. 31, no. 10, pp. 3470 –3484, 2023, doi: 10.1109/TFUZZ.202...

    2023

  53. [63]

    A Robust Coevolutionary Neural -Based Optimization Algorithm for Constrained Nonconvex Optimization,

    L. Wei, L. Jin, and X. Luo , “A Robust Coevolutionary Neural -Based Optimization Algorithm for Constrained Nonconvex Optimization,” IEEE Transactions on Neural Networks and Learning Systems, vol. 35, no. 6, pp. 7778 –7791, 2024, doi: 10.1109/TNNLS.2022.3220806

    2024

  54. [64]

    An Asynchronously Alternative Stochastic Gradient Descent Algorithm for Efficiently Parallel Latent Feature Analysis on Sh ared- Memory,

    W. Qin and X. Luo, “An Asynchronously Alternative Stochastic Gradient Descent Algorithm for Efficiently Parallel Latent Feature Analysis on Sh ared- Memory,” in 2022 IEEE International Conference on Knowledge Graph (ICKG), 2022, pp. 217 –224. doi: 10.1109/ICKG55886.2022.00035

    2022

  55. [65]

    Monarch butterfly optimization: A comprehensive review,

    Y. Feng, S. Deb, G.-G. Wang, and A. H. Alavi, “Monarch butterfly optimization: A comprehensive review,” Expert Systems with Applications, vol. 168, p. 114418, 2021, doi: https://doi.org/10.1016/j.eswa.2020.114418

    2021

  56. [66]

    Harris hawks optimization: Algorithm and applica tions,

    A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, and H. Chen, “Harris hawks optimization: Algorithm and applica tions,” Future Generation Computer Systems, vol. 97, pp. 849 –872, 2019, doi: https://doi.org/10.1016/j.future.2019.02.028

    2019 doi

  57. [67]

    Advances in sine cosine algorithm: a comprehensive survey,

    L. Abualigah and A. Diabat, “Advances in sine cosine algorithm: a comprehensive survey,” Artificial Intelligence Review, vol. 54, no. 4, pp. 2567–2608, 2021

    2021

  58. [68]

    The Arithmetic Optimization Algorithm,

    L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz, and A. H. Gandomi, “The Arithmetic Optimization Algorithm,” Computer Methods in Applied Mechanics and Engineering, vol. 376, p. 113609, 2021, doi: https://doi.org/10.1016/j.cma.2020.113609

    2021

  59. [69]

    Accurate Latent Factor Analysis via Particle Swarm Optimizers,

    J. Chen, X. Luo, and M. Zhou, “Accurate Latent Factor Analysis via Particle Swarm Optimizers,” in 2021 IEEE International Conference on Syst ems, Man, and Cybernetics (SMC), 2021, pp. 2930 –2935. doi: 10.1109/SMC52423.2021.9659218

    2021

  60. [70]

    Hierarchical Particle Swarm Optimization -incorporated Latent Factor Analysis for Large -Scale Incomplete Matrices,

    J. Chen, X. Luo, and M. Zhou, “Hierarchical Particle Swarm Optimization -incorporated Latent Factor Analysis for Large -Scale Incomplete Matrices,” IEEE Transactions on Big Data, vol. 8, no. 6, pp. 1524 –1536, 2022, doi: 10.1109/TBDATA.2021.3090905

    2022

  61. [71]

    An Adaptive Latent Factor Model via Particle Swarm Optimization for High -Dimensional and Sparse Matrices,

    S. Chen, Y. Yuan, and J. Wang, “An Adaptive Latent Factor Model via Particle Swarm Optimization for High -Dimensional and Sparse Matrices,” in 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), 2019, pp. 1738 –1743. doi: 10.1109/SMC.2019.8914673

    2019

  62. [72]

    Fast Matrix Factorization With Nonuniform Weights on Missing Data,

    X. He, J. Tang, X. Du, R. Hong, T. Ren, and T.-S. Chua, “Fast Matrix Factorization With Nonuniform Weights on Missing Data,” IEEE Transactions on Neural Networks and Learning Systems, vol. 31, no. 8, pp. 2791 –2804, 2020, doi: 10.1109/TNNLS.2018.2890117

    2020

  63. [73]

    Adaptively-Accelerated Parallel Stochastic Gradient Descent for High-Dimensional and Incomplete Data Representation Learning,

    W. Qin, X. Luo, and M. Zhou, “Adaptively-Accelerated Parallel Stochastic Gradient Descent for High-Dimensional and Incomplete Data Representation Learning,” IEEE Transactions on Big Data, vol. 10, no. 1, pp. 92 –107, 2024, doi: 10.1109/TBDATA.2023.3326304

    2024

  64. [74]

    MMA: Multi-Metric-Autoencoder for Analyzing High -Dimensional and Incomplete Data,

    C. Liang, D. Wu, Y. He, T. Huang, Z. Chen, and X. Luo, “MMA: Multi-Metric-Autoencoder for Analyzing High -Dimensional and Incomplete Data,” in Machine Learning and Knowledge Discovery in Databases: Research Track, 2023, pp. 3 –19

    2023

  65. [75]

    Asynchronous Parallel Fuzzy Stochastic Gradient Descent for High -Dimensional Incomplete Data Representation,

    W. Qin and X. Luo , “Asynchronous Parallel Fuzzy Stochastic Gradient Descent for High -Dimensional Incomplete Data Representation,” IEEE Transactions on Fuzzy Systems, vol. 32, no. 2, pp. 445 –459, 2024, doi: 10.1109/TFUZZ.2023.3300370

    2024

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.