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

arXiv 2023年

作者： Li, Yingji Du, Mengnan Song, Rui Wang, Xin Wang, Ying College of Computer Science and Technology Jilin University Changchun130012 China Department of Data Science New Jersey Institute of Technology Newark United States School of Artificial Intelligence Jilin University Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China

Large Language Models (LLMs) have shown powerful performance and development prospects and are widely deployed in the real world. However, LLMs can capture social biases from unprocessed training data and propagate the biases to downstream tasks. Unfair LLM systems have undesirable social impacts and potential harms. In this paper, we provide a comprehensive review of related research on fairness in LLMs. Considering the influence of parameter magnitude and training paradigm on research strategy, we divide existing fairness research into oriented to medium-sized LLMs under pre-training and fine-tuning paradigms and oriented to large-sized LLMs under prompting paradigms. First, for medium-sized LLMs, we introduce evaluation metrics and debiasing methods from the perspectives of intrinsic bias and extrinsic bias, respectively. Then, for large-sized LLMs, we introduce recent fairness research, including fairness evaluation, reasons for bias, and debiasing methods. Finally, we discuss and provide insight on the challenges and future directions for the development of fairness in LLMs. Copyright © 2023, The Authors. All rights reserved.

关键词： computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Nondestructive quantitative analysis of compound paracetamol and diphenhydramine hydrochloride powder using RBF networks

Nondestructive quantitative analysis of compound paracetamol...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Hong Zheng Li-Ming Wan Jing-Qing Jiang Yan-Chun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China College of Computer Science and Engineering Changchun University of Technology Changchun China Institute of General Development and Evaluation of Equipment EAAF of PLA Beijing China College of Mathematics and Computer Science Inner Mongolia University for the Nationalities Tongliao China

A method for simultaneous analysis of the two components of compound paracetamol and diphenhydramine hydrochloride powdered drugs on near-infrared (NIR) spectroscopy is developed by using a radial basis function (RBF) network. Nearest neighbor-clustering algorithm is used as the learning algorithm of RBF network. Comparisons of the results obtained from the RBF models with those from BP models show that it is feasible to use the RBF network in nondestructive quantitative analysis of the components of drugs.

关键词： Powders Radial basis function networks Clustering algorithms Educational institutions Computer science Drugs Spectroscopy Educational technology knowledge engineering Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic graph software watermark based on the Chinese Remainder Theorem

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 198-201页

作者： Zhu, Jian-Qi Liu, Yan-Heng Yin, Ke-Xin Song, Shuang Key Laboratory of Symbol Computation and Knowledge Engineer College of Computer Science and Technology Jilin University Changchun 130012 China College of Computer Science and Engineering Changchun University of Technology Changchun 130012 China

The watermark is split into a set of shares and represented as a set of graphs, which are embedded into the program dynamically. Code obfuscating technique in the embedding phase was used. A novel scheme of dynamic data structure software watermarking is presented. This scheme can restore the watermark according to partial watermark shares and is very robust and stealthy.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Contrastive Fusion of Generative and Discriminative Lesion Maps for Weakly Supervised Medical Image Segmentation

SSRN

引用

SSRN 2023年

作者： Du, Wei Huo, Yongkang Tang, Shiyi Chen, Liang Li, Ying Li, Gaoyang Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Engineering Shantou University Shantou515063 China Translational Medical Center for Stem Cell Therapy Institute for Regenerative Medicine Shanghai East Hospital Bioinformatics Department School of Life Sciences and Technology Tongji University Shanghai200092 China

Medical image segmentation is a crucial computer-aided diagnosis (CAD) procedure in various clinical applications. However, most existing methods rely on pixel-level annotations, which are costly and time-consuming. We propose a novel contrastive fusion model of generative and discriminative lesion maps for weakly supervised medical image segmentation to address this limitation. The generative lesion map is generated by a lesion region-guided cycle-consistent adversarial network (CCANet), and the discriminative lesion map is produced by a class-aware-based discriminative lesion localization network (DLLNet). CCANet and DLLNet share weights at the encoder layer, which contains skip connections and channel attention modules to enhance feature embedding. In order to fully utilize and integrate the generative and discriminative lesion maps, and improve the segmentation accuracy, we design a fusion method based on contrastive loss to jointly train CCANet and DLLNet. The final lesion segmentation result is obtained by applying dense conditional random fields (Dense CRF) to the fused lesion map. Extensive experiments on three benchmark medical image datasets show that our model outperforms the state-of-the-art methods on weakly supervised medical image segmentation, especially in datasets with few samples, validating the proposed model's good generalization ability and robustness in various medical image segmentation scenarios. The source code and experiment datasets are available on GitHub: https://***/mlcb-jlu/GDC4MedSeg. © 2023, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Multimodal Hypothetical Summary for Retrieval-based Multi-image Question Answering

