Jipeng Cui
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jipeng Cui has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Cheng Wang
Tongji University
4 shared publications - Changjun Jiang
Tongji University
2 shared publications Chungang Yan
Department of Computer Science, Key Laboratory of the Ministry of Education for Embedded System and Service Computing, Tongji University, Shanghai, China
2 shared publications- Qing Yang
Key Laboratory of Embedded System and Service Computing, Ministry of Education, Tongji University, Shanghai, China
2 shared publications - Xue Chen
School of Computer Science and Technology, Tongji University
2 shared publications - Changqi Wang
Computer Science, Tongji University, Shanghai, Shanghai, China
1 shared publication
Latest Publications
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 3339-3352
Approaching the Information-Theoretic Limit of Privacy Disclosure With Utility Guarantees
The possibility for public attributes to disclose private information has caused widespread concern. Traditional privacy-preserving approaches have two limitations: (1) Approaches based on data anonymization or distortion often lead to poor utility-privacy trade-offs, and (2) approaches based on data encryption face heavy computational costs. These problems have prompted calls for an effective privacy-preserving framework that provides adequate privacy guarantees while maintaining good data utility. Inspired by denoising autoencoders, in this paper, we regard the information about privacy attributes contained in the public attributes as a kind of noise and design an ex ante privacy-preserving model called the Mutual Information Autoencoder (MIAE), which reconstructs the loss function of the original autoencoder by combining reconstruction errors and mutual information, and we introduce a trade-off coefficient to achieve utility-privacy trade-offs. To elucidate the superiority of the proposed model, we consider utility-privacy trade-offs with the expected distortion function as a metric of data utility and the joint mutual information as a metric of privacy disclosure, and then, we construct a convex optimization problem with multiple constraints based on rate-distortion theory. From an information theory perspective, we provide a lower bound for privacy disclosure with utility guarantees. Elaborate experiments over a real-world dataset reveal that as the level of expected distortion increases, the achievable bound obtained by MIAE exhibits a trend similar to that of the information-theoretic bound. When the expected distortion surpasses 2.2, the achievable bound obtained by MIAE also converges to 0, and the maximum gap between the achievable bound obtained by MIAE and the information-theoretic bound is no more than 1.4. Compared to existing models, MIAE can provide a tighter achievable bound and achieve good utility-privacy trade-offs.
- 15 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 19 (15566013) , 3339-3352
Approaching the Information-Theoretic Limit of Privacy Disclosure With Utility Guarantees
The possibility for public attributes to disclose private information has caused widespread concern. Traditional privacy-preserving approaches have two limitations: (1) Approaches based on data anonymization or distortion often lead to poor utility-privacy trade-offs, and (2) approaches based on data encryption face heavy computational costs. These problems have prompted calls for an effective privacy-preserving framework that provides adequate privacy guarantees while maintaining good data utility. Inspired by denoising autoencoders, in this paper, we regard the information about privacy attributes contained in the public attributes as a kind of noise and design an ex ante privacy-preserving model called the Mutual Information Autoencoder (MIAE), which reconstructs the loss function of the original autoencoder by combining reconstruction errors and mutual information, and we introduce a trade-off coefficient to achieve utility-privacy trade-offs. To elucidate the superiority of the proposed model, we consider utility-privacy trade-offs with the expected distortion function as a metric of data utility and the joint mutual information as a metric of privacy disclosure, and then, we construct a convex optimization problem with multiple constraints based on rate-distortion theory. From an information theory perspective, we provide a lower bound for privacy disclosure with utility guarantees. Elaborate experiments over a real-world dataset reveal that as the level of expected distortion increases, the achievable bound obtained by MIAE exhibits a trend similar to that of the information-theoretic bound. When the expected distortion surpasses 2.2, the achievable bound obtained by MIAE also converges to 0, and the maximum gap between the achievable bound obtained by MIAE and the information-theoretic bound is no more than 1.4. Compared to existing models, MIAE can provide a tighter achievable bound and achieve good utility-privacy trade-offs.
- 12 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 9 (2) , 499-511
Incorporating Prior Knowledge in Local Differentially Private Data Collection for Frequency Estimation
Local differential privacy (LDP) is a prevalent measure of privacy protection as it provides rigorous privacy guarantees and has been widely studied for statistical analysis, especially in frequency estimation. As a representative LDP-enabled frequency estimation algorithm, Google’s Randomized Aggregation Privacy-Preserving Ordinal Response (RAPPOR) has been put into practice. However, it achieves sub-optimal utility due to the following limitations. Firstly, the adoption of the MD5 hash function inevitably results in the hash collision. Secondly, the application of the randomized response technique leads to randomness. To improve the practical effectiveness of RAPPOR and the utility of frequency-based services, we propose an LDP-enabled frequency estimation method called PK-RAPPOR, in which we devise an effective re-encoding hash function (RE-HF) incorporating prior knowledge (PK) about the rough frequency ranking of items. RE-HF divides items into several cohorts based on the PK and generates a unique hash value set for each item. Compared with the original RAPPOR, the hash collision can be eliminated for items from different cohorts, and the effect of randomness can be decreased by the overlapping of items from the same cohorts. We validate our proposed method with theoretical analysis and demonstrate its effectiveness with experiments on both synthetic and real-world datasets.
- 12 July 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Big Data
- Vol. 9 (2) , 499-511
Incorporating Prior Knowledge in Local Differentially Private Data Collection for Frequency Estimation
Local differential privacy (LDP) is a prevalent measure of privacy protection as it provides rigorous privacy guarantees and has been widely studied for statistical analysis, especially in frequency estimation. As a representative LDP-enabled frequency estimation algorithm, Google’s Randomized Aggregation Privacy-Preserving Ordinal Response (RAPPOR) has been put into practice. However, it achieves sub-optimal utility due to the following limitations. Firstly, the adoption of the MD5 hash function inevitably results in the hash collision. Secondly, the application of the randomized response technique leads to randomness. To improve the practical effectiveness of RAPPOR and the utility of frequency-based services, we propose an LDP-enabled frequency estimation method called PK-RAPPOR, in which we devise an effective re-encoding hash function (RE-HF) incorporating prior knowledge (PK) about the rough frequency ranking of items. RE-HF divides items into several cohorts based on the PK and generates a unique hash value set for each item. Compared with the original RAPPOR, the hash collision can be eliminated for items from different cohorts, and the effect of randomness can be decreased by the overlapping of items from the same cohorts. We validate our proposed method with theoretical analysis and demonstrate its effectiveness with experiments on both synthetic and real-world datasets.
- 8 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (3) , 643-654
ReMEMBeR: Ranking Metric Embedding-Based Multicontextual Behavior Profiling for Online Banking Fraud Detection
Anomaly detection relies on individuals' behavior profiling and works by detecting any deviation from the norm. When used for online banking fraud detection, however, it mainly suffers from three disadvantages. First, for an individual, the historical behavior data are often too limited to profile his/her behavior pattern. Second, due to the heterogeneous nature of transaction data, there lacks a uniform treatment of different kinds of attribute values, which becomes a potential barrier for model development and further usage. Third, the transaction data are highly skewed, and it becomes a challenge to utilize the label information effectively. The three disadvantages result in both poor generalization and high false positive rate of anomaly detection, and we propose a ranking metric embedding based multi-contextual behavior profiling (ReMEMBeR) model to battle them effectively. We solve the original fraud detection problem as a pseudo-recommender system problem, where an individual is treated as a pseudo-user, his/her behavior as a pseudo-item, and the label as the corresponding pseudo-rating. With the idea of collaborative filtering, for an individual, information from other similar individuals can be used to establish his/her behavior profile. In order to obtain a uniform treatment of heterogeneous attributes, we turn to an embedding based method to learn both attribute embedding and individuals' behavior profiles within a common latent space simultaneously. To utilize the label information better, our model is designed to fit pseudo-users' correct preference ranking for pseudo-items. By doing so, it explicitly learns to tell the fraudulent from the legitimate. Last but not least, we propose to identify and distinguish individuals under different contexts and further generalize the behavior profiling model to be a multi-contextual one. The proposed model can, thus, integrate the multi-contextual behavior patterns and allow transactions to be examined under the different contexts. Extensive experiments on a real-world online banking transaction dataset demonstrate that our model not only outperforms benchmarks on all metrics but also can be combined with them to achieve even better performance.
- 8 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 8 (3) , 643-654
ReMEMBeR: Ranking Metric Embedding-Based Multicontextual Behavior Profiling for Online Banking Fraud Detection
Anomaly detection relies on individuals' behavior profiling and works by detecting any deviation from the norm. When used for online banking fraud detection, however, it mainly suffers from three disadvantages. First, for an individual, the historical behavior data are often too limited to profile his/her behavior pattern. Second, due to the heterogeneous nature of transaction data, there lacks a uniform treatment of different kinds of attribute values, which becomes a potential barrier for model development and further usage. Third, the transaction data are highly skewed, and it becomes a challenge to utilize the label information effectively. The three disadvantages result in both poor generalization and high false positive rate of anomaly detection, and we propose a ranking metric embedding based multi-contextual behavior profiling (ReMEMBeR) model to battle them effectively. We solve the original fraud detection problem as a pseudo-recommender system problem, where an individual is treated as a pseudo-user, his/her behavior as a pseudo-item, and the label as the corresponding pseudo-rating. With the idea of collaborative filtering, for an individual, information from other similar individuals can be used to establish his/her behavior profile. In order to obtain a uniform treatment of heterogeneous attributes, we turn to an embedding based method to learn both attribute embedding and individuals' behavior profiles within a common latent space simultaneously. To utilize the label information better, our model is designed to fit pseudo-users' correct preference ranking for pseudo-items. By doing so, it explicitly learns to tell the fraudulent from the legitimate. Last but not least, we propose to identify and distinguish individuals under different contexts and further generalize the behavior profiling model to be a multi-contextual one. The proposed model can, thus, integrate the multi-contextual behavior patterns and allow transactions to be examined under the different contexts. Extensive experiments on a real-world online banking transaction dataset demonstrate that our model not only outperforms benchmarks on all metrics but also can be combined with them to achieve even better performance.
- Open Access
- 28 January 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 2020, 1-5
Learning Transaction Cohesiveness for Online Payment Fraud Detection
In the online payment fraud detection scenario, transactions are characterized by attributes. A fraud detection system makes use of the attributes to build a binary classifier that tells fraudulent transactions from legitimate ones. The key factor that affects the quality of a fraud detection system is how to extract useful features from transaction attributes. This paper proposes a novel automatic feature learning approach for online payment fraud detection. To begin with, it represents transaction attributes as vectors in a latent vector space. With these vectors, transaction cohesiveness is defined. By maximizing the probability that legitimate transactions have larger cohesiveness than fraudulent ones, the vector representations of attributes can be optimized. Experiments demonstrate that the selected classifiers trained with the cohesive features show superior performance than those with the original attributes.
- 28 January 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 2020, 1-5
Open AccessLearning Transaction Cohesiveness for Online Payment Fraud Detection
In the online payment fraud detection scenario, transactions are characterized by attributes. A fraud detection system makes use of the attributes to build a binary classifier that tells fraudulent transactions from legitimate ones. The key factor that affects the quality of a fraud detection system is how to extract useful features from transaction attributes. This paper proposes a novel automatic feature learning approach for online payment fraud detection. To begin with, it represents transaction attributes as vectors in a latent vector space. With these vectors, transaction cohesiveness is defined. By maximizing the probability that legitimate transactions have larger cohesiveness than fraudulent ones, the vector representations of attributes can be optimized. Experiments demonstrate that the selected classifiers trained with the cohesive features show superior performance than those with the original attributes.
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1
LAW: Learning Automatic Windows for Online Payment Fraud Detection
The rapid development of internet finance has caused increasing concern in online payment fraud due to its great threat. It is typical to employ rule systems or machine learning-based techniques to detect frauds. For the most significant features of such fraudulent transactions are exhibited in a sequential form, the sliding time window is a widely-recognized effective tool for this problem. However, the adaptive setting of sliding time window is really a big challenge, since the transaction patterns in real-life application scenarios are often too elusive to be captured. In this work, we pursue an adaptive learning approach to detect fraudulent online payment transactions with automatic sliding time windows. Accordingly, we design an intelligent window, called \textit{learning automatic window} (\textit{LAW}). It utilizes the learning automata to learn the proper parameters of time windows and adjust them dynamically according to the variation and oscillation of fraudulent transaction patterns. By the experiments over a real-world dataset from a commercial bank, we validate the gain of \textit{LAW} in terms of detection effectiveness and robustness. To the best of our knowledge, this is the first work to make a sliding time window for fraud detection capable of learning its proper size in changing situations.
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. PP (15455971) , 1
LAW: Learning Automatic Windows for Online Payment Fraud Detection
The rapid development of internet finance has caused increasing concern in online payment fraud due to its great threat. It is typical to employ rule systems or machine learning-based techniques to detect frauds. For the most significant features of such fraudulent transactions are exhibited in a sequential form, the sliding time window is a widely-recognized effective tool for this problem. However, the adaptive setting of sliding time window is really a big challenge, since the transaction patterns in real-life application scenarios are often too elusive to be captured. In this work, we pursue an adaptive learning approach to detect fraudulent online payment transactions with automatic sliding time windows. Accordingly, we design an intelligent window, called \textit{learning automatic window} (\textit{LAW}). It utilizes the learning automata to learn the proper parameters of time windows and adjust them dynamically according to the variation and oscillation of fraudulent transaction patterns. By the experiments over a real-world dataset from a commercial bank, we validate the gain of \textit{LAW} in terms of detection effectiveness and robustness. To the best of our knowledge, this is the first work to make a sliding time window for fraud detection capable of learning its proper size in changing situations.