scholarly journals Non-submodular model for group profit maximization problem in social networks

2021 ◽  
Vol 8 (1) ◽  
Author(s):  
Jianming Zhu ◽  
Smita Ghosh ◽  
Weili Wu ◽  
Chuangen Gao
Keyword(s):  
Social Networks ◽  
Profit Maximization ◽  
Randomized Algorithm ◽  
Political Orientation ◽  
Submodular Functions ◽  
Maximization Problem ◽  
Modular Algorithm ◽  
The Difference ◽  
Group Enterprise ◽  
Theoretical Results

AbstractIn social networks, there exist many kinds of groups in which people may have the same interests, hobbies, or political orientation. Sometimes, group decisions are made by simply majority, which means that most of the users in this group reach an agreement, such as US Presidential Elections. A group is called activated if $$\beta$$ β percent of users are influenced in the group. Enterprise will gain income from all influenced groups. Simultaneously, to propagate influence, enterprise needs pay advertisement diffusion cost. Group profit maximization (GPM) problem aims to pick k seeds to maximize the expected profit that considers the benefit of influenced groups with the diffusion cost. GPM is proved to be NP-hard and the objective function is proved to be neither submodular nor supermodular. An upper bound and a lower bound which are difference of two submodular functions are designed. We propose a submodular–modular algorithm (SMA) to solve the difference of two submodular functions and SMA is shown to converge to a local optimal. We present an randomized algorithm based on weighted group coverage maximization for GPM and apply sandwich framework to get theoretical results. Our experiments verify the efficiency of our methods.

Nonsubmodular Constrained Profit Maximization in Attribute Networks

2021 ◽  
Author(s):  
Liman Du ◽  
Wenguo Yang ◽  
Suixiang Gao
Keyword(s):  
Profit Maximization ◽  
Logistic Function ◽  
Influence Maximization ◽  
Maximization Problem ◽  
Cardinality Constraint ◽  
Three Phase ◽  
Marginal Increment ◽  
The Difference ◽  
Classical Influence ◽  
Influence Maximization Problem

The number of social individuals who interact with their friends through social networks is increasing, leading to an undeniable fact that word-of-mouth marketing has become one of the useful ways to promote sale of products. The Constrained Profit Maximization in Attribute network (CPMA) problem, as an extension of the classical influence maximization problem, is the main focus of this paper. We propose the profit maximization in attribute network problem under a cardinality constraint which is closer to the actual situation. The profit spread metric of CPMA calculates the total benefit and cost generated by all the active nodes. Different from the classical Influence Maximization problem, the influence strength should be recalculated according to the emotional tendency and classification label of nodes in attribute networks. The profit spread metric is no longer monotone and submodular in general. Given that the profit spread metric can be expressed as the difference between two submodular functions and admits a DS decomposition, a three-phase algorithm named as Marginal increment and Community-based Prune and Search(MCPS) Algorithm frame is proposed which is based on Louvain algorithm and logistic function. Due to the method of marginal increment, MPCS algorithm can compute profit spread more directly and accurately. Experiments demonstrate the effectiveness of MCPS algorithm.

Profit Maximization problem with Coupons in social networks

2020 ◽  
Vol 803 ◽  
pp. 22-35
Author(s):  
Bin Liu ◽  
Xiao Li ◽  
Huijuan Wang ◽  
Qizhi Fang ◽  
Junyu Dong ◽  
...  
Keyword(s):  
Social Networks ◽  
Profit Maximization ◽  
Maximization Problem

scholarly journals Genetic Algorithm for the Retailers’ Shelf Space Allocation Profit Maximization Problem

2021 ◽  
Vol 11 (14) ◽  
pp. 6401
Author(s):  
Kateryna Czerniachowska ◽  
Karina Sachpazidu-Wójcicka ◽  
Piotr Sulikowski ◽  
Marcin Hernes ◽  
Artur Rot
Keyword(s):  
Genetic Algorithm ◽  
Profit Maximization ◽  
Allocation Rule ◽  
Maximization Problem ◽  
Shelf Space ◽  
Allocation Model ◽  
Space Allocation ◽  
Shelf Space Allocation ◽  
To Receive

