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

Graph-based exercise- And knowledge-aware learning network for student performance prediction

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Liu, Mengfan Shao, Pengyang Zhang, Kun Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology China

Predicting student performance is a fundamental task in Intelligent Tutoring Systems (ITSs), by which we can learn about students' knowledge level and provide personalized teaching strategies for them. Researchers have made plenty of efforts on this task. They either leverage educational psychology methods to predict students' scores according to the learned knowledge proficiency, or make full use of Collaborative Filtering (CF) models to represent latent factors of students and exercises. However, most of these methods either neglect the exercise-specific characteristics (e.g., exercise materials), or cannot fully explore the high-order interactions between students, exercises, as well as knowledge concepts. To this end, we propose a Graph-based Exercise- and knowledge-Aware Learning Network for accurate student score prediction. Specifically, we learn students' mastery of exercises and knowledge concepts respectively to model the two-fold effects of exercises and knowledge concepts. Then, to model the high-order interactions, we apply graph convolution techniques in the prediction process. Extensive experiments on two real-world datasets prove the effectiveness of our proposed Graph-EKLN. Copyright © 2021, The Authors. All rights reserved.

关键词： Students

ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2023年

作者： He, Junwei Xu, Qianqian Jiang, Yangbangyan Wang, Zitai Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China

Graph anomaly detection is crucial for identifying nodes that deviate from regular behavior within graphs, benefiting various domains such as fraud detection and social network. Although existing reconstruction-based methods have achieved considerable success, they may face the Anomaly Overfitting and Homophily Trap problems caused by the abnormal patterns in the graph, breaking the assumption that normal nodes are often better reconstructed than abnormal ones. Our observations indicate that models trained on graphs with fewer anomalies exhibit higher detection performance. Based on this insight, we introduce a novel two-stage framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD). In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. We pretrain graph autoencoders on these augmented graphs at multiple levels, which enables the graph autoencoders to capture normal patterns. In the next stage, the decoders are retrained for detection on the original graph, benefiting from the multi-level representations learned in the previous stage. Meanwhile, we propose the node anomaly distribution regularization to further alleviate Anomaly Overfitting. We validate the effectiveness of our approach through extensive experiments on both synthetic and real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Anomaly detection

Aerial Secure Collaborative Communications under Eavesdropper Collusion in Low-altitude Economy: A Generative Swarm Intelligent Approach

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Jiahui Sun, Geng Wu, Qingqing Liang, Shuang Wang, Jiacheng Niyato, Dusit Kim, Dong In College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China School of Information Science and Technology Northeast Normal University Changchun130117 China Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

The rapid development of the low-altitude economy (LAE) has significantly increased the utilization of autonomous aerial vehicles (AAVs) in various applications, necessitating efficient and secure communication methods among AAV swarms. In this work, we aim to introduce distributed collaborative beamforming (DCB) into AAV swarms and handle the eavesdropper collusion by controlling the corresponding signal distributions. Specifically, we consider a two-way DCB-enabled aerial communication between two AAV swarms and construct these swarms as two AAV virtual antenna arrays. Then, we minimize the two-way known secrecy capacity and maximum sidelobe level to avoid information leakage from the known and unknown eavesdroppers, respectively. Simultaneously, we also minimize the energy consumption of AAVs when constructing virtual antenna arrays. Due to the conflicting relationships between secure performance and energy efficiency, we consider these objectives by formulating a multi-objective optimization problem, which is NP-hard and with a large number of decision variables. Accordingly, we design a novel generative swarm intelligence (GenSI) framework to solve the problem with less overhead, which contains a conditional variational autoencoder (CVAE)-based generative method and a proposed powerful swarm intelligence algorithm. In this framework, CVAE can collect expert solutions obtained by the swarm intelligence algorithm in other environment states to explore characteristics and patterns, thereby directly generating high-quality initial solutions in new environment factors for the swarm intelligence algorithm to search solution space efficiently. Simulation results show that the proposed swarm intelligence algorithm outperforms other state-of-the-art baseline algorithms, and the GenSI can achieve similar optimization results by using far fewer iterations than the ordinary swarm intelligence algorithm. Experimental tests demonstrate that introducing the CVAE mechanism ach

关键词： Multiobjective optimization

Zero-knowledge Proof Meets Machine Learning in Verifiability: A Survey

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Liu, Jiamou Zhang, Ziang Li, Meng Zhu, Liehuang Russello, Giovanni The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing China The School of Computer Science The University of Auckland Auckland New Zealand Southeast Institute of Information Technology Beijing Institute of Technology Fujian China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Anhui Hefei230601 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology China

