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

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Chen, Tianhao Gao, Qian Fan, Jun Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Shandong Jinan250014 China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Shandong Jinan250353 China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Shandong Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd Shandong Jinan250101 China

ISBN: (纸本)9798350330014

Group recommendation involves comprehensively considering various aspects, including members and items, to predict the overall interests of a group and recommend suitable items through a recommendation system. With the rapid evolution of the Internet, online group activities have become increasingly prevalent, making group recommendation a highly discussed topic within the realm of recommendation systems. However, current research in group recommendation still confronts the following challenges. Firstly, a predominant portion of group recommendation research focuses solely on aggregating group-level information, neglecting the valuable contribution of higher-order member-level insights to group recommendation. Moreover, some aggregation strategies overly prioritize fairness, thereby disregarding common real-world patterns. Secondly, previous studies have primarily relied on aggregating individual member interests to establish group preferences, lacking a holistic consideration of group dynamics. To tackle these challenges, this study introduces an innovative approach by implementing multi-channel hypergraph convolution within the member perspective. This approach aims to effectively extract higher-order insights from members by utilizing a member information enhancement module. By establishing group interconnections based on similarity and employing an adaptive fusion network to amalgamate multiple viewpoints, a final representation is derived. Experimental results demonstrate that our proposed model surpasses baseline models by 3% to 4% in terms of hit rate and accuracy, validating the efficacy of our approach. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Engagement Level Detection Using Facial Extraction and Multi-Stacked Convolutional Neural Network in e-Learning Settings

Engagement Level Detection Using Facial Extraction and Multi...

引用

Electrical Power, Electronics, Communications, Controls and Informatics Seminar (EECCIS)

作者： Fitra Abdurrachman Bachtiar Al'Ravie Mutiar Mahesa Eric Wallace Cooper Computer Science Faculty Intelligent System Laboratory Universitas Brawijaya Malang Indonesia College of Information Science and Engineering Affective Engineering and Arts Laboratory Ritsumeikan University Ibaraki Japan

ISBN: (数字)9798350379914

ISBN: (纸本)9798350379921

Engagement in learning is crucial in maintaining student eagerness as fuel for student learning to achieve learning success. In e-Learning settings, engagement also plays an im-portant role as a factor influencing student learning success as students are regulating themselves during learning one-on-one using computer devices. Failing to detect student engagement may result in unsuccessful learning. In extreme cases, students may disengage and learning purpose cannot be achieved. This research aims to detect user engagement in e-Learning settings by using a deep learning approach with a feature extraction method. The dataset used in this study is the DAiSEE dataset. The dataset is in the form of videos and is extracted into frames and specific facial features. The facial area was extracted using the Mediapipe Library. The features include 1434 3D landmark features, 52 action unit features, one depth estimation feature, and three head pose estimation features. This research also conducts image selection, which selecting frames with an interval of 15 in the train, validation, and test folders. The multi-stacked Convolutional Neural Network model was used to classify four levels of engagements. The results were compared to the existing approach in engagement detection. The untuned proposed model achieved an accuracy of 48.95%, while the tuned proposed model achieved an accuracy of 52.94%. The proposed model is able to compete with state-of-the-art methods using a less complex model. Even so, the model still cannot learn labels perfectly due to a very imbalanced dataset and a possibility of model overfitting. This research is expected to be useful for educational institutions and the e-Learning field in the future.

关键词： Seminars Electronic learning Accuracy Three-dimensional displays Pose estimation Feature extraction Power electronics Convolutional neural networks Videos Overfitting

来源：评论

学校读者我要写书评

暂无评论

Research on elephant flow detection method based on information entropy and improved random forest

Research on elephant flow detection method based on informat...

引用

2022 International Conference on Algorithms, Microchips and Network Applications

作者： Hu, Xiaohong Miao, Xianghua Yuan, Meiyu Faculty of Information Engineering and Automation Kunming University of Science and Technology Kunming650500 China Yunnan Key Laboratory of Computer Technology Application Kunming University of Science and Technology Kunming650500 China

ISBN: (纸本)9781510653290

