CAFD: Detecting Collusive Frauds in Online Auction Networks by Combining One-Class Classification and Collective Classification

Author(s):  
Nazanin Habibollahi ◽  
Mahdi Abadi ◽  
Mahila Dadfarnia
2020 ◽  
Vol 13 (5) ◽  
pp. 1008-1019
Author(s):  
N. Vijayaraj ◽  
T. Senthil Murugan

Background: Number of resource allocation and bidding schemes had been enormously arrived for on demand supply scheme of cloud services. But accessing and presenting the Cloud services depending on the reputation would not produce fair result in cloud computing. Since the cloud users not only looking for the efficient services but in major they look towards the cost. So here there is a way of introducing the bidding option system that includes efficient user centric behavior analysis model to render the cloud services and resource allocation with low cost. Objective: The allocation of resources is not flexible and dynamic for the users in the recent days. This gave me the key idea and generated as a problem statement for my proposed work. Methods: An online auction framework that ensures multi bidding mechanism which utilizes user centric behavioral analysis to produce the efficient and reliable usage of cloud resources according to the user choice. Results: we implement Efficient Resource Allocation using Multi Bidding Model with User Centric Behavior Analysis. Thus the algorithm is implemented and system is designed in such a way to provide better allocation of cloud resources which ensures bidding and user behavior. Conclusion: Thus the algorithm Efficient Resource Allocation using Multi Bidding Model with User Centric Behavior Analysis is implemented & system is designed in such a way to provide better allocation of cloud resources which ensures bidding, user behavior. The user bid data is trained accordingly such that to produce efficient resource utilization. Further the work can be taken towards data analytics and prediction of user behavior while allocating the cloud resources.


2020 ◽  
Vol E103.D (2) ◽  
pp. 450-453
Author(s):  
Guizhong ZHANG ◽  
Baoxian WANG ◽  
Zhaobo YAN ◽  
Yiqiang LI ◽  
Huaizhi YANG

AI ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 195-208
Author(s):  
Gabriel Dahia ◽  
Maurício Pamplona Segundo

We propose a method that can perform one-class classification given only a small number of examples from the target class and none from the others. We formulate the learning of meaningful features for one-class classification as a meta-learning problem in which the meta-training stage repeatedly simulates one-class classification, using the classification loss of the chosen algorithm to learn a feature representation. To learn these representations, we require only multiclass data from similar tasks. We show how the Support Vector Data Description method can be used with our method, and also propose a simpler variant based on Prototypical Networks that obtains comparable performance, indicating that learning feature representations directly from data may be more important than which one-class algorithm we choose. We validate our approach by adapting few-shot classification datasets to the few-shot one-class classification scenario, obtaining similar results to the state-of-the-art of traditional one-class classification, and that improves upon that of one-class classification baselines employed in the few-shot setting.


2016 ◽  
Vol 45 (1) ◽  
pp. 153-172 ◽  
Author(s):  
Shaokai Wang ◽  
Yunming Ye ◽  
Xutao Li ◽  
Xiaohui Huang ◽  
Raymond Y. K. Lau

2021 ◽  
pp. 1-28
Author(s):  
ChienHsing Wu ◽  
Shu-Chen Kao ◽  
ChengHsun Ho
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document