Phone number recycling(PNR)refers to the event wherein a mobile operator collects a disconnected number and reassigns it to a new owner.It has posed a threat to the reliability of the existing authentication solution ...Phone number recycling(PNR)refers to the event wherein a mobile operator collects a disconnected number and reassigns it to a new owner.It has posed a threat to the reliability of the existing authentication solution for e-commerce platforms.Specifically,a new owner of a reassigned number can access the application account with which the number is associated,and may perform fraudulent activities.Existing solutions that employ a reassigned number database from mobile operators are costly for e-commerce platforms with large-scale users.Thus,alternative solutions that depend on only the information of the applications are imperative.In this work,we study the problem of detecting accounts that have been compromised owing to the reassignment of phone numbers.Our analysis on Meituan's real-world dataset shows that compromised accounts have unique statistical features and temporal patterns.Based on the observations,we propose a novel model called temporal pattern and statistical feature fusion model(TSF)to tackle the problem,which integrates a temporal pattern encoder and a statistical feature encoder to capture behavioral evolutionary interaction and significant operation features.Extensive experiments on the Meituan and IEEE-CIS datasets show that TSF significantly outperforms the baselines,demonstrating its effectiveness in detecting compromised accounts due to reassigned numbers.展开更多
Since the fully convolutional network has achieved great success in semantic segmentation,lots of works have been proposed to extract discriminative pixel representations.However,the authors observe that existing meth...Since the fully convolutional network has achieved great success in semantic segmentation,lots of works have been proposed to extract discriminative pixel representations.However,the authors observe that existing methods still suffer from two typical challenges:(i)The intra-class feature variation between different scenes may be large,leading to the difficulty in maintaining the consistency between same-class pixels from different scenes;(ii)The inter-class feature distinction in the same scene could be small,resulting in the limited performance to distinguish different classes in each scene.The authors first rethink se-mantic segmentation from a perspective of similarity between pixels and class centers.Each weight vector of the segmentation head represents its corresponding semantic class in the whole dataset,which can be regarded as the embedding of the class center.Thus,the pixel-wise classification amounts to computing similarity in the final feature space between pixels and the class centers.Under this novel view,the authors propose a Class Center Similarity(CCS)layer to address the above-mentioned challenges by generating adaptive class centers conditioned on each scenes and supervising the similarities between class centers.The CCS layer utilises the Adaptive Class Center Module to generate class centers conditioned on each scene,which adapt the large intra-class variation between different scenes.Specially designed Class Distance Loss(CD Loss)is introduced to control both inter-class and intra-class distances based on the predicted center-to-center and pixel-to-center similarity.Finally,the CCS layer outputs the processed pixel-to-center similarity as the segmentation prediction.Extensive experiments demonstrate that our model performs favourably against the state-of-the-art methods.展开更多
On-demand food delivery(OFD)is gaining more and more popularity in modern society.As a kernel order assignment manner in OFD scenario,order recommendation directly influences the delivery efficiency of the platform an...On-demand food delivery(OFD)is gaining more and more popularity in modern society.As a kernel order assignment manner in OFD scenario,order recommendation directly influences the delivery efficiency of the platform and the delivery experience of riders.This paper addresses the dynamism of the order recommendation problem and proposes a reinforcement learning solution method.An actor-critic network based on long short term memory(LSTM)unit is designed to deal with the order-grabbing conflict between different riders.Besides,three rider sequencing rules are accordingly proposed to match different time steps of the LSTM unit with different riders.To test the performance of the proposed method,extensive experiments are conducted based on real data from Meituan delivery platform.The results demonstrate that the proposed reinforcement learning based order recommendation method can significantly increase the number of grabbed orders and reduce the number of order-grabbing conflicts,resulting in better delivery efficiency and experience for the platform and riders.展开更多
The on-demand food delivery(OFD)service has gained rapid development in the past decades but meanwhile encounters challenges for further improving operation quality.The order dispatching problem is one of the most con...The on-demand food delivery(OFD)service has gained rapid development in the past decades but meanwhile encounters challenges for further improving operation quality.The order dispatching problem is one of the most concerning issues for the OFD platforms,which refer to dynamically dispatching a large number of orders to riders reasonably in very limited decision time.To solve such a challenging combinatorial optimization problem,an effective matching algorithm is proposed by fusing the reinforcement learning technique and the optimization method.First,to deal with the large-scale complexity,a decoupling method is designed by reducing the matching space between new orders and riders.Second,to overcome the high dynamism and satisfy the stringent requirements on decision time,a reinforcement learning based dispatching heuristic is presented.To be specific,a sequence-to-sequence neural network is constructed based on the problem characteristic to generate an order priority sequence.Besides,a training approach is specially designed to improve learning performance.Furthermore,a greedy heuristic is employed to effectively dispatch new orders according to the order priority sequence.On real-world datasets,numerical experiments are conducted to validate the effectiveness of the proposed algorithm.Statistical results show that the proposed algorithm can effectively solve the problem by improving delivery efficiency and maintaining customer satisfaction.展开更多
基金supported by the National Natural Science Foundation of China(Nos.62072115,62202402,61971145,and 61602122)the Shanghai Science and Technology Innovation Action Plan Project(No.22510713600)+2 种基金the Guangdong Basic and Applied Basic Research Foundation,China(Nos.2022A1515011583 and 2023A1515011562)the One-off Tier 2 Start-up Grant(2020/2021)of Hong Kong Baptist University(Ref.RCOFSGT2/20-21/COMM/002)Startup Grant(Tier 1)for New Academics AY2020/21 of Hong Kong Baptist University and Germany/Hong Kong Joint Research Scheme sponsored by the Research Grants Council of Hong Kong,China,the German Academic Exchange Service of Germany(No.G-HKBU203/22),and Meituan。
文摘Phone number recycling(PNR)refers to the event wherein a mobile operator collects a disconnected number and reassigns it to a new owner.It has posed a threat to the reliability of the existing authentication solution for e-commerce platforms.Specifically,a new owner of a reassigned number can access the application account with which the number is associated,and may perform fraudulent activities.Existing solutions that employ a reassigned number database from mobile operators are costly for e-commerce platforms with large-scale users.Thus,alternative solutions that depend on only the information of the applications are imperative.In this work,we study the problem of detecting accounts that have been compromised owing to the reassignment of phone numbers.Our analysis on Meituan's real-world dataset shows that compromised accounts have unique statistical features and temporal patterns.Based on the observations,we propose a novel model called temporal pattern and statistical feature fusion model(TSF)to tackle the problem,which integrates a temporal pattern encoder and a statistical feature encoder to capture behavioral evolutionary interaction and significant operation features.Extensive experiments on the Meituan and IEEE-CIS datasets show that TSF significantly outperforms the baselines,demonstrating its effectiveness in detecting compromised accounts due to reassigned numbers.
基金Hubei Provincial Natural Science Foundation of China,Grant/Award Number:2022CFA055National Natural Science Foundation of China,Grant/Award Number:62176097。
文摘Since the fully convolutional network has achieved great success in semantic segmentation,lots of works have been proposed to extract discriminative pixel representations.However,the authors observe that existing methods still suffer from two typical challenges:(i)The intra-class feature variation between different scenes may be large,leading to the difficulty in maintaining the consistency between same-class pixels from different scenes;(ii)The inter-class feature distinction in the same scene could be small,resulting in the limited performance to distinguish different classes in each scene.The authors first rethink se-mantic segmentation from a perspective of similarity between pixels and class centers.Each weight vector of the segmentation head represents its corresponding semantic class in the whole dataset,which can be regarded as the embedding of the class center.Thus,the pixel-wise classification amounts to computing similarity in the final feature space between pixels and the class centers.Under this novel view,the authors propose a Class Center Similarity(CCS)layer to address the above-mentioned challenges by generating adaptive class centers conditioned on each scenes and supervising the similarities between class centers.The CCS layer utilises the Adaptive Class Center Module to generate class centers conditioned on each scene,which adapt the large intra-class variation between different scenes.Specially designed Class Distance Loss(CD Loss)is introduced to control both inter-class and intra-class distances based on the predicted center-to-center and pixel-to-center similarity.Finally,the CCS layer outputs the processed pixel-to-center similarity as the segmentation prediction.Extensive experiments demonstrate that our model performs favourably against the state-of-the-art methods.
基金supported in part by the National Natural Science Foundation of China(No.62273193)Tsinghua University-Meituan Joint Institute for Digital Life,and the Research and Development Project of CRSC Research&Design Institute Group Co.,Ltd.
文摘On-demand food delivery(OFD)is gaining more and more popularity in modern society.As a kernel order assignment manner in OFD scenario,order recommendation directly influences the delivery efficiency of the platform and the delivery experience of riders.This paper addresses the dynamism of the order recommendation problem and proposes a reinforcement learning solution method.An actor-critic network based on long short term memory(LSTM)unit is designed to deal with the order-grabbing conflict between different riders.Besides,three rider sequencing rules are accordingly proposed to match different time steps of the LSTM unit with different riders.To test the performance of the proposed method,extensive experiments are conducted based on real data from Meituan delivery platform.The results demonstrate that the proposed reinforcement learning based order recommendation method can significantly increase the number of grabbed orders and reduce the number of order-grabbing conflicts,resulting in better delivery efficiency and experience for the platform and riders.
基金supported in part by the National Natural Science Foundation of China(No.62273193)Tsinghua University-Meituan Joint Institute for Digital Life,and the Research and Development Project of CRSC Research&Design Institute Group Co.,Ltd.
文摘The on-demand food delivery(OFD)service has gained rapid development in the past decades but meanwhile encounters challenges for further improving operation quality.The order dispatching problem is one of the most concerning issues for the OFD platforms,which refer to dynamically dispatching a large number of orders to riders reasonably in very limited decision time.To solve such a challenging combinatorial optimization problem,an effective matching algorithm is proposed by fusing the reinforcement learning technique and the optimization method.First,to deal with the large-scale complexity,a decoupling method is designed by reducing the matching space between new orders and riders.Second,to overcome the high dynamism and satisfy the stringent requirements on decision time,a reinforcement learning based dispatching heuristic is presented.To be specific,a sequence-to-sequence neural network is constructed based on the problem characteristic to generate an order priority sequence.Besides,a training approach is specially designed to improve learning performance.Furthermore,a greedy heuristic is employed to effectively dispatch new orders according to the order priority sequence.On real-world datasets,numerical experiments are conducted to validate the effectiveness of the proposed algorithm.Statistical results show that the proposed algorithm can effectively solve the problem by improving delivery efficiency and maintaining customer satisfaction.