In the increasingly complex network environment, various attacks emerge one after another. Being able to accurately detect elephant flow and mouse flow plays an extremely important role in defending against large-scale network attacks. Aiming at some shortcomings of current methods for detecting elephant flow and mouse flow, this paper proposes a detection method based on information entropy and improved random forest. After preprocessing the data, first calculate the data feature score with information entropy, screen out the truly valuable features according to the score, then put them into the improved random forest classifier, and finally get the detection results. In this paper, the grid search algorithm is used to optimize the tree and depth of random forest tree, so that the detection results can be obtained quickly and accurately. Experiments show that due to the significant difference between the data characteristics of elephant flow and mouse flow, this method can effectively identify elephant flow and mouse flow. The accuracy rate is 97.93%, the precision rate is 99.99%, the recall rate is 97.91%, and the F1-score is 98.94%, which is improved compared with other algorithms. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Rapid Maize Seedling Detection Based on Receptive-Field and Cross-Dimensional information Interaction

Rapid Maize Seedling Detection Based on Receptive-Field and ...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Hao, Fengqi Zhu, Shulei Ma, Dexin Dong, Xiangjun Kong, Hoiio Liu, Xia Mu, Chunhua Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China City University of Macau Faculty of Data Science 999078 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China Communication College Qingdao Agricultural University Qingdao266109 China Maize Research Institute Shandong Academy of Agricultural Sciences National Engineering Laboratory of Wheat and Maize Key Laboratory of Biology and Genetic Improvement of Maize in Northern Yellow-huai River Plain Ministry of Agriculture Jinan250100 China

ISBN: (纸本)9781665410205

The seedling stage is important in the growth and development of maize, and it is also a critical period that affects maize yield and quality. Accurately recognizing this stage of maize is challenging, as current maize seedling detection methods struggle with small sizes and complex environments. This paper proposes a rapid maize seedling detection method that emphasizes spatial feature extraction in the receptive field and cross-dimensional interaction - receptive field triplet attention YOLO (RFT-YOLO). First, we design a convolutional module for cross-dimensional information interaction within the receptive field. Second, we introduce an advanced selective fusion network, which boosts the multi-scale fusion capability of small object features while reducing the GFLOPs of the model. Additionally, we employ Inner-IoU to diminish sensitivity to positional biases of small objects and expedite the convergence of the loss function. Finally, we create a dataset of maize seedlings to conduct our experiments. Experimental results demonstrate that the RFT-YOLO significantly enhances performance, reducing the number of parameters by 35.3% and GFLOPs by 14.24%, compared to the baseline model. Moreover, the mean average precision (mAP) improves from 89.6% to 91.5%. These improvements confirm the model's effectiveness in detecting maize seedlings. © 2024 IEEE.

关键词： Deep learning Maize seedling detection Object detection UAV

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Scheme for Video-Based Person Re-identification Using Lightweight PCANet and Handcrafted LOMO Features

引用

Chinese Journal of Electronics 2021年第2期30卷 289-295页

作者： LI Youjiao ZHUO Li LI Jiafeng ZHANG Jing Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing University of Technology Faculty of Information Technology College of Micro-electronics Beijing University of Technology College of Computer Science and Technology Shandong University of Technology

A two-level hierarchical scheme for video-based person re-identification(re-id) is presented, with the aim of learning a pedestrian appearance model through more complete walking cycle extraction. Specifically,given a video with consecutive frames, the objective of the first level is to detect the key frame with lightweight Convolutional neural network(CNN) of PCANet to reflect the summary of the video content. At the second level, on the basis of the detected key frame, the pedestrian walking cycle is extracted from the long video sequence. Moreover,local features of Local maximal occurrence(LOMO) of the walking cycle are extracted to represent the pedestrian's appearance information. In contrast to the existing walking-cycle-based person re-id approaches, the proposed scheme relaxes the limit on step number for a walking cycle, thus making it flexible and less affected by noisy frames. Experiments are conducted on two benchmark datasets: PRID 2011 and i LIDS-VID. The experimental results demonstrate that our proposed scheme outperforms the six state-of-art video-based re-id methods, and is more robust to the severe video noises and variations in pose,lighting, and camera viewpoint.

