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

30th International Conference on Neural Information Processing, ICONIP 2023

作者： Wang, Qi Zhang, Haiyan Ji, Junkai Tang, Cheng Tang, Yajiao College of Economics Central South University of Forestry and Technology Changsha410004 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Faculty of Information Science and Electrical Engineering Kyushu University Fukuoka819-0395 Japan

ISBN: (纸本)9789819981830

Recently, banks are constantly facing the problem of customers churning. Customer churn not only leads to a decline in bank funds and profits but also reduces its credit capacity and affects the bank’s operational management. As an important component of Customer Relationship Management, predicting customer churn has been increasingly urgent. Inspired by biological neurons, we build up a dendritic neural regression model (DNRM) with four layers, namely the synaptic layer, the dendritic layer, the membrane layer, and the soma layer for bank customer churn prediction. To pursue better prediction performance in this experiment, the Chicken Swarm Optimization (CSO) algorithm is defined as the training algorithm of DNRM. With the ability to balance exploration and exploitation, CSO is implemented to optimize and improve the accuracy of the DNRM. In this paper, we propose a novel dendritic neural regression model called CSO-DNRM for churn prediction, and the experimental results are based on a benchmark dataset from Kaggle. Compared with other algorithms and models, our proposed model obtains the highest accuracy of 92.27% and convergence speed in customer churn prediction. Due to the novel bionic algorithms and the pruning function of the model, it is evident that our proposed model has advantages in accuracy and computational speed in the field of customer churn prediction and can be widely applied in commercial bank customer relationship management. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy

ACGraph: Accelerating Streaming Graph Processing via Depende...

引用

Design Automation Conference

作者： Zihan Jiang Fubing Mao Yapu Guo Xu Liu Haikun Liu Xiaofei Liao Hai Jin Wei Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electronic and Computer Engineering HKUST Hong Kong

Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates. To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms. It maintains dependence trees during runtime, and makes affected vertices processed in a top-to-bottom order in the hierarchy of the dependence trees, thus normalizing the state propagation order and coalescing of multiple propagation to the same vertices. Experimental results show that ACGraph reduces the number of updates by 50% on average, and achieves the speedup of 1.75~7.43× over state-of-the-art systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SSC- l0 : Sparse Subspace Clustering with the l0 Inequality Constraint 7th

SSC- l0 : Sparse Subspace Clustering with the l0 Inequality...

引用

7th Asian Conference on Pattern Recognition, ACPR 2023

作者： Wang, Yangbo Zhou, Jie Lin, Qingshui Lu, Jianglin Gao, Can National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China Basic Teaching Department Liaoning Technical University Huludao125105 China College of Engineering Northeastern University BostonMA02115 United States

ISBN: (纸本)9783031476648

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using all points to represent a fixed sample in a class under the self-expression framework may not be ideal, as points from other classes participate in the representing process. To alleviate this issue, this study attempts to achieve representation learning between points only coming from the same class. In practice, it is easier for data points from the same class to represent each other than that from different classes. So, when reconstructing a point, if the number of non-zero elements in the coefficient vector is limited, a model is more likely to select data points from the class where the reconstructed point lies to complete the reconstruction work. Based on this idea, we propose Sparse Subspace Clustering with the l0 inequality constraint (SSC- l0 ). In SSC- l0, the l0 inequality constraint determines the maximum number of non-zero elements in the coefficient vector, which helps SSC- l0 to conduct representation learning among the points in the same class. After introducing the simplex constraint to ensure the translation invariance of the model, an optimization method concerning l0 inequality constraint is formed to solve the proposed SSC- l0, and its convergence is theoretically analyzed. Extensive experiments on well-known datasets demonstrate the superiority of SSC- l0 compared to several state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Audio-Visual Target Speaker Extraction With Selective Auditory Attention

IEEE Transactions on Audio, Speech and Language Processing

引用

IEEE Transactions on Audio, Speech and Language Processing 2025年 33卷 797-811页

作者： Ruijie Tao Xinyuan Qian Yidi Jiang Junjie Li Jiadong Wang Haizhou Li Department of Electrical and Computer Engineering National University of Singapore Singapore Department of Computer Science and Technology University of Science and Technology Beijing Beijing China Chinese University of Hong Kong Shenzhen China Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen China University of Bremen Bremen Germany

