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

32nd ACM International Conference on Multimedia, MM 2024

作者： Jia, Chengyou Luo, Minnan Chang, Xiaojun Dang, Zhuohang Han, Mingfei Wang, Mengmeng Dai, Guang Dang, Sizhe Wang, Jingdong School of Computer Science and Technology MOEKLINNS Lab Xi'an Jiaotong University Shaanxi Xi'an China University of Science and Technology of China Anhui Hefei China School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China ReLER Lab AAII University of Technology Sydney SydneyNSW Australia Zhejiang University of Technology College of Computer Science and Technology China SGIT AI Lab State Grid Corporation of China Beijing China Baidu Inc Beijing China United Arab Emirates Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Xi'an710049 China SGIT AI Lab State Grid Corporation of China China School of Computer Science and Technology Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China

ISBN: (纸本)9798400706868

Exploring open-vocabulary video action recognition is a promising venture, which aims to recognize previously unseen actions within any arbitrary set of categories. Existing methods typically adapt pretrained image-text models to the video domain, capitalizing on their inherent strengths in generalization. A common thread among such methods is the augmentation of visual embeddings with temporal information to improve the recognition of seen actions. Yet, they compromise with standard less-informative action descriptions, thus faltering when confronted with novel actions. Drawing inspiration from human cognitive processes, we argue that augmenting text embeddings with human prior knowledge is pivotal for open-vocabulary video action recognition. To realize this, we innovatively blend video models with Large Language Models (LLMs) to devise Action-conditioned Prompts. Specifically, we harness the knowledge in LLMs to produce a set of descriptive sentences that contain distinctive features for identifying given actions. Building upon this foundation, we further introduce a multi-modal action knowledge alignment mechanism to align concepts in video and textual knowledge encapsulated within the prompts. Extensive experiments on various video benchmarks, including zero-shot, few-shot, and base-to-novel generalization settings, demonstrate that our method not only sets new SOTA performance but also possesses excellent interpretability. © 2024 ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Unlocking the Secrets Behind Advanced Artificial Intelligence Language Models in Deidentifying Chinese-English Mixed Clinical Text: Development and Validation Study

引用

Journal of Medical Internet Research 2024年第1期26卷 e48443页

作者： Lee, You-Qian Chen, Ching-Tai Chen, Chien-Chang Lee, Chung-Hong Chen, Peitsz Wu, Chi-Shin Dai, Hong-Jie Dialogue System Technical Department Asustek Computer Inc Taipei Taiwan Intelligent System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Bioinformatics and Medical Engineering Asia University Taichung Taiwan Center for Precision Health Research Asia University Taichung Taiwan Electromagnetic Sensing Control and AI Computing System Laboratory Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Knowledge Discovery and Data Mining Lab Department of Electrical Engineering College of Electrical Engineering and Computer Science National Kaohsiung University of Science and Technology Kaohsiung Taiwan Department of Chemical Engineering Feng Chia University Taichung Taiwan National Center for Geriatrics and Welfare Research National Health Research Institutes Zhunan Taiwan National Institute of Cancer Research National Health Research Institutes Tainan Taiwan School of Post-Baccalaureate Medicine College of Medicine Kaohsiung Medical University Kaohsiung Taiwan Center for Big Data Research Kaohsiung Medical University Kaohsiung Taiwan

Background: The widespread use of electronic health records in the clinical and biomedical fields makes the removal of protected health information (PHI) essential to maintain privacy. However, a significant portion of information is recorded in unstructured textual forms, posing a challenge for deidentification. In multilingual countries, medical records could be written in a mixture of more than one language, referred to as code mixing. Most current clinical natural language processing techniques are designed for monolingual text, and there is a need to address the deidentification of code-mixed text. Objective: The aim of this study was to investigate the effectiveness and underlying mechanism of fine-tuned pretrained language models (PLMs) in identifying PHI in the code-mixed context. Additionally, we aimed to evaluate the potential of prompting large language models (LLMs) for recognizing PHI in a zero-shot manner. Methods: We compiled the first clinical code-mixed deidentification data set consisting of text written in Chinese and English. We explored the effectiveness of fine-tuned PLMs for recognizing PHI in code-mixed content, with a focus on whether PLMs exploit naming regularity and mention coverage to achieve superior performance, by probing the developed models’ outputs to examine their decision-making process. Furthermore, we investigated the potential of prompt-based in-context learning of LLMs for recognizing PHI in code-mixed text. Results: The developed methods were evaluated on a code-mixed deidentification corpus of 1700 discharge summaries. We observed that different PHI types had preferences in their occurrences within the different types of language-mixed sentences, and PLMs could effectively recognize PHI by exploiting the learned name regularity. However, the models may exhibit suboptimal results when regularity is weak or mentions contain unknown words that the representations cannot generate well. We also found that the availability of cod

