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

32nd ACM International Conference on Multimedia, MM 2024

作者： Li, Ao Liu, Huijun Sheng, Jinrong Chen, Zhongming Ge, Yongxin School of Big Data and Software Engineering Chongqing University Chongqing China College of Computer Science Chongqing University Chongqing China

ISBN: (纸本)9798400706868

Weakly-supervised Temporal Action Localization (WTAL) following a localization-by-classification paradigm has achieved significant results, yet still grapples with confounding arising from ambiguous snippets. Previous works have attempted to distinguish these ambiguous snippets from action snippets without investigating the underlying causes of their formation, thus failing to effectively eliminate the bias on both action-context and action-content. In this paper, we revisit WTAL from the perspective of structural causal model to identify the true origins of confounding, and propose an efficient dual-confounding eliminating framework to alleviate these biases. Specifically, we construct a Substituted Confounder Set (SCS) to eliminate the confounding bias on action-context by leveraging the modal disparity between RGB and FLOW. Then, a Multi-level Consistency Mining (MCM) method is designed to mitigate the confounding bias on action-content by utilizing the consistency between discriminative snippets and corresponding proposals at both the feature and label levels. Notably, SCS and MCM could be seamlessly integrated into any two-stream models without additional parameters by Expectation-Maximization (EM) algorithm. Extensive experiments on two challenging benchmarks including THUMOS14 and ActivityNet-1.2 demonstrate the superior performance of our method. © 2024 ACM.

关键词： Expectation maximization algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Truss Computation in Dynamic Graphs

引用

Tsinghua science and Technology 2023年第5期28卷 873-887页

作者： Ziwei Mo Qi Luo Dongxiao Yu Hao Sheng Jiguo Yu Xiuzhen Cheng School of Computer Science and Technology Shandong UniversityQingdao 266200China State Key Laboratory of Software Development Environment School of Computer Science and Engineering and the Beijing Advanced Innovation Center for Big Data and Brain ComputingBeihang UniversityBeijing 100191China Big Data Institute Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China

Large-scale graphs usually exhibit global sparsity with local cohesiveness,and mining the representative cohesive subgraphs is a fundamental problem in graph *** k-truss is one of the most commonly studied cohesive subgraphs,in which each edge is formed in at least k 2 triangles.A critical issue in mining a k-truss lies in the computation of the trussness of each edge,which is the maximum value of k that an edge can be in a *** works mostly focus on truss computation in static graphs by sequential ***,the graphs are constantly changing dynamically in the real *** study distributed truss computation in dynamic graphs in this *** particular,we compute the trussness of edges based on the local nature of the k-truss in a synchronized node-centric distributed *** decomposing the trussness of edges by relying only on local topological information is possible with the proposed distributed decomposition ***,the distributed maintenance algorithm only needs to update a small amount of dynamic information to complete the *** experiments have been conducted to show the scalability and efficiency of the proposed algorithm.

关键词： distributed algorithm dynamic graph graph mining cohesive subgraph k-truss

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Method to Measure Distribution Consistency of Mixed-Attribute datasets

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2023年第1期4卷 182-196页

作者： He, Yulin Ye, Xuan Huang, Defa Fournier-Viger, Philippe Huang, Joshua Zhexue College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China

Random sample partition (RSP) is a newly developed data management and processing model for big data processing and analysis. To apply the RSP model for big data computation tasks, it is very important to measure the distribution consistency of different datasets. Existing measurement methods for continuous-attribute and discrete-attribute datasets cannot directly deal with mixed-attribute datasets. In this article, we design a hybrid method to measure the distribution consistency among different mixed-attribute datasets by using a multilayer extreme learning machine (MLELM) and the generalized maximum mean discrepancy (GMMD) criterion, abbreviated as MLELM-GMMD. MLELM is first used to transform original mixed-attribute datasets into corresponding deep encoding datasets. Then, the GMMD criterion is applied to check the distribution consistency of the deep encoding datasets. Four experiments have been done to validate the feasibility and effectiveness of MLELM-GMMD, i.e., the impact of MLELM on the amount of information during mixed-attribute data transformation, the impact of MLELM on distributions of mixed-attribute data, the distribution consistencies of RSP and non-RSP data blocks, and the comparison with other measurement methods. Experimental results show that the proposed MLELM-GMMD method can measure the distribution consistency of mixed-attribute datasets more accurately than one-hot encoding-based methods. © 2022 IEEE.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Architecture Search

MPNAS: Multimodal Sentiment Analysis Pruning via Neural Arch...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Binyan Ren, Ao Zhang, Zihao Duan, Moming Liu, Duo Tan, Yujuan Zhong, Kan College of Computer Science Chongqing University Chongqing China School of Big Data Software & Engineering Chongqing University Chongqing China Institute of Data Science National University of Singapore Singapore

ISBN: (纸本)9798350368741

