LayerFolding : Discovering Creative Links in Word Association Networks

Show full item record



Permalink

http://hdl.handle.net/10138/163216

Citation

Xiao , P & Toivonen , H T T 2016 , LayerFolding : Discovering Creative Links in Word Association Networks . in SAC '16 Proceedings of the 31st Annual ACM Symposium on Applied Computing . ACM, Association for Computing Machinery , New York, NY , pp. 894-897 , ACM Symposium on Applied Computing , Pisa , Italy , 04/04/2016 . https://doi.org/10.1145/2851613.2851883

Title: LayerFolding : Discovering Creative Links in Word Association Networks
Author: Xiao, Ping; Toivonen, Hannu Tauno Tapani
Contributor: University of Helsinki, Department of Computer Science
University of Helsinki, Department of Computer Science
Publisher: ACM, Association for Computing Machinery
Date: 2016-04-04
Language: eng
Number of pages: 4
Belongs to series: SAC '16 Proceedings of the 31st Annual ACM Symposium on Applied Computing
ISBN: 978-1-4503-3739-7
URI: http://hdl.handle.net/10138/163216
Abstract: A frequent challenge in creative tasks such as advertising is finding novel and concrete representations of abstract concepts. We cast this problem as finding, in word association networks, the relevant indirect associations of a given node. We propose a novel approach, LayerFolding, which selects nodes at increasing distances from the given node, according to their relatedness to it. The relatedness is calculated based on the shortest paths that are potentially coherent. In a test against a small set of visual representations of abstract concepts found in real advertisements, LayerFolding provides a 79\% recall, and outperforms other two popular semantic relatedness measures.
Subject: 113 Computer and information sciences
Rights:


Files in this item

Total number of downloads: Loading...

Files Size Format View
LayerFolding.pdf 423.9Kb PDF View/Open

This item appears in the following Collection(s)

Show full item record