arXiv

引用

arXiv 2024年

作者： Li, Peize Si, Qingyi Fu, Peng Lin, Zheng Wang, Yan School of Artificial Intelligence Jilin University Changchun China Institute of Information Engineering Chinese Academy of Sciences Beijing China Huawei Technologies Co. Ltd. Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Changchun China

Retrieval-based multi-image question answering (QA) task involves retrieving multiple question-related images and synthesizing these images to generate an answer. Conventional "retrieve-then-answer" pipelines often suffer from cascading errors because the training objective of QA fails to optimize the retrieval stage. To address this issue, we propose a novel method to effectively introduce and reference retrieved information into the QA. Given the image set to be retrieved, we employ a multimodal large language model (visual perspective) and a large language model (textual perspective) to obtain multimodal hypothetical summary in question-form and description-form. By combining visual and textual perspectives, MHyS captures image content more specifically and replaces real images in retrieval, which eliminates the modality gap by transforming into text-to-text retrieval and helps improve retrieval. To more advantageously introduce retrieval with QA, we employ contrastive learning to align queries (questions) with MHyS. Moreover, we propose a coarse-to-fine strategy for calculating both sentence-level and word-level similarity scores, to further enhance retrieval and filter out irrelevant details. Our approach achieves a 3.7% absolute improvement over state-of-the-art methods on RETVQA and a 14.5% improvement over CLIP. Comprehensive experiments and detailed ablation studies demonstrate the superiority of our method. Copyright © 2024, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Logical reinforcement learning method based on heuristic contour list

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2008年第11期45卷 1824-1830页

作者： Liu, Quan Gao, Yang Chen, Daoxu Sun, Jigui Yao, Wangshu State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Institute of Computer Science and Technology Soochow University Suzhou 215006 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China

Reinforcement learning gets optimal policy through trial-and-error and interaction with dynamic environment. Its properties of self-improving and online learning make reinforcement learning become one of most important machine learning methods. Against reinforcement learning has been 'curse of dimensionality' troubled by the problem the question, a method of heuristic contour list is proposed on the basis of relational reinforcement learning. The method can represent states, actions and Q-functions through using first-order predications with contour list. Thus advantages of Prolog list can be exerted adequately. The method is to combine logical predication rule with reinforcement learning. A new logical reinforcement learning-CCLORRL is formed and its convergence is proved. The method uses contour shape predicates to build shape state tables, drastically reducing the state space;Using heuristic rules to guide the choice of action can reduce choice blindness when the sample does not exist in the state space. The CCLORRL algorithm is used in the Tetris game. Experiments show that the method is more efficient.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Identification of Cancer Development Related Pathways Based on Co-Expression Analyses

Identification of Cancer Development Related Pathways Based ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hongyang Jiang Zhihang Wang Chaoyi Yin Peishuo Sun Ying Xu Huiyan Sun School of Artificial Intelligence Jilin University Changchun Innovation Group of Marine Engineering Materials and Corrosion Control Southern Marine Science and Engineering Guangdong Laboratory Zhuhai China College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China Computational Systems Biology Lab Institute of Bioinformatics University of Georgia Athens USA School of Artificial Intelligence Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Cancer is a rapidly evolving disease, with complex physiological changes throughout its development. Different patients of the same cancer type may require distinct treatments depending on the level of development. Hence it is essential to identify the genes and biological processes strongly associated with cancer progression to design an effective treatment plan. Our study has found that cancer samples of the same development stage (or grade, subtype) tend to share highly unique co-expression patterns, providing considerably stronger discerning power than differential expressions for cancer staging (and grading, subtyping). Based on this, we have developed a framework for identification and analyses of genes and pathways strongly associated with a cancer's development through identification of co-expression patterns that become increasingly stronger or weaker over cancer samples from early through advanced stages. Functional analyses of such co-expressed genes reveal that (1) cell-cycle, immune response, ribosome, proteasome and oxidative phosphorylation, among others, strongly associate with cancer development, (2) the co-expression patterns among ribosome, proteasome and oxidative phosphorylation genes tend to become increasingly weaker as a cancer advances, for almost all cancer types, and (3) the co-expression patterns among cell cycle and immune response genes tend to become increasingly stronger with cancer progression. We anticipate that co-expression-based analyses like we present here will become a key technique for functional studies of cancer development and evolution.

