Journal Article10.1109/TCSS.2020.3017818
Computational Experimental Study on Social Organization Behavior Prediction Problems
5
TL;DR: This article compares and analyzes the performance of the organizational behavior prediction model established by four typical cost-sensitive learning methods based on six classifiers and proposes an effective personalized solution to the problem of class disequilibrium and nonconsistent misclassification cost in organizational behavior Prediction modeling.
read more
Abstract: With the development of mobile Internet, behavioral trajectories of human life are more and more recorded, which makes it possible to use computer technology to mine organizational behavior patterns. The mining of organizational behavior patterns based on social computing can not only prepare them in a targeted manner but also predict the consequences of possible measures. The organization behavior pattern mining has achieved a series of achievements in the fields of e-commerce and enterprise management. However, the problem of class imbalance and nonconsistent misclassification cost is common in the field of organizational behavior. For this problem, this article compares and analyzes the performance of the organizational behavior prediction model established by four typical cost-sensitive learning methods based on six classifiers, which provides a basis for the appropriate selection of cost-sensitive learning methods in different situations. Among them, the upsampling learning method is a better cost-sensitive learning method. However, there are some shortcomings in the upper sampling method. In order to avoid the possible overfitting problem of the social organization behavior prediction model established by the upper sampling method, this article proposes a new cost-sensitive learning method suitable for the mining of organizational behavior patterns. Based on the cost curve, this article proposes an effective personalized solution to the problem of class disequilibrium and nonconsistent misclassification cost in organizational behavior prediction modeling.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Hierarchical deployment of deep neural networks based on fog computing inferred acceleration model
Weijin Jiang,Sijian Lv +1 more
TL;DR: The proposed hierarchical deployment and inference acceleration model meets the minimum latency and accuracy of neural network inference in multiple fog computing scenarios and greatly reduces the performance occupation and case cost of the cloud under the traditional cloud computing model.
6
Dual-Population Social Group Optimization Algorithm Based on Human Social Group Behavior Law
TL;DR: In this article , a new swarm intelligence algorithm named the dual-population social group optimization (DPSGO) algorithm is proposed to further simulate the behavior law of actual human social groups.
5
Quadro-W learning for human behavior prediction in an evolving environment: a case study of the intelligent butler technology
TL;DR: A Quadro-W (QW) learning method to predict human behavior is developed that can not only make predictions based on the initial environment but also update itself with changes in the environment to increase the system flexibility and life cycle.
Task Distribution Method of Participatory Sensing Based on Urban Rail Transit
Jiang Weijin,Lu Sijian,Liu Yuehua,Chen Junpeng,Zhang Wanqing +4 more
Abstract: With the current development of mobile terminal devices and the popularity of 5G technology, there is an increasing demand for mobile group intelligence awareness. However, the current distribution methods for sensing tasks still suffer from inefficient, costly and unstable transmission, which limits greatly the completion of sensing terminal tasks. For this reason, an Incentive Cost Task Distribution Model (ICTDM) and a User Number Task Distribution Model (UNTDM) based on the good coverage of urban rail transit and the predictability of urban rail transit are proposed. The selective distribution of sensory tasks in different areas of the city is achieved through the sparseness of rail traffic for aggregated pedestrian flows. And the minimization of the number of people required for the task and the distance moved is used as a means to accomplish the purpose of reducing the total incentive cost of the system. Experimental results show that this algorithm can achieve fewer task participant distribution schemes by optimizing the task distribution process to reduce the cost of perceived tasks compared with similar algorithms, while completing the same set of tasks.
Dual-Population Social Group Optimization Algorithm Based on Human Social Group Behavior Law
TL;DR: In this paper , a new swarm intelligence algorithm named the dual-population social group optimization (DPSGO) algorithm is proposed to further simulate the behavior law of actual human social groups.
References
SMOTE: synthetic minority over-sampling technique
TL;DR: In this article, a method of over-sampling the minority class involves creating synthetic minority class examples, which is evaluated using the area under the Receiver Operating Characteristic curve (AUC) and the ROC convex hull strategy.
•Book
Classification and regression trees
Leo Breiman
- 01 Jan 1983
TL;DR: The methodology used to construct tree structured rules is the focus of a monograph as mentioned in this paper, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.
22.7K
Classification and regression trees
TL;DR: This article gives an introduction to the subject of classification and regression trees by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples.
•Proceedings Article
Fast algorithms for mining association rules
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 01 Jul 1998
TL;DR: Two new algorithms for solving thii problem that are fundamentally different from the known algorithms are presented and empirical evaluation shows that these algorithms outperform theknown algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems.
SMOTE: Synthetic Minority Over-sampling Technique
TL;DR: In this article, a method of over-sampling the minority class involves creating synthetic minority class examples, which is evaluated using the area under the Receiver Operating Characteristic curve (AUC) and the ROC convex hull strategy.