In this paper, we present a decision-makingprocess that uses our proposed quasi-oppositional comprehensive learning particle swarm optimizers (QCLPSO) to solve multi-period portfolio problem. Multi-stage stochastic f...
详细信息
In this paper, we present a decision-makingprocess that uses our proposed quasi-oppositional comprehensive learning particle swarm optimizers (QCLPSO) to solve multi-period portfolio problem. Multi-stage stochastic financial optimization takes order with portfolio in ever-changing financial markets by periodically rebalancing the asset portfolio to achieve return maximization and/or risk minimization. It brings together all major financial-related decision in a single consistent structure and integrates investment strategies, liability decisions and savings strategies in an all-around fashion. The objective function is classical return-variance function. The performance of our algorithm is demonstrated by optimizing the allocation of cash and various stocks in SSE 180 Index. Experiments are conducted to compare performance of the portfolio optimized by different objective functions with PSO and genetic algorithm (GA) in the terms of efficient frontiers.
When the case information is described in natural language and not complete, to deal with problems of case retrieval in Case-Based Reasoning (CBR), Extension theory is introduced to aid it. Firstly, the case index is ...
详细信息
When the case information is described in natural language and not complete, to deal with problems of case retrieval in Case-Based Reasoning (CBR), Extension theory is introduced to aid it. Firstly, the case index is created based on the Extension model. Secondly, the main characteristics of the case are formalized to store in the case base to realize the data compression. Finally, case retrieval algorithm is designed. The basic and the advanced retrieve strategy supplement each other. This algorithm lowers the request of the professional level and improves the efficiency of retrieval. The approach is of practical significance in problem solving, such as auto fault diagnosis.
Consumers' online information seeking process consists of two alternatelyjoining behaviors: intra-site visit and cross-site transfer. Current studiesmainly focused on the intra-site visit behavior while cross-site...
详细信息
This paper proposes a scheduling strategy which divides OLAM (Online Analytical Mining) tasks into query tasks, mining tasks and updating tasks in order to improve the efficiency of Bl (Business Intelligence) systems....
详细信息
This paper proposes a scheduling strategy which divides OLAM (Online Analytical Mining) tasks into query tasks, mining tasks and updating tasks in order to improve the efficiency of Bl (Business Intelligence) systems. OLAM mechanism is considered as the seamless integration of OLAP (Online Analytical processing) and data mining on data cubes, according to which the scheduling strategy focuses on. This paper emphasizes the interaction of OLAP, data mining and data cube updating, illustrates the details of the OLAM scheduling strategy and demonstrates its efficiency by performing it in a financial Bl system.
This paper proposes, for the first time, a new issue called utility paradox which can not be solved effectively by the existing methods in evidence theory. A utility analysis method considering the subjective preferen...
详细信息
This paper proposes, for the first time, a new issue called utility paradox which can not be solved effectively by the existing methods in evidence theory. A utility analysis method considering the subjective preference of decision maker is presented to solve the utility paradox problem. First, the degrees of belief given by experts are transformed into the utility beliefs of decision makers by a utility-belief function. The utility beliefs determine decision makers' action. Second, the rule of combination in evidence theory is employed to combine the utility beliefs. This paper gives the properties the utility-belief function should have, then a specific function is given and its validation is proved. Experiment shows the method is valid to solve the utility paradox problem.
This paper considers how to design coordination strategies to achieve the coordination in decentralized supply chain, considering pricing, inventory and transportation cost simultaneously under the price sensitive env...
详细信息
ISBN:
(纸本)9781424425020
This paper considers how to design coordination strategies to achieve the coordination in decentralized supply chain, considering pricing, inventory and transportation cost simultaneously under the price sensitive environment. Based on a supplier-Stackelberg game structure, we analyze the non-cooperation decision model and design the algorithm. Then we propose the cooperation decision model and design the algorithm. Revenue sharing and price discount strategies are used to coordinate the decentralized supply chain. The experimental results show that both revenue sharing and price discount strategy can efficiently make the coordination of the supplier and the retailer.
This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are ...
详细信息
ISBN:
(纸本)9781424425020
This paper considers the problem of uniform parallel machine scheduling with unequal release dates so as to minimize makespan. This problem is proved to an NP-hard problem. Heuristics in existence for the problem are analyzed, and then we present an improved algorithm. The performance of the algorithms by experiment is also analyzed. The heuristic is further extended by applying the method of variable neighborhood search, which is used for improving the quality of the solutions obtained by the original heuristics.
This paper considered the single machine scheduling problem with unequal release dates so as to minimize total completion times. This problem was proved to be as an NP-hard problem. Traditional heuristics for the prob...
详细信息
This paper considered the single machine scheduling problem with unequal release dates so as to minimize total completion times. This problem was proved to be as an NP-hard problem. Traditional heuristics for the problem were analyzed, and then we presented an improved algorithm. A numerical example and its computational result were given. The performance of the algorithm was also analyzed by experiments and the experimental results show that the algorithm is more effective than the existing heuristics.
Music recommender systems play a critical role in music streaming platforms by providing users with music that they are likely to enjoy. Recent studies have shown that user emotions can influence users’ preferences f...
详细信息
Music recommender systems play a critical role in music streaming platforms by providing users with music that they are likely to enjoy. Recent studies have shown that user emotions can influence users’ preferences for music moods. However, existing emotion-aware music recommender systems (EMRSs) explicitly or implicitly assume that users’ actual emotional states expressed through identical emotional words are homogeneous. They also assume that users’ music mood preferences are homogeneous under the same emotional state. In this article, we propose four types of heterogeneity that an EMRS should account for: emotion heterogeneity across users, emotion heterogeneity within a user, music mood preference heterogeneity across users, and music mood preference heterogeneity within a user. We further propose a Heterogeneity-aware Deep Bayesian Network (HDBN) to model these assumptions. The HDBN mimics a user’s decisionprocess of choosing music with four components: personalized prior user emotion distribution modeling, posterior user emotion distribution modeling, user grouping, and Bayesian neural network-based music mood preference prediction. We constructed two datasets, called EmoMusicLJ and EmoMusicLJ-small, to validate our method. Extensive experiments demonstrate that our method significantly outperforms baseline approaches on metrics of HR, Precision, NDCG, and MRR. Ablation studies and case studies further validate the effectiveness of our HDBN. The source code and datasets are available at https://***/jingrk/HDBN.
暂无评论