检索结果-内蒙古大学图书馆

2023 China Automation Congress, CAC 2023

作者： Wang, Lei Huang, Wei Chen, Yiping Chen, Hao Liu, Chuang Yin, Jun School of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China School of Internet of Things Nanjing University of Posts and Telecommunications Nanjing210023 China

ISBN: (纸本)9798350303759

This paper proposes a scene segmentation method based on optimized line detection to address the difficulty of segmenting spatially independent equipment in complex substation scenes. The method first employs the RANSAC method to simulate the ground plane and extract the ground point cloud. Then, it projects the 3D point cloud scene onto a 2D plane to obtain a 2D image of the substation. Straight line segments of the power line are extracted from the image using the edge detection algorithm and an improved line detection algorithm. The straight line segments that do not belong to the power line are filtered out using the surrounding features of the 3D point corresponding to the 2D point on the line. The power line's straight line segment is extended using the region-growing algorithm. Finally, the power line clustering is completed using European clustering based on the three-dimensional coordinates of the two ends of the power line, thereby completing the scene segmentation. Experimental results show that the proposed method can effectively segment substation equipment. Compared to traditional segmentation methods, this method has an average power line identification accuracy of 14% higher. © 2023 IEEE.

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

CROA: A content-based recommendation optimization algorithm for personalized knowledge services 21

CROA: A content-based recommendation optimization algorithm ...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on data Science and Systems, HPCC/SmartCity/DSS 2019

作者： Sun, Xiao Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Information explosion is a typical feature of the big data. Learners can easily find a wide variety of knowledge information online. However, the expansion of information also makes it difficult for learners to retrieve the information they want and fall into the problem of knowledge overload. In order to solve this problem effectively, we propose a content-based recommendation optimization algorithm for personalized knowledge services (CROA). First, the feature vector model is established, where each item information is represented by specific words and key information is highlighted by weighting. Second, a dynamic user vector model is then established to capture the latest preference information of the user. Finally, the feature vector model is combined with the multi-user comparison results thereby obtaining a list of recommendations. Experimental results indicate that CROA outstands in knowledge recommendation mechanism and can also alleviate knowledge overload. © 2019 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

MDPFL:A Multiple Differential Privacy Protection Method based on Federated Learning

MDPFL:A Multiple Differential Privacy Protection Method base...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Xinyu Liu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

With the continuous development of artificial intelligence technology, machine learning in distributed network systems, such as IoVflntemet of Vehicles), will inevitably lead to privacy leakage. At present, there are lots of problems in federated learning, differential privacy and other machine learning privacy protection schemes, such as high loss of availability and the need of a fully trusted third-party server. In order to solve these problems, we propose MDPFL(Multiple Differential Privacy based on Federated Learning) algorithm. The algorithm combines with the differential privacy model in each stage of federated learning to solve the problem of curious third-party data collectors obtaining users’ original data in the process of machine learning. Meanwhile, the algorithm does not adopt a decentralized machine learning scheme directly, but uses a double noise adding mode with the existence of the third-party data collectors. We use Laplacian mechanism in the central server and GRR mechanism in local clients to ensure the goal of stability of the effect of the machine ¡earning model. The algorithm is compared with FedAvg, CDP, LDP algorithm in accuracy and loss rate which based on EMNIST data sets. In different global sensitivities, the model training effect is consistent with FedAvg algorithm while comparing with LDP algorithm, the speed of model convergence is improved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robustness May be at Odds with Stability in Adversarial Training based Feature Selection?

Robustness May be at Odds with Stability in Adversarial Trai...

引用

IEEE International Conference on data Mining (ICDM)

作者： Yue Liu Yun Li Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

As an important stage in machine learning pipeline, feature selection techniques are mainly used to improve the generalization performance and training efficiency of machine learning model, but few works have focused on the robustness of machine learning models from the perspective of feature selection when dealing with adversarial attacks. In this paper, we propose the adversarial training (AT) based feature selection framework, i.e. AT based feature selection, to improve the robustness of machine learning model built on the feature selection result, which is inspired by using adversarial training to improve the robustness of deep learning model. AT based feature selection framework is the combination of adversarial training with some traditional feature selection algorithm, which can be divided into AT in-processing and AT post-processing feature selection. On the other hand, stability is also a very important property for feature selection. Then we experimentally analyze the relationship between robustness and stability of AT based feature selection, especially theoretically analyze the stability of $\ell_processing$ regularized AT in-processing feature selection algorithm in two different adversarial training forms. Our experimental results on benchmark data sets show that AT based feature selection algorithm is effective to improve the robustness of machine learning model, however, obtain lower stability than corresponding feature selection model without AT.