With the rapid advancement of artificial intelligence technology, the usage of machine learning models is gradually becoming part of our daily lives. High-quality models rely not only on efficient optimization algorithms but also on the training and learning processes built upon vast amounts of data and computational power. However, in practice, due to various challenges such as limited computational resources and data privacy concerns, users in need of models often cannot train machine learning models locally. This has led them to explore alternative approaches such as outsourced learning and federated learning. While these methods address the feasibility of model training effectively, they introduce concerns about the trustworthiness of the training process since computations are not performed locally. Similarly, there are trustworthiness issues associated with outsourced model inference. These two problems can be summarized as the trustworthiness problem of model computations: How can one verify that the results computed by other participants are derived according to the specified algorithm, model, and input data? To address this challenge, verifiable machine learning (VML) has emerged. This paper presents a comprehensive survey of zero-knowledge proof-based verifiable machine learning (ZKP-VML) technology. We first analyze the potential verifiability issues that may exist in different machine learning scenarios. Subsequently, we provide a formal definition of ZKP-VML. We then conduct a detailed analysis and classification of existing works based on their technical approaches. Finally, we discuss the key challenges and future directions in the field of ZKP-based VML. © 2023, CC BY.

关键词： Machine learning

USER: A unified information search and recommendation model based on integrated behavior sequence

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yao, Jing Dou, Zhicheng Xie, Ruobing Lu, Yanxiong Wang, Zhiping Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search and recommendation are the two most common approaches used by people to obtain information. They share the same goal - satisfying the user's information need at the right time. There are already a lot of Internet platforms and Apps providing both search and recommendation services, showing us the demand and opportunity to simultaneously handle both tasks. However, most platforms consider these two tasks independently - they tend to train separate search model and recommendation model, without exploiting the relatedness and dependency between them. In this paper, we argue that jointly modeling these two tasks will benefit both of them and finally improve overall user satisfaction. We investigate the interactions between these two tasks in the specific information content service domain. We propose first integrating the user's behaviors in search and recommendation into a heterogeneous behavior sequence, then utilizing a joint model for handling both tasks based on the unified sequence. More specifically, we design the Unified Information SEarch and Recommendation model (USER), which mines user interests from the integrated sequence and accomplish the two tasks in a unified way. Experiments on a dataset from a real-world information content service platform verify that our model outperforms separate search and recommendation baselines. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

CLDG: Contrastive Learning on Dynamic Graphs

学校读者我要写书评

暂无评论

CLDG: Contrastive Learning on Dynamic Graphs

International Conference on data engineering

作者： Yiming Xu Bin Shi Teng Ma Bo Dong Haoyi Zhou Qinghua Zheng Department of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China Department of Distance Education Xi’an Jiaotong University China School of Software Beihang University China Advanced Innovation Center for Big Data and Brain Computing Beihang University China

The graph with complex annotations is the most potent data type, whose constantly evolving motivates further exploration of the unsupervised dynamic graph representation. One of the representative paradigms is graph contrastive learning. It constructs self-supervised signals by maximizing the mutual information between the statistic graph’s augmentation views. However, the semantics and labels may change within the augmentation process, causing a significant performance drop in downstream tasks. This drawback becomes greatly magnified on dynamic graphs. To address this problem, we designed a simple yet effective framework named CLDG. Firstly, we elaborate that dynamic graphs have temporal translation invariance at different levels. Then, we proposed a sampling layer to extract the temporally-persistent signals. It will encourage the node to maintain consistent local and global representations, i.e., temporal translation invariance under the timespan views. The extensive experiments demonstrate the effectiveness and efficiency of the method on seven datasets by outperforming eight unsupervised state-of-the-art baselines and showing competitiveness against four semi-supervised methods. Compared with the existing dynamic graph method, the number of model parameters and training time is reduced by an average of 2,001.86 times and 130.31 times on seven datasets, respectively. The code and data are available at: https://***/yimingxu24/CLDG.

关键词：

Intervention Prediction for Patients with Pressure Injury Using Random Forest 12

学校读者我要写书评

暂无评论

Intervention Prediction for Patients with Pressure Injury Us...

12th IEEE International Conference on Big knowledge, ICBK 2021

作者： Jin, Liuqi Pan, Yan Yang, Jiaoyun Han, Lin Lv, Lin Raviv, Miki An, Ning Hefei University of Technology Key Laboratory of Knowledge Engineering With Big Data of The Ministry of Education School of Computer Science and Information Engineering Hefei China Lanzhou University Evidence-Based Nursing Center School of Nursing Lanzhou China Wound and Ostomy Care Center Gansu Provincal Hospital Lanzhou China Vitalerter LTD Ha-Yarden Airport City Israel

