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

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Li, Xiaona Han, Huijin Yan, Xiaoran Sun, Lu Ning, Zhaolong Xia, Feng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China School of Communication and Information Engineering Chongqing University of Posts and Telecommunications Chongqing China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Graph convolutional neural network (GCN) is a powerful deep learning framework for network data. However, variants of graph neural architectures can lead to drastically different performance on different tasks. Model comparison calls for a unifying framework with interpretability and principled experimental procedures. Based on the theories from graph signal processing (GSP), we show that GCN's capability is fundamentally limited by the uncertainty principle, and wavelets provide a controllable trade-off between local and global information. We adapt wavelet denoising filters to the graph domain, unifying popular variants of GCN under a common interpretable mathematical framework. Furthermore, we propose WaveThresh and WaveShrink which are novel GCN models based on proven denoising filters from the signal processing literature. Empirically, we evaluate our models and other popular GCNs under a more principled procedure and analyze how trade-offs between local and global graph signals can lead to better performance in different datasets. © 2023 ACM.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Learning from multi-dimensional partial labels 29

Learning from multi-dimensional partial labels

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Wang, Haobo Liu, Weiwei Zhao, Yang Hu, Tianlei Chen, Ke Chen, Gang Key Lab of Intelligent Computing Based Big Data of Zhejiang Province Zhejiang University China College of Computer Science and Technology Zhejiang University China School of Computer Science Wuhan University China

ISBN: (纸本)9780999241165

Multi-dimensional classification (MDC) has attracted much attention from the community. Though most studies consider fully annotated data, in real practice obtaining fully labeled data in MDC tasks is usually intractable. In this paper, we propose a novel learning paradigm: MultiDimensional Partial label Learning (MDPL) where the ground-truth labels of each instance are concealed in multiple candidate label sets. We first introduce the partial hamming loss for MDPL that incurs a large loss if the predicted labels are not in candidate label sets, and provide an empirical risk minimization (ERM) framework. Theoretically, we rigorously prove the conditions for ERM learnability of MDPL in both independent and dependent cases. Furthermore, we present two MDPL algorithms under our proposed ERM framework. Comprehensive experiments on both synthetic and real-world datasets validate the effectiveness of our proposals. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Federated Learning Framework with Resisting Source Inference Attacks in Smart Healthcare

SSRN

引用

SSRN 2024年

作者： Chenghe, Dong Xu, Guangquan Zhang, Jianhong Bai, Hongpeng Hao, Peng College of Intelligence and Computing Tianjin University Tianjin300354 China School of Big Data Qingdao Huanghai University Qingdao China Tianjin300350 China Department of Electrical and Computer Engineering North China University of Technology Beijing100144 China Key Laboratory of Intelligent Education Technology Application of Zhejiang Province School of Computer Science and Technology Zhejiang Normal University Jinhua321004 China

Federated Learning (FL) is a distributed machine learning technology that is extensive applications in smart healthcare, since it allows multiple medical institutions to jointly train medical diagnostic models without sharing their local sensitive dataset with others. Despite its benefits, FL is susceptible to source inference attacks and model poisoning. To avoid these issues, we propose a federated learning framework for smart healthcare that preserves privacy and employs certificateless ring signatures to counteract potential attacks. During the collaborative training process of the FL model, certificateless ring signatures are used to obscure the origin of parameter updates, ensuring the anonymity of the parameter sources. This approach has the advantage of being computationally efficient due to no complicated pairing operations. Furthermore, compared with the previous certificateless ring signature schemes, our proposed scheme is more effective in reducing the success rate of source inference attacks, and is efficient in terms of computation and communication overhead. © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

SoLar: Sinkhorn label Refinery for Imbalanced Partial-label Learning

arXiv

引用

arXiv 2022年