关键词： Training Deep learning Machine learning algorithms Pipelines Benchmark testing Feature extraction Stability analysis

来源：评论

学校读者我要写书评

暂无评论

An optimal profit route planning scheme based on ACO-OPP 21

An optimal profit route planning scheme based on ACO-OPP

引用

作者： Qiu, Yuhua Xu, Xiaolong Xia, Fei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China Information and communication Branch State Grid Jiangsu Electric Power Company Nanjing China

ISBN: (纸本)9781728120584

Taxi plays an important role of urban public transportation system. However, without appropriate route planning scheme, taxi drivers can only choose to wait or seek passengers in the absence of orders, leading to wasting a lot of time and fuel. In this paper, an optimal profit route planning scheme for taxi drivers with Ant Colony Optimization Algorithm based on Optimal Profit Points (ACO-OPP) is proposed. First, the taxi trajectory data are preprocessed and the pick-up and drop-off points are extracted to obtain high-quality data;second, the data spatiotemporal distribution is analyzed to plan a more appropriate and rational route;the clustering algorithm is used to obtain the optimal profit points to increase the occupancy rate of taxis;then, ACO-OPP is utilized to plan the profit routes for each taxi. A series of experiments are implemented based on the real taxi trajectory dataset to test and compare the performance of the simulated annealing algorithm, the genetic algorithm, the ant colony algorithm and ACO-OPP on the optimal route length and the profitability with the unit time profit function. The experimental results show that ACO-OPP has the shortest optimal route length and the best profit per unit time. © 2019 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

SNNLog: A Log Parsing Scheme with Siamese Network and Fixed Depth Tree in Networks

SNNLog: A Log Parsing Scheme with Siamese Network and Fixed ...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Lei Sun Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

Syslog records critical information of network when the system is running, and has been used to help practitioners carry out various network maintenance and operation activities. Because of abundance of syslog, automated log analysis technology is needed to complete the above activities. Usually, log parsing is an important part of log analysis. Previous log parsing methods have good achievements, but they heavily rely on well-designed regular expressions and ignore semantic information of log. To solve these problems, we propose a novel log parsing method SNNLog, which uses Siamese Network to assess the similarity between log messages, and the similarity is used for the subsequent parsing. In addition, after parsing, SNNLog merges log similar events, reducing the misjudgment rate caused by non-numeric token variables at the beginning of messages. We evaluated on five publicly accessible log datasets and the results show that compared with SOTA algorithms such as LogMine, Spell, Drain and MoLFI, SNNLog has an F1-score of 0.999 on five datasets, and parsing accuracy of four datasets is the highest.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modeling Disease Progression via Weakly Supervised Temporal Multitask Matrix Completion

Modeling Disease Progression via Weakly Supervised Temporal ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lingsheng Wang Lei Xu Ping Li Siming Zha Lei Chen Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728185262

ISBN: (纸本)9781728185279

Alzheimer's disease (AD) is one of the most common neurodegenerative diseases. Understanding AD progression can empower the patients in taking proactive care. Mini Mental State Examination (MMSE) and AD Assessment Scale Cognitive subscale (ADAS-Cog) are two prevailing clinical measures designed to evaluate the AD progression. In this paper, we propose a weakly supervised Temporal Multitask Matrix Completion (TMMC) framework, which combines a novel transductive multitask feature selection scheme, to simultaneously predict AD progression measured by MMSE and ADAS-Cog, and identify related biomarkers trackable of AD progression. Specifically, by treating the prediction of cognitive scores at each time point as a regression task, we first formulate AD progression problem as a standard Multitask Matrix Completion (MMC) model. Secondly, considering the limited number of samples available in this study, we introduce a transductive feature selection scheme to jointly select the task-shared features for multiple time points and the task-specific features for different time points, and thus alleviate the over-fitting defect caused by Small-Sample-Size issue. Thirdly, aiming at the small change of cognitive scores between successive time points for a patient, we employ a temporal regularization scheme to capture the temporal smoothness of cognitive scores. Furthermore, we design an efficient optimization algorithm based on Alternative Minimization and Difference of Convex Programming techniques to solve the proposed TMMC framework. Finally, the extensive experiments performed on real-world Alzheimer's disease dataset demonstrate the effectiveness of our TMMC framework.

