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

Proceedings of the 41st International Conference on Machine Learning

作者： Xingcheng Fu Yisen Gao Yuecen Wei Qingyun Sun Hao Peng Jianxin Li Xianxian Li Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China and Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Decision-Making Approach for Better Selection of Blockchain Platform for Health Insurance Frauds Detection with Smart Contracts: Development and Performance Evaluation

引用

Procedia Computer Science 2023年 220卷 470-477页

作者： Rima Kaafarani Leila Ismail Oussama Zahwe ICCS-Lab Computer Science Department American University of Culture and Education 1507 Beirut Lebanon Cloud Computing and Distributed Systems (CLOUDS) Laboratory School of Computing and Information Systems The University of Melbourne Melbourne Australia Intelligent Distributed Computing and Systems (INDUCE) Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Abu Dhabi United Arab Emirates National Water and Energy Center United Arab Emirates University Abu Dhabi United Arab Emirates

Blockchain technology has piqued the interest of businesses of all types, while consistently improving and adapting to business requirements. Several blockchain platforms have emerged, making it challenging to select a suitable one for a specific type of business. This paper presents a classification of over one hundred blockchain platforms. We develop smart contracts for detecting healthcare insurance frauds using the top two blockchain platforms selected based on our proposed decision-making map approach which selects the top suitable platforms for healthcare insurance frauds detection application. Our classification shows that the largest percentage of platforms can be used for all types of application domains, the second biggest percentage for financial services, and a small number is to develop applications in specific domains. Our decision-making map and performance evaluations reveal that Hyperledger Fabric surpassed Neo in all metrics for detecting healthcare insurance frauds.

关键词： Blockchain Decision-Map Health Insurance Frauds Detection Hyperledger Fabric Neo Smart Contract Smart Healthcare

来源：评论

学校读者我要写书评

暂无评论

CLIMS++: Cross Language Image Matching with Automatic Context Discovery for Weakly Supervised Semantic Segmentation

引用

International Journal of Computer Vision 2025年 1-20页

作者： Xie, Jinheng Deng, Songhe Hou, Xianxu Luo, Zhaochuan Shen, Linlin Huang, Yawen Zheng, Yefeng Shou, Mike Zheng Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Computer Science Wenzhou-Kean University Wenzhou325060 China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore639798 Singapore School of AI and Advanced Computing Xi’an Jiaotong-Liverpool University Suzhou215400 China Jarvis Research Center Tencent YouTu Lab Shenzhen518703 China

While promising results have been achieved in weakly-supervised semantic segmentation (WSSS), limited supervision from image-level tags inevitably induces discriminative reliance and spurious relations between target classes and background regions. Thus, Class Activation Map (CAM) usually tends to activate discriminative object regions and falsely includes lots of class-related backgrounds. Without pixel-level supervisions, it could be very difficult to enlarge the foreground activation and suppress those false activation of background regions. In this paper, we propose a novel framework of Cross Language Image Matching with Automatic Context Discovery (CLIMS++), based on the recently introduced Contrastive Language-Image Pre-training (CLIP) model, for WSSS. The core idea of our framework is to introduce natural language supervision to activate more complete object regions and suppress class-related background regions in CAM. In particular, we design object, background region, and text lab.l matching losses to guide the model to excite more reasonable object regions of each category. In addition, we propose to automatically find spurious relations between foreground categories and backgrounds, through which a background suppression loss is designed to suppress the activation of class-related backgrounds. The above designs enable the proposed CLIMS++ to generate a more complete and compact activation map for the target objects. Extensive experiments on PASCAL VOC 2012 and MS COCO 2014 datasets show that our CLIMS++ significantly outperforms the previous state-of-the-art methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation

arXiv

引用

arXiv 2024年

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

A unified generalization analysis of re-weighting and logit-adjustment for imbalanced learning 23

A unified generalization analysis of re-weighting and logit-...