关键词： video surveillance image sequences two-level hierarchical scheme video content local features image representation video-based re-id methods pedestrian walking cycle video signal processing convolutional neural nets local maximal occurrence noisy frames lightweight PCANet complete walking cycle extraction pedestrian appearance information walking-cycle-based person re-id approaches LOMO features lightweight convolutional neural network learning (artificial intelligence) pedestrian appearance model consecutive frames video noises video-based person re-identification iLIDS-VID benchmark dataset LOMO PRID 2011 benchmark dataset video sequence image matching detected key frame object detection

来源：评论

学校读者我要写书评

暂无评论

GCM-PDA: A Generative Compensation Model for Progressive Difference Attenuation in Spatiotemporal Fusion of Remote Sensing Images

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 34卷 3817-3832页

作者： Kai Ren Weiwei Sun Xiangchao Meng Gang Yang Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China Department of Geography and Spatial Information Techniques Ningbo University Ningbo China Ningbo Key Laboratory of Remote Sensing and Ecological Security of Coastal Zone Ningbo China Electrical Engineering and Computer Science Ningbo University Ningbo China

High-resolution satellite imagery with dense temporal series is crucial for long-term surface change monitoring. Spatiotemporal fusion seeks to reconstruct remote sensing image sequences with both high spatial and temporal resolutions by leveraging prior information from multiple satellite platforms. However, significant radiometric discrepancies and large spatial resolution variations between images acquired from different satellite sensors, coupled with the limited availability of prior data, present major challenges to accurately reconstructing missing data using existing methods. To address these challenges, this paper introduces GCM-PDA, a novel generative compensation model with progressive difference attenuation for spatiotemporal fusion of remote sensing images. The proposed model integrates multi-scale image decomposition within a progressive fusion framework, enabling the efficient extraction and integration of information across scales. Additionally, GCM-PDA employs domain adaptation techniques to mitigate radiometric inconsistencies between heterogeneous images. Notably, this study pioneers the use of style transformation in spatiotemporal fusion to achieve spatial-spectral compensation, effectively overcoming the constraints of limited prior image information. Experimental results demonstrate that GCM-PDA not only achieves competitive fusion performance but also exhibits strong robustness across diverse conditions.

关键词： Spatiotemporal phenomena MODIS Spatial resolution Remote sensing Landsat Sensors Reflectivity Image reconstruction Data mining Bayes methods

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the shortest path based on the Traveling Salesman problem with a genetic algorithm in a neutrosophic environment

引用

Neutrosophic Sets and Systems 2024年 68卷 187-197页

作者： Raut, Prasanta Kumar Behera, Siva Prasad Broumi, Said Dey, Arindam Talea, Mohamed Baral, Amarendra Department of Mathematics C.V. Raman Global University Odisha Bhubaneswar752054 India Laboratory of Information Processing Faculty of Science Ben M’Sik University Hassan II Casablanca Morocco School of Computer Science and Engineering VIT-AP University Inavolu Beside AP Secretariat AP Amaravati India Trident Academy of Technology Odisha Bhubaneswar India Department of Mathematics Saveetha School of Engineering SIMATS Thandalam Tamilnadu Chennai602105 India

In The traveling salesman problem (TSP) is an essential and the most popular conventional combinatorial optimization network problem in operations research, in which the TSP evaluates the shortest route or path in a network. In TSP, every node has been visited only once, excluding the starting node. In TSP, edge lengths are usually expressed to indicate journey time and expenses instead of distance from a location. The exact arc length can't be predicted because journey times and expenses vary depending on the amount of payload, climate, highway conditions, and so on. As a result, the Neutrosophic numbers introduce a new tool for dealing with unpredictability in TSP. The present article addresses TSP on a neutrosophic network where the edge weight is a neutrosophic number rather than a real number. For solving the Neutrosophic TSP, an algorithmic technique based on the genetic algorithm (GA) is proposed. We created a new mutation and crossover for our suggested GA. We used mathematical examples to show the usefulness of the algorithm that we suggested. The results of experiments suggest that the proposed GA can find the shortest path in a TSP within a neutrosophic framework. This provides valuable insights for decision-makers dealing with real-world situations characterized by imprecise and incomplete data. © (2023), (University of New Mexico). All Rights Reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