关键词： ChatGPT code mixing deidentification electronic health record large language model pretrained language model

来源：评论

学校读者我要写书评

暂无评论

Learning personalized attribute preference via multi-task auc optimization

arXiv

引用

arXiv 2019年

作者： Yang, Zhiyong Xu, Qianqian Cao, Xiaochun Huang, Qingming SKLOIS Institute of Information Engineering Chinese Academy of Sciences Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Key Lab of Intell. Info. Process. Inst. of Comput. Tech. CAS Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management CAS Beijing China

Traditionally, most of the existing attribute learning methods are trained based on the consensus of annotations aggregated from a limited number of annotators. However, the consensus might fail in settings, especially when a wide spectrum of annotators with different interests and comprehension about the attribute words are involved. In this paper, we develop a novel multi-task method to understand and predict personalized attribute annotations. Regarding the attribute preference learning for each annotator as a specific task, we first propose a multi-level task parameter decomposition to capture the evolution from a highly popular opinion of the mass to highly personalized choices that are special for each person. Meanwhile, for personalized learning methods, ranking prediction is much more important than accurate classification. This motivates us to employ an Area Under ROC Curve (AUC) based loss function to improve our model. On top of the AUC-based loss, we propose an efficient method to evaluate the loss and gradients. Theoretically, we propose a novel closed-form solution for one of our non-convex subproblem, which leads to provable convergence behaviors. Furthermore, we also provide a generalization bound to guarantee a reasonable performance. Finally, empirical analysis consistently speaks to the efficacy of our proposed method. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Improving Generalization of Neural Vehicle Routing Problem Solvers Through the Lens of Model Architecture

arXiv

引用

arXiv 2024年

作者： Xiao, Yubin Wang, Di Wu, Xuan Wu, Yuesong Li, Boyang Du, Wei Wang, Liupu Zhou, You Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639956 Singapore WeBank-NTU Joint Research Institute on Fintech Nanyang Technological University 639956 Singapore College of Computing and Data Science Nanyang Technological University 639956 Singapore

Neural models produce promising results when solving Vehicle Routing Problems (VRPs), but may often fall short in generalization. Recent attempts to enhance model generalization often incur unnecessarily large training cost or cannot be directly applied to other models solving different VRP variants. To address these issues, we take a novel perspective on model architecture in this study. Specifically, we propose a plug-and-play Entropy-based Scaling Factor (ESF) and a Distribution-Specific (DS) decoder to enhance the size and distribution generalization, respectively. ESF adjusts the attention weight pattern of the model towards familiar ones discovered during training when solving VRPs of varying sizes. The DS decoder explicitly models VRPs of multiple training distribution patterns through multiple auxiliary light decoders, expanding the model representation space to encompass a broader range of distributional scenarios. We conduct extensive experiments on both synthetic and widely recognized real-world benchmarking datasets and compare the performance with seven baseline models. The results demonstrate the effectiveness of using ESF and DS decoder to obtain a more generalizable model and showcase their applicability to solve different VRP variants, i.e., travelling salesman problem and capacitated VRP. Notably, our proposed generic components require minimal computational resources, and can be effortlessly integrated into conventional generalization strategies to further elevate model generalization. Copyright © 2024, The Authors. All rights reserved.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Research on Influencing Factors of College Students' Intention of Online Health Information Behavior Based on Social Cognitive Theory

引用

Journal of Physics: Conference Series 2019年第2期1213卷

作者： Jia Kong Sanhong Deng Yue Zhang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Based on the Social Cognition Theory, we constructed the influencing factors model of college students' intention of online health information behavior from three levels of individual, society and information systems, which was analyzed by using the PLS-SEM. Research shows that self-efficacy, information service quality, social support, information literacy and information quality significantly influence college students' intention of online health information behavior. However, the influence of perceived risk and information system quality is not significant.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Zero-knowledge Proof-based Practical Federated Learning on Blockchain

arXiv

引用

arXiv 2023年