关键词： Predictive models Biomarkers Programming Feature extraction Task analysis Standards Diseases

来源：评论

学校读者我要写书评

暂无评论

A Network Fault Prediction-Based Service Migration Approach for Unstable Mobile Edge Environment

引用

Wireless Communications and Mobile Computing 2023年第1期2023卷

作者： Wang, Haiyan Tang, Weihao Luo, Jian Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

How to perform efficient service migration in a mobile edge environment has become one of the research hotspots in the field of service computing. Most service migration approaches assume that the mobile edge network on which the migration depends is stable. However, in practice, these networks often fluctuate greatly due to the fault of edge devices, resulting in unexpected service interruptions during the migration process. Besides, most of the existing solutions do not consider the migration cost and path selection in the event of edge network fault. Aiming at the above problems, we propose a service migration approach based on network fault prediction (SMNFP) for mobile edge environment. The SMNFP method first introduces the software-defined network as a global controller, which is used to monitor and collect the changing of the edge network and schedule the migration tasks. Second, a network fault prediction model based on Wide&Deep model is proposed to predict the upcoming faults in the network according to the alarm information of network equipment. Finally, the service migration problem is constructed as a Markov decision process, and a fault penalty function is introduced to avoid faulty nodes, together with the deep Q-learning method to solve the migration strategy. Simulation experiments are conducted on the public metro network fault dataset, and results show the proposed method can effectively predict network faults and complete service migration. Copyright © 2023 Haiyan Wang et al.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Latent Group Recommendation based on Double Fuzzy Clustering and Matrix Tri-factorization

Latent Group Recommendation based on Double Fuzzy Clustering...

引用

IEEE International Conference on Web Services (ICWS)

作者： Haiyan Wang Jinxia Zhu Zhousheng Wang Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728187860

ISBN: (纸本)9781728187877

Group recommendation has received great attention owing to its practical value in real applications. However, group members are implicit and groups are formed occasionally in some scenarios. Existing solutions for latent group recommendation assumes a user belongs to a specific group, and totally ignore the possible correlation between the user' s preferences and other groups' preferences. In addition, existing methods cannot deal with new items cold-start problem effectively because they only focus on which items are favored by the group without considering the hidden related information between items. These weaknesses usually lead to poor performance of latent group recommendation. To address the problems above, this paper proposes a latent group recommendation method based on double fuzzy clustering and matrix tri-factorization (DFCMTF -LGR). Firstly, this method utilizes unsupervised learning to implement potential feature extraction and double fuzzy clustering for users and items. Secondly, a novel matrix tri-factorization method is presented to adjust the membership of user-to-group, item-to-item category, and the incidence of group-to-item category is obtained. Finally, latent groups are detected according to user-to-group membership, and group rating can be generated in accordance with group-to-item category incidence matrix and item-to-item category membership. Experimental results on real datasets demonstrate that our proposed DFCMTF-LGR has better performance compared with state-of-the art methods.

关键词： Correlation Art Web services Conferences Feature extraction Real-time systems Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Granularity Power Prediction for data Center Operations via Long Short-Term Memory Network

Multi-Granularity Power Prediction for Data Center Operation...

引用

IEEE International Conference on big data and Cloud Computing (BdCloud)

作者： Ziyu Shen Xusheng Zhang Bin Xia Zheng Liu Yun Li Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

The increasing numbers of the applications and requirement of cloud computing have made huge power consumption in data centers, which brings the problems of the high cost and resource waste. This problem attracts significant attention from academia and industry. A critical approach to solve this problem is constructing an intelligent energy management system for data centers. Furthermore, an efficient assessment and prediction module of power consumption in data centers is an essential part of the management system. It facilitates cloud service providers to perform workflow scheduling at the minimal cost and energy efficiency management with the requirement of QoS. Since the assessment and prediction of power consumption correlate, this paper presents a multi-granularity approach for power consumption prediction in data centers, which combines multi-task learning with the LSTM network. We first transfer a multi-granularity power prediction problem into a multi-task regression problem to assess and predict the power consumption of data center system maintenance and scheduling operations. Due to the time requirement for workflow and container scheduling, the prediction interval is 30 seconds. Then we propose an efficient long short-term memory network for the multigranularity prediction. The experimental results show our model outperforms other prediction models on the real datasets.

关键词： Power demand data centers Task analysis Predictive models data models Time series analysis Servers

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：