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

arXiv 2024年

作者： Luo, Junyu Gu, Yiyang Luo, Xiao Ju, Wei Xiao, Zhiping Zhao, Yusheng Yuan, Jingyang Zhang, Ming School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University-Anker Embodied AI Lab Peking University Beijing China Department of Computer Science University of California Los Angeles United States

Source-free domain adaptation is a crucial machine learning topic, as it contains numerous applications in the real world, particularly with respect to data privacy. Existing approaches predominantly focus on Euclidean data, such as images and videos, while the exploration of non-Euclidean graph data remains scarce. Recent graph neural network (GNN) approaches can suffer from serious performance decline due to domain shift and label scarcity in source-free adaptation scenarios. In this study, we propose a novel method named Graph Diffusion-based Alignment with Jigsaw (GALA), tailored for source-free graph domain adaptation. To achieve domain alignment, GALA employs a graph diffusion model to reconstruct source-style graphs from target data. Specifically, a score-based graph diffusion model is trained using source graphs to learn the generative source styles. Then, we introduce perturbations to target graphs via a stochastic differential equation instead of sampling from a prior, followed by the reverse process to reconstruct source-style graphs. We feed the source-style graphs into an off-the-shelf GNN and introduce class-specific thresholds with curriculum learning, which can generate accurate and unbiased pseudo-labels for target graphs. Moreover, we develop a simple yet effective graph-mixing strategy named graph jigsaw to combine confident graphs and unconfident graphs, which can enhance generalization capabilities and robustness via consistency learning. Extensive experiments on benchmark datasets validate the effectiveness of GALA. The source code is available at thttps://***/luo-junyu/GALA. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ordinal distribution regression for gait-based age estimation

引用

science China(information sciences) 2020年第2期63卷 21-34页

作者： Haiping ZHU Yuheng ZHANG Guohao LI Junping ZHANG Hongming SHAN Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Department of Biomedical Engineering Rensselaer Polytechnic Institute

computer vision researchers prefer to estimate age from face images because facial features provide useful information. However, estimating age from face images becomes challenging when people are distant from the camera or occluded. A person’s gait is a unique biometric feature that can be perceived efficiently even at a distance. Thus, gait can be used to predict age when face images are not ***, existing gait-based classification or regression methods ignore the ordinal relationship of different ages, which is an important clue for age estimation. This paper proposes an ordinal distribution regression with a global and local convolutional neural network for gait-based age estimation. Specifically, we decompose gait-based age regression into a series of binary classifications to incorporate the ordinal age ***, an ordinal distribution loss is proposed to consider the inner relationships among these classifications by penalizing the distribution discrepancy between the estimated value and the ground truth. In addition,our neural network comprises a global and three local sub-networks, and thus, is capable of learning the global structure and local details from the head, body, and feet. Experimental results indicate that the proposed approach outperforms state-of-the-art gait-based age estimation methods on the OULP-Age dataset.

关键词： computer vision deep learning ordinal distribution regression global and local features gaitbased age estimation

来源：评论

学校读者我要写书评

暂无评论

Selection of Cancer Biomarkers from Microarray Gene Expression Data Utilizing the Bi-Objective Optimization Method

Selection of Cancer Biomarkers from Microarray Gene Expressi...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Jiang, Hanjing Lin, Jianqing Zhu, Huachao Huang, Yabing Huazhong University of Science and Technology Key Lab. of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Wuhan430074 China Wuhan University School of Computer Science Wuhan430064 China Renmin Hospital of Wuhan University Department of Pathology Wuhan430060 China

ISBN: (纸本)9798350337488

Cancer-associated biomarker genes play an indispensable role in the intricate tapestry of cancer development and manifestation. The expression of biomarkers in different types of tumor cells has beneficial implications for shedding light on the development of various cancers, guiding clinical diagnosis, and treatment. Microarray technology enables the expression levels of thousands of genes in samples to be sequenced simultaneously. However, sparse and high-dimensional microarray data present a formidable challenge in identifying biomarker genes. This study presents EREF-NSGA2, a novel method for cancer biomarker selection from microarray data, employing a hybrid gene selection approach. Firstly, the combination of the wrapper and embedded gene selection methods is proposed to filter the microarray data, which efficiently decreases the search space of the algorithm. After that, the improved NSGA-II algorithm is used to search the genes subset obtained from the previous step to reach the optimal subset of cancer biomarker genes. The proposed EREF-NSGA2 is compared with other reported methods on six cancer benchmark gene expression datasets. A detailed biological analysis is performed to analyze the relationship between the selected genes and the cancer data sets they belong to. To summarize, EREF-NSGA2 proves its effectiveness in selecting a feature subset comprising the fewest genes while maintaining the highest classification accuracy. © 2023 IEEE.

