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

Intervention Prediction for Patients with Pressure Injury Using Random Forest

学校读者我要写书评

暂无评论

Intervention Prediction for Patients with Pressure Injury Us...

IEEE International Conference on Big knowledge (ICBK)

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

ISBN: (纸本)9781665438599

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.

关键词： Support vector machines Conferences Forestry Predictive models Indexes Decision trees Particle swarm optimization

Fast extraction of word embedding from Q-contexts

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Kong, Junsheng Li, Weizhao Liu, Zeyi Liao, Ben Qiu, Jiezhong Hsieh, Chang-Yu Cai, Yi Zhang, Shengyu School of Software Engineering South China University of Technology China University of Cambridge United Kingdom Tencent Quantum Lab China Tsinghua University China The Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education

The notion of word embedding plays a fundamental role in natural language processing (NLP). However, pre-training word embedding for very large-scale vocabulary is computationally challenging for most existing methods. In this work, we show that with merely a small fraction of contexts (Q-contexts) which are typical in the whole corpus (and their mutual information with words), one can construct high-quality word embedding with negligible errors. Mutual information between contexts and words can be encoded canonically as a sampling state, thus, Q-contexts can be fast constructed. Furthermore, we present an efficient and effective WEQ method, which is capable of extracting word embedding directly from these typical contexts. In practical scenarios, our algorithm runs 11∼ 13 times faster than well-established methods. By comparing with well-known methods such as matrix factorization, word2vec, GloVe and fasttext, we demonstrate that our method achieves comparable performance on a variety of downstream NLP tasks, and in the meanwhile maintains run-time and resource advantages over all these baselines. © 2021, CC BY.

关键词： Embeddings

Better Pseudo-label: Joint Domain-aware label and Dual-classifier for Semi-supervised Domain Generalization

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Wang, Ruiqi Qi, Lei Shi, Yinghuan Gao, Yang State Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Institute of Healthcare Data Science Nanjing University Nanjing China School of Computer Science and Engineering Key Lab of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

With the goal of directly generalizing trained model to unseen target domains, domain generalization (DG), a newly proposed learning paradigm, has attracted considerable attention. Previous DG models usually require a sufficient quantity of annotated samples from observed source domains during training. In this paper, we relax this requirement about full annotation and investigate semisupervised domain generalization (SSDG) where only one source domain is fully annotated along with the other domains totally unlabeled in the training process. With the challenges of tackling the domain gap between observed source domains and predicting unseen target domains, we propose a novel deep framework via joint domain-aware labels and dual-classifier to produce high-quality pseudo-labels. Concretely, to predict accurate pseudo-labels under domain shift, a domain-aware pseudo-labeling module is developed. Also, considering inconsistent goals between generalization and pseudo-labeling: former prevents overfitting on all source domains while latter might overfit the unlabeled source domains for high accuracy, we employ a dual-classifier to independently perform pseudo-labeling and domain generalization in the training process. When accurate pseudo-labels are generated for unlabeled source domains, the domain mixup operation is applied to augment new domains between labeled and unlabeled domains, which is beneficial for boosting the generalization capability of the model. Extensive results on publicly available DG benchmark datasets show the efficacy of our proposed SSDG method. Copyright © 2021, The Authors. All rights reserved.

关键词： Image recognition

Rethinking the Sample Relations for Few-Shot Classification

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Yin, Guowei Huang, Sheng Huangfu, Luwen Zhang, Yi Zhang, Xiaohong School of Big Data and Software Engineering Chongqing University No.55 Daxuecheng South Rd. Shapingba Chongqing401331 China Ministry of Education Key Laboratory of Dependable Service Computing in Cyber Physical Society Chongqing University No.174 Shazhengjie Shapingba Chongqing400044 China Fowler College of Business San Diego State University San DiegoCA92182 United States San Diego State University San DiegoCA92182 United States AI4Business Lab San Diego State University San DiegoCA92182 United States

