DocumentCode :
3018301
Title :
Information theoretic methods for learning generative models for relational structures
Author :
Hancock, Edwin R. ; Han, Lin ; Wilson, Richard C.
Author_Institution :
Dept. of Comput. Sci., Univ. of York, York, UK
fYear :
2011
fDate :
6-13 Nov. 2011
Firstpage :
692
Lastpage :
693
Abstract :
This talk focusses on work aimed at developing a principled probabilistic and information theoretic framework for learning generative models of relational structure. The aim is develop methods that can be used to learn models that can capture the variability present in graph-structures used to represent shapes or arrangements of shape-primitives in images. Here nodes represent the parts of shape-primitives representing an object, and the the edges represent the relationships which prevail between the parts. The aim is to learn the relationships from examples. Of course such structures can exhibit variability in the arrangement of parts, and the data used in training can be subject to uncertainty. It hence represents a demanding learning problem, for which there is limited available methodology.
Keywords :
graph theory; learning (artificial intelligence); probability; relational databases; generative model learning; graph-structures; information theoretic methods; principled probabilistic framework; relational structures; shape-primitives; Complexity theory; Computational modeling; Conferences; Entropy; Laplace equations; Probabilistic logic; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision Workshops (ICCV Workshops), 2011 IEEE International Conference on
Conference_Location :
Barcelona
Print_ISBN :
978-1-4673-0062-9
Type :
conf
DOI :
10.1109/ICCVW.2011.6130312
Filename :
6130312
Link To Document :
بازگشت