With the rapid development of social media, sentiment analysis from multimodal posts has garnered significant attention in recent years. However, the substantial size of these models impedes their deployment on resource-constrained embedded devices. Although pruning has been extensively studied to reduce the size of unimodal models, specific challenges remain for Multimodal Sentiment Analysis (MSA) models. First, existing techniques prune fixed original models into sparse models, while our findings indicate that different model architectures of identical size yield varying performance outcomes. Second, prior studies fail to explore the unique characteristics of MSA models, resulting in suboptimal pruning performance. To address these challenges, we propose MPNAS, a unified pruning framework via Neural Architecture Search (NAS) for MSA models. Specifically, we formulate pruning as a NAS problem and analyze MSA model characteristics to guide the subnet search. We conduct an initial coarse-grained NAS on the original model, expanding the search space slightly to identify suitable subnets that enhance pruning rates and accuracy. Subsequently, we refine coarse-grained subnets in a fine-grained NAS stage, where MSA model characteristics guide the search process. Extensive experiments on three representative datasets demonstrate the superiority of our approach over existing methods. © 2025 IEEE.

关键词： Multimodal Compression NAS

来源：评论

学校读者我要写书评

暂无评论

DBKEM-AACS: a distributed key escrow model in blockchain with anonymous authentication and committee selection

引用

science China(Information sciences) 2023年第3期66卷 289-290页

作者： Axin XIANG Hongfeng GAO Youliang TIAN Liang WAN College of Computer Science and Technology Guizhou University Institute of Cryptography and Data Security Guizhou University Network and Information Management Center Guizhou University State Key Laboratory of Public Big Data Guizhou University Institute of Computer Software and Theory Guizhou University

Dear editor, Key security is of great practical significance and demand to guarantee the security of digital assets in the blockchain system. At present, users prefer to escrow their assets on centralized institutions, but this phenomenon has gone against the unique characteristics of decentralization and anonymity in the blockchain. Among them, the suspense incidents of assets lock or lost are enough to prove that the security of escrowed keys on the exchanges is questionable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Tree Regularization for Visual Explanations of Cancer Cell Classification

Tree Regularization for Visual Explanations of Cancer Cell C...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Raza, Muhammad Umair Chen, Jie Wang, Li Nawaz, Adil Leung, Victor C.M. Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology China

ISBN: (纸本)9798350386226

The challenge of interpretability remains a significant barrier to adopting deep neural networks in healthcare domains. Although tree regularization aims to align a deep neural network's decisions with a single axis-aligned decision tree, however, relying on one tree for all inputs often leads to sub-optimal performance and interoperability. To address this limitation, we propose an enhanced tree regularization method that integrates a post-hoc visual explainable model such as Grad-CAM. This approach guides the deep model to be well-approximated by decision trees tailored to the salient regions identified by Grad-CAM in the input space. We rigorously validate the effectiveness of this framework on two cancer cell datasets: CNMC, which focuses on acute lymphoblastic leukemia cells, and ISBI2016, which comprises benign and malignant skin lesions. The results demonstrate that the proposed method delivers simpler and more interpretable explanations without compromising accuracy, thereby advancing the interpretability of deep learning models in critical healthcare applications. © 2024 IEEE.

关键词： Cancer cells

来源：评论

学校读者我要写书评

暂无评论

Time Series data Cleaning under Expressive Constraints on Both Rows and Columns 40

Time Series Data Cleaning under Expressive Constraints on Bo...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Ding, Xiaoou Li, Genglong Wang, Hongzhi Wang, Chen Song, Yichen School of Computer Science and Technology Harbin Institute of Technology China Tsinghua University National Engineering Laboratory for Big Data Software EIRI China

ISBN: (纸本)9798350317152

Time series data generated by thousands of sensors are suffering data quality problems. Traditional constraint-based techniques have greatly contributed to data cleaning applications. However, cleaning methods that support expressive constraints on time series data remain insufficient. Given the notable characteristics of time series data, existing cleaning approaches are challenged to provide good repair solutions. To address the challenges, we propose a novel data cleaning method for time series which incorporates expressive constraints that support arithmetic operations between attributes and time context. In the violation detection phase, we introduce specialized violation degree quantification functions and design a violation cell discovery algorithm to identify errors hidden in time series data. In the data repairing phase, we formalize the cleaning task as a constrained optimization problem and develop a novel repair objective function that considers both modification costs and conformance degrees of constraints. We effectively reduce the repair search space through the evaluation of time-context constraints and propose a bidirectional repairing algorithm. We also provide theoretical analysis of the proposed repairing method. Experimental results on three real-world IoT datasets across five metrics demonstrate that our proposed method outperforms seven state-of-the-art cleaning techniques specialized for time series data. Specifically, we achieve a 60% improvement in repairing effectiveness and a 70% reduction in time costs with our designed cleaning strategy. © 2024 IEEE.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Multi-Task Learning for Alzheimer's Disease Diagnosis and Mini-Mental State Examination Score Prediction

