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

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Lin, Jiawen Lu, Feng Li, Li Lin, Lingjie Li, Dongqi Borchert, Glen M. Huang, Jingshan Fuzhou University College of Computer and Data Science Fuzhou China Fujian Provincial Hospital South Branch Department of Ophthalmology Fuzhou China University of California Irvine Department of Economics School of Information and Computer Sciences Irvine United States University of South Alabama College of Medicine Department of Pharmacology Mobile United States University of South Alabama School of Computing & College of Medicine Mobile United States

ISBN: (纸本)9798350337488

To solve the label scarcity of meibomian gland segmentation in infrared meibography images, a novel framework for semi-supervised meibomian gland segmentation is firstly presented in this paper. Extra mutual feature consistency constraint is added along with the cross pseudo supervision , guiding the model more robustness and discriminative. Meanwhile, cross uncertainty rectification is introduced to avoid noisy labels, further improving the pseudo supervision. Experimental results on an internal dataset reveals that our method yields significant performances using only 10% of the labeled data compared to the fully supervised segmentation, and outperforms the state-of-the art semi-supervised segmentation methods. Combination of mutual consistency regularization and cross uncertainty rectifi-cation guides model to distinguish glands from background well with limited labeled data. © 2023 IEEE.

关键词： meibomian gland dysfunction meibomian gland segmentation mutual consistency constraint semi-supervised learning uncertainty rectification

来源：评论

学校读者我要写书评

暂无评论

TIME-FS: Joint Learning of Tensorial Incomplete Multi-View Unsupervised Feature Selection and Missing-View Imputation 39

TIME-FS: Joint Learning of Tensorial Incomplete Multi-View U...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Huang, Yanyong Lu, Minghui Huang, Wei Yi, Xiuwen Li, Tianrui Joint Laboratory of Data Science and Business Intelligence Southwestern University of Finance and Economics China College of Computer and Data Science Fuzhou University China JD Intelligent Cities Research and JD Intelligent Cities Business Unit China School of Computing and Artificial Intelligence Southwest Jiaotong University China

ISBN: (纸本)157735897X

Multi-view unsupervised feature selection (MUFS) has received considerable attention in recent years. Existing MUFS methods for processing unlabeled incomplete multi-view data, where some samples are missing in certain views, first impute the missing values and then perform feature selection on the completed dataset. However, treating imputation and feature selection as two separate processes overlooks their potential interactions. The graph-guided local structure gleaned from feature selection can aid in imputation, which in turn can enhance the feature selection performance. Additionally, most similarity graph-based MUFS methods suffer from high computational costs. To address these problems, we propose a novel MUFS method, termed Tensorial Incomplete Multi-view unsupErvised Feature Selection (TIME-FS). TIME-FS unifies missing value recovery, discriminative feature selection, and low-dimensional representation learning within a joint framework through matrix decomposition. Then, TIME-FS conducts CP decomposition on tensor data formed by the low-dimensional representations of different views to learn a consistent anchor graph across views and a view-preference weight matrix, both of which simultaneously guide missing view imputation and feature selection. Furthermore, an efficient algorithm with low time complexity and rapid convergence is proposed to solve TIME-FS. Extensive experimental results demonstrate the effectiveness and efficiency of TIME-FS over state-of-the-art methods. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and Data Science Fuzhou UniversityFuzhou350116FujianChina Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina Key Laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：评论

学校读者我要写书评

暂无评论

Aspect category and sentiment polarity detection using a permutation language-based transformer model

Aspect category and sentiment polarity detection using a per...

引用

3rd International Conference on Machine Learning and data Engineering, ICMLDE 2024

作者： Jayaraman, Ashok Kumar Trueman, Tina Ester Ananthakrishnan, Gayathri Murugappan, Abirami Cambria, Erik Manikandan, G. Mitra, Satanik HCLTech Engineering and R&D Services Tamil Nadu Chennai India Department of Computer Science University of the People CA United States School of Computer Science Engineering and Information Systems Vellore Institute of Technology Vellore India Department of Information Science and Technology Anna University Chennai India College of Computing and Data Science Nanyang Technological University Nanyang Singapore Singapore School of Computer Science and Engineering Vellore Institute of Technology Vellore India Department of Management BITS Pilani India

