No abstract

Abstract. This work presents a novel GA-Taguchi-based feature selection method. Genetic algorithms are utilized with randomness for "global search" of the entire search space of the intractable search problem. Various genetic operations, including crossover, mutation, selection and replacement are performed to assist the search procedure in escaping from sub-optimal solutions. In each iteration in the proposed nature-inspired method, the Taguchi methods are employed for "local search" of the entire search space and thus can help explore better feature subsets for next iteration. The two-level orthogonal array is utilized for a well-organized and balanced comparison of two levels for features-a feature is or is not selected for pattern classification-and interactions among features. The signal-to-noise ratio (SNR) is then used to determine the robustness of the features. As a result, feature subset evaluation efforts can be significantly reduced and a superior feature subset with high classification performance can be obtained. Experiments are performed on different application domains to demonstrate the performance of the proposed nature-inspired method. The proposed hybrid GA-Taguchi-based approach, with wrapper nature, yields superior performance and improves classification accuracy in pattern classification.

No abstract

No abstract

Web personalization has quickly changed from a value-added facility to a service required in presenting large quantities of information because individual users of the Internet have various needs and preferences in seeking information. This paper presents a novel personalized recommendation system with online preference analysis in a distance learning environment called Coursebot. Users can both browse and search for course materials by using the interface of Coursebot. Moreover, the proposed system includes appropriate course materials ranked according to a user's interests. In this work, an analysis measure is proposed to combine typical grey relational analysis and implicit rating, and thus a user's interests are calculated from the content of documents and the user's browsing behavior. This algorithm's low computational complexity and ease of adding knowledge support online personalized analysis. In addition, the user profiles are dynamically revised to provide efficiently personalized information that reflects a user's interests after each page is visited.