关键词： Bi-objective optimization Cancer biomarker Gene selection NSGA-II

来源：评论

学校读者我要写书评

暂无评论

M3-20M: A Large-Scale Multi-Modal Molecule Dataset for AI-driven Drug Design and Discovery

arXiv

引用

arXiv 2024年

作者： Guo, Siyuan Wang, Lexuan Jin, Chang Wang, Jinxian Peng, Han Shi, Huayang Li, Wengen Guan, Jihong Zhou, Shuigeng Department of Computer Science and Technology Tongji University No. 4800 Cao’an Road Shanghai201804 China Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 2005 Songhu Road Shanghai200438 China

This paper introduces M3-20M, a large-scale Multi-Modal Molecule dataset that contains over 20 million molecules, with the data mainly being integrated from existing databases and partially generated by large language models. Designed to support AI-driven drug design and discovery, M3-20M is 71 times more in the number of molecules than the largest existing dataset, providing an unprecedented scale that can highly benefit the training or fine-tuning of models, including large language models for drug design and discovery tasks. This dataset integrates one-dimensional SMILES, two-dimensional molecular graphs, three-dimensional molecular structures, physicochemical properties, and textual descriptions collected through web crawling and generated using GPT-3.5, offering a comprehensive view of each molecule. To demonstrate the power of M3-20M in drug design and discovery, we conduct extensive experiments on two key tasks: molecule generation and molecular property prediction, using large language models including GLM4, GPT-3.5, GPT-4, and Llama3-8b. Our experimental results show that M3-20M can significantly boost model performance in both tasks. Specifically, it enables the models to generate more diverse and valid molecular structures and achieve higher property prediction accuracy than existing single-modal datasets, which validates the value and potential of M3-20M in supporting AI-driven drug design and discovery. The dataset is available at https://***/bz99bz/M-3. Copyright © 2024, The Authors. All rights reserved.

关键词： Web crawler

来源：评论

学校读者我要写书评

暂无评论

Tail Classes Matter: Long-Tailed Object Detection Revisited

Tail Classes Matter: Long-Tailed Object Detection Revisited

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： Yinglu Zhang Chenbo Zhang Lu Zhang Tianying Liu Jihong Guan Xinkai Liang Jiajia Zhao Shuigeng Zhou Shanghai Key Lab of Intelligent Information Processing and School of Computer Science Fudan University China Department of Computer Science & Technology Tongji University China Science and Technology on Complex System Conroland InelligentAgent Cooperation Laboratory Beijing Electro-Mechanical Engineering Institute China

Real-world data ubiquitously exhibit long-tailed distribution, which sparks the increasing interest in long-tailed object detection (LTOD). However, existing methods neglect that a lack of diverse data in tail classes will cause underrepresented tail class features, making their efforts for balancing foreground classes tend to over-fit tail classes and be less effective. In this paper, we propose a multi-class co-attention generation network to increase data diversity of tail classes by generating augmented samples. To alleviate imbalance, we develop a distribution-aware up-sampling strategy, performing differential up-sampling for different classes and design a bi-directional regulation loss to adjust both positive and negative gradients. Moreover, we construct a new dataset LVIS-X with more rare classes based on existing LTOD benchmark dataset LVIS. Experiments on LVIS and LVIS-X demonstrate the superiority of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FediLive: A Framework for Collecting and Preprocessing Snapshots of Decentralized Online Social Networks 25

FediLive: A Framework for Collecting and Preprocessing Snaps...

引用

Companion Proceedings of the ACM on Web Conference 2025

作者： Shaojie Min Shaobin Wang Yaxiao Luo Min Gao Qingyuan Gong Yu Xiao Yang Chen Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University Shanghai China Research Institute of Intelligent Complex Systems Fudan University Shanghai China Department of Information and Communications Engineering Aalto University Espoo Finland

ISBN: (纸本)9798400713316

Decentralized online social networks such as Mastodon have emerged quickly during the past years, and offer unique opportunities to investigate user behavior, moderation strategies, and community evolution. However, their decentralized nature imposes challenges for data collection and preprocessing, particularly for obtaining a real-time snapshot in a timely manner. This paper introduces FediLive, a framework designed to rapidly collect and preprocess the live feeds from Mastodon, generate a comprehensive snapshot in real-time, including user-generated contents, interaction networks, and users' demographic attributes. Such a snapshot could further be leveraged for data analysis from different angles, leading to a deeper understanding of user activities on Mastodon. Using FediLive, we collected a 13-day snapshot of Mastodon, covering the publicly-visible activities of all Mastodon users. Our study demonstrates the usefulness of FediLive, and reveals its potential in facilitating data-driven analysis for decentralized online social networks.