This paper discusses the problem of retailers’ profit maximization regarding displaying products on the planogram shelves, which may have different dimensions in each store but allocate the same product sets. We develop a mathematical model and a genetic algorithm for solving the shelf space allocation problem with the criteria of retailers’ profit maximization. The implemented program executes in a reasonable time. The quality of the genetic algorithm has been evaluated using the CPLEX solver. We determine four groups of constraints for the products that should be allocated on a shelf: shelf constraints, shelf type constraints, product constraints, and virtual segment constraints. The validity of the developed genetic algorithm has been checked on 25 retailing test cases. Computational results prove that the proposed approach allows for obtaining efficient results in short running time, and the developed complex shelf space allocation model, which considers multiple attributes of a shelf, segment, and product, as well as product capping and nesting allocation rule, is of high practical relevance. The proposed approach allows retailers to receive higher store profits with regard to the actual merchandising rules.

scholarly journals A Novel Integrated Profit Maximization Model for Retailers under Varied Penetration Levels of Photovoltaic Systems

Energies ◽  
2020 ◽  
Vol 14 (1) ◽  
pp. 92
Author(s):  
Ioannis P. Panapakidis ◽  
Nikolaos Koltsaklis ◽  
Georgios C. Christoforidis
Keyword(s):  
Profit Maximization ◽  
Energy Markets ◽  
Maximization Problem ◽  
Selling Price ◽  
Retail Market ◽  
Stochastic Variable ◽  
Wholesale Market ◽  
Market Operation ◽  
Pv Penetration ◽  
Marginal Price

In contemporary energy markets, the Retailer acts as the intermediate between the generation and demand sectors. The scope of the Retailer is to maximize its profits by selecting the appropriate procurement mechanism and selling price to the consumers. The wholesale market operation influences the profits since the mix of generation plants determines the system marginal price (SMP). In the related literature, the SMP is treated as a stochastic variable, and the wholesale market conditions are not taken into account. The present paper presents a novel methodology that aims at connecting the wholesale and retail market operations from a Retailer’s perspective. A wholesale market clearing problem is formulated and solved. The scope is to examine how different photovoltaics (PV) penetration levels in the generation side influences the profits of the Retailer and the selling prices to the consumers. The resulting SMPs are used as inputs in a retailer profit maximization problem. This approach allows the Retailer to minimize economic risks and maximize profits. The results indicate that different PV implementation levels on the generation side highly influences the profits and the selling prices.

Economic optimum plant density of irrigated early-maturity soybean in southern Alberta

2021 ◽  
Author(s):  
Tram T.N. Thai ◽  
Danny G. Le Roy ◽  
Manjula S. Bandara ◽  
James E. Thomas ◽  
Francis J Larney
Keyword(s):  
Plant Density ◽  
Profit Maximization ◽  
Seeding Density ◽  
Early Maturity ◽  
Growing Seasons ◽  
Southern Alberta ◽  
Soybean Genotypes ◽  
Glycine Max L ◽  
The Difference ◽  
Lower Plant

With soybean [Glycine max (L.) Merr.] seed cost increasing in Alberta, understanding economic optimum plant density (EOPD) could help growers save on input expenses. A study was conducted at two irrigated locations in southern Alberta (Bow Island and Lethbridge), in three growing seasons (2014–16), using two maturity group (MG) 00 soybean genotypes, two row spacings (RS; narrow, 17.5 cm; wide, 35 cm), and three seeding densities (SD; 30, 50 and 80 seeds m-2). Exponential plant density-yield relationships were used to estimate EOPD. The earlier MG 00.4 genotype compensated yield at lower plant density (39 vs. 43 plants m-2) and emergence (74 vs. 80%) than the later MG 00.8 genotype. The EOPD gaps between environments, genotypes, and RS were minimal (from 1–3 plants m-2), resulting in only 1.3–2.0% differences in grain yield (37–56 kg ha-1), and gross revenue at EOPD ($16–24 ha-1). The overall EOPD estimate was 46 plants m-2, regardless of environment, genotype or RS. The study highlighted the difference between agronomic production and profit maximization in choosing an optimum plant density, and the need to establish a seeding density calculator for irrigated soybean in southern Alberta.