引用

big data Mining and Analytics 2024年第3期7卷 828-842页

作者： Jin Liu Xu Tian Hanhe Lin Hong-Dong Li Yi Pan Hunan Provincial Key Lab on Bioinformatics School of Computer Science and EngineeringCentral South UniversityChangsha 410083China Xinjiang Engineering Research Center of Big Data and Intelligent Software School of SoftwareXinjiang UniversityUrumqi 830091China School of Science and Engineering University of DundeeDundeeDD14HNUK Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China

Accurately diagnosing Alzheimer's disease is essential for improving elderly ***,accurate prediction of the mini-mental state examination score also can measure cognition impairment and track the progression of Alzheimer's ***,most of the existing methods perform Alzheimer's disease diagnosis and mini-mental state examination score prediction separately and ignore the relation between these two *** address this challenging problem,we propose a novel multi-task learning method,which uses feature interaction to explore the relationship between Alzheimer's disease diagnosis and minimental state examination score *** our proposed method,features from each task branch are firstly decoupled into candidate and non-candidate parts for ***,we propose feature sharing module to obtain shared features from candidate features and return shared features to task branches,which can promote the learning of each *** validate the effectiveness of our proposed method on multiple *** Alzheimer's disease neuroimaging initiative 1 dataset,the accuracy in diagnosis task and the root mean squared error in prediction task of our proposed method is 87.86%and 2.5,*** results show that our proposed method outperforms most state-of-the-art *** proposed method enables accurate Alzheimer's disease diagnosis and mini-mental state examination score ***,it can be used as a reference for the clinical diagnosis of Alzheimer's disease,and can also help doctors and patients track disease progression in a timely manner.

关键词： multi-task learning Alzheimer's disease diagnosis mini-mental state examination score prediction

来源：评论

学校读者我要写书评

暂无评论

PAIR: Protein-aptamer interaction prediction based on language models and contrastive learning framework

PAIR: Protein-aptamer interaction prediction based on langua...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Zhang, Jun Yan, Zhiqiang Zeng, Hao Zhu, Zexuan Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen University College of Computer Science and Software Engineering Shenzhen China

ISBN: (纸本)9798350386226

Aptamers are single-stranded DNA or RNA oligonucleotides that selectively bind to specific targets, making them valuable for drug design and diagnostic applications. Identifying the interactions between aptamers and target proteins is crucial for these applications. The systematic evolution of ligands by exponential enrichment process, traditionally used for this purpose, is challenging and time-consuming. The resulting aptamers often suffer from limitations in stability and diversity. Computational approaches have shown promise in aiding the discovery of high-performance aptamers, but existing methods are usually constrained by insufficient training data and limited generalizability. Recently, advancements in pre-training large language models have offered a new avenue to mitigate the dependency on large datasets. In this study, we propose a novel method to predict aptamer-protein interactions using large language models within a contrastive learning framework. Experimental results demonstrate that our method exhibits superior generalization and outperforms existing approaches. This method holds promise as a powerful tool for predicting aptamer-protein interactions. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Efficient Relaxed Functional Dependency Discovery with Minimal Set Cover 40

Efficient Relaxed Functional Dependency Discovery with Minim...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Ding, Xiaoou Liu, Yida Wang, Hongzhi Wang, Chen Song, Yichen Yang, Donghua Wang, Jianmin School of Computer Science and Technology Harbin Institute of Technology China National Engineering Research Center for Big Data Software EIRI Tsinghua University China

ISBN: (纸本)9798350317152

Assessing data quality through Functional Depen-dencies (FDs) is a crucial aspect of data governance. However, with the diverse range of data sources and the exponential growth in data volume, exact FDs can sometimes be impractical for real-world applications. In contrast, relaxed functional dependencies (RFDs), which allows for some flexibility in attribute value comparisons, demonstrates greater adaptability and flexibility for big data scenarios. To address the efficient discovery of RFDs, this paper proposes a novel mining method to supplement the current research gaps. By establishing a difference table for tuples, we transform the problem into a specialized minimal set covering problem. Additionally, we introduce two optimization strategies: reducing the time complexity of enumerating the left-hand side of the base RFDs to 0 (1) and decreasing the search complexity for feasible LHS attributes and threshold candidates from O(2m-l) to O(1.5m-1). We rigorously proof that our mining approach guarantees the identification of validity and minimal RFDs. Experiments on nine real-world datasets reveal that our method significantly improves efficiency compared to existing techniques. Furthermore, it uncovers more concise and higher-quality RFDs. Importantly, the RFDs extracted through our methodology exhibit better performance in downstream cleaning tasks. © 2024 IEEE.

关键词： Quality management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：