Personalised attraction recommendation for enhancing topic diversity and accuracy

2021 ◽  
pp. 016555152199980
Author(s):  
Yuanyuan Lin ◽  
Chao Huang ◽  
Wei Yao ◽  
Yifei Shao
Keyword(s):  
Real World ◽  
Information Overload ◽  
Two Stage ◽  
Misclassification Cost ◽  
Second Stage ◽  
Low Visibility ◽  
Recommendation Diversity ◽  
Optimisation Model ◽  
Definition Of ◽  
Improved Methods

Attraction recommendation plays an important role in tourism, such as solving information overload problems and recommending proper attractions to users. Currently, most recommendation methods are dedicated to improving the accuracy of recommendations. However, recommendation methods only focusing on accuracy tend to recommend popular items that are often purchased by users, which results in a lack of diversity and low visibility of non-popular items. Hence, many studies have suggested the importance of recommendation diversity and proposed improved methods, but there is room for improvement. First, the definition of diversity for different items requires consideration for domain characteristics. Second, the existing algorithms for improving diversity sacrifice the accuracy of recommendations. Therefore, the article utilises the topic ‘features of attractions’ to define the calculation method of recommendation diversity. We developed a two-stage optimisation model to enhance recommendation diversity while maintaining the accuracy of recommendations. In the first stage, an optimisation model considering topic diversity is proposed to increase recommendation diversity and generate candidate attractions. In the second stage, we propose a minimisation misclassification cost optimisation model to balance recommendation diversity and accuracy. To assess the performance of the proposed method, experiments are conducted with real-world travel data. The results indicate that the proposed two-stage optimisation model can significantly improve the diversity and accuracy of recommendations.

A TWO-STAGE SYNERGETIC APPROACH FOR FACE RECOGNITION

2004 ◽  
Vol 18 (06) ◽  
pp. 1007-1017
Author(s):  
WEIGANG CHEN ◽  
FEIHU QI ◽  
ZHAOZHONG WANG
Keyword(s):  
Face Recognition ◽  
Potential Function ◽  
Order Parameter ◽  
Test Pattern ◽  
Face Image ◽  
Recognition Method ◽  
Two Stage ◽  
Second Stage ◽  
Definition Of ◽  
Global Similarity

A two-stage face recognition method is presented in this paper. In the first stage, the set of candidate patterns is narrowed down with the global similarity being taken into account. In the second stage, synergetic approach is employed to perform further recognition. Face image is segmented into meaningful regions, each of which is represented as a prototype vector. The similarity between a given region of the test pattern and a stored sample is obtained as the order parameter which serves as an element of the order vector. Finally, a modified definition of the potential function is given, and the dynamic model of recognition is derived from it. The effectiveness of the proposed method is experimentally confirmed.

scholarly journals The commercialization instruments of innovations: empirical research on FMCG market

2018 ◽  
pp. 42-51 ◽  
Author(s):  
E. V. Arsenova ◽  
O. N. Pankova
Keyword(s):  
Empirical Research ◽  
Market Research ◽  
New Products ◽  
Special Importance ◽  
Practical Application ◽  
Two Stage ◽  
Russian Market ◽  
Case Research ◽  
Second Stage ◽  
Definition Of

The research objective is in definition of the main tools participating in process of commercialization of grocery and marketing on the basis of expansion and deepening of the existing theory and methodology of commercialization, and also development of recommendations to improvement of tools that will promote finally to increase of efficiency of process of acceptance of a novelty by the market. Research is conducted on the basis of two-stage methodology including at the first stage carrying out questioning among the employees occupied in the course of commercialization in the large companies FMCG of the market, and at the second stage a case - research of two - players of the Russian market of juice. Confirmation of the made hypothesis that in most cases the innovations put on the market, can be considered grocery that is explainable that such innovations are capable to give to consumers essentially new advantages is result of research. The interrelation between stages of commercialization and the tools applied during this period is also confirmed. In the analysis of separate tools the tools informing the consumer on new products showed the greatest importance. Among them the special importance is played by TV advertizing. Practical application of results consists in identification tools for each of stages of commercialization of innovations the FMCG companies, and also those from them which play a paramount role on each of stages are defined.

An Enhanced Two Stage MMSE Equalizer for Coded FBMC/OQAM Systems

2019 ◽  
Vol 10 (1) ◽  
pp. 69-82 ◽  
Author(s):  
Mohammad Rizk Assaf ◽  
Abdel-Nasser Assimi
Keyword(s):  
Error Propagation ◽  
Channel Model ◽  
Error Correcting Codes ◽  
Two Stage ◽  
Probability Of Error ◽  
Second Stage ◽  
Different Types ◽  
Mmse Equalizer ◽  
And Performance ◽  
Ici Cancellation