关键词： Cancer Correlation Indexes Biological processes Physiology Immune system Genetic expression

来源：评论

学校读者我要写书评

暂无评论

Effective pruning algorithm for least squares support vector machine classifier

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2007年第7期44卷 1128-1136页

作者： Yang, Xiaowei Lu, Jie Zhang, Guangquan School of Mathematical Sciences South China University of Technology Guangzhou 510641 China Faculty of Information Technology Sydney University of Technology NSW 2007 Australia Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China

A well-known drawback in the least squares support vector machine (LS-SVM) is that the sparseness is lost. In this study, an effective pruning algorithm is developed to deal with this problem. To avoid solving the primal set of linear equations, the bottom to the top strategy is adopted in the proposed algorithm. During the training process of the algorithm, the chunking incremental and decremental learning procedures are used alternately. A small support vector set, which can cover most of the information in the training set, can be formed adaptively. Using the support vector set, one can construct the final classifier. In order to test the validation of the proposed algorithm, it has been applied to five benchmarking UCI datasets. In order to show the relationships among the chunking size, the number of support vector machine, the training time, and the testing accuracy, different chunking sizes are tested. The experimental results show that the proposed algorithm can adaptively obtain the sparse solutions without almost losing generalization performance when the chunking size is equal to 2, and also its training speed is much faster than that of the sequential minimal optimization (SMO) algorithm. The proposed algorithm can also be applied to the least squares support vector regression machine as well as LS-SVM classifier.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Multilocus association analysis into susceptibility genes of schizophrenia

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 205-212页

作者： Zhang, Hong-Li Liu, Yuan-Ning Zhang, Hao Yu, Ya-Qin Yu, Qiong Kou, Chang-Gui Shi, Jie-Ping Meng, Xiang-Fei Tao, Lu Qu, Ting College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China Research Center for Genomic Medicine School of Public Health Jilin University Changchun 130021 China

A model based on multilocus interaction of schizophrenia was designed. Using the program of MATLAB through a C-language interface, combined with Fisher's exact test, a total of 18 SNPs that came from 9 susceptibility genes of the cPLA2 and PNPLA8 family were analyzed to detect positive sites of schizophrenia in multilocus association analysis. Results show that 4 positive sites at rs3816533, rsl668589, rsl356410 and rs40848 were detected in 13 SNPs, which did not deviate from the Hardy-Weinberg equilibrium (P>0.05). The haplotype significance test of these positive sites indicates that 6 haplotypes passing through rs3816533, rsl668589, rsl356410 and 2 haplotypes passing through rs40848 are associated with schizophrenia.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

Drive: An Adjustable Parallel Architecture Based on Evidence Awareness for Fake News Detection

SSRN

引用

SSRN 2024年

作者： Cong, Mou Liu, Lu Han, Jiayu Zhu, Beibei Yuan, Xiaosong Peng, Tao College of Computer Science and Technology Jilin University 2699 Qianjin Street Jilin Changchun130012 China College of Software Jilin University 2699 Qianjin Street Jilin Changchun130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University 2699 Qianjin Street Jilin Changchun130012 China Department of Linguistics University of Washington SeattleWA98195 United States

Fake news detection becomes a critical challenge in NLP. Batch processing with attention-derivative models is a popular solution for fake news detection. Models with attention mechanisms could mitigate the long-distance dependence problem. However, we find that extracting local dependencies using convolutional networks is as important as extracting global dependencies using attention mechanisms. Besides, fake news datasets often suffer from problems such as imbalance and are hard to understand by current models. To address these problems, we propose DRIVE, which is short for an adjustable parallel architecture based on evidence awareness for fake news detection to alleviate the above problems, in which we introduce Claim as a supporting clue to enhance the model’s comprehension ability. Specifically, we propose a novel method for unbalanced datasets and design adjustable parallel branches, using Claim Additives Network (ClaimAddNet) and the MLP with convolutional gating mechanism (CPMLP) to capture global and local information in distinct branches, respectively. Experiments conducted on 5 public datasets demonstrate that DRIVE outperforms all baselines, improving accuracy by approximately 1.7 %. Furthermore, we implement an anti-noise interference test and evaluate the weighted average of the two branches along with ablation studies. © 2024, The Authors. All rights reserved.

关键词： Parallel architectures

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：