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

A transactional-behavior-based hierarchical gated network for credit card fraud detection

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Xie, Yu Zhou, MengChu Liu, Guanjun Wei, Lifei Zhu, Honghao De Meo, Pasquale College of Information Engineering Shanghai Maritime University Shanghai201306 China School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou310018 China Helen and John C. Hartmann Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Tongji University Shanghai201804 China College of Computer Science and Information Engineering Bengbu University Bengbu233030 China Department of Ancient and Modern Civilizations University of Messina Messina98166 Italy

The task of detecting fraud in credit card transactions is crucial to ensure the security and stability of a financial system, as well as to enforce customer confidence in digital payment systems. Historically, credit card companies have used rule-based approaches to detect fraudulent transactions, but these have proven inadequate due to the complexity of fraud strategies and have been replaced by much more powerful solutions based on machine learning or deep learning algorithms. Despite significant progress, the current approaches to fraud detection suffer from a number of limitations: for example, it is unclear whether some transaction features are more effective than others in discriminating fraudulent transactions, and they often neglect possible correlations among transactions, even though they could reveal illicit behaviour. In this paper, we propose a novel credit card fraud detection (CCFD) method based on a transaction behaviour-based hierarchical gated network. First, we introduce a feature-oriented extraction module capable of identifying key features from original transactions, and such analysis is effective in revealing the behavioural characteristics of fraudsters. Second, we design a transaction-oriented extraction module capable of capturing the correlation between users' historical and current transactional behaviour. Such information is crucial for revealing users' sequential behaviour patterns. Our approach, called transactional-behaviour-based hierarchical gated network model (TbHGN), extracts two types of new transactional features, which are then combined in a feature interaction module to learn the final transactional representations used for CCFD. We have conducted extensive experiments on a real-world credit card transaction dataset with an increase in average F1 between 1.42% and 6.53% and an improvement in average AUC between 0.63% and 2.78% over the state of the art. © 2025 Institute of Electrical and Electronics Engineers Inc.. All right

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Feedback-based Coarse Time-Granularity POI Recommendation and Itinerary Planning

Feedback-based Coarse Time-Granularity POI Recommendation an...

引用

2021 China Automation Congress, CAC 2021

作者： Zong, Jie Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education TONGJI University Shanghai China

ISBN: (纸本)9781665426473

For tourists, planning their own travel itinerary to a strange city is really challenging. Although there are many researches on Point of Interests (POIs) recommendation and itinerary planning, two problems occur in currently proposed recommendation algorithms. First, the time granularity of the algorithms is too fine. POI recommendation should be considered within a more coarse-grained time factor. For example, a visitor wouldn't like to visit a water park in winter, although he appears to love such places. However, seldom researches have taken this into consideration. Second, most of the algorithms build their models based on the tourists' trajectory, which means, they did not consider users' feedback. In fact, quite a number of tourists do not like their travel experience and give negative feedbacks after their visits. In this situation, we shouldn't recommend similar POIs to this user because he may not like such kind of scenic spots at all. To address these two problems, this paper proposes an algorithm called Feedback-based Coarse Time-Granularity POI Recommendation, which can extract information from comments and distinguish tourists' attitudes towards the POIs they have visited. At the same time, the coarse-grained time factor is considered while making recommendations. In addition, an itinerary planning algorithm is proposed. Experiments show that our algorithm can reach SOTA. © 2021 IEEE

关键词： Parks

来源：评论

学校读者我要写书评

暂无评论

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZERO-SHOT IMAGE RECOGNITION

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZER...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Wang, Yu Zhao, Sev-Jue Key Laboratory of Embedded System and Service Computing Ministry of Education China HaiBa Technology China

ISBN: (纸本)9781665438643

Zero-shot learning (ZSL) recently has drawn widespread attention due to the demand for scalability of object recognition in real scenes. Existing approaches typically focus on directly learning various mapping functions from the visual space to the semantic space or vice versa. However, these methods fail to explicitly capture consistent representations reflecting the nature of different modalities of the same object, which results in the deterioration of the domain shift problem in the ZSL context during the testing stage. To this end, a consistent representation learning mechanism across visual modalities and the associated semantic modalities based on common subspace learning is proposed in this paper. We further impose an orthogonal constraint on the subspace for informative representations, as well as 21-norm regularization terms on projection matrices for automatic feature selection. Finally, an iterative process based on the ALM algorithm with an alternating direction strategy is displayed to resolve the proposed formulation. Extensive experimental results on four popular datasets demonstrate that our algorithm is promising. © 2021 IEEE

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Block diagonal precoding based power allocation for coordinated multi-point transmission