作者： Xing, Zhibo Zhang, Zijian Li, Meng Liu, Jiamou Zhu, Liehuang Russello, Giovanni Asghar, Muhammad Rizwan The School of Computer Science The University of Auckland Auckland New Zealand The School of Cyberspace Science and Technology Beijing Institute of Technology Beijing100081 China Southeast Institute of Information Technology Beijing Institute of Technology Fujian351100 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 The Department of Computer Science University of Surrey The School of Computer Science The University of Auckland Auckland New Zealand

Since the concern of privacy leakage extremely discourages user participation in sharing data, federated learning has gradually become a promising technique for both academia and industry for achieving collaborative learning without leaking information about the local data. Unfortunately, most federated learning solutions cannot efficiently verify the execution of each participant's local machine learning model and protect the privacy of user data, simultaneously. In this article, we first propose a Zero-knowledge Proof-based Federated Learning (ZKP-FL) scheme on blockchain. It leverages zero-knowledge proof for both the computation of local data and the aggregation of local model parameters, aiming to verify the computation process without requiring the plaintext of the local data. We further propose a Practical ZKP-FL (PZKP-FL) scheme to support fraction and non-linear operations. Specifically, we explore a Fraction-Integer mapping function, and use Taylor expansion to efficiently handle non-linear operations while maintaining the accuracy of the federated learning model. We also analyze the security of PZKP-FL. Performance analysis demonstrates that the whole running time of the PZKP-FL scheme is approximately less than one minute in parallel execution. Copyright © 2023, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Research on the motivation to contribution and influencing factors of university students——a semi-structured interview based on qualitative research

引用

IOP Conference Series: Materials Science and engineering 2019年第5期563卷

作者： Yueyao Li Sanhong Deng Yue Zhang School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing 210023 China

Due to the lack of theoretical knowledge and practical experience, the university students have many deficiencies in contribution. We conducted semi-structured interviews with 28 undergraduate and postgraduate students of Nanjing Agricultural University. At the same time, we used descriptive statistics and cross-analysis methods to analyse the motivations of college students' initial contribution and the influencing factor of their choice. Based on this, this paper puts forward some suggestions for the initial submission of college students, and the journals are also provided for reference in the selection of manuscripts.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Order-preserving pattern mining with forgetting mechanism

arXiv

引用

arXiv 2024年

作者： Li, Yan Ma, Chenyu Gao, Rong Wu, Youxi Li, Jinyan Wang, Wenjian Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300400 China School of Artificial Intelligence Hebei University of Technology Tianjin300400 China School of Computer Science and Control Engineering Shenzhen University of Advanced Technology Shenzhen518055 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China School of Computer and Information Technology Shanxi University Taiyuan237016 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important;however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed. Copyright © 2024, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

Evaluation of China’s Digital Economy: A Case Study using Entropy and TOPSIS

引用

Procedia Computer Science 2024年 242卷 1256-1262页

作者： Junjie Liu Boya Wang Jiayu Xue Yi Qu Yong Shi Sino-Danish College University of Chinese Academy of Sciences Beijing 100049 China Research Center on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China Faculty of Science and Engineering University of Nottingham Ningbo China Ningbo Zhejiang 315100 China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing 101408 China School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China College of Information Science and Technology University of Nebraska at Omaha Omaha NE 68182 USA

Recently, digital economy in social science has become increasingly significant. A well-constructed evaluation structure could generally and promptly describe and reveal its overall social digitalization development. Building on existent researches, this paper improves the evaluation system, which comprises four first-level indicators and thirty-one second-level indicators. Notably, this paper innovatively incorporates higher education into digital innovation of the evaluation. The Entropy method is utilized to assign weights to various indicators in an objective way, with employing the TOPSIS approach to prioritize the development of digital economy in places based on the closeness to the ideal solution. By analysing related data related from 31 provinces in China between 2017 to 2021, this paper greatly finds: Firstly, the development of digital economy vary significantly across provinces, with most provinces at a relatively poor level, indicating considerable potential for overall growth; Secondly, Guangdong, Jiangsu, Zhejiang, and Shandong consistently ranked in the top four from 2017 to 2021, reflecting their specific development attributes and their emphasis on digital economy; Thirdly, significant disparities exist both between regions and among provinces. Consequently, this paper suggests establishing a comprehensive national digital economy development plan, formulating region-specific digital economy policies tailored to local conditions, and encouraging leading provinces to actively share experiences with other provinces.

关键词： Digital economy Multi-source information Evaluation TOPSIS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：