In this article, the authors investigate the enhanced two stage MMSE (TS-MMSE) equalizer in bit-interleaved coded FBMC/OQAM system which gives a tradeoff between complexity and performance, since error correcting codes limits error propagation, so this allows the equalizer to remove not only ICI but also ISI in the second stage. The proposed equalizer has shown less design complexity compared to the other MMSE equalizers. The obtained results show that the probability of error is improved where SNR gain reaches 2 dB measured at BER compared with ICI cancellation for different types of modulation schemes and ITU Vehicular B channel model. Some simulation results are provided to illustrate the effectiveness of the proposed equalizer.

scholarly journals Two-stage multi-tasking transform framework for large-scale many-objective optimization problems

2021 ◽  
Author(s):  
Lu Chen ◽  
Handing Wang ◽  
Wenping Ma
Keyword(s):  
Large Scale ◽  
Original Problem ◽  
Optimization Problems ◽  
Reference Points ◽  
Optimization Strategy ◽  
Two Stage ◽  
Decision Space ◽  
Second Stage ◽  
Decision Variables ◽  
Objective Space

AbstractReal-world optimization applications in complex systems always contain multiple factors to be optimized, which can be formulated as multi-objective optimization problems. These problems have been solved by many evolutionary algorithms like MOEA/D, NSGA-III, and KnEA. However, when the numbers of decision variables and objectives increase, the computation costs of those mentioned algorithms will be unaffordable. To reduce such high computation cost on large-scale many-objective optimization problems, we proposed a two-stage framework. The first stage of the proposed algorithm combines with a multi-tasking optimization strategy and a bi-directional search strategy, where the original problem is reformulated as a multi-tasking optimization problem in the decision space to enhance the convergence. To improve the diversity, in the second stage, the proposed algorithm applies multi-tasking optimization to a number of sub-problems based on reference points in the objective space. In this paper, to show the effectiveness of the proposed algorithm, we test the algorithm on the DTLZ and LSMOP problems and compare it with existing algorithms, and it outperforms other compared algorithms in most cases and shows disadvantage on both convergence and diversity.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

scholarly journals Betweenness centrality for temporal multiplexes

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Silvia Zaoli ◽  
Piero Mazzarisi ◽  
Fabrizio Lillo
Keyword(s):  
Information Flow ◽  
Real World ◽  
Betweenness Centrality ◽  
Temporal Structure ◽  
Shortest Paths ◽  
Single Layer ◽  
Distance Metric ◽  
Definition Of

AbstractBetweenness centrality quantifies the importance of a vertex for the information flow in a network. The standard betweenness centrality applies to static single-layer networks, but many real world networks are both dynamic and made of several layers. We propose a definition of betweenness centrality for temporal multiplexes. This definition accounts for the topological and temporal structure and for the duration of paths in the determination of the shortest paths. We propose an algorithm to compute the new metric using a mapping to a static graph. We apply the metric to a dataset of $$\sim 20$$ ∼ 20 k European flights and compare the results with those obtained with static or single-layer metrics. The differences in the airports rankings highlight the importance of considering the temporal multiplex structure and an appropriate distance metric.

scholarly journals Fast Two-Stage Computation of an Index Policy for Multi-Armed Bandits with Setup Delays

Mathematics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 52
Author(s):  
José Niño-Mora
Keyword(s):  
Numerical Study ◽  
Arithmetic Operation ◽  
Bandit Problem ◽  
Index Policy ◽  
Two Stage ◽  
Second Stage ◽  
Whittle Index ◽  
Set Up ◽  
Computing Method ◽  
Special Case

We consider the multi-armed bandit problem with penalties for switching that include setup delays and costs, extending the former results of the author for the special case with no switching delays. A priority index for projects with setup delays that characterizes, in part, optimal policies was introduced by Asawa and Teneketzis in 1996, yet without giving a means of computing it. We present a fast two-stage index computing method, which computes the continuation index (which applies when the project has been set up) in a first stage and certain extra quantities with cubic (arithmetic-operation) complexity in the number of project states and then computes the switching index (which applies when the project is not set up), in a second stage, with quadratic complexity. The approach is based on new methodological advances on restless bandit indexation, which are introduced and deployed herein, being motivated by the limitations of previous results, exploiting the fact that the aforementioned index is the Whittle index of the project in its restless reformulation. A numerical study demonstrates substantial runtime speed-ups of the new two-stage index algorithm versus a general one-stage Whittle index algorithm. The study further gives evidence that, in a multi-project setting, the index policy is consistently nearly optimal.

scholarly journals Multiple Sclerosis: Assessment of Disease Progression and Effects of Treatment