引用

Journal of Communications 2011年第7期6卷 524-528页

作者： Han, Jing Wang, Ping Liu, Fuqiang Zhu, Yin Broadband Wireless Communications and Multimedia Laboratory Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Shanghai Key Laboratory of Digital Media Processing and Transmission Shanghai China

This paper studies power allocation in coordinated multi-point (CoMP) transmission of 3GPP LTE-Advanced system with remote radio units(RRUs) power constraints. We apply block diagonal (BD) precoding to downlink transmission, and assume perfect knowledge of downlink channels and transmit messages at each transmit point. We propose a modified water-filling power (MWF) allocation algorithm in order to maximize the downlink sum capacity, at the same time the low complexity is achieved. The interior-point method is also used to solve the optimization problem. Simulations show that interior-point method converges after only a few iterative steps and the system capacity is near-optimal. As for complexity and power efficiency, MWF achieves a good compromise. © 2011 ACADEMY PUBLISHER.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

STMGT: A Long-Term Traffic Forecasting Method Based on Spatial-Temporal Multi-View Graph Transformer 24

STMGT: A Long-Term Traffic Forecasting Method Based on Spati...

引用

5th International Conference on Artificial Intelligence and Computer Engineering, ICAICE 2024

作者： Zheng, Fengkai The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9798400718007

Accurate long-term traffic forecasting is crucial for urban traffic management and planning. Existing methods focus mainly on short-term predictions and struggle with long-term spatial-temporal dependencies due to computational complexities. We propose a Spatial-Temporal Multi-View Graph Transformer (STMGT) based on spatial-temporal sequence decomposition. STMGT enhances long-term forecasting by decomposing traffic sequences into temporal position embeddings, periodicity-trend features, and residual components. This approach captures long-term correlations while managing computational cost by dividing data into multiple time blocks. A multi-head graph attention mechanism is used to explore dynamic spatial correlations. Experimental results on real-world datasets show that STMGT significantly outperforms baseline models, proving it effective for long-term traffic prediction. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： graph attention mechanism

来源：评论

学校读者我要写书评

暂无评论

Research on the Matthews correlation coefficients metrics of personalized recommendation algorithm evaluation

引用

International Journal of Hybrid Information Technology 2015年第1期8卷 163-172页

作者： Liu, Yingbo Cheng, Jiujun Yan, Chendan Wu, Xiao Chen, Fuzhen Key Laboratory of Embedded System and Service Computing of Ministry of Education Tongji University Shanghai China Department of Computer Science and Technology Tongji University Shanghai China

The personalized recommendation systems could better improve the personalized service for network user and alleviate the problem of information overload in the Internet. As we all know, the key point of being a successful recommendation system is the performance of recommendation algorithm. When scholars put forward some new recommendation algorithms, they claim that the new algorithms have been improved in some respects, better than previous algorithm. So we need some evaluation metrics to evaluate the algorithm performance. Due to the scholar didn’t fully understand the evaluation mechanism of recommendation algorithms. They mainly emphasized some specific evaluation metrics like Accuracy, Diversity. What’s more, the academia did not establish a complete and unified assessment of recommendation algorithms evaluation system which is credibility to do the work of recommendation evaluation. So how to do this work objective and reasonable is still a challengeable task. In this article, we discussed the present evaluation metrics with its respective advantages and disadvantages. Then, we put forward to use the Matthews Correlation Coefficient to evaluate the recommendation algorithm’s performance. All this based on an open source projects called mahout which provides a rich set of components to construct the classic recommendation algorithm. The results of the experiments show that the applicability of Matthews correlation coefficient in the relative evaluation work of recommendation algorithm. © 2015 SERSC.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

An algorithm for generating home states of Petri nets

引用

Journal of Computational Information systems 2011年第12期7卷 4225-4232页

作者： Wang, Pengwei Ding, Zhijun Chai, Hua Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China Department of Computer Science and Technology Tongji University Shanghai 201804 China

