Trace selection for interactive evolutionary algorithms
Pages 327 - 334
Abstract
This paper presents a selection method for use with interactive evolutionary algorithms and sensitivity analysis in spatiotemporal domains. Recent work in the field has made it possible to give feedback to an interactive evolutionary system with a finer granularity than the typical wholesale selection method. This recent development allows the user to drive the evolutionary search in a more precise way by allowing him to select a part of a phenotype to indicate fitness. The method has potential to alleviate the human fatigue bottleneck, so it seems ideally suited for use in domains that vary in both space and time, such as character motion or cloth simulation where evaluation times are long. However no evolutionary interface has been developed yet which will allow for selecting parts of time-varying phenotypes. We present a selection interface that should be fast and intuitive enough to minimize the interaction bottleneck in evolutionary algorithms that receive feedback at the phenotype part level.
References
[1]
Autodesk. Autodesk Maya. computer program, 2012.
[2]
P. Dragicevic, G. Ramos, J. Bibliowitcz, D. Nowrouzezahrai, R. Balakrishnan, and K. Singh. Video browsing by direct manipulation. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI '08, pages 237--246, New York, NY, USA, 2008. ACM.
[3]
J. Eisenmann, M. Lewis, and R. Parent. Inverse Mapping with Sensitivity Analysis for Partial Selection in Interactive Evolution. In P. Machado and J. McDermott, editors, Lecture Notes in Computer Science. EvoStar, Springer Verlag, Apr. 2013.
[4]
B. W. Franks, M. Herrlich, T. Karrer, M. Wittenhagen, R. S. Kroll, R. Malaka, and J. Borchers. Dragimation: direct manipulation keyframe timing for performance-based animation. In Proceedings of Graphics Interface 2012, GI '12, pages 101--108, Toronto, Ont., Canada, Canada, 2012. Canadian Information Processing Society.
[5]
H. Hochheiser and B. Shneiderman. Dynamic query tools for time series data sets: timebox widgets for interactive exploration. Information Visualization, 3(1):1--18, Mar. 2004.
[6]
J.-H. Lee, H.-S. Kim, and S.-B. Cho. Accelerating evolution by direct manipulation for interactive fashion design. In Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001, pages 343--347. IEEE, 2001.
[7]
J. P. Lewis and Anjyo. Direct Manipulation Blendshapes. Computer Graphics and Applications, IEEE, 30(4):42--50, July 2010.
[8]
L. Li, H.-H. Hsieh, and H.-W. Shen. Illustrative Streamline Placement and Visualization. In Visualization Symposium, 2008. PacificVIS. IEEE Pacific, pages 79--86. IEEE, Mar. 2008.
[9]
J. Lin, E. Keogh, S. Lonardi, J. P. Lankford, and D. M. Nystrom. Visually mining and monitoring massive time series. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '04, pages 460--469, New York, NY, USA, 2004. ACM.
[10]
J. Min, Y. L. Chen, and J. Chai. Interactive generation of human animation with deformable motion models. ACM Trans. Graph., 29(1), Dec. 2009.
[11]
M. Müller. Information Retrieval for Music and Motion. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2007.
[12]
A. Saltelli. Global sensitivity analysis: the primer. John Wiley, 2008.
[13]
D. F. Swayne, D. T. Lang, A. Buja, and D. Cook. GGobi: evolving from XGobi into an extensible framework for interactive data visualization. Comput. Stat. Data Anal., 43(4):423--444, Aug. 2003.
[14]
H. Takagi. Interactive evolutionary computation: fusion of the capabilities of EC optimization and human evaluation. Proceedings of the IEEE, 89(9):1275--1296, Sept. 2001.
[15]
H. Takagi and K. Kishi. On-line knowledge embedding for an interactive EC-based montage system. Knowledge-Based Intelligent Information Engineering Systems, 1999. Third International Conference, pages 280--283, Dec. 1999.
[16]
X. Tong, T.-Y. Lee, and H.-W. Shen. Salient time steps selection from large scale time-varying data sets with dynamic time warping. In Large Data Analysis and Visualization (LDAV), 2012 IEEE Symposium on, pages 49--56. IEEE, Oct. 2012.
[17]
M. Weber, M. Alexa, and W. Müller. Visualizing Time-Series on Spirals. In Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01), INFOVIS '01, pages 7+, Washington, DC, USA, 2001. IEEE Computer Society.
[18]
M. Whitelaw. Metacreation: art and artificial life. MIT Press, Apr. 2004.
[19]
M. Wolter, B. Hentschel, I. Tedjo-Palczynski, and T. Kuhlen. A direct manipulation interface for time navigation in scientific visualizations. In 3D User Interfaces, 2009. 3DUI 2009. IEEE Symposium on, pages 11--18. IEEE, Mar. 2009.
[20]
J. Woodring and H.-W. Shen. Multiscale Time Activity Data Exploration via Temporal Clustering Visualization Spreadsheet. Visualization and Computer Graphics, IEEE Transactions on, 15(1):123--137, Jan. 2009.
Index Terms
- Trace selection for interactive evolutionary algorithms
Recommendations
Unplugging Evolutionary Algorithms: an experiment on human-algorithmic creativity
Understanding and emulating human creativity is a key factor when developing computer based algorithms devoted to art. This paper presents a new evolutionary approach to art and creativity aimed at comprehending human principles and motivations, ...
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Fast non-elitist evolutionary algorithms with power-law ranking selection
GECCO '22: Proceedings of the Genetic and Evolutionary Computation ConferenceTheoretical evidence suggests that non-elitist evolutionary algorithms (EAs) with non-linear selection mechanisms can efficiently overcome broad classes of local optima where elitist EAs fail. However, the analysis assumes a weak selective pressure and ...
Comments
Information & Contributors
Information
Published In
July 2013
1672 pages
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 July 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '13
Sponsor:
GECCO '13: Genetic and Evolutionary Computation Conference
July 6 - 10, 2013
Amsterdam, The Netherlands
Acceptance Rates
GECCO '13 Paper Acceptance Rate 204 of 570 submissions, 36%;
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 123Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in