A Triangular Stable Node Network based on Self-supervised Learning for personalized prediction

A Triangular Stable Node Network based on Self-supervised Le...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liu, Qing Gao, Qian Fan, Jun Zhang, Zhiqiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology Shandong Academy of Sciences Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan250014 China China Telecom Digital Intelligence Techonology Co Ltd. No.1999 Shunhua road Shandong Jinan250101 China

ISBN: (纸本)9798350368741

In recent years, research has illuminated the potency of implicit data processing in enhancing user preferences. Nevertheless, barriers remain in breaking through the constraints of implicit information. This study aims to bridge this gap by firstly constructing a triangular stable node network model, tailored to manage implicit information with precision. Recognizing the challenge of pinpointing novel structures within large-scale graphs, we propose SLTSNN-a triangular stable node network based on self-supervised learning for personalized prediction. SLTSNN innovates by maximizing mutual information between graph-level and patch-level representations, while augmenting graph representations through extended enhanced representations. Additionally, it incorporates triangular data associations and introduces a triangular allocation attention network, which emphasizes strongly correlated preference features among similar users. Furthermore, SLTSNN employs contrastive learning to maximize mutual information between graph vectors and hidden representations, distinguishing between high-order global and local representations. The model's effectiveness in enhancing user preferences and capturing new graph structures is evidenced by its performance on hit rate and normalized discounted cumulative gain metrics across three datasets. © 2025 IEEE.

关键词： graph contrastive learning graph neural networks recommender systems self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Zero-Shot Video Restoration and Enhancement Using Pre-Trained Image Diffusion Model 39

Zero-Shot Video Restoration and Enhancement Using Pre-Traine...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Cao, Cong Yue, Huanjing Liu, Xin Yang, Jingyu School of Electrical and Information Engineering Tianjin University Tianjin China Computer Vision and Pattern Recognition Laboratory School of Engineering Science Lappeenranta-Lahti University of Technology LUT Lappeenranta Finland

ISBN: (纸本)157735897X

Diffusion-based zero-shot image restoration and enhancement models have achieved great success in various tasks of image restoration and enhancement. However, directly applying them to video restoration and enhancement results in severe temporal flickering artifacts. In this paper, we propose the first framework for zero-shot video restoration and enhancement based on the pre-trained image diffusion model. By replacing the spatial self-attention layer with the proposed short-long-range (SLR) temporal attention layer, the pre-trained image diffusion model can take advantage of the temporal correlation between frames. We further propose temporal consistency guidance, spatial-temporal noise sharing, and an early stopping sampling strategy to improve temporally consistent sampling. Our method is a plug-and-play module that can be inserted into any diffusion-based image restoration or enhancement methods to further improve their performance. Experimental results demonstrate the superiority of our proposed method. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

HiRes: Hierarchical Feature Optimization and Rescorer for Automatic ICD Coding

HiRes: Hierarchical Feature Optimization and Rescorer for Au...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Liang, Zhenpeng Guan, Hongjiao Lu, Wenpeng Peng, Xueping Xu, Bing Yang, Muyun Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia Faculty of Computing Harbin Institute of Technology Harbin China

ISBN: (纸本)9798350368741

The International Classification of Diseases (ICD) coding assigns standardized codes to diseases. Automating this process enhances the efficiency and accuracy of clinical records processing. However, current methods struggle with noisy and lengthy clinical texts, making it difficult to ensure the reliability of feature extraction. Furthermore, they typically make separate binary predictions for each code, overlooking the dependencies between them. To address these issues, we propose a novel model called Hierarchical Feature Optimization and Rescorer (HiRes). We employ a cascaded convolution architecture to mitigate noise and enhance feature representation. Additionally, a masked autoencoder-based rescorer is introduced to capture ICD code interdependencies, refining initial predictions for improved accuracy. The model also considers the inconsistencies in code representations. Experiments on the MIMIC datasets demonstrate the effectiveness of our model. © 2025 IEEE.

关键词： automatic ICD coding cascaded convolutional network multi-label classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：