Home states are ground markings which can be reached from any other reachable markings of a Petri net. The existence of home states is a strong property, and it is not only of important theoretical research meaning, but also of great practical value. This paper presents an algorithm for generating home states. For any bounded Petri net, the algorithm can judge whether it contains home states or not, and obtain the set of all its home states. The correctness of the algorithm is proved, and its complexity is analyzed, the result shows that it is a polynomial-time algorithm, so it is effective. Meanwhile, we implemented the algorithm in the popular Petri net tool PIPE2, which can be used for experimental purposes. Then a number of conclusions about the relationships between home state and deadlock are given, which bring great convenience to judge deadlock and exert control pointedly. Copyright © 2011 Binary Information Press.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Edge-weight-Based link prediction in heterogeneous graph 19

Edge-weight-Based link prediction in heterogeneous graph

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Zong, Jie Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665472432

Link prediction is to predict whether there is a link between two nodes in the graph, it is a very important application and plays a great role in various industries. In recent years, with the development of graph neural network technology, many algorithms make effort to study the expression of each node from the original graph data and use them to infer new links. However, most of the existing algorithms have a common problem when facing heterogeneous graphs, which is, they do not consider the weight of edges in graphs. Instead, they put all their energies into computing node features. Although a few algorithms such as RGCN are trying to take the influence of different link types into account while extracting node features, these implicit feature extractions do not start from the global information, but just calculate independently for each node. In other words, in these algorithms, even the same type of links will be abstracted into different features on different nodes. This is obviously inconsistent with reality. On the same map, the feature of the same link should be relatively fixed and should not be changed just because of different positions. In addition, when the current graph neural network algorithm is applied to link prediction, the link type to be predicted must be specified in advance, which makes the algorithm extremely inflexible. In order to solve these problems, we propose an edge weight calculation algorithm that extracts the edge feature from the whole graph. We also propose the edge-weight-based link prediction algorithm. By introducing edge weight into the MLP, there is no need to specify the target link type at the beginning of model training. It improves both the performance and efficiency of the link prediction model. Experiments on two datasets show that this edge-weight-based link prediction algorithm performs better than current algorithms and reaches SOTA. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Random Forest with Dynamic Detectors for Evolving Data Stream Classification 23

Adaptive Random Forest with Dynamic Detectors for Evolving D...

引用

9th International Conference on computing and Artificial Intelligence, ICCAI 2023

作者： Jin, Xuancheng Zhang, Yaying Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781450399029

Evolving data streams containing concept drift breaks the assumption that data are independent and identically distributed (IID) in traditional machine learning models. A series of ensemble-based models have been adapted to data stream learning tasks due to the abilities of dynamic partially update and cooperate with drift detection methods. Adaptive Random Forests (ARF), one of the state-of-the-art in the stream setting, encounters high resource requirements in both efficiency and memory like all ensemble methods. We are committed to reducing running cost without compromising ARF’s performance. In this paper, we propose the Adaptive Random Forest with Dynamic Detectors (ARFDD) which utilizes diversity measurement to combine homogeneous detectors and split heterogeneous ones accordingly, leads to lower computing costs and thus speed up in applications. Experiments on all 8 synthetic and 4 real datasets show a great CPU-time thrift while avoiding performance degradation. © 2023 Copyright held by the owner/author(s).

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Research on Behavior Element Decision of Cloud Edge Collaboration Capability Based on 5g Automatic Driving Scene 5

Research on Behavior Element Decision of Cloud Edge Collabor...

引用

5th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2021

作者： Yan, Chungang Sheng, Shuo Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China

ISBN: (纸本)9781665415989

In order to meet the cloud side requirements of various traffic business scenarios, the construction of traffic cloud side collaboration platform realizes the collaboration and unification of various business resources and data on both sides of the cloud side, and the cloud side integration realizes the real-time and efficient "vehicle road cloud side"collaboration of traffic. In order to quickly meet the needs of various scenarios and provide customized cloud edge capability services, by drawing on the experience and technology R D capabilities of Companies in the industry, it helps to shorten the overall development period of the platform, reduce costs and technical risks, and quickly form product capabilities. Based on the cloud edge collaboration capability, the super edge node collects structured and unstructured data in real time, uses the edge computing power to label, filter and design thresholds, so as to detect and filter the scene behavior elements in 5g + traffic scenarios, further clarify the actor's data, gather it to the cloud for research and judgment, and improve the global decision-making ability of the cloud, Improve the real-time flow of dynamic traffic element resources. © 2021 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：