A survey on meta-heuristic algorithms for the influence maximization problem in the social networks

Computing ◽  
2021 ◽  
Author(s):  
Zahra Aghaee ◽  
Mohammad Mahdi Ghasemi ◽  
Hamid Ahmadi Beni ◽  
Asgarali Bouyer ◽  
Afsaneh Fatemi
Keyword(s):  
Social Networks ◽  
Heuristic Algorithms ◽  
Influence Maximization ◽  
Maximization Problem ◽  
The Social ◽  
Influence Maximization Problem

scholarly journals Retweet Prediction Based on User Behavior

2021 ◽  
Author(s):  
Syeda Nadia Firdaus
Keyword(s):  
Machine Learning ◽  
Social Networks ◽  
Social Network ◽  
Prediction Model ◽  
Matrix Factorization ◽  
Information Diffusion ◽  
User Behavior ◽  
Past Research ◽  
The Difference ◽  
The Impact

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.

scholarly journals Retweet Prediction Based on User Behavior

2021 ◽  
Author(s):  
Syeda Nadia Firdaus
Keyword(s):  
Machine Learning ◽  
Social Networks ◽  
Social Network ◽  
Prediction Model ◽  
Matrix Factorization ◽  
Information Diffusion ◽  
User Behavior ◽  
Past Research ◽  
The Difference ◽  
The Impact

Social network is a hot topic of interest for researchers in the field of computer science in recent years. These social networks such as Facebook, Twitter, Instagram play an important role in information diffusion. Social network data are created by its users. Users’ online activities and behavior have been studied in various past research efforts in order to get a better understanding on how information is diffused on social networks. In this study, we focus on Twitter and we explore the impact of user behavior on their retweet activity. To represent a user’s behavior for predicting their retweet decision, we introduce 10-dimentional emotion and 35-dimensional personality related features. We consider the difference of a user being an author and a retweeter in terms of their behaviors, and propose a machine learning based retweet prediction model considering this difference. We also propose two approaches for matrix factorization retweet prediction model which learns the latent relation between users and tweets to predict the user’s retweet decision. In the experiment, we have tested our proposed models. We find that models based on user behavior related features provide good improvement (3% - 6% in terms of F1- score) over baseline models. By only considering user’s behavior as a retweeter, the data processing time is reduced while the prediction accuracy is comparable to the case when both retweeting and posting behaviors are considered. In the proposed matrix factorization models, we include tweet features into the basic factorization model through newly defined regularization terms and improve the performance by 3% - 4% in terms of F1-score. Finally, we compare the performance of machine learning and matrix factorization models for retweet prediction and find that none of the models is superior to the other in all occasions. Therefore, different models should be used depending on how prediction results will be used. Machine learning model is preferable when a model’s performance quality is important such as for tweet re-ranking and tweet recommendation. Matrix factorization is a preferred option when model’s positive retweet prediction capability is more important such as for marketing campaign and finding potential retweeters.

scholarly journals Social Ties and the Job Search of Recent Immigrants

ILR Review ◽  
2017 ◽  
Vol 72 (2) ◽  
pp. 355-381 ◽  
Author(s):  
Deepti Goel ◽  
Kevin Lang
Keyword(s):  
Social Networks ◽  
Theoretical Model ◽  
Job Search ◽  
Social Ties ◽  
Wage Distribution ◽  
Specific Mechanism ◽  
Recent Immigrants ◽  
The Difference

This article highlights a specific mechanism through which social networks help in job search. The authors characterize the strength of a network by its likelihood of providing a job offer. Using a theoretical model, they show that the difference between wages in jobs found using networks versus those found using formal channels decreases as the network becomes stronger. The authors verify this result for recent immigrants to Canada for whom a strong network is captured by the presence of a “close tie.” Furthermore, structural estimates confirm that the presence of a close tie operates by increasing the likelihood of generating a job offer from the network rather than by altering the network wage distribution.

Sign in / Sign up

Export Citation Format

Share Document