关键词： decentralized online social networks

来源：评论

学校读者我要写书评

暂无评论

Attention Bootstrapping for Multi-Modal Test-Time Adaptation 39

Attention Bootstrapping for Multi-Modal Test-Time Adaptation

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Zhao, Yusheng Luo, Junyu Luo, Xiao Huang, Jinsheng Yuan, Jingyang Xiao, Zhiping Zhang, Ming State Key Laboratory for Multimedia Information Processing School of Computer Science PKU-Anker LLM Lab Peking University Beijing China Department of Computer Science University of California Los AngelesCA United States Paul G. Allen School of Computer Science and Engineering University of Washington SeattleWA United States

ISBN: (纸本)157735897X

Test-time adaptation aims to adapt a well-trained model to potential distribution shifts at test time using only unlabeled test data, without access to the original training data. While previous efforts mainly focus on a single modality, test-time distribution shift in the multi-modal setting is more complex and calls for new solutions. This paper tackles the problem of multi-modal test-time adaptation by proposing a novel method named Attention Bootstrapping with Principal Entropy Minimization (ABPEM). We observe that test-time distribution shift causes misalignment across modalities, leading to a large gap between intra-modality discrepancies (measured by self-attention) and inter-modality discrepancies (measured by cross-attention). We name this the attention gap. This attention gap widens with more severe distribution shifts, hindering effective modality fusion. To mitigate this attention gap and encourage better modality fusion, we propose attention bootstrapping that promotes cross-attention with the guidance of self-attention. Moreover, to reduce the gradient noise in the commonly-used entropy minimization, we adopt principal entropy minimization, a refinement of entropy minimization that reduces gradient noise by focusing on the principal parts of entropy, excluding less reliable gradient information. Extensive experiments on the benchmarks validate the effectiveness of the proposed ABPEM in comparison with competing baselines. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

Attention Bootstrapping for Multi-Modal Test-Time Adaptation

arXiv

引用

arXiv 2025年

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-enhanced dual semi-supervised graph classification 24

Hypergraph-enhanced dual semi-supervised graph classificatio...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Wei Ju Zhengyang Mao Siyu Yi Yifang Qin Yiyang Gu Zhiping Xiao Yifan Wang Xiao Luo Ming Zhang School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University-Anker Embodied AI Lab Peking University China School of Statistics and Data Science Nankai University China Department of Computer Science University of California Los Angeles School of Information Technology & Management University of International Business and Economics China

In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph neural networks (GNNs), they typically require a large number of costly labeled graphs, while a wealth of unlabeled graphs fail to be effectively utilized. Moreover, GNNs are inherently limited to encoding local neighborhood information using message-passing mechanisms, thus lacking the ability to model higher-order dependencies among nodes. To tackle these challenges, we propose a Hypergraph-Enhanced DuAL framework named HEAL for semi-supervised graph classification, which captures graph semantics from the perspective of the hypergraph and the line graph, respectively. Specifically, to better explore the higher-order relationships among nodes, we design a hypergraph structure learning to adaptively learn complex node dependencies beyond pairwise relations. Meanwhile, based on the learned hypergraph, we introduce a line graph to capture the interaction between hyperedges, thereby better mining the underlying semantic structures. Finally, we develop a relational consistency learning to facilitate knowledge transfer between the two branches and provide better mutual guidance. Extensive experiments on real-world graph datasets verify the effectiveness of the proposed method against existing state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

neural Underwater Scene Representation

Neural Underwater Scene Representation

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yunkai Tang Chengxuan Zhu Renjie Wan Chao Xu Boxin Shi National Engineering Research Center of Visual Technology School of Computer Science Peking University National Key Laboratory for Multimedia Information Processing School of Computer Science Peking University National Key Lab of General AI School of Intelligence Science and Technology Peking University Department of Computer Science Hong Kong Baptist University

ISBN: (数字)9798350353006

ISBN: (纸本)9798350353013

Among the numerous efforts towards digitally recovering the physical world, neural Radiance Fields (NeRFs) have proved effective in most cases. However, underwater scene introduces unique challenges due to the absorbing water medium, the local change in lighting and the dynamic contents in the scene. We aim at developing a neural under-water scene representation for these challenges, modeling the complex process of attenuation, unstable in-scattering and moving objects during light transport. The proposed method can reconstruct the scenes from both established datasets and in-the-wild videos with outstanding fidelity.

关键词： Solid modeling Visualization Computational modeling Urban areas Lighting Virtual reality neural radiance field

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：