Data Visualization pp 407-421 | Cite as

# Visual Interaction

## Abstract

Many real world problems can be described as complex optimization problems. Some of them can be easily formalized and are amenable to an automated solution using some (usually heuristic) optimization algorithm. Other complex problems can not be solved satisfactory by automated algorithms. The reason is that the problems and the corresponding optimization goals can either not be fully formalized or that they vary depending on the user and the task at hand. In both cases, there is no chance to obtain a fully automatic solution of the problem. The only possibility is to make the user an integral part of the process. In this article, we therefore propose an interactive optimization system based on visualization techniques to guide the optimization process of heuristic optimization algorithms. To show the usefulness of our ideas, we provide two example applications: First, we apply the idea in the framework of similarity search in multimedia databases. Since it is difficult to specify the search task, we use visualization techniques to allow an interactive specification. As basis for the automated optimization we use a genetic algorithm. Instead of having an a-priori fully-specified fitness function, however, we let the user interactively determine the fitness of intermediate results based on visualizations of the data. In this way, an optimization with user-dependent and changing optimization goals is possible. The second example is a typical complex optimization problem — the time tabling problem. In most instantiations of the problem, it is not possible to completely specify all constraints, especially the potentially very large number of dependencies and soft constraints. In this application example, we also use visualization techniques in combination with automated optimization to improve the obtained solutions.

### Keywords

Egypt Allo## Preview

Unable to display preview. Download preview PDF.

### References

- Aarts, E. and Korts, J. (1989).
*Simulated Annealing and Boltzmann**Machines*. Wiley.MATHGoogle Scholar - Anderson, D., Anderson, E., Lesh, N., Marks, J., Mirtich, B., Ratajczak, D., and Ryall, K. (2000). Human-guided simple search.
*Conference Proc. of AAAI*, pages 209–216. http://www.merl.com/papers/TR2000-16/.Google Scholar - Ashley, J., Flickner, M., Hafner, J. L., Lee, D., Niblack, W., and Petkovic, D. (1995). The query by image content (QBIC) system. In
*Proc. of the 1995 ACM SIGMOD*, page 475. ACM Press.CrossRefGoogle Scholar - Bartak, R. (1999). Constraint programming: In pursuit of the holy grail.
*Proc. of WDS99 (invited lecture)*.Google Scholar - Böhm, K., Stojanovic, A., and Weber, R. (2001). Implementing relevance feedback techniques for large image collections efficiently.
*Multimedia Information Systems*, pages 113–122.Google Scholar - Burke, E., MacCarthy, B., Petrovic, S., and Qu, R. (2000). Structured cases in CBR: Re-using and adapting cases for timetabling problems.
*Knowledge-Based Systems*, 13:159–165.CrossRefGoogle Scholar - Burke, E. K., Elliman, D. G., Ford, P. H., and Weare, R. F. (1995). Examination timetabling in british universities — A survey. In
*Int. Conference on the Practice and Theory of Automated Timetabling ICPTAT’95, Edinburgh*, UK, pages 423–434.Google Scholar - Cinque, L., Levialdi, S., Olsen, K. A., and Pellicanò, A. (1999). Color-based image retrieval using spatial-chromatic histograms. In
*Proc. of the IEEE International Conference on Multimedia Computing and Systems*, volume II, pages 969–973. IEEE CS Press.CrossRefGoogle Scholar - Colorni, A., Dorigo, M., and Maniezzo, V. (1990). Genetic algorithms and highly constrained problems: The time-table case.
*Proc. Int. Workshop on Parallel Problem Solving from Nature, LNCS 496, Springer*, pages 55–59.Google Scholar - Corbis (2000). http://www.corbis.com.
- Goldberg, D. (1989).
*Genetic Algorithms in Search, Optimization and Machine Learning*. Addision-Wesley.MATHGoogle Scholar - Hinneburg, A., Aggarwal, C. C, and Keim, D. A. (2000). What is the nearest neighbor in high dimensional spaces? In
*VLDB 2000, Proc. of 26th International Conference on Very Large Data Bases, 2000, Cairo, Egypt*, pages 506–515. Morgan Kaufmann.Google Scholar - Hinneburg, A., Wawryniuk, M., and Keim, D. A. (1999). HD-Eye: Visual Mining of High-Dimensional Data.
*Computer Graphics & Applications Journal*, 19(5):22–31.CrossRefGoogle Scholar - Inc., B. S. (2000). Diggit! http://www.diggit.com.Google Scholar
- Keim, D. A. (2000). An introduction to information visualization techniques for exploring large databases. In Tutorial Notes of the IEEE Int.
*Conference on Visualization*. IEEE CS Press.Google Scholar - Lesh, N., Marks, J., and Patrignani, M. (2000). Interactive partitioning.
*Proc. of the conference on Graph Drawing.*Google Scholar - Löwe, J. (2000). VisTime: Visual Interactive Timetabling (in German), Master Thesis, University of Halle, Germany.Google Scholar
- Melício, F., Caldeira, P., and Rosa, A. (2000). Solving the timetabling problem by simulated annealing,
*in Enterprise Information Systems, Kluwer Academic Publisher*, pages 171–178.Google Scholar - Rojas, R. (1996).
*Neural Networks A Systematic Introduction*. Springer,Berlin.MATHGoogle Scholar - Rui, Y., Huang, T., Ortega, M., and Mehrotra, S. (1998). Relevance feedback: A power tool in interactive content-based image retrieval.
*IEEE Transactions on Circ. Sys. Video Tech.*Google Scholar - Seidl, T. and Kriegel, H.-P. (1997). Efficient user-adaptable similarity search in large multimedia databases. In
*Proc. of the 23rd VLDB-Conference*, Athen.Google Scholar - Sims, K. (1993). Interactive evolution of equations for procedural models.
*The Visual Computer*, 9:466–476CrossRefGoogle Scholar