引用

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

作者： Zitai Wang Qianqian Xu Zhiyong Yang Yuan He Xiaochun Cao Qingming Huang SKLOIS Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences Alibaba Group School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

Real-world datasets are typically imbalanced in the sense that only a few classes have numerous samples, while many classes are associated with only a few samples. As a result, a naïve ERM learning process will be biased towards the majority classes, making it difficult to generalize to the minority classes. To address this issue, one simple but effective approach is to modify the loss function to emphasize the learning on minority classes, such as re-weighting the losses or adjusting the logits via class-dependent terms. However, existing generalization analysis of such losses is still coarse-grained and fragmented, failing to explain some empirical results. To bridge this gap, we propose a novel technique named data-dependent contraction to capture how these modified losses handle different classes. On top of this technique, a fine-grained generalization bound is established for imbalanced learning, which helps reveal the mystery of re-weighting and logit-adjustment in a unified manner. Furthermore, a principled learning algorithm is developed based on the theoretical insights. Finally, the empirical results on benchmark datasets not only validate the theoretical results but also demonstrate the effectiveness of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DRAUC: an instance-wise distributionally robust AUC optimization framework 23

DRAUC: an instance-wise distributionally robust AUC optimiza...

引用

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

作者： Siran Dai Qianqian Xu Zhiyong Yang Xiaochun Cao Qingming Huang SKLOIS Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Tech. CAS and BDKM University of Chinese Academy of Sciences

The Area Under the ROC Curve (AUC) is a widely employed metric in long-tailed classification scenarios. Nevertheless, most existing methods primarily assume that training and testing examples are drawn i.i.d. from the same distribution, which is often unachievable in practice. Distributionally Robust Optimization (DRO) enhances model performance by optimizing it for the local worst-case scenario, but directly integrating AUC optimization with DRO results in an intractable optimization problem. To tackle this challenge, methodically we propose an instance-wise surrogate loss of Distributionally Robust AUC (DRAUC) and build our optimization framework on top of it. Moreover, we highlight that conventional DRAUC may induce lab.l bias, hence introducing distribution-aware DRAUC as a more suitable metric for robust AUC learning. Theoretically, we affirm that the generalization gap between the training loss and testing error diminishes if the training set is sufficiently large. Empirically, experiments on corrupted benchmark datasets demonstrate the effectiveness of our proposed method. Code is availab.e at: https://***/EldercatSAM/DRAUC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Bridging Gaps in HCI: Advancing Education, Research, and Careers in Asia

Bridging Gaps in HCI: Advancing Education, Research, and Car...

引用

2025 CHI Conference on Human Factors in computing Systems, CHI EA 2025

作者： Gamage, Dilrukshi Cheng, Shiwei Mudliar, Preeti Lu, Zhicong Zhao, Shengdong Ahmed, Nova Ma, Xiaojuan Lee, Uichin Wang, Ding Department of Computation and Intelligent Systems University of Colombo School of Computing Colombo Sri Lanka Zhejiang University of Technology Hangzhou China International Institute of Information Technology Bangalore Bangalore India Department of Computer Science City University of Hong Kong Hong Kong School of Creative Media City University of Hong Kong Hong Kong Design Inclusion and Access Lab. Department of Electrical and Computer Engineering North South University Dhaka Dhaka Bangladesh Hong Kong University of Science and Technology Hong Kong Hong Kong School of Computing KAIST Daejeon South Korea Google Atlanta GA United States

ISBN: (纸本)9798400713958