1987 ◽  
Vol 14 (S3) ◽  
pp. 518-520 ◽  
Author(s):  
D.W. Paty
Keyword(s):  
Multiple Sclerosis ◽  
Disease Progression ◽  
Treatment Effects ◽  
Two Stage ◽  
Second Stage ◽  
Sequential Development ◽  
Stage Disease

ABSTRACT:MS could well be a two stage disease. The first stage involves the sequential development of multiple small lesions, mostly inflammatory, that accumulate at a given rate. The second stage could be that of consolidation and confluence of lesions that involves not only demyelination but gliosis. MRI now gives us an opportunity to watch the evolution of these processes and also to monitor treatment effects. It is only after the evolution of this process is understood that we can design rational therapies directed toward the prevention of spasticity in MS.

scholarly journals Two-Stage Mask-RCNN Approach for Detecting and Segmenting the Optic Nerve Head, Optic Disc, and Optic Cup in Fundus Images

2020 ◽  
Vol 10 (11) ◽  
pp. 3833 ◽  
Author(s):  
Haidar Almubarak ◽  
Yakoub Bazi ◽  
Naif Alajlan
Keyword(s):  
Optic Nerve ◽  
Optic Disc ◽  
Optic Nerve Head ◽  
Fine Tuning ◽  
Fundus Images ◽  
Two Stage ◽  
Second Stage ◽  
Retinal Fundus Images ◽  
Tuning Strategy ◽  
Retinal Fundus

In this paper, we propose a method for localizing the optic nerve head and segmenting the optic disc/cup in retinal fundus images. The approach is based on a simple two-stage Mask-RCNN compared to sophisticated methods that represent the state-of-the-art in the literature. In the first stage, we detect and crop around the optic nerve head then feed the cropped image as input for the second stage. The second stage network is trained using a weighted loss to produce the final segmentation. To further improve the detection in the first stage, we propose a new fine-tuning strategy by combining the cropping output of the first stage with the original training image to train a new detection network using different scales for the region proposal network anchors. We evaluate the method on Retinal Fundus Images for Glaucoma Analysis (REFUGE), Magrabi, and MESSIDOR datasets. We used the REFUGE training subset to train the models in the proposed method. Our method achieved 0.0430 mean absolute error in the vertical cup-to-disc ratio (MAE vCDR) on the REFUGE test set compared to 0.0414 obtained using complex and multiple ensemble networks methods. The models trained with the proposed method transfer well to datasets outside REFUGE, achieving a MAE vCDR of 0.0785 and 0.077 on MESSIDOR and Magrabi datasets, respectively, without being retrained. In terms of detection accuracy, the proposed new fine-tuning strategy improved the detection rate from 96.7% to 98.04% on MESSIDOR and from 93.6% to 100% on Magrabi datasets compared to the reported detection rates in the literature.

scholarly journals Knowing What, How and Why: A Near Complete Solution for Aspect-Based Sentiment Analysis

2020 ◽  
Vol 34 (05) ◽  
pp. 8600-8607
Author(s):  
Haiyun Peng ◽  
Lu Xu ◽  
Lidong Bing ◽  
Fei Huang ◽  
Wei Lu ◽  
...  
Keyword(s):  
Sentiment Analysis ◽  
State Of The Art ◽  
Complete Solution ◽  
Unified Model ◽  
Two Stage ◽  
Fine Grained ◽  
Aspect Extraction ◽  
Second Stage ◽  
Opinion Extraction ◽  
Complete Story

Target-based sentiment analysis or aspect-based sentiment analysis (ABSA) refers to addressing various sentiment analysis tasks at a fine-grained level, which includes but is not limited to aspect extraction, aspect sentiment classification, and opinion extraction. There exist many solvers of the above individual subtasks or a combination of two subtasks, and they can work together to tell a complete story, i.e. the discussed aspect, the sentiment on it, and the cause of the sentiment. However, no previous ABSA research tried to provide a complete solution in one shot. In this paper, we introduce a new subtask under ABSA, named aspect sentiment triplet extraction (ASTE). Particularly, a solver of this task needs to extract triplets (What, How, Why) from the inputs, which show WHAT the targeted aspects are, HOW their sentiment polarities are and WHY they have such polarities (i.e. opinion reasons). For instance, one triplet from “Waiters are very friendly and the pasta is simply average” could be (‘Waiters’, positive, ‘friendly’). We propose a two-stage framework to address this task. The first stage predicts what, how and why in a unified model, and then the second stage pairs up the predicted what (how) and why from the first stage to output triplets. In the experiments, our framework has set a benchmark performance in this novel triplet extraction task. Meanwhile, it outperforms a few strong baselines adapted from state-of-the-art related methods.

Sign in / Sign up

Export Citation Format

Share Document