In this paper we present a prediction process of the Stock Exchange of Thailand index using adaptive evolution strategies. The prediction process does not require the knowledge of the functional form a priori. In each recursion step, genetic algorithm is used to evolve the structure of the prediction function, whereas the coefficient is evolved by evolution strategies. The proposed method has been shown to successfully predict the Stock Exchange of Thailand and returns an error less than 3%. This methodology is also a tool for knowledge discovery in a specific application. We have found that the SET index can be reasonably forecasted with only two factors: the Hang Seng index and minimum loan rate. The proposed method also achieves a lower prediction error when compared with multiple regression method

Nowadays there are many new web sites occur daily on the Internet and the demand for web page creation and design increases. The problem is it takes time to create and design the web pages. Moreover, designing web page templates to satisfy user preference is difficult. In order to reduce time and allow users to interact with the design process, we propose the web application which applies interactive genetic algorithm to generate web page templates and allow users to get involved with the system. The proposed algorithm evolves HTML files for the content and CSS style sheets for a presentation format. Users can rate each section of a web page template according to their preferences. The given scores feed back to the system and the generated template is evolved. The experiments are conducted by assuming user's preferential criteria. We designed score-rules to test the algorithm whether it can create web page templates to satisfy the criteria or not. The experimental results show that the proposed algorithm can generate web page templates that meet the criteria.

Location-based recommender systems (LBRSs) have exhibited significant potential in providing personalized recommendations based on the user’s geographic location and contextual factors such as time, personal preference, and location categories. However, several challenges (such as data sparsity, the cold-start problem, and tedium problem) need to be addressed to develop more effective LBRSs. In this paper, we propose a novel POI recommendation system, called LACF-Rec3, which employs a hybrid approach of link analysis (HITS-3) and collaborative filtering (CF-3) based on three visiting behaviors: frequency, variety, and repetition. HITS-3 identifies distinctive POIs based on user- and POI-visit patterns, ranks them accordingly, and recommends them to cold-start users. For existing users, CF-3 utilizes collaborative filtering based on their previous check-in history and POI distinctive aspects. Our experimental results conducted on a Foursquare dataset demonstrate that LACF-Rec3 outperforms prior methods in terms of recommendation accuracy, ranking precision, and matching ratio. In addition, LACF-Rec3 effectively solves the challenges of data sparsity, the cold-start issue, and tedium problems for cold-start and existing users. These findings highlight the potential of LACF-Rec3 as a promising solution to the challenges encountered by LBRS.

Effective crossover methods are essential for genetic algorithms because they enhance population diversity, resulting in an increase in the search space to be explored and the mitigation of trapping at local optima. Ring-based crossover methods are designed to address the shortcomings of traditional crossover techniques; for example, the ends of binary-encoded chromosomes tend to remain unaltered, even when their fitness values are low. By conjoining the leftmost and rightmost parts of a chromosome to form a ring, the ring-based crossovers allow offspring bits to be inherited from parent bits at the front and rear positions. Such a ring-based technique helps increase population diversity while requiring a relatively low number of fitness evaluations. To the best of our knowledge, there has been no comparative study or comprehensive analysis of ring-based crossover techniques. In this paper, we study and compare the characteristics of various existing ring-based crossover techniques (i.e., circle-ring (CRC), annular (AC), ring (RC) and front-rear crossover (FRC)). Although they each have distinct characteristics, they share a common crossover concept: bits at different positions can be swapped. We propose a generalized ring-based crossover (GRC) as an umbrella of the ring-based crossovers, embodying all of their beneficial characteristics. Chromosome shifting, ring forming, chromosome exchange and offspring creation are integrated into the proposed model. The experimental results show that GRC outperforms the other ring-based crossover methods in all experiments, and these results are consistent with the results of behavioral analysis. In a trap problem, GRC outperformed the state-of-the-art BOA method and require 40-times fewer fitness evaluations. GRC tends to maintain a variety of candidates in populations and to preserve the building blocks of solution, and it requires 93% and 57% fewer fitness evaluations (on average) compared to traditional crossover and other ring-based crossover methods.