Feature quality is paramount for classification performance, particularly in few-shot scenarios. Contrastive learning, a widely adopted technique for enhancing feature quality, leverages sample relations to extract intrinsic features that capture semantic information and has achieved remarkable success in Few-Shot Learning (FSL). Nevertheless, current few-shot contrastive learning approaches often overlook the semantic similarity discrepancies at different granularities when employing the same modeling approach for different sample relations, which limits the potential of few-shot contrastive learning. In this paper, we introduce a straightforward yet effective contrastive learning approach, Multi-Grained Relation Contrastive Learning (MGRCL), as a pretraining feature learning model to boost few-shot learning by meticulously modeling sample relations at different granularities. MGRCL categorizes sample relations into three types: intra-sample relation of the same sample under different transformations, intra-class relation of homogenous samples, and inter-class relation of inhomogeneous samples. In MGRCL, we design Transformation Consistency Learning (TCL) to ensure the rigorous semantic consistency of a sample under different transformations by aligning predictions of input pairs. Furthermore, to preserve discriminative information, we employ Class Contrastive Learning (CCL) to ensure that a sample is always closer to its homogenous samples than its inhomogeneous ones, as homogenous samples share similar semantic content while inhomogeneous samples have different semantic content. Our method is assessed across four popular FSL benchmarks, showing that such a simple pre-training feature learning method surpasses a majority of leading FSL methods. Moreover, our method can be incorporated into other FSL methods as the pre-trained model and help them obtain significant performance gains. © 2025, CC BY-NC-SA.

关键词： Contrastive Learning

Research on DNS Resolution Technology based on Blockchain

学校读者我要写书评

暂无评论

Research on DNS Resolution Technology based on Blockchain

Chinese Automation Congress (CAC)

作者： Wang Hu-qing Zhang Ying-jiao Zhang Xu Sun Zhi-xin Post Industry Technology Research and Development Center of the State Posts Bureau(Intemet of Things Technology) Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Key Lab of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China School of Modern Posts Nanjing University of Posts and Telecommunications Nanjing China Aahui Yougu Express Intelligent Technology Co. LTD Nanjing China

DNS completes the resolution of domain names to IP addresses, which is an effective means to realize various In-ternet applications, and is also an indispensable part of Internet infrastructure, playing an important role. However, the resolution efficiency and security of DNS have always been a hot spot in the industry. This study deeply discusses the principle of Blockchain-based DNS resolution and conducts extensive re-search on Blockchain-based DNS resolution schemes. Based on compatibility with traditional DNS, these schemes are divided into two categories: compatible and incompatible. For different scenarios, we conduct a detailed analysis and comparison, focusing on the technical characteristics and performance of each so-lution. Finally, the future research direction is looked forward to, and the full text is summarized.

关键词：

Web-based teamwork: Distributed software development course under Covid-19 15

学校读者我要写书评

暂无评论

Web-based teamwork: Distributed software development course ...

15th International Conference on Computer Science and education, ICCSE 2020

作者： Zhang, Rui Mestre, Pedro Serodio, Carlos Prada, Marilia Gao, Wenjuan Jilin University Key Lab of Symbolic Computation and Knowledge Engineering Chinese Ministry of Education College of Computer Science and Technology Changchun130012 China University of Minho Centro Algoritmi Guimaraes4800-058 Portugal Department of Social and Organizational Psychology Lisboa Portugal Library of Changchun University Changchun130022 China

ISBN: (纸本)9781728172675

In a increasingly globalized world, it is very important to help students to acquire the hard and soft skills needed to cope with the challenges they will face when working in such environments. However, even though students find this subject interesting and volunteer for it, it is hard, even impossible to teach college students such a distributed fashion of teamwork. In this paper, a case study is provided to illustrate the methodology and experiences of a joint course, distributed software development, of multiple universities from Asia, Europe, North and South Americas. The results show that student can get the spirit, effective communication for such web-based teamwork environment and achieve software project development. The recent developments because of the Covid-19 pandemic are the facts that now students have to cooperate remotely with each other not only across continents but also inside their own city or country. It has increased the awareness of the need for this kind of training and effectively improved the interactions between team elements in different countries and improved the students' feeling of belonging to their team. © 2020 IEEE.

关键词： Students

AdaXpert: Adapting neural architecture for growing data

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Niu, Shuaicheng Wu, Jiaxiang Xu, Guanghui Zhang, Yifan Guo, Yong Zhao, Peilin Wang, Peng Tan, Mingkui School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Tencent AI Lab China National University of Singapore Singapore Northwestern Polytechnical University China Pazhou Laboratory China

In real-world applications, data often come in a growing manner, where the data volume and the number of classes may increase dynamically. This will bring a critical challenge for learning: given the increasing data volume or the number of classes, one has to instantaneously adjust the neural model capacity to obtain promising performance. Existing methods either ignore the growing nature of data or seek to independently search an optimal architecture for a given dataset, and thus are incapable of promptly adjusting the architectures for the changed data. To address this, we present a neural architecture adaptation method, namely Adaptation eXpert (AdaXpert), to efficiently adjust previous architectures on the growing data. Specifically, we introduce an architecture adjuster to generate a suitable architecture for each data snapshot, based on the previous architecture and the different extent between current and previous data distributions. Furthermore, we propose an adaptation condition to determine the necessity of adjustment, thereby avoiding unnecessary and time-consuming adjustments. Extensive experiments on two growth scenarios (increasing data volume and number of classes) demonstrate the effectiveness of the proposed method. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