Aspect-based sentiment analysis (ABSA) performs fine-grained analysis on text to determine a specific aspect category and a sentiment polarity. Recently, machine learning models have played a key role in ABSA tasks. In particular, transformer-based pre-trained models have achieved promising results in natural language processing tasks. Therefore, we propose a permutation based XLNet fine-tuning model for aspect category detection and sentiment polarity detection. Our model learns bidirectional contexts via positional encoding and factorization order. We evaluate the proposed permutation language model on three ABSA datasets, namely, SentiHood, SemEval 2015, and SemEval 2016. Specifically, we studied the ABSA tasks in a constrained system with a multi-class environment. Our result indicates that the proposed permutation language model achieves a better result. © 2025 The Authors. Published by Elsevier B.V.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Beyond Graph Convolutional Network: An Interpretable Regularizer-centered Optimization Framework

arXiv

引用

arXiv 2023年

作者： Wang, Shiping Wu, Zhihao Chen, Yuhong Chen, Yong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China School of Computer Science Beijing University of Posts and Telecommunications China

Graph convolutional networks (GCNs) have been attracting widespread attentions due to their encouraging performance and powerful generalizations. However, few work provide a general view to interpret various GCNs and guide GCNs’ designs. In this paper, by revisiting the original GCN, we induce an interpretable regularizer-centerd optimization framework, in which by building appropriate regularizers we can interpret most GCNs, such as APPNP, JKNet, DAGNN, and GNN-LF/HF. Further, under the proposed framework, we devise a dual-regularizer graph convolutional network (dubbed tsGCN) to capture topological and semantic structures from graph data. Since the derived learning rule for tsGCN contains an inverse of a large matrix and thus is time-consuming, we leverage the Woodbury matrix identity and low-rank approximation tricks to successfully decrease the high computational complexity of computing infinite-order graph convolutions. Extensive experiments on eight public datasets demonstrate that tsGCN achieves superior performance against quite a few state-of-the-art competitors w.r.t. classification *** Codes 68T07 Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

VULSEYE: Detect Smart Contract Vulnerabilities via Stateful Directed Graybox Fuzzing

arXiv

引用

arXiv 2024年

作者： Liang, Ruichao Chen, Jing Wu, Cong He, Kun Wu, Yueming Cao, Ruochen Du, Ruiying Liu, Yang Zhao, Ziming Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Cyber Security Lab College of Computing and Data Science Nanyang Technological University Singapore Department of Computer Science and Engineering University at Buffalo New York United States

Smart contracts, the cornerstone of decentralized applications, have become increasingly prominent in revolutionizing the digital landscape. However, vulnerabilities in smart contracts pose great risks to user assets and undermine overall trust in decentralized systems. Fuzzing, a prominent security testing technique, is extensively explored to detect vulnerabilities. But current smart contract fuzzers fall short of expectations in testing efficiency for two primary reasons. Firstly, smart contracts are stateful programs, and existing approaches, primarily coverage-guided, lack effective feedback from the contract state. Consequently, they struggle to effectively explore the contract state space. Secondly, coverage-guided fuzzers, aiming for comprehensive program coverage, may lead to a wastage of testing resources on benign code areas. This wastage worsens in smart contract testing, as the mix of code and state spaces further complicates comprehensive testing. To address these challenges, we propose VULSEYE, a stateful directed graybox fuzzer for smart contracts guided by vulnerabilities. Different from prior works, VULSEYE achieves stateful directed fuzzing by prioritizing testing resources to code areas and contract states that are more prone to vulnerabilities. We introduce Code Targets and State Targets into fuzzing loops as the testing targets of VULSEYE. We use static analysis and pattern matching to pinpoint Code Targets, and propose a scalable backward analysis algorithm to specify State Targets. We design a novel fitness metric that leverages feedback from both the contract code space and state space, directing fuzzing toward these targets. With the guidance of code and state targets, VULSEYE alleviates the wastage of testing resources on benign code areas and achieves effective stateful fuzzing. In comparison with state-of-the-art fuzzers, VULSEYE demonstrated superior effectiveness and efficiency. Notably, it uncovered 4,845 vulnerabilities in 42,738 rea

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Towards Robust Cross-Domain Recommendation with Joint Identifiability of User Preference

