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

Tensor completion via Tucker decomposition with Correlated Total Variation regularization on factor matrices

Signal Processing 2025年

作者： Min Wang Zhuying Chen Qiang Wu Liang Zhong School of Computing and Artificial Intelligence Jiangxi Provincial Key Laboratory of Multimedia Intelligent Processing Jiangxi University of Finance and Economics Nanchang 330013 Jiangxi China School of Electrical and Data Engineering Global Big Data Technologies Centre University of Technology Sydney Ultimo 2007 NSW Australia

Multidimensional data, such as color images and videos, often exhibit inherent low-rank and local smoothness properties, with temporal and spatial correlations playing a crucial role in data recovery. While most existing methods focus on modeling these properties independently, they often overlook their coupled correlation in the factor space derived during tensor decomposition. In this study, we propose a novel Matrix Correlated Total Variation (MCTV) regularizer to explicitly model the coupled correlation between low-rankness and smoothness within Tucker decomposition. Unlike traditional methods, MCTV propagates the low-rankness of factor matrices to the Tucker rank, eliminating the need to predefine the core tensor size. It also preserves temporal and spatial smoothness correlations across all tensor modes through operations on smooth factor matrices. By integrating MCTV into a Tucker-based tensor completion model, we remove the dependence on hyperparameters like the Tucker rank and tradeoff parameters, creating a unified framework for capturing these coupled correlations. To optimize the proposed model, we design an efficient Alternating Direction Method of Multipliers (ADMM) algorithm. Experimental results on benchmark datasets demonstrate the superiority of our method in recovering multidimensional data by effectively modeling the synergy between low-rankness and smoothness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm

arXiv

引用

arXiv 2022年

作者： Bao, Shilong Xu, Qianqian Yang, Zhiyong He, Yuan Cao, Xiaochun Huang, Qingming State Key Laboratory of Information Security Institute of Information Engineering CAS China School of Cyber Security University of Chinese Academy of Sciences China Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS China School of Computer Science and Tech. University of Chinese Academy of Sciences China Alibaba Group China School of Cyber Science and Technology Shenzhen Campus Sun Yat-sen University China Key Laboratory of Big Data Mining and Knowledge Management CAS China Peng Cheng Laboratory China

Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems (RS), closing the gap between metric learning and Collaborative Filtering. Following the convention of RS, existing methods exploit unique user representation in their model design. This paper focuses on a challenging scenario where a user has multiple categories of interests. Under this setting, we argue that the unique user representation might induce preference bias, especially when the item category distribution is imbalanced. To address this issue, we propose a novel method called Diversity-Promoting Collaborative Metric Learning (DPCML), with the hope of considering the commonly ignored minority interest of the user. The key idea behind DPCML is to include a multiple set of representations for each user in the system. Based on this embedding paradigm, user preference toward an item is aggregated from different embeddings by taking the minimum item-user distance among the user embedding set. Furthermore, we observe that the diversity of the embeddings for the same user also plays an essential role in the model. To this end, we propose a diversity control regularization term to accommodate the multi-vector representation strategy better. Theoretically, we show that DPCML could generalize well to unseen test data by tackling the challenge of the annoying operation that comes from the minimum value. Experiments over a range of benchmark datasets speak to the efficacy of DPCML. © 2022, CC BY-NC-SA.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

AdAUC: End-to-end Adversarial AUC Optimization Against Long-tail Problems

arXiv

引用

arXiv 2022年

作者： Hou, Wenzheng Xu, Qianqian Yang, Zhiyong Bao, Shilong He, Yuan Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China Alibaba Group Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

It is well-known that deep learning models are vulnerable to adversarial examples. Existing studies of adversarial training have made great progress against this challenge. As a typical trait, they often assume that the class distribution is overall balanced. However, long-tail datasets are ubiquitous in a wide spectrum of applications, where the amount of head class instances is larger than the tail classes. Under such a scenario, AUC is a much more reasonable metric than accuracy since it is insensitive toward class distribution. Motivated by this, we present an early trial to explore adversarial training methods to optimize AUC. The main challenge lies in that the positive and negative examples are tightly coupled in the objective function. As a direct result, one cannot generate adversarial examples without a full scan of the dataset. To address this issue, based on a concavity regularization scheme, we reformulate the AUC optimization problem as a saddle point problem, where the objective becomes an instance-wise function. This leads to an end-to-end training protocol. Furthermore, we provide a convergence guarantee of the proposed algorithm. Our analysis differs from the existing studies since the algorithm is asked to generate adversarial examples by calculating the gradient of a min-max problem. Finally, the extensive experimental results show the performance and robustness of our algorithm in three long-tail datasets. © 2022, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Granule Density-Based Outlier Detection with Multi-Scale Granular Balls

arXiv

引用

arXiv 2025年

作者： Gao, Can Tan, Xiaofeng Zhou, Jie Ding, Weiping Pedrycz, Witold The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The School of Artificial Intelligence and Computer Science Nantong University Nantong226019 China The Faculty of Data Science City University of Macau Macau999078 China The Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia The Department of Computer Engineering Istinye University Istanbul Turkey