作者： Wang, Haobo Xia, Mingxuan Li, Yixuan Mao, Yuren Feng, Lei Chen, Gang Zhao, Junbo Key Lab of Intelligent Computing based Big Data of Zhejiang Province Zhejiang University China School of Software Technology Zhejiang University China Department of Computer Sciences University of Wisconsin-Madison United States College of Computer Science Chongqing University China Center for Advanced Intelligence Project RIKEN Japan

Partial-label learning (PLL) is a peculiar weakly-supervised learning task where the training samples are generally associated with a set of candidate labels instead of single ground truth. While a variety of label disambiguation methods have been proposed in this domain, they normally assume a class-balanced scenario that may not hold in many real-world applications. Empirically, we observe degenerated performance of the prior methods when facing the combinatorial challenge from the long-tailed distribution and partial-labeling. In this work, we first identify the major reasons that the prior work failed. We subsequently propose SoLar, a novel Optimal Transport-based framework that allows to refine the disambiguated labels towards matching the marginal class prior distribution. SoLar additionally incorporates a new and systematic mechanism for estimating the long-tailed class prior distribution under the PLL setup. Through extensive experiments, SoLar exhibits substantially superior results on standardized benchmarks compared to the previous state-of-the-art PLL methods. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Generating Action-conditioned Prompts for Open-vocabulary Video Action Recognition 24

Generating Action-conditioned Prompts for Open-vocabulary Vi...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Turbidity currents propagating down an inclined slope: particle auto-suspension

arXiv

引用

arXiv 2023年

作者： Xie, Jiafeng Hu, Peng Zhu, Chenlin Yu, Zhaosheng Pähtz, Thomas Ocean College Zhejiang University Zhoushan316021 China Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province China Jiliang University Hangzhou310018 China State Key Laboratory of Fluid Power and Mechatronic Systems Department of Mechanics Zhejiang University Hangzhou310027 China Ocean Research Center of Zhoushan Zhejiang University Zhoushan316021 China Donghai Lab Zhoushan316021 China

The Turbidity current (TC), a ubiquitous fluid-particle coupled phenomenon in the natural environment and engineering, can transport over long distances on an inclined terrain due to the suspension mechanism. A large-eddy simulation and discrete element method coupled model is employed to simulate the particle-laden gravity currents over the inclined slope in order to investigate the auto-suspension mechanism from a Lagrangian perspective. The particle Reynolds number in our TC simulation is 0.01 ∼ 0.1 and the slope angle is 1/20 ∼ 1/5. The influences of initial particle concentration and terrain slope on the particle flow regimes, particle movement patterns, fluid-particle interactions, energy budget and auto-suspension index are explored. The results indicate that the auto-suspension particles predominantly appear near the current head and their number increases and then decreases during the current evolution, which is positively correlated with the coherent structures around the head. When the turbidity current propagates downstream, the average particle Reynolds number of the auto-suspension particles remains basically unchanged, and is higher than that of other transported particles. The average particle Reynolds number of the transported particles exhibits a negative correlation with the Reynolds number of the current. Furthermore, the increase in particle concentration will enhance the particle velocity, which allows the turbidity current to advance faster and improves the perpendicular support, thereby increasing the turbidity current auto-suspension capacity. Increasing slope angle will result in a slightly larger front velocity, while the effect of that on the total force is insignificant. Copyright © 2023, The Authors. All rights reserved.

关键词： Large eddy simulation

来源：评论

学校读者我要写书评

暂无评论

HAM:a deep collaborative ranking method incorporating textual information

引用

Frontiers of Information Technology & Electronic Engineering 2020年第8期21卷 1206-1216页

作者： Cheng-wei WANG Teng-fei ZHOU Chen CHEN Tian-lei HU Gang CHEN The Key Laboratory of Big Data Intelligent Computing of Zhejiang Province Hangzhou 310027China State Key Lab of CAD&CG Zhejiang UniversityHangzhou 310027China College of Computer Science and Technology Zhejiang UniversityHangzhou 310027China

