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

9th International Conference on Systems and Informatics, ICSAI 2023

作者： Shi, Kang Shi, Kang Yang, Jun Liang, Zi Jun Jun Liang, Zi Li, Yu Qi Wang, Rui Han Tongji University Key Laboratory of Road and Traffic Engineering Ministry of Education Shanghai201804 China Anhui Chaoyuan Information Technology Co. Ltd HeFei230088 China Anhui Province Transportation Big Data Analysis and Application Engineering Laboratory Hefei230601 China Hefei University School of Urban Construction and Transportation Hefei230601 China

ISBN: (纸本)9798350383706

To address traffic congestion and vehicle queue overflow at short-link intersections, it is essential to conduct a predictive analysis of vehicle queue length between these intersections. This helps in proactively implementing appropriate traffic management measures to prevent traffic overflow and congestion. In this paper, we propose a short-link intersection vehicle queue length prediction method based on Long Short-Term Memory (LSTM). First, historical traffic data from the morning peak hours over the past month is collected. After comparing multiple machine learning models, LSTM is chosen for traffic flow prediction. Subsequently, mathematical models are used to predict queue length at future time intervals. Through practical validation, we found that the proposed method for predicting queue length between short-link intersections in this paper is effective, with an average prediction error rate of 11.9%. It meets the requirements for predicting vehicle queue length between intersections and proactively controlling them, holding significant practical significance for preventing traffic flow and congestion events. © 2023 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

A Differential Privacy Protection Protocol Based on Location Entropy

引用

Tsinghua Science and Technology 2023年第3期28卷 452-463页

作者： Ping Guo Baopeng Ye Yuling Chen Tao Li Yixian Yang Xiaobin Qian Xiaomei Yu State Key Laboratory of Public Big Data School of Computer Science and TechnologyGuizhou UniversityGuiyang 550025China Information Technology Innovation Service Center of Guizhou Province Guiyang 550025China School of Cyberspace Security Beijing University of Posts and TelecommnuicationsBeijing 100000China Guizhou CoVision Science&Technology Co. Ltd.Guiyang 550025China School of Information Science and Engineering Shandong Normal UniversityJinan 250000China

A Location-Based Service(LBS)refers to geolocation-based services that bring both convenience and *** an increase in the scale and value of data,most existing location privacy protection protocols cannot balance privacy and *** solve the revealing problems in LBS,we propose a differential privacy protection protocol based on location ***,we design an algorithm of the best-assisted user selection for constructing anonymity ***,we employ smart contracts to evaluate the credibility of participants,which ensures the honesty of ***,we provide a comprehensive experiment;the theoretical analysis and experiments show that the proposed protocol effectively resists background knowledge ***,our protocol improves data ***,it realizes user-controllable privacy protection,which improves privacy protection and strengthens security.

关键词： Location-Based Services(LBS) smart contract location entropy differential privacy privacy protection

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Adapting Language Model to Sequential Recommendation 24

Contrastive Learning for Adapting Language Model to Sequenti...

引用

24th IEEE International Conference on data Mining, ICDM 2024

作者： Liang, Fei-Yao Xi, Wu-Dong Xing, Xing-Xing Wan, Wei Wang, Chang-Dong Chen, Min Guizani, Mohsen School of Computer Science and Engineering Sun Yat-sen University Guangzhou China NetEase Games China UX Center NetEase Games Guangzhou China Guangdong Provincial Key Laboratory of Intellectual Property and Big Data Guangzhou China School of Computer Science and Engineering South China University of Technology Guangzhou China Pazhou Laboratory Guangzhou China Machine Learning Department Abu Dhabi United Arab Emirates

ISBN: (纸本)9798331506681

With the explosive growth of information, recommendation systems have emerged to alleviate the problem of information overload. In order to improve the performance of recommendation systems, many existing methods introduce Large Language Models to extract textual information from description text. However, Large Language Models are trained on large-scale generic textual data and may face a semantic gap for downstream recommendation tasks. To address the above issues, we propose Contrastive Learning for Adapting Language Model to Sequential Recommendation (CLA-Rec). In CLA-Rec, we first extract text embeddings from description text using Large Language Models and align the text embeddings learned by Large Language Models with the collaborative information through contrastive learning to obtain high-quality item representations. Through semantic alignment, we bridge the semantic gap between Large Language Models and the recommendation task. To map textual information and collaborative information into user representations, we utilize a Transformer model to learn user representations and capture user preferences by combining the semantically aligned item representations. Extensive experiments on three public datasets demonstrate that our method outperforms state-of-the-art approaches on multiple evaluation metrics, illustrating the effectiveness of the CLA-Rec model in adapting Large Language Models to recommendation tasks. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Fish freshness evaluation based on MobileNetV1 and attention mechanism 6