Outlier detection refers to the identification of anomalous samples that deviate significantly from the distribution of normal data and has been extensively studied and used in a variety of practical tasks. However, most unsupervised outlier detection methods are carefully designed to detect specified outliers, while real-world data may be entangled with different types of outliers. In this study, we propose a fuzzy rough sets-based multi-scale outlier detection method to identify various types of outliers. Specifically, a novel fuzzy rough sets-based method that integrates relative fuzzy granule density is first introduced to improve the capability of detecting local outliers. Then, a multi-scale view generation method based on granular-ball computing is proposed to collaboratively identify group outliers at different levels of granularity. Moreover, reliable outliers and inliers determined by the three-way decision are used to train a weighted support vector machine to further improve the performance of outlier detection. The proposed method innovatively transforms unsupervised outlier detection into a semi-supervised classification problem and for the first time explores the fuzzy rough sets-based outlier detection from the perspective of multi-scale granular balls, allowing for high adaptability to different types of outliers. Extensive experiments carried out on both artificial and UCI datasets demonstrate that the proposed outlier detection method significantly outperforms the state-of-the-art methods, improving the results by at least 8.48% in terms of the Area Under the ROC Curve (AUROC) index. The source codes are released at https://***/Xiaofeng-Tan/MGBOD. © 2025, CC BY.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

Research on SDN Multi Controller Deployment based on K-means++

Research on SDN Multi Controller Deployment based on K-means...

引用

2020 International Conference on 5G Mobile Communication and Information Science, MCIS-5G 2020

作者： Yue, Li Junyan, Chen Chuxin, Liang Xiaochun, Lei School of Computer and Information Security Guilin University of Electronic Technology Guilin541004 China Guangxi Cloud Computing and Big Data Collaborative Innovation Center Guilin541001 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin541004 China

In large-scale SDN network, a single centralized controller can not meet the demand, and multiple controllers are needed to deal with the problem, which leads to the problem of multi control balanced deployment. In this paper, the topology of SDN switches and links is known. The main research contents are as follows: The mathematical model of SDN multi controller deployment is established, and the appropriate network topology is selected and the multi controller deployment problem is solved. In the research, the number of controllers needed in the network and the switches managed by each controller is determined by the algorithm results, and the mapping relationship between controllers and switches is established. By analyzing the deployment results of the same network topology under different algorithms, the influence of different clustering algorithms on the experimental results is obtained. At the same time, the better deployment experiment results are simulated. © 2020 Published under licence by IOP Publishing Ltd.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Multi-label Contrastive Focal Loss for Pedestrian Attribute Recognition

Multi-label Contrastive Focal Loss for Pedestrian Attribute ...

引用

International Conference on Pattern Recognition

作者： Xiaoqiang Zheng Zhenxia Yu Lin Chen Fan Zhu Shilong Wang Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China School of computer science Chengdu University Of Information Technology Chengdu China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing China

Pedestrian Attribute Recognition (PAR) has received extensive attention during the past few years. With the advances of deep convolutional neural networks (CNNs), the performance of PAR has been significantly improved. Existing methods tend to acquire attribute-specific features by designing various complex network structures with additional modules. Such additional modules, however, dramatically increase the number of network parameters. Meanwhile, the problems of class imbalance and hard attribute retrieving remain underestimated in PAR. In this paper, we explore the optimization mechanism of the training processing to account for these problems and propose a new loss function called Multi-label Contrastive Focal Loss (MCFL). This proposed MCFL emphasizes the hard and minority attributes by using a separated re-weighting mechanism for different positive and negative classes to alleviate the impact of the imbalance. MCFL is also able to enlarge the gaps between the intra-class of multi-label attributes, to force CNNs to extract more subtle discriminative features. We evaluate the proposed MCFL on three large public pedestrian datasets, including RAP, PA-100K, and PETA. The experimental results indicate that the proposed MCFL with the ResNet-50 backbone is able to outperform other state-of-the-art approaches in term of mean accuracy.

关键词： Training Visualization Force Complex networks Feature extraction Pattern recognition Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network

Dual attention mechanism object tracking algorithm based on ...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Sugang Ma Zixian Zhang Lei Zhang Yanping Chen Xiaobao Yang Lei Pu Zhiqiang Hou School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an Shaanxi China School of Information Engineering Chang’an University Xi’an Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’an University of Posts and Telecommunications Xi’an Shaanxi China School of Information and Navigation Air Force Engineering University Xi’an Shaanxi China