Conditional Generative Modeling for Amorphous Multi-Element Materials

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Li, Honglin Liu, Chuhao Guo, Yongfeng Luo, Xiaoshan Chen, Yijie Liu, Guangsheng Li, Yu Wang, Ruoyu Wang, Zhenyu Wu, Jianzhuo Ma, Cheng Xie, Zhuohang Lv, Jian Ding, Yufei Zhang, Huabin Luo, Jian Zhong, Zhicheng Li, Mufan Wang, Yanchao Li, Wan-Lu Key Laboratory of Material Simulation Methods and Software Ministry of Education College of Physics Jilin University Changchun China Aiiso Yufeng Li Family Department of Chemical and Nano Engineering University of California La Jolla San DiegoCA United States Institute of Molecular Engineering Plus College of Chemistry Fuzhou University Fuzhou China College of Chemistry and Molecular Engineering Peking University Beijing China School of Physics Nankai University Tianjin China Institute of Modern Physics Fudan University Shanghai China Program in Materials Science and Engineering University of California La Jolla San DiegoCA United States School of Artificial Intelligence and Data Science University of Science and Technology of China Hefei230026 China Suzhou Institute for Advanced Research University of Science and Technology of China Suzhou215123 China International Center of Future Science Jilin University Changchun China Department of Computer Science and Engineering University of California La Jolla San DiegoCA United States Center for Renewable Energy and Storage Technologies Physical Science and Engineering Division King Abdullah University of Science and Technology Thuwal Saudi Arabia Suzhou Lab Suzhou215123 China

Amorphous multi-element materials offer unprecedented tunability in composition and properties, yet their rational design remains challenging due to the lack of predictive structure-property relationships and the vast configurational space. Traditional modeling struggles to capture the intricate short-range order that dictates their stability and functionality. We here introduce ApolloX, a pioneering predictive framework for amorphous multi-element materials, establishing a new paradigm by integrating physics-informed generative modeling with particle swarm optimization, using chemical short-range order as an explicit constraint. By systematically navigating the disordered energy landscape, ApolloX enables the targeted design of thermodynamically stable amorphous configurations. It accurately predicts atomic-scale arrangements, including composition-driven metal clustering and amorphization trends, which are well-validated by experiments, while also guiding synthesis by leveraging sluggish diffusion to control elemental distribution and disorder. The resulting structural evolution, governed by composition, directly impacts catalytic performance, leading to improved activity and stability with increasing amorphization. This predictive-experimental synergy transforms the discovery of amorphous materials, unlocking new frontiers in catalysis, energy storage, and functional disordered systems. Copyright © 2025, The Authors. All rights reserved.

关键词： Amorphization

Contrastive graph poisson networks: semi-supervised learning with extremely limited labels 21

学校读者我要写书评

暂无评论

Contrastive graph poisson networks: semi-supervised learning...

Proceedings of the 35th International Conference on Neural Information Processing Systems

作者： Sheng Wan Yibing Zhan Liu Liu Baosheng Yu Shirui Pan Chen Gong PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology and JD Explore Academy JD Explore Academy The University of Sydney Department of Data Science and AI Faculty of IT Monash University

ISBN: (纸本)9781713845393

Graph Neural Networks (GNNs) have achieved remarkable performance in the task of semi-supervised node classification. However, most existing GNN models require sufficient labeled data for effective network training. Their performance can be seriously degraded when labels are extremely limited. To address this issue, we propose a new framework termed Contrastive Graph Poisson Networks (CGPN) for node classification under extremely limited labeled data. Specifically, our CGPN derives from variational inference; integrates a newly designed Graph Poisson Network (GPN) to effectively propagate the limited labels to the entire graph and a normal GNN, such as Graph Attention Network, that fexibly guides the propagation of GPN; applies a contrastive objective to further exploit the supervision information from the learning process of GPN and GNN models. Essentially, our CGPN can enhance the learning performance of GNNs under extremely limited labels by contrastively propagating the limited labels to the entire graph. We conducted extensive experiments on different types of datasets to demonstrate the superiority of CGPN.

关键词：