Fish freshness evaluation based on MobileNetV1 and attention...

引用

6th International Conference on Electronic Information Technology and Computer engineering, EITCE 2022

作者： Guo, Xin Gu, Shenming Wei, Dan School of Information Engineering Zhejiang Ocean University Zhoushan316022 China Key Laboratory of Oceanographic Big Data Mining & Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China

ISBN: (纸本)9781450397148

Rapid acquisition of fish freshness is an important task. The traditional freshness detection of aquatic fish has the problems of damaging samples, complicated operation and long detection time. A convenient, rapid, nondestructive and accurate freshness detection method is urgently needed in production. In this study, the freshness of aquatic fish was evaluated nondestructively and rapidly by machine vision. Firstly, we select the appropriate data set, and add the attention mechanism module to the end of the MobileNetV1 with the default alpha value. Secondly, the alpha value of all models is reduced to compare the performance for subsequent deployment to the cloud and small embedded devices with limited resources. Finally, the network is trained by real data. The results show that the MobilenetV1 network with attention mechanism module can better evaluate the freshness of fish through the fisheye image. The convergence speed and accuracy of the network are improved compared with the original network, and it is more suitable for the task of determining the freshness of fish through fisheye. © 2022 Association for Computing Machinery.

关键词： Fish

来源：评论

学校读者我要写书评

暂无评论

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xinzheng Li Yuhong Zhang Peipei Li Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China

Cross-network node classification aims to use a labeled source network to classify nodes in an unlabeled target network. Most of the existing cross-network node classification methods learn the network representations by capturing the node neighborhood and train the classifier on these representations. The performance is highly dependent on the high-quality neighborhood in the network. However, in applications, the degree of nodes generally follows a long-tail distribution, i.e., a significant proportion of nodes are tail nodes with sparse neighborhood. It poses a challenge to existing methods. To this end, a structure similarity graph for cross-network node classitication method (SCNC) is proposed in this paper. Firstly, the potential links between nodes are predicted with the structural similarity metric to construct structure similarity graph, which can enrich the neighborhood of tail nodes. Then, the embedding representations of the structural similarity graph are learned to capture more neighborhood information. Finally, the adversarial is used to learn the domain invariant representations to address cross-network divergence. Extensive experimental results show that our SCNC outperforms the state-of-the-art methods.

关键词： Network topology Tail Learning (artificial intelligence) Prediction algorithms Classification algorithms Noise measurement Task analysis

来源：评论

学校读者我要写书评

暂无评论

Revisiting Graph Contrastive Learning on Anomaly Detection: A Structural Imbalance Perspective 39

Revisiting Graph Contrastive Learning on Anomaly Detection: ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Xu, Yiming Peng, Zhen Shi, Bin Hua, Xu Dong, Bo Wang, Song Chen, Chen School of Computer Science and Technology Xi'an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University China School of Distance Education Xi'an Jiaotong University China University of Virginia Charlottesville VA United States

ISBN: (纸本)157735897X

The superiority of graph contrastive learning (GCL) has prompted its application to anomaly detection tasks for more powerful risk warning systems. Unfortunately, existing GCL-based models tend to excessively prioritize overall detection performance while neglecting robustness to structural imbalance, which can be problematic for many real-world networks following power-law degree distributions. Particularly, GCL-based methods may fail to capture tail anomalies (abnormal nodes with low degrees). This raises concerns about the security and robustness of current anomaly detection algorithms and therefore hinders their applicability in a variety of realistic high-risk scenarios. To the best of our knowledge, research on the robustness of graph anomaly detection to structural imbalance has received little scrutiny. To address the above issues, this paper presents a novel GCL-based framework named AD-GCL. It devises the neighbor pruning strategy to filter noisy edges for head nodes and facilitate the detection of genuine tail nodes by aligning from head nodes to forged tail nodes. Moreover, AD-GCL actively explores potential neighbors to enlarge the receptive field of tail nodes through anomaly-guided neighbor completion. We further introduce intra- and inter-view consistency loss of the original and augmentation graph for enhanced representation. The performance evaluation of the whole, head, and tail nodes on multiple datasets validates the comprehensive superiority of the proposed AD-GCL in detecting both head anomalies and tail anomalies. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Research on Marine Garbage Detection Based on Improved Yolov5 Model

Research on Marine Garbage Detection Based on Improved Yolov...

引用

2022 International Conference on Electronics Technology and Artificial Intelligence, ETAI 2022

作者： Cai, Chengtao Gu, Shenming School of Information Engineering Zhejiang Ocean University Zhoushan316022 China Key Laboratory of Oceanographic Big Data Mining & Application of Zhejiang Province Zhejiang Ocean University Zhoushan316022 China