Asia’s Human-Computer Interaction (HCI) landscape is rapidly evolving, yet it faces distinct challenges in curriculum development, research establishment, and career navigation. This panel discussion, hosted by Asia SIGCHI Committee (ASC) at CHI2025, will bring together distinguished experts to address these challenges and explore strategies for fostering a robust and inclusive HCI community in Asia. Panelists will discuss the integration of culturally relevant content in HCI education, approaches to enhancing research visibility on international platforms, and initiatives to bridge gaps between academic training and industry expectations. Through an engaging discussion and audience interaction, the panel aims to identify actionable solutions, promote collab.ration, and inspire future initiatives that strengthen HCI’s growth across the region. Participants will gain valuable insights into overcoming systemic barriers while building sustainable and impactful HCI programs tailored to Asia’s unique sociocultural dynamics. This panel seeks to advance the global relevance and contributions of HCI in Asia. © 2025 Copyright held by the owner/author(s).

关键词： Asia Curricula HCI HCI Education HCI Teaching

来源：评论

学校读者我要写书评

暂无评论

A Kind of new parallax algorithm based on symmetric continuous optimization 5

A Kind of new parallax algorithm based on symmetric continuo...

引用

2020 5th International Seminar on Computer Technology, Mechanical and Electrical engineering, ISCME 2020

作者： Jiang, Kaiwen Zhang, Degan Xu, Haixia Key Laboratory of Computer Vision and System Tianjin University of Technology Ministry of Education 300384 China Tianjin Key Lab of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin China School of Electronic and Information Engineering Tianjin Vocational Institute Tianjin300410 China

With the fast development of 3D imaginations becomes more and more fascination, multi-view stereo based 3D reconstruction is a significant technique for those application. To facilitate the subsequent processing of 3D reconstruction and reduce the possibility of other algorithms falling into local optimal solutions, attempting to get better and faster performance, a new parallax calculation based on symmetric continuous optimization is proposed in this paper. The algorithm is proposed here will be tested respectively in the same data, in order to certificate the algorithm applied is better than traditional minimize El algorithm. © Published under licence by IOP Publishing Ltd.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

SSRN

引用

SSRN 2023年

作者： Wang, Jiabao Li, Yang Wei, Xiu-Shen Li, Hang Miao, Zhuang Zhang, Rui Army Engineering University of PLA Jiangsu Nanjing210007 China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Jiangsu Nanjing210094 China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nanjing210023 China

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors for the performance gap. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer ImageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on four public FGVC datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance. © 2023, The Authors. All rights reserved.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Disentangled Hypergraph Collab.rative Filtering for Social Recommendation

Disentangled Hypergraph Collaborative Filtering for Social R...

引用

IEEE International Conference on Web Services (ICWS)

作者： Xiao Liu Shunmei Meng Qianmu Li Xiaolong Xu Lianyong Qi Wanchun Dou Jing Zhang Xuyun Zhang Nanjing University of Science and Technology China State Key Lab. for Novel Software Technology Nanjing University China School of Computer and Software Nanjing University of Information Science and Technology China College of Computer Science and Technology China University of Petroleum (East China) China School of Cyber Science and Engineering Southeast University China School of Computing Macquarie University Australia

In the current era of information overload, service recommendations have emerged as a valuable tool for enhancing the user experience. Among them, social recommendation models have shown promising results by incorporating social relationships to improve representation learning. However, most of these models lack fine-grained modeling of social user behavior, leading to a unified representation of users and a loss of expressiveness in user representations. To address this issue, we propose DisenHGCF, a new social recommendation approach based on disentangled hypergraph collab.rative filtering, to disentangle the representations of users and items at the granularity of social users’ intents. This approach aims to provide a more nuanced understanding of the user, leading to more accurate and personalized recommendations. To be specific, DisenHGCF leverages hypergraphs to represent the complex relationships among users, friends, and items. By using the hypergraph disentangling module based on attention, it is able to disentangle the user’s intents and generate users representations in cooperating their intents for recommendation tasks. Additionally, a contrastive learning task based on intent-weight perturbation is designed to enhance representational learning. The experimental results obtained from the BeiBei and Beidian datasets demonstrate the superiority of our proposed approach in comparison to previous baseline methods, as evidenced by higher Recall and NDCG scores.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：