Audio-visual target speaker extraction (AV-TSE) aims to extract the specific person's speech from the audio mixture given auxiliary visual cues. Previous methods usually search for the target voice through speech-lip synchronization. However, this strategy mainly focuseson the existence of target speech, while ignoring the variations of the noise characteristics, i.e., interference speaker and the background noise. That may result in extracting noisy signals from the incorrect sound source in challenging acoustic situations. To this end, we propose a novel selective auditory attention mechanism, which can suppress interference speakers and non-speech signals to avoid incorrect speaker extraction. By estimating and utilizing the undesired noisy signal through this mechanism, we design an AV-TSE framework named Subtraction-and-ExtrAction network (SEANet) to suppress the noisy signals. We conduct abundant experiments by re-implementing three popular AV-TSE methods as the baselines and involving nine metrics for evaluation. The experimental results show that our proposed SEANet achieves state-of-the-art results and performs well for all five datasets.

关键词： Noise measurement Lips Visualization Synchronization Noise Correlation data mining Speech processing Interference Speech recognition

来源：评论

学校读者我要写书评

暂无评论

RETIA: Relation-Entity Twin-Interact Aggregation for Temporal Knowledge Graph Extrapolation

RETIA: Relation-Entity Twin-Interact Aggregation for Tempora...

引用

International Conference on data engineering

作者： Kangzheng Liu Feng Zhao Guandong Xu Xianzhi Wang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations; therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands" problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UniTSFace: unified threshold integrated sample-to-sample loss for face recognition 23

UniTSFace: unified threshold integrated sample-to-sample los...

引用

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

作者： Qiufu Li Xi Jia Jiancan Zhou Linlin Shen Jinming Duan National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and School of Computer Science University of Birmingham UK National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China and Computer Vision Institute Shenzhen University China and Aqara Lumi United Technology Co. Ltd China School of Computer Science University of Birmingham UK and Alan Turing Institute UK

Sample-to-class-based face recognition models can not fully explore the cross-sample relationship among large amounts of facial images, while sample-to-sample-based models require sophisticated pairing processes for training. Furthermore, neither method satisfies the requirements of real-world face verification applications, which expect a unified threshold separating positive from negative facial pairs. In this paper, we propose a unified threshold integrated sample-to-sample based loss (USS loss), which features an explicit unified threshold for distinguishing positive from negative pairs. Inspired by our USS loss, we also derive the sample-to-sample based softmax and BCE losses, and discuss their relationship. Extensive evaluation on multiple benchmark datasets, including MFR, IJB-C, LFW, CFP-FP, AgeDB, and MegaFace, demonstrates that the proposed USS loss is highly efficient and can work seamlessly with sample-to-class-based losses. The embedded loss (USS and sample-to-class Softmax loss) overcomes the pitfalls of previous approaches and the trained facial model UniTSFace exhibits exceptional performance, outperforming state-of-the-art methods, such as CosFace, ArcFace, VPL, AnchorFace, and UNPG. Our code is available at https://***/CVI-SZU/UniTSFace.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sharing Economy in Local Energy Markets

引用

Journal of Modern Power systems and Clean Energy 2023年第3期11卷 714-726页

作者： Zhaoyuan Wu Jianxiao Wang Haiwang Zhong Feng Gao Tianjiao Pu Chin-Woo Tan Xiupeng Chen Gengyin Li Huiru Zhao Ming Zhou Qing Xia School of Economics and Management North China Electric Power UniversityBeijing 102206China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power UniversityBeijing 102206China National Engineering Laboratory for Big Data Analysis and Applications Peking UniversityBeijing 100871China State Key Lab of Power Systems Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Industrial Engineering and Management College of EngineeringPeking UniversityBeijing 100871China China Electric Power Research Institute Beijing 100192China Department of Civil and Environmental Engineering Stanford UniversityPalo AltoCA 94305USA Engineering and Technology Institute Groningen University of Groningen9742 AG Groningenthe Netherlands

With an increase in the electrification of end-use sectors,various resources on the demand side provide great flexibility potential for system operation,which also leads to problems such as the strong randomness of power consumption behavior,the low utilization rate of flexible resources,and difficulties in cost *** the core idea of“access over ownership”,the concept of the sharing economy has gained substantial popularity in the local energy market in recent ***,we provide an overview of the potential market design for the sharing economy in local energy markets(LEMs)and conduct a detailed review of research related to local energy sharing,enabling technologies,and potential *** paper can provide a useful reference and insights for the activation of demand-side flexibility ***,this paper can also provide novel insights into the development and further integration of the sharing economy in LEMs.