The tidal movement of the ocean carries garbage to the shore. The garbage needs to be dealt with in time, otherwise, the pollution of the garbage to the environment will become increasingly serious. According to statistics, plastic garbage accounts for a substantial proportion of marine garbage. This study developed a target detection model for some plastic garbage to help achieve automatic marine garbage capture. Firstly, according to the principle of balanced label distribution, multi-background, and multi-angle, we created an image dataset based on artificial synthesis to solve the problem of insufficient data. Secondly, the CBAM attention module was used for the target detection algorithm Yolov5 to improve the ability of target feature extraction and model generalization. Furthermore, the loss function of bounding box regression CIoU was replaced with SIoU to solve the problems of slow convergence speed and low training efficiency. Finally, the effectiveness of the Yolov5 model was discussed with the analysis of experimental results. © Published under licence by IOP Publishing Ltd.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A new method for predicting plant proteins function based on multi label classification algorithm

A new method for predicting plant proteins function based on...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Chen, Shuai Wang, Juan Guo, Maozu Inner Mongolia University School of Computer Science Hohhot China Beijing University of Civil Engineering and Architecture School of Electrical and Information Engineering Beijing Key Laboratory of Intelligent Processing for Building Big Data Beijing China

ISBN: (纸本)9781665468190

Protein function annotation is an important content of bioinformatics. It is unrealistic to experimentally annotate a large number of protein functions, so automated prediction of the functions of proteins is required. Studying plant proteins can help us cultivate new plant varieties. However, the existing methods mainly aim at predicting the single function of plant proteins. Most proteins only have sequence information. Therefore, the multi-function prediction method of plant protein based on sequence has become the focus of research. In this study, we propose a method based on sequence to predict the function of plant proteins, called PlantGO. We describe the functional annotation problem as a multi-label classification problem using Gene Ontology (GO) terminology, and predict multiple functions for plant proteins. PlantGO extracts features from three aspects and performs feature fusion respectively. To avoid redundant information in features, PlantGO uses the random forest to select features and obtains three groups of optimal features. PlantGO uses a multi-label learning algorithm MLKNN to predict protein function, which proves the effectiveness and accuracy of the algorithm. Finally, PlantGO adopts the ensemble learning method to integrate all models into a unified model, further improving the prediction performance. Therefore, PlantGO has achieved excellent performance. The performance metrics are Accuracy (0.936), F1 Score (0.944), Ranking loss (0.011), which is better than the previous method in the independent test. We have developed an online server to predict the functions of plant proteins. © 2022 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Learning with Open-world Noisy data via Class-independent Margin in Dual Representation Space 39

Learning with Open-world Noisy Data via Class-independent Ma...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Pan, Linchao Gao, Can Zhou, Jie Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

ISBN: (纸本)157735897X

Learning with Noisy Labels (LNL) aims to improve the model generalization when facing data with noisy labels, and existing methods generally assume that noisy labels come from known classes, called closed-set noise. However, in real-world scenarios, noisy labels from similar unknown classes, i.e., open-set noise, may occur during the training and inference stage. Such open-world noisy labels may significantly impact the performance of LNL methods. In this study, we propose a novel dual-space joint learning method to robustly handle the open-world noise. To mitigate model overfitting on closed-set and open-set noises, a dual representation space is constructed by two networks. One is a projection network that learns shared representations in the prototype space, while the other is a One-Vs-All (OVA) network that makes predictions using unique semantic representations in the class-independent space. Then, bi-level contrastive learning and consistency regularization are introduced in two spaces to enhance the detection capability for data with unknown classes. To benefit from the memorization effects across different types of samples, class-independent margin criteria are designed for sample identification, which selects clean samples, weights closed-set noise, and filters open-set noise effectively. Extensive experiments demonstrate that our method outperforms the state-of-the-art methods and achieves an average accuracy improvement of 4.55% and an AUROC improvement of 6.17% on CIFAR80N. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey of Loss Functions in Machine Learning

引用

Annals of data Science 2022年第2期9卷 187-212页

作者： Wang, Qi Ma, Yue Zhao, Kun Tian, Yingjie School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Logistics Beijing Wuzi University Beijing101149 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China

As one of the important research topics in machine learning, loss function plays an important role in the construction of machine learning algorithms and the improvement of their performance, which has been concerned and explored by many researchers. But it still has a big gap to summarize, analyze and compare the classical loss functions. Therefore, this paper summarizes and analyzes 31 classical loss functions in machine learning. Specifically, we describe the loss functions from the aspects of traditional machine learning and deep learning respectively. The former is divided into classification problem, regression problem and unsupervised learning according to the task type. The latter is subdivided according to the application scenario, and here we mainly select object detection and face recognition to introduces their loss functions. In each task or application, in addition to analyzing each loss function from formula, meaning, image and algorithm, the loss functions under the same task or application are also summarized and compared to deepen the understanding and provide help for the selection and improvement of loss function. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：