arXiv

引用

arXiv 2024年

作者： Du, Jing Ye, Zesheng Guo, Bin Yu, Zhiwen Wu, Jia Yang, Jian Sheng, Michael Yao, Lina School of Computing Macquarie University SydneyNSW2109 Australia School of Computing and Information Systems University of Melbourne MelbourneVIC3052 Australia School of Computer Science Northwestern Polytechnical University Shaanxi Xi’an China Data 61 CSIRO SydneyNSW2122 Australia School of Computer Science and Engineering University of New South Wales SydneyNSW2015 Australia

Recent cross-domain recommendation (CDR) studies assume that disentangled domain-shared and domain-specific user representations can mitigate domain gaps and facilitate effective knowledge transfer. However, achieving perfect disentanglement is challenging in practice, because user behaviors in CDR are highly complex, and the true underlying user preferences cannot be fully captured through observed user-item interactions alone. Given this impracticability, we instead propose to model joint identifiability that establishes unique correspondence of user representations across domains, ensuring consistent preference modeling even when user behaviors exhibit shifts in different domains. To achieve this, we introduce a hierarchical user preference modeling framework that organizes user representations by the neural network encoder’s depth, allowing separate treatment of shallow and deeper subspaces. In the shallow subspace, our framework models the interest centroids for each user within each domain, probabilistically determining the users’ interest belongings and selectively aligning these centroids across domains to ensure fine-grained consistency in domain-irrelevant features. For deeper subspace representations, we enforce joint identifiability by decomposing it into a shared cross-domain stable component and domain-variant components, linked by a bijective transformation for unique correspondence. Empirical studies on real-world CDR tasks with varying domain correlations demonstrate that our method consistently surpasses state-of-the-art, even with weakly correlated tasks, highlighting the importance of joint identifiability in achieving robust CDR. © 2024, CC BY-NC-SA.

关键词： Network coding

来源：评论

学校读者我要写书评

暂无评论

Copula Guided Parallel Gibbs Sampling for Nonparametric and Coherent Topic Discovery (Extended Abstract) 39

Copula Guided Parallel Gibbs Sampling for Nonparametric and ...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Lin, Lihui Rao, Yanghui Xie, Haoran Lau, Raymond Y. K. Yin, Jian Wang, Fu Lee Li, Qing Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Lingnan University Department of Computing and Decision Sciences New Territories Hong Kong City University of Hong Kong Department of Information Systems Kowloon Hong Kong Sun Yat-sen University Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Hong Kong Metropolitan University School of Science and Technology Kowloon Hong Kong The Hong Kong Polytechnic University Department of Computing Kowloon Hong Kong

ISBN: (纸本)9798350322279

In terms of the generative process, the Gamma-Gamma-Poisson Process (G2PP) is equivalent to the nonparametric topic model of Hierarchical Dirichlet Process (HDP). Considering the high computational cost of estimating parameters in HDP, a parallel G2PP was developed to generate topics efficiently via multi-threading. Unfortunately, the above model needs to predefine the number of topics. To address this issue, we first propose a Topic Self-Adaptive Model (TSAM) for nonparametric and parallel topic discovery. In TSAM, a monitor-executor mechanism is developed to manage the global topic information using a hierarchical structure of threads. Based on the apparatus of copulas, we further extend our TSAM to TSAMcop for coherent topic modeling by exploiting a copula guided parallel Gibbs sampling algorithm. Extensive experiments validate the effectiveness of both TSAM and TSAMcop. © 2023 IEEE.

