Domain Bridging Associations Support Creativity
Inhaltsverzeichnis
Reference
Tobias Koetter, Kilian Thiel and Michael Berthold: Domain Bridging Associations Support Creativity. In: Computational Creativity 2010 ICCC 2010. 200-204.
DOI
Abstract
This paper proposes a new approach to support creativity through assisting the discovery of unexpected associations across differ- ent domains. This is achieved by integrating information from heteroge- neous domains into a single network, enabling the interactive discovery of links across the corresponding information resources. We discuss three different pattern of domain crossing associations in this context.
Extended Abstract
Bibtex
@inproceedings{
author = {Tobias Koetter, Kilian Thiel and Michael Berthold},
title = {Domain Bridging Associations Support Creativity},
editor = {Dan Ventura, Alison Pease, Rafael P ́erez y P ́erez, Graeme Ritchie and Tony Veale},
booktitle = {Proceedings of the First International Conference on Computational Creativity},
series = {ICCC2010},
year = {2010},
month = {January},
location = {Lisbon, Portugal},
pages = {200-204},
url = {http://computationalcreativity.net/iccc2010/papers/kotter-thiel-berthold.pdf, http://de.evo-art.org/index.php?title=Domain_Bridging_Associations_Support_Creativity },
publisher = {International Association for Computational Creativity},
keywords = {computational, creativity},
}
Used References
1. R.W. Weisberg. Creativity and knowledge: A challenge to theories. Handbook of creativity, 226:251, 1999.
2. Arthur Koestler. The Act of Creation. Macmillan, 1964.
3. Michael R. Berthold, Fabian Dill, Tobias K ̈otter, and Kilian Thiel. Supporting creativity: Towards associative discovery of new insights. In Proceedings of PAKDD 2008, 2008.
4. John M. Dienhart. A linguistic look at riddles. Journal of Pragmatics, 31(1):95 – 125, 1999.
5. Ulrik Brandes. A faster algorithm for betweenness centrality. Journal of Mathemat- ical Sociology, 25:163–177, 2001.
6. Joseph B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7, 1956.
7. Stephen P. Borgatti and Martin G. Everett. Two algorithms for computing regular equivalence. Social Networks, 15(4):361–376, December 1993.
Links
Full Text
http://computationalcreativity.net/iccc2010/papers/kotter-thiel-berthold.pdf