ISBN: (纸本)9781665438582

Pressure injury (PI) is one of the major causes of short-term death. Early intervention for patients at risk plays an essential role in PI. However, many nurses may ignore risks. This paper aims to establish a model to predict interventions according to the patient's physical signs, which can help nurses develop care plans. We used data from 1, 483 patients with 25 characteristics and 17 interventions. We use the Random Forest and Particle Swarm Optimization (PSO) to optimize model parameters. Then we compared it with KNN, SVM, and Decision Tree. The 10-fold cross-validation result showed that the Random Forest has better accuracy than other methods, with an f1 score of 0.84. This finding proved the feasibility of using machine learning to help formulate care plans according to the classification of index prediction results. Our model shows that hemoglobin, Braden PI score, and age are the three most influential risk factors. © 2021 IEEE.

关键词： Decision trees

HUSS: A Heuristic Method for Understanding the Semantic Structure of Spreadsheets

学校读者我要写书评

暂无评论

HUSS: A Heuristic Method for Understanding the Semantic Stru...

IEEE International Conference on Big knowledge (ICBK)

作者： Xindong Wu Hao Chen Chenyang Bu Shengwei Ji Zan Zhang Victor S. Sheng Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Computer Science Texas Tech University Lubbock TX USA

Spreadsheets contain a lot of valuable data and have many practical applications. The key technology of these practical applications is how to make machines understand the semantic structure of spreadsheets, e.g., identifying cell function types and discovering relationships between cell pairs. Most existing methods for understanding the semantic structure of spreadsheets do not make use of the semantic information of cells. A few studies do, but they ignore the layout structure information of spreadsheets, which affects the performance of cell function classification and the discovery of different relationship types of cell pairs. In this paper, we propose a Heuristic algorithm for Understanding the Semantic Structure of spreadsheets (HUSS). Specifically, based on the existing cell function classification model [11], we propose five types of heuristic rules to extract four different types of cell pairs, based on the cell style and spatial location information. Our experimental results on two real-world datasets demonstrate that the proposed method HUSS can effectively understand the semantic structure of spreadsheets and outperforms corresponding baselines.

关键词： Analytical models Heuristic algorithms Semantics Layout Feature extraction Classification algorithms data mining

Human-in-The-Loop Optimization for Vehicle Body Lightweight Design

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Hao, Jia Deng, Ruofan Jia, Liangyue Li, Zuoxuan Alizadeh, Reza Soltanisehat, Leili Liu, Binyi Sun, Zhibin Shao, Yiping Industrial and Systems Engineering Laboratory Beijing Institute of Technology Beijing100081 China Yangtze Delta Region Academy Beijing Institute of Technology Jiaxing314019 China Key Laboratory of Industry Knowledge & Data Fusion Technology and Application Ministry of Industry and Information Technology Beijing Institute of Technology Beijing100081 China School of Industrial and Systems Engineering University of Oklahoma NormanOK United States Charlton College of Business University of Massachusetts- Dartmouth MA United States College of Mechanical Engineering Zhejiang University of Technology Hangzhou310023 China

Automatic optimization algorithms are crucial for vehicle body lightweight design;however, existing methods remain inefficient leading to excessive iterations that increase both time and costs. Current interactive optimization strategies partially mitigate this issue but lack a broad range of manipulation points and auxiliary information models. As such, we introduce a novel approach, "Human-in-the-Loop based method for Vehicle Body Lightweight Design" (HIL-VBLD). This method integrates human decision-making with optimization algorithms to reduce unproductive iterations. HIL-VBLD comprises two key components: (1) an innovative interaction mode that provides multiple manipulation points including constraint modification, algorithm switching, and selection of solutions of interest (SOI);(2) A comprehensive auxiliary information model that supports decision-making for designers. Our analysis demonstrates HIL-VBLD's efficacy, showing a 54.5% reduction in iteration cycles for genetic algorithm using SOI selection. Algorithm switching led to a 4.5% mass reduction, avoiding local optimum pitfalls associated with gradient algorithms. Additionally, the auxiliary information model achieved a further 1.25% mass reduction, enhancing optimization robustness. Compared to conventional automatic algorithm switching strategies, HIL-VBLD maintains equivalent accuracy with 23.9% fewer iterations. © 2024, The Authors. All rights reserved.

关键词： Genetic algorithms