The recommendation task with a textual corpus aims to model customer preferences from both user feedback and item textual *** is highly desirable to explore a very deep neural network to capture the complicated nonlinear ***,training a deeper recommender is not as effortless as simply adding layers.A deeper recommender suffers from the gradient vanishing/exploding issue and cannot be easily trained by gradient-based ***,textual descriptions probably contain noisy word *** extracting feature vectors from them can harm the recommender’s *** overcome these difficulties,we propose a new recommendation method named the HighwAy reco Mmender(HAM).HAM explores a highway mechanism to make gradient-based training methods stable.A multi-head attention mechanism is devised to automatically denoise textual ***,a block coordinate descent method is devised to train a deep neural *** studies show that the proposed method outperforms state-of-the-art methods significantly in terms of accuracy.

关键词： Deep learning Recommendation system Highway network Block coordinate descent

来源：评论

学校读者我要写书评

暂无评论

PiCO+: Contrastive label Disambiguation for Robust Partial label Learning

arXiv

引用

arXiv 2022年

作者： Wang, Haobo Xiao, Ruixuan Li, Yixuan Feng, Lei Niu, Gang Chen, Gang Zhao, Junbo Key Lab of Intelligent Computing Based Big Data of Zhejiang Province Zhejiang University Hangzhou310027 China Department of Computer Sciences University of WisconsinMadison MadisonWI53706 United States The College of Computer Science Chongqing University Chongqing400044 China RIKEN Center for Advanced Intelligence Project Tokyo Japan

Partial label learning (PLL) is an important problem that allows each training example to be labeled with a coarse candidate set, which well suits many real-world data annotation scenarios with label ambiguity. Despite the promise, the performance of PLL often lags behind the supervised counterpart. In this work, we bridge the gap by addressing two key research challenges in PLL-representation learning and label disambiguation-in one coherent framework. Specifically, our proposed framework PiCO consists of a contrastive learning module along with a novel class prototype-based label disambiguation algorithm. PiCO produces closely aligned representations for examples from the same classes and facilitates label disambiguation. Theoretically, we show that these two components are mutually beneficial, and can be rigorously justified from an expectation-maximization (EM) algorithm perspective. Moreover, we study a challenging yet practical noisy partial label learning setup, where the ground-truth may not be included in the candidate set. To remedy this problem, we present an extension PiCO+ that performs distance-based clean sample selection and learns robust classifiers by a semi-supervised contrastive learning algorithm. Extensive experiments demonstrate that our proposed methods significantly outperform the current state-of-the-art approaches in standard and noisy PLL tasks and even achieve comparable results to fully supervised learning. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-graph Embedding for Next-POI Recommendation

Mandari: Multi-Modal Temporal Knowledge Graph-aware Sub-grap...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoqian Liu Xiuyun Li Yuan Cao Fan Zhang Xiongnan Jin Jinpeng Chen School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education Beijing China The Technology Innovation Center of Cultural Tourism Big Data of Hebei Province Chengde China Hebei Normal University for Nationalities Chengde China Knowledge Discovery and Data Mining Research Center Zhejiang Lab Hangzhou China

Next-POI recommendation aims to explore from user check-in sequence to predict the next possible location to be visited. Existing methods are often difficult to model the implicit association of multi-modal data with user choices. Moreover, traditional methods struggle to fully explore the variation of user preferences at variable time intervals. To tackle these limitations, we propose a Multi-Modal Temporal Knowledge Graph-aware Sub-graph Embedding approach (Mandari). We first construct a novel Multi-Modal Temporal Knowledge Graph. Based on the proposed knowledge graph, we integrate multi-modal information and leverage the graph attention network to calculate sub-graph prediction probability. Next, we implement a temporal knowledge mining method to model the segmentation and periodicity of user check-in and obtain temporal prediction probability. Finally, we fuse temporal prediction probability with the previous sub-graph prediction probability to obtain the final result. Extensive experiments demonstrate that our approach outperforms existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：