Human-Centered Analysis and Visualization Tools for the Blogosphere

by Xavier Llorà, Noriko Imafuji Yasui, Michael Welge, David E. Goldberg (in press, 2007). To apper in the Proceedings of the Digital Humanities 2007 Conference.Also as IlliGAL TR No. 2006023. Link to the PDF. Abstract Blogging has become a new and disruptive communication medium. Blogs have changed the way people and organizations express, interact, and—quite unforeseen—exercise influence. The digital nature of the blog media provides access to an always-expanding corpus of information. It would take more than a lifetime to read all the available blogs necessary to answer questions such as what were the more relevant plots suggested or what key concepts were managed by bloggers in their ideas. However, human-centered analysis and visualization techniques may help users navigate such enormous corpus. This paper presents human-centered analysis and visualization techniques for supporting innovation and creativity can help to identify relevant post portions and to visualize concept relations in the blogosphere. ...

Nov 29, 2006 · 1 min · 150 words · Xavier Llorà

Evolving emotional prosody

by Cecilia Ovesdotter Alm and Xavier Llorà (2006). Proceedings of the Ninth International Conference on Spoken Language Processing (INTERSPEECH 2006), paper 1741. Also as IlliGAL TR No 2006018. Link to the PDF. Abstract Emotion is expressed by prosodic cues, and this study uses the active interactive Genetic Algorithm to search a wide space for sad and angry parameters of intensity, F0, and duration in perceptual resynthesis experiments with users. This method avoids large recorded databases and is flexible for exploring prosodic emotion parameters. Solutions from multiple runs are analyzed graphically and statistically. Average results indicate parameter evolution by emotion, and appear best forsad speech. Solutions are quite successfully classified by CART, with duration as main predictor. ...

Sep 17, 2006 · 1 min · 116 words · Xavier Llorà

Analyzing active interactive genetic algorithms using visual analytics

by Xavier Llorà, Kumara Sastry , Francesc Alías, David E. Goldberg, and Michael Welge (2006). Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 1417–1418, ACM press. Also as IlliGAL TR No 2006004. Link to the PDF. Abstract This paper build on active interactive genetic algorithms and introduces visual-analytic techniques to aggregate, summarize, and visualize the information generated during interactive evolutionary processes. Special visualizations of the user-provided partial ordering of solutions, the synthetic fitness surrogates induced, and the model of user preferences were prepared. The visual-analytic techniques proposed point out potential pitfalls, strengths, and possible improvements in a non-trivial case study where the hierarchical tournament selection scheme of an active interactive genetic algorithm is replaced by an equivalent incremental selection scheme. Visual analytics provided an intuitive reasoning environment that unveiled important properties that greatly affect the performance of active interactive genetic algorithms that could not have been easily reveled otherwise. ...

Jul 7, 2006 · 1 min · 153 words · Xavier Llorà

Fast rule matching for Learning Classifier Systems via vector instructions

by Xavier Llorà and Kumara Sastry (2006, accepted). Proceedings of the ACM Genetic and Evolutionary Computation Conference (GECCO 2006), pp. 1513–1520, ACM press. Also as IlliGAL TR No 2006001. Link to the PDF. Abstract Over the last ten years XCS has become a de facto standard for Michigan-style learning classifier systems (LCS). Since the initial CS-1 work conceived by Holland, classifiers (rules) have widely used a ternary condition alphabet {0,1,#} for binary input problems. Most of the freely available implementations of this ternary alphabet in XCS rely on character-based encodings—easy to implement, not memory efficient, and expensive to compute. Profiling of freely available XCS implementations shows that most of their execution time is spent determining whether a rule is match or not, posing a serious thread to XCS scalability. In the last decade, multimedia and scientific applications have pushed CPU manufactures to include native support for vector instruction sets. This paper presents how to implement efficient condition encoding and fast rule matching strategies using vector instructions. The paper elaborates on Altivec (PowerPC G4, G5) and SSE2 (Intel P4/Xeon and AMD Opteron) instruction sets producing speedups of XCS matching process beyond ninety times. Moreover, such a vectorized matching code will allow to easily scale beyond tens of thousands of conditions in a reasonable time. The proposed fast matching scheme also fits in any other LCS other than XCS. ...

Jul 7, 2006 · 2 min · 227 words · Xavier Llorà

The χ-ary extended compact classifier system: Linkage learning in Pittsburgh LCS

by Xavier Llorà, Kumara Sastry, David E. Goldberg, and Luis de la Ossa (2006). To appear in the Proceedings of the International Workshop on Learning Classifier Systems (IWLCS 2006). Also as IlliGAL TR No 2006015. Link to the PDF. Abstract This paper proposes a competent Pittsburgh LCS that automatically mines important substructures of the underlying problems and takes problems that were intractable with first-generation Pittsburgh LCS and renders them tractable. Specifically, we propose a χ-ary extended compact classifier system (χeCCS) which uses (1) a competent genetic algorithm (GA) in the form of χ-ary extended compact genetic algorithm, and (2) a niching method in the form restricted tournament replacement, to evolve a set of maximally accurate and maximally general rules. The results clearly show that linkage exists in the multiplexer problem which needs to be accurately discovered and efficiently processed in order to solve the problem in tractable time. The results also show that in accordance with the facetwise models from GA theory, the number of function evaluations required by χeCCs to successfully evolve an optimal rule set scales exponentially with the number of address bits (building block size) and quadratically with the problem size. ...

Jul 7, 2006 · 1 min · 194 words · Xavier Llorà