We apply an interactive genetic algorithm (iGA) to generate product recommendations. iGAs search for a single optimum point based on a user’s Kansei through the interaction between the user and machine. However, especially in the domain of product recommendations, there may be numerous optimum points. Therefore, the purpose of this study is to develop a new iGA crossover method that concurrently searches for multiple optimum points for multiple user preferences. The proposed method estimates the locations of the optimum area by a clustering method and then searches for the maximum values of the area by a probabilistic model. To confirm the effectiveness of this method, two experiments were performed. In the first experiment, a pseudouser operated an experiment system that implemented the proposed and conventional methods and the solutions obtained were evaluated using a set of pseudomultiple preferences. With this experiment, we proved that when there are multiple preferences, the proposed method searches faster and more diversely than the conventional one. The second experiment was a subjective experiment. This experiment showed that the proposed method was able to search concurrently for more preferences when subjects had multiple preferences. 1. Introduction At present, in the e-commerce of business-to-consumer, product recommendation is very important. The number of products sold on online shopping sites is increasing. Moreover, to improve sales, each site uses search techniques or recommendations to display its products. Because search techniques take into account user direct input, they return products that users expect. In contrast, because product recommendation techniques use action logs of users to analyze their needs, they display products that users do not expect. At present, the main recommendation techniques are contents based filtering [1, 2] and collaborative filtering [3–5]. The former recommends products by matching a user’s profile and action logs with features of products, whereas the latter recommends products on the basis of frequency they are bought at the same time. Therefore, we aim at displaying products that fit a personal Kansei model. Kansei is a Japanese term that relates to human characteristics such as sensibility, perception, affection, or subjectivity. We assume that human Kansei is modeled as a function. The input parameters of the function are the features of objects or the factors of environment and the output parameters are subjective evaluations such as preference or impression. This internal model in human Kansei
References
[1]
F. Ricci, L. Rokach, B. Shapira, and P. B. Kantor, Recommender Systems Handbook, Springer, 2011.
[2]
M. J. Pazzani and D. Billsus, “Content-Based Recommendation Systems,” in The Adaptive Web, pp. 325–341, 2007.
[3]
X. Su and T. M. Khoshgoftaar, “A survey of collaborative filtering techniques,” Advances in Artificial Intelligence, vol. 2009, Article ID 421425, 19 pages, 2009.
[4]
G. Linden, B. Smith, and J. York, “Amazon.com recommendations: item-to-item collaborative filtering,” IEEE Internet Computing, vol. 7, no. 1, pp. 76–80, 2003.
[5]
B. Sarwar, G. Karypis, J. Konstan, and J. Reidl, “Item-based collaborative filtering recommendation algorithms,” in Proceedings of the 10th international conference on World Wide Web, pp. 285–295, 2001.
[6]
M. Tanaka, T. Hiroyasu, M. Miki, Y. Sasaki, M. Yoshimi, and H. Yokouchi, “Extraction and usage of Kansei meta-data in interactive Genetic Algorithm,” in Proceedings of 9th World Congress on Structural and Multidisciplinary Optimization (WCSMO9 '11), p. 505, 2011.
[7]
H. Takagi, “Interactive evolutionary computation: fusion of the capabilities of EC optimization and human evaluation,” Proceedings of the IEEE, vol. 89, no. 9, pp. 1275–1296, 2001.
[8]
M. Herdy, “Evolution strategies with subjective selection,” in Parallel Problem SolvIng from Nature—PPSN IV, H. M. Voigt, W. Ebeling, I. Rechenberg, and H. P. Schwefel, Eds., vol. 1141 of Lecture Notes in Computer Science, pp. 22–31, Springer, Berlin, Germany, 1996.
[9]
T. Unemi, “SBArt4—Breeding abstract animations in realtime,” in Proceedings of the IEEE Congress on Evolutionary Computation (WCCI-IEEE CEC '10)., IEEE, Barcelona, Spain, July 2010.
[10]
K. Sims, “Artificial evolution for computer graphics,” Computer Graphics—ACM SIGGRAPH, vol. 25, no. 4, pp. 319–328, 1991.
[11]
J. Koza and R. Poli, “Genetic programming,” in Search Methodologies, E. K. Burke and G. Kendall, Eds., pp. 127–164, Springer, New York, NY, USA, 2005.
[12]
D.-W. Gong, J. Yuan, and X.-Y. Sun, “Interactive genetic algorithms with individual's fuzzy fitness,” Computers in Human Behavior, vol. 27, no. 5, pp. 1482–1492, 2011.
[13]
D. Gong, “Interactive genetic algorithms with individual fitness not assigned by human,” Journal of Universal Computer Science, vol. 15, no. 13, pp. 2464–2480, 2009.
[14]
X. Sun, D. Gong, and W. Zhang, “Interactive genetic algorithms with large population and semi-supervised learning,” Applied Soft Computing, vol. 12, no. 9, pp. 3004–3013, 2012.
[15]
D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Professional, 1989.
[16]
H.-S. Kim and S.-B. Cho, “Application of interactive genetic algorithm to fashion design,” Engineering Applications of Artificial Intelligence, vol. 13, no. 6, pp. 635–644, 2000.
[17]
S.-B. Cho, “Towards creative evolutionary systems with interactive genetic algorithm,” Applied Intelligence, vol. 16, no. 2, pp. 129–138, 2002.
[18]
J. C. Quiroz, S. J. Louis, A. Shankar, and S. M. Dascalu, “Interactive genetic algorithms for user interface design,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 1366–1373, September 2007.
[19]
J. C. Quiroz, A. Banerjee, S. J. Louis, and S. M. Dascalu, “Document design with interactive evolution,” in New Directions in Intelligent Interactive Multimedia Systems and Services, vol. 2, pp. 309–310, Springer, Berlin, Germany, 2009.
[20]
P. Legrand, C. Bourgeois-Republique, V. Péan et al., “Interactive evolution for cochlear implants fitting,” Genetic Programming and Evolvable Machines, vol. 8, no. 4, pp. 319–354, 2007.
[21]
H. Takagi and M. Ohsaki, “Interactive evolutionary computation-based hearing aid fitting,” IEEE Transactions on Evolutionary Computation, vol. 11, no. 3, pp. 414–427, 2007.
[22]
F. Herrera, M. Lozano, and A. M. Sánchez, “Hybrid crossover operators for real-coded genetic algorithms: an experimental study,” Soft Computing, vol. 9, no. 4, pp. 280–298, 2005.
[23]
K. Deep and M. Thakur, “A new crossover operator for real coded genetic algorithms,” Applied Mathematics and Computation, vol. 188, no. 1, pp. 895–911, 2007.
[24]
L. J. Eshelman and J. D. Schaffer, “Real-coded genetic algorithms and interval-schemata,” Foundations of Genetic Algorithms, vol. 2, pp. 187–202, 1993.
[25]
F. Ito, T. Hiroyasu, M. Miki, and H. Yokouchi, “Discussion of offspring generation method for interactive genetic algorithms with consideration of multimodal preference,” in Proceedings of the 7th International Conference on Simulated Evolution and Learning, vol. 5361, pp. 349–359, 2008.
[26]
M. E. J. Newman and M. Girvan, “Finding and evaluating community structure in networks,” Physical Review E, vol. 69, no. 2, Article ID 026113, pp. 1–15, 2004.
[27]
I. Derényi, G. Palla, and T. Vicsek, “Clique percolation in random networks,” Physical Review Letters, vol. 94, no. 16, Article ID 160202, 2005.
[28]
R. Tibshirani, G. Walther, and T. Hastie, “Estimating the number of clusters in a data set via the gap statistic,” Journal of the Royal Statistical Society B, vol. 63, no. 2, pp. 411–423, 2001.
[29]
J. Handl and J. Knowles, “Multiobjective clustering with automatic determination of the number of clusters,” Tech. Rep. COMPSYSBIO-2004-02, UMIST, Manchester, UK, 2004.
[30]
P. J. Rousseeuw, “Silhouettes: a graphical aid to the interpretation and validation of cluster analysis,” Journal of Computational and Applied Mathematics, vol. 20, pp. 53–65, 1987.
[31]
A. Hotho, A. Maedche, and S. Staab, “Ontology-based text document clustering,” Künstliche Intelligenz, vol. 4, pp. 1–13, 2002.
[32]
T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, “An efficient k-means clustering algorithms: analysis and implementation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881–892, 2002.
[33]
I. T. Jolliffe, Principal Component Analysis, Springer, 2nd edition, 2002.
[34]
T. Hiroyasu, M. Miki, M. Sano, H. Shimosaka, S. Tsutsui, and J. Dongarra, “Distributed probabilistic model-building genetic algorithm,” in Genetic and Evolutionary Computation—GECCO, vol. 2723 of Lecture Notes in Computer Science, pp. 1015–1028, Springer, 2003.
[35]
M. Takahashi and H. Kita, “A crossover operator using independent component analysis for real-coded genetic algorithms,” in Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 643–649, May 2001.
[36]
M. D. Fairchild, Color Appearance Models, Wiley-IS & T, Chichester, UK, 2nd edition, 2005.