关键词： information management

来源：评论

学校读者我要写书评

暂无评论

Covert Communication in RSMA-Assisted Ambient Backscatter Communication Systems

引用

IEEE Transactions on Wireless Communications 2025年

作者： Zhang, Zhuo Yang, Liang Lei, Hongjiang Li, Xingwang Niyato, Dusit Hunan University College of Computer Science and Electronic Engineering Changsha410082 China Hunan University College of Computer Science and Electronic Engineering China Jishou University School of Communication and Electronic Engineering China Chongqing University of Posts and Telecommunications School of Communications and Information Engineering The Chongqing Key Laboratory of Mobile Communications Technology Chongqing400065 China Henan Polytechnic University School of Physics and Electronic Information Engineering Jiaozuo454003 China Nanyang Technological University College of Computing and Data Science Singapore639798 Singapore

In this paper, we investigate covert communication in rate-splitting multiple access (RSMA)-assisted ambient backscatter communication (AmBC) systems. Specifically, in the presence of illegitimate users, a base station applies RSMA to the downlink transmission of covert users and common users in the the primary system of ambient backscatter. To evaluate the covertness of the system, we derive closed-form expressions for the detection error probability (DEP), outage probability (OP), and covert rate (CR), where the DEP is applied to evaluate the ability of the warden to detect the presence or absence of communication behaviors between the base station and the covert user. Based on these expressions, we also conduct an asymptotic analysis of the outage probability, an upper bound analysis of the covert rate, and an analysis of the impact of the power allocation factor on system performance. Numerical results show that the RSMA scheme has a higher covert rate and a higher minimum DEP value compared to the non-orthogonal multiple access (NOMA) scheme, but it may reduce its outage performance. Additionally, an appropriate use of the power allocation factor can enhance the covertness of the system. Furthermore, we find that the co-channel interference between the primary and secondary systems in the ambient backscatter system can degrade the covert performance of the primary system. © 2002-2012 IEEE.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

MOAC: Multi-Objective Adaptive Clustering Optimization Algorithm Based on Cluster Adaptation

MOAC: Multi-Objective Adaptive Clustering Optimization Algor...

引用

Computational Intelligence Approaches and Applications (ICCIAA), International Conference on

作者： Hossam M. J. Mustafa Dheeb Albashish Ahmad Khasawneh Department of Data Science and Artificial Intelligence Faculty of Information Technology University of Petra Amman Jordan Computer Science Department Prince Abdullah bin Ghazi Faculty of Information and Communication Technology Al-Balqa Applied University Salt Jordan School of Computing Skyline University College Sharjah UAE

ISBN: (数字)9798331523657

ISBN: (纸本)9798331523664

This paper presents a novel Multi-Objective Adaptive Clustering (MOAC) algorithm that addresses current limitations in existing multi-objective optimization methods. While current algorithms often struggle with premature convergence and diversity preservation, the MOAC algorithm proposes a novel clustering-based approach to search space by partitioning. The algorithm combines cluster evolution with an adaptive parameter control mechanism to achieve significant improvements in balancing exploration-exploitation and diversity maintenance. MOAC employs k-means clustering for population partitioning, combined with cluster-based genetic operators, and an efficient diversity preservation scheme. Extensive experiments across different ZDT, MMF, and UF test suites demonstrate that MOAC's performance is superior, which achieves outstanding hypervolume and IGD values in complex multi-modal problems. The algorithm shows strength in handling complex Pareto fronts, and comprehensive statistical analysis through the Friedman rankings test with a 2.21 rank. Moreover. The results reveal that MOAC is a robust approach for complex multi-objective optimization problems, particularly maintaining solution diversity and achieving consistent convergence across different problems.

关键词： Ranking (statistics) Statistical analysis Metaheuristics Clustering algorithms Optimization methods Evolutionary computation Partitioning algorithms Maintenance Convergence Genetic operators

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：