In an effort to the problem of insufficient tracking performance of the Fully-convolutional Siamese network (SiamFC) in complex scenarios, a dual attention mechanism object tracking algorithm based on the Fully-convolutional Siamese network is proposed to improve the generalization capability of the tracker by ameliorating the robustness of the template characteristics. Firstly, a global context attention module is appended after the backbone network of SiamFC to ameliorate the power of original feature extraction from two dimensions of spatial and channel. Then, a coordinate attention module is introduced to augment the capability of feature extraction in the channel dimension. Finally, the model of the proposed algorithm is trained on the Got-10k dataset. Five related algorithms are tested on the OTB2015 dataset, the results of experiments manifest that our algorithm outperforms the baseline trackers, the success and precision rate of the proposed algorithm are improved by 3.3% and 6.3%. The average tracking speed is 145FPS, which can demand the requirement of real-time tracking.

关键词： Target tracking Feature extraction Real-time systems Robustness Object tracking Task analysis

来源：评论

学校读者我要写书评

暂无评论

TSAR-based Expert Recommendation Mechanism for Community Question Answering

TSAR-based Expert Recommendation Mechanism for Community Que...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Jian Song Xiaolong Xu Xinheng Wang Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computing and Engineering University of West London London UK

ISBN: (纸本)9781728165974;9781728165981

Community Question Answering (CQA) provides a platform to share knowledge for users. With the increasing number of users and questions, askers have to wait a long time for an answer with high quality while responders may not be interested in assigned questions. Current methods usually try to address this issue based on text or link analysis. However, most of them suffer from delayed answers or low coverage of best answer. In this paper, we design a novel expert recommendation mechanism by incorporating the deep structured semantic model (DSSM) [20] with our proposed graph-based algorithm, a topic sensitive answerer rank algorithm (TSAR). In the process of constructing transition probability matrix, we not only take into account both the number of questions answered by the user and question difficulty, but also consider the user's average response time for providing the answer. The experiments carried out on Yahoo! Answers and Stack Overflow datasets demonstrate that the proposed mechanism outperforms the current typical algorithms [9] on multiple metrics and achieves the best answer coverages, which are 61.5% and 53.8%, respectively.

关键词： Measurement Conferences Semantics Knowledge discovery Collaborative work Time factors

来源：评论

学校读者我要写书评

暂无评论

Asynchronous control for Markov jump systems subject to actuator saturation

Asynchronous control for Markov jump systems subject to actu...

引用

第33届中国控制与决策会议

作者： Chao Wang Lei Liu Wei Wang Xiaobing Luo Huijin Fan the National Key Laboratory of Science and Technology of Multispectral Information Processing School of Artificial Intelligence and AutomationHuazhong University of Science and Technology the School of Automation Science and Electrical Engineering and the Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University School of Computer Technology and Software Engineering Wuhan Polytechnic

In this paper,the asynchronous controller problem is considered for Markov jump systems(MJSs) subject to actuator *** asynchronous phenomenon between the controller and the plant is addressed by introducing a hidden Markov model and the closed-loop hidden MJSs are *** on the closed-loop hidden MJSs and using convex hull technique and linear matrix inequality technique,a controller design algorithm is derived to ensure that the closed-loop hidden MJSs satisfy the stochastic ***,a numerical example is provided to demonstrate the effectiveness of the proposed asynchronous controller design algorithm.

关键词： Asynchronous control actuator saturation Markov jump systems

来源：评论

学校读者我要写书评

暂无评论

The Temporal Structural Pattern in Scientific Collaborative Behavior from the Perspective of Complex Network 23rd

The Temporal Structural Pattern in Scientific Collaborative...

引用

23rd International Symposium on Knowledge and Systems Sciences, KSS 2024

作者： Zholdoshbaeva, Elina Zhang, Shuang Liu, Feifan Xia, Haoxiang Institute of Systems Engineering Dalian University of Technology No. 2 Linggong Road Liaoning Dalian116024 China Center for Big Data and Intelligent Decision-Making Dalian University of Technology Linggong Road Liaoning Dalian116024 China School of Business East China University of Science and Technology 130 Meilong Road Xuhui District Shanghai200237 China Institute for Advanced Intelligence Dalian University of Technology Linggong Road Liaoning Dalian116024 China Key Laboratory of Social Computing and Cognitive Intelligence Ministry of Education of China Linggong Road Liaoning Dalian116024 China

ISBN: (纸本)9789819601776

The rapid advancement of science has underscored the importance of collaboration among scientists. While many studies have explored the structure of collaboration networks, there is a lack of comprehensive quantitative research on the temporal patterns of these collaborations. This study addresses this gap by analyzing temporal scientific collaboration networks in physics, spanning from 1960 to 2021, using complex network theories and methods. By constructing five-year temporal collaborative networks and employing metrics such as network diameter, shortest path, and clustering coefficient, this research reveals an increase in connectivity and small-world characteristics over time. Additionally, community detection highlights a shift towards specialized collaboration patterns and increased cross-community interactions. The study also uncovers growing centrality and social stratification within the research system, with the "rich club" phenomenon indicating strong and dynamic collaborations among highly connected scientists. Temporal analysis shows that while ultra-high connectivity scientists engage in fluctuating relationships, medium-high connectivity scientists maintain more stable collaborations. These findings provide insights into the evolution of collaborative behaviors and inform science policy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Collaborative learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：