The compact classifier system: Motivation, analysis and first results

by Xavier Llorà, Kumara Sastry, and David E. Goldberg (2006). Proceedings of the Congress on Evolutionary Computation, 1, 596—603. Also as IlliGAL TR No 2005019. Link to the PDF. Abstract This paper presents an analysis of how maximally general and accurate rules can be evolved in a Pittsburgh-style classifier system. In order to be able to perform such an analysis we introduce a simple bare-bones Pittsburgh-style classifier systems—the compact classifier system (CCS)—based on estimation of distribution algorithms. Using a common rule encoding schemes of Pittsburgh-style classifier systems, CCS mantains a dynamic set of probability vectors that compactly describe a rule set. The compact genetic algorithm is used to evolve each of the initially perturbated probability vectors. Results show how CCS is able to evolve in a compact, simple, and elegant manner rule sets composed by maximally general and accurate rules. The initial theoretical analysis and results also show that traditional encoding schemes used by Pittsburgh-style classifiers add an extra facet of diffiiculty. Such a bias plays a central role on the overall performance and scalability of CCS and other Pittsburgh-style systems using such encoding schemes. ...

Jul 20, 2005 · 1 min · 185 words · Xavier Llorà

Combating user fatigue in iGAs: Partial ordering, support vector machines, and synthetic fitness

by Llorà, X., Sastry, K., Goldberg, D.E., Gupta, A., Lakshmi, L. (2005). Published in the ACM Genetic and Evolutionary Computation Conference (GECCO 2005), ACM press, pp. 1363–1371. Also as IlliGAL TR No 2005009. Link to the PDF Abstract: One of the daunting challenges of interactive genetic algorithms (iGAs)—genetic algorithms in which fitness measure of a solution is provided by a human rather than by a fitness function, model, or computation—is user fatigue which leads to sub-optimal solutions. This paper proposes a method to combat user fatigue by augmenting user evaluations with a synthetic fitness function. The proposed method combines partial ordering concepts, notion of non-domination from multiobjective optimization, and support vector machines to synthesize a fitness model based on user evaluation. The proposed method is used in an iGA on a simple test problem and the results demonstrate that the method actively combats user fatigue by requiring 3–7 times less user evaluation when compared to a simple iGA. ...

Jul 19, 2005 · 1 min · 158 words · Xavier Llorà

Mining social networks in message boards

by Matsumura, N., Goldberg, D.E., Llorà, X. (2005). Published in the Symposium on Conversational Informatics for Supporting Social Intel ligence, The Society for the Study of Artificial Intelligence and the Simulation of Behavior Press, pp. 18–27. Also as IlliGAL TR No 2005001. More info. Abstract: In this paper, we first present an approach to extract social networks from message boards on the Internet. Then we show structural features of 3,000 social networks extracted from 3,000 message boards from 15 categories in Yahoo! Japan Message Boards to prove the relationships between the features and the categories. After we classify social networks into three types (interactive communication, distributed expertise communication and soapbox communication), we suggest an approach for mining social networks to identify the types of communication, the roles of individuals, and important ties, all of which can be used to redesign the means communication as well as understand the state of communication. ...

Apr 12, 2005 · 1 min · 151 words · Xavier Llorà