关键词： Energy sharing flexibility potential local energy market information and communication technology sharing economy

来源：评论

学校读者我要写书评

暂无评论

DPP-HSS: Towards Fast and Scalable Hypervolume Subset Selection for Many-objective Optimization

引用

IEEE Transactions on Evolutionary Computation 2024年

作者： Gong, Cheng Nan, Yang Shang, Ke Guo, Ping Ishibuchi, Hisao Zhang, Qingfu City University of Hong Kong Department of Computer Science Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

Hypervolume subset selection (HSS) has received significant attention since it has a strong connection with evolutionary multi-objective optimization (EMO), such as environment selection and post-processing to identify representative solutions for decision-makers. The goal of HSS is to find the optimal subset that maximizes the hypervolume indicator subject to a given cardinality constraint. However, existing HSS algorithms or related methods are not efficient in achieving good performance in high-dimensional objective spaces. This is primarily because HSS problems become NP-hard when the number of objectives exceeds two, and the calculation of hypervolume contribution is very time-consuming. To efficiently solve HSS problems while maintaining a good solution quality, we propose a fast and scalable hypervolume subset selection method for many-objective optimization based on the determinantal point process (DPP), named DPP-HSS, which is fully free of hypervolume contribution calculation. Specifically, DPP-HSS constructs a hypervolume kernel matrix by extracting the convergence and diversity representations of each solution for a given HSS problem. This matrix is then used to build a DPP model. Subsequently, the original HSS problem is reformulated as a new maximization optimization problem based on the constructed model. A greedy DPP-based hypervolume subset selection algorithm is implemented to solve this transformed problem. Extensive experiments show that the proposed DPP-HSS achieves significant speedup and good hypervolume performance in comparison with state-of-the-art HSS algorithms on benchmark problems. Furthermore, DPP-HSS demonstrates very good scalability with respect to the number of objectives. © 1997-2012 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

A Scalable, Efficient, and Robust Dynamic Memory Management Library for HLS-based FPGAs

A Scalable, Efficient, and Robust Dynamic Memory Management ...

引用

IEEE/ACM International Symposium on Microarchitecture (MICRO)

作者： Qinggang Wang Long Zheng Zhaozeng An Shuyi Xiong Runze Wang Yu Huang Pengcheng Yao Xiaofei Liao Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China School of Computer Science and Engineering University of New South Wales Sydney NSW Australia

ISBN: (数字)9798350350579

ISBN: (纸本)9798350350586

Nowadays, high-level synthesis (HLS) has gained prominence for FPGA-based architecture prototyping, enhancing productivity significantly. Despite this advancement, HLS tools are impeded by a critical drawback: they lack support for dynamic memory management (DMM), leading to static mem-ory allocation and suboptimal use of memory resources. In response, numerous efforts have been made to develop DMM solutions compatible with HLS. However, our analysis indicates that existing solutions fail to concurrently meet the desired trifecta of scalability (efficient management of memory of any size), efficiency (minimal latency in memory (de-)allocation), and robustness (low allocation failure rates). This limitation hampers their applicability in real-world scenarios. In this paper, we introduce GraDMM, a “three-birds-one- stone” solution that comprehensively enhances the scalability, efficiency, and robustness of DMM. The key insight is to formulate memory (de-)allocation as graph analytics and lever-age sophisticated FPGA-based graph processing techniques. To achieve scalability, GraDMM specializes a simplified pipeline that significantly suppresses resource utilization expansion caused by managed memory scaling. This is crucial for managing arbitrarily sized memory on resource-limited FPGA platforms. For efficiency, GraDMM implements a data-centric concurrent traversal scheme and a shortcut-assisted fast traversal policy to accelerate (de-)allocation-guided graph traversal, reducing mem-ory (de-)allocation latency. To enhance robustness, GraDMM incorporates an adaptive memory defragmenter that defragments managed memory to minimize fragmentation-induced allocation failures. GraDMM is encapsulated as a library, providing high- level interfaces for users and ensuring synthesizability with Vi- vado HLS. Experimental results demonstrate that GraDMM out-performs three state-of-the-art HLS-compatible DMM solutions by significant margins: 56.71 %-85.59% in resource consumption sa

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：