DLDongdong Lv

Dongdong Lv

*This is an algorithmically generated author record based on publicly available information.

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


Dongdong Lv has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Streaming Graph Hybrid Partitioning Method to Capture Multipatterns via the Incremental Lightweight GNN

    by Zhipeng Sun, Chaoze Lu, Dongdong Lv, Youli Fang

    With dynamic big graphs becoming mainstream in recent years, existing graph partitioning methods struggle to capture the complex semantics and dynamic characteristics of streaming graphs. This limitation leads to graph k-way partitioning outcomes that cannot efficiently support parallel and distributed computing, thereby failing to meet the high-performance demands of dynamic graph processing. Furthermore, while Graph Neural Networks (GNNs) have achieved remarkable performance across various graph computing domains, research on GNN models specifically tailored for dynamic graph partitioning remains scarce. To address the above issues, this paper introduces SP_iLGNN, a streaming graph hybrid partitioning method to capture multi-patterns via the incremental lightweight GNN. Our method performs online streaming graph partitioning over multiple consecutive time windows and formulates an objective that integrates multi-patterns. During the initial time window, the arrived graph data undergoes augmentation and coarsening, and the coarsened graph data serves as the input to the constructed lightweight network model. The partitioning objective is then integrated with this model for joint mini-batch training, yielding optimized model parameters and k initial partitions. For following time windows, the previous partition is reused. Guided by the current graph change information, an incremental partitioning step is applied to new data and locally affected subgraphs. Subsequently, the model undergoes fine-tuning and updates. This methodology avoids expensive retraining from scratch, minimizes the scale of training data needed, and significantly speeds up the processing of subsequent streaming graphs. Extensive experiments indicate that SP_iLGNN effectively achieves conventional partitioning goals while more effectively maintaining the locality and dynamic characteristics inherent to streaming graphs. Furthermore, compared to the state-of-the-art incremental partitioning algorithm iG-kway, our method demonstrates improved online partitioning performance for streaming graphs.

  • MPPL: Mean-Based Privacy-Preserving Localization With Linear Complexity for High-Precision Crowdsourcing Systems

    by Shengming Chang, Lincan Li, Dongdong Lv, He Xu

    Accurate localization is fundamental for internet of things (IoT) applications but introduces significant privacy risks in crowdsourcing-based systems. Conventional privacy-preserving techniques suffer from critical limitations: subtraction-based models sacrifice positioning accuracy by discarding measurement equations; cryptographic solutions incur prohibitive computation overhead; while secret-sharing approaches expose target locations. To address these challenges, we propose the mean-based subtraction localization (MSL) model that preserves all measurement equations through global averaging, eliminating information loss while establishing a privacy-conducive mathematical framework. Building on MSL, we develop the mean-based privacy-preserving localization (MPPL) algorithm featuring: 1) matrix decomposition for bidirectional privacy isolation, 2) lightweight secure summation/multiplication primitives, and 3) linear-complexity operations. Rigorous theoretical verification confirms MPPL’s feasibility, correctness, information-theoretic privacy, and efficiency. Experimental results demonstrate 10% – 14% higher accuracy than privacy-preserving multi-lateral localization (PPPL)/efficient privacy-preserving localization (EPPL) under noise while reducing computation time by a factor of 2.8 versus homomorphic encryption schemes, establishing a new paradigm for high-precision privacy-aware localization.

  • LEFE-Net: Lightweight Edge Feature Enhancement for Salient Object Detection in UAV Real-Time Systems

    by Ning Jia, Mingkai Zhen, Dongdong Lv, Xianhui Liu, Zhongxiang Wei

    Salient object detection (SOD) is a fundamental component of unmanned aerial vehicle (UAV) vision systems, as it enhances autonomous perception and facilitates precise target localization. However, achieving an optimal balance between model efficiency and detection accuracy remains a significant challenge, particularly in resource-constrained scenarios, such as UAVs. To address this issue, a lightweight SOD framework enhanced with edge information is proposed, aiming to achieve both high efficiency and high precision under limited computational resources. First, an edge-aware depthwise separable convolution module is introduced to replace conventional encoder operations, thereby enhancing spatial detail preservation while reducing computational cost. Second, a novel edge feature enhancement module is designed to extract fine-grained edge features from encoder outputs and to guide the decoder in reconstructing object with higher accuracy. Third, an edge-integrated loss function is developed by incorporating edge supervision into the standard cross-entropy loss, thereby further improving the model’s capability to delineate salient object boundaries. Extensive experiments conducted on multiple benchmark SOD datasets demonstrate that the proposed method achieves competitive, and in some cases superior, performance compared to existing state-of-the-art lightweight models, while maintaining low-computational complexity. The proposed framework provides a promising solution for real-time and energy-efficient SOD in low-power computing environments.


  • Open Access

    Selection of the optimal trading model for stock investment in different industries

    by Dongdong Lv, Zhenhua Huang, Meizi Li, Yang Xiang

    In general, the stock prices of the same industry have a similar trend, but those of different industries do not. When investing in stocks of different industries, one should select the optimal model from lots of trading models for each industry because any model may not be suitable for capturing the stock trends of all industries. However, the study has not been carried out at present. In this paper, firstly we select 424 S&P 500 index component stocks (SPICS) and 185 CSI 300 index component stocks (CSICS) as the research objects from 2010 to 2017, divide them into 9 industries such as finance and energy respectively. Secondly, we apply 12 widely used machine learning algorithms to generate stock trading signals in different industries and execute the back-testing based on the trading signals. Thirdly, we use a non-parametric statistical test to evaluate whether there are significant differences among the trading performance evaluation indicators (PEI) of different models in the same industry. Finally, we propose a series of rules to select the optimal models for stock investment of every industry. The analytical results on SPICS and CSICS show that we can find the optimal trading models for each industry based on the statistical tests and the rules. Most importantly, the PEI of the best algorithms can be significantly better than that of the benchmark index and “Buy and Hold” strategy. Therefore, the algorithms can be used for making profits from industry stock trading.


  • Open Access

    An Empirical Study of Machine Learning Algorithms for Stock Daily Trading Strategy

    by Dongdong Lv, Shuhan Yuan, Meizi Li, Yang Xiang

    According to the forecast of stock price trends, investors trade stocks. In recent years, many researchers focus on adopting machine learning (ML) algorithms to predict stock price trends. However, their studies were carried out on small stock datasets with limited features, short backtesting period, and no consideration of transaction cost. And their experimental results lack statistical significance test. In this paper, on large‐scale stock datasets, we synthetically evaluate various ML algorithms and observe the daily trading performance of stocks under transaction cost and no transaction cost. Particularly, we use two large datasets of 424 S&P 500 index component stocks (SPICS) and 185 CSI 300 index component stocks (CSICS) from 2010 to 2017 and compare six traditional ML algorithms and six advanced deep neural network (DNN) models on these two datasets, respectively. The experimental results demonstrate that traditional ML algorithms have a better performance in most of the directional evaluation indicators. Unexpectedly, the performance of some traditional ML algorithms is not much worse than that of the best DNN models without considering the transaction cost. Moreover, the trading performance of all ML algorithms is sensitive to the changes of transaction cost. Compared with the traditional ML algorithms, DNN models have better performance considering transaction cost. Meanwhile, the impact of transparent transaction cost and implicit transaction cost on trading performance are different. Our conclusions are significant to choose the best algorithm for stock trading in different markets.