Skill characterization based on betweenness

Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference

Volumn , Issue , 2009, Pages 1497-1504

  Şimşek, Özgür ^a,b   Barto, Andrew G ^a  

^a University of Massachusetts Amherst   (United States)

^b MAX PLANCK INSTITUTE FOR HUMAN DEVELOPMENT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AGENT INTERACTION; BETWEENNESS; DISCOVERY ALGORITHM; GRAPHICAL REPRESENTATIONS; INTERACTION GRAPHS;

ARTIFICIAL INTELLIGENCE;

EID: 78651097494     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. L. C. Freeman. A set of measures of centrality based upon betweenness. Sociometry, 40:35-41, 1977.
2. L. C. Freeman. Centrality in social networks: Conceptual clarification. Social Networks, 1:215-239, 1979.
3. A. McGovern and A. G. Barto. Automatic discovery of subgoals in reinforcement learning using diverse density. In Proceedings of the Eighteenth International Conference on Machine Learning, 2001.
4. M. Stolle and D. Precup. Learning options in reinforcement learning. Lecture Notes in Computer Science, 2371:212-223, 2002.
5. M. Stolle. Automated discovery of options in reinforcement learning. Master's thesis, McGill University, 2004.
6. I. Menache, S. Mannor, and N. Shimkin. Q-Cut - Dynamic discovery of sub-goals in reinforcement learning. In Proceedings of the Thirteenth European Conference on Machine Learning, 2002.
7. Ö. Şimşek and A. G. Barto. Using relative novelty to identify useful temporal abstractions in reinforcement learning. In Proceedings of the Twenty-First International Conference on Machine Learning, 2004.
8. S. Mannor, I. Menache, A. Hoze, and U. Klein. Dynamic abstraction in reinforcement learning via clustering. In Proceedings of the Twenty-First International Conference on Machine Learning, 2004.
9. Ö. Şimşek, A. P.Wolfe, and A. G. Barto. Identifying useful subgoals in reinforcement learning by local graph partitioning. In Proceedings of the Twenty-Second International Conference on Machine Learning, 2005.
10. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 25(2):163-177, 2001. (Pubitemid 33398479)
11. T. G. Dietterich. Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research, 13:227-303, 2000. (Pubitemid 33682087)
12. A. G. Barto, S. Singh, and N. Chentanez. Intrinsically motivated learning of hierarchical collections of skills. In Proceedings of the Third International Conference on Developmental Learning, 2004.
13. S. Singh, A. G. Barto, and N. Chentanez. Intrinsically motivated reinforcement learning. In Advances in Neural Information Processing Systems, 2005.
14. R. S. Sutton, D. Precup, and S. P. Singh. Between MDPs and Semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112(1-2):181-211, 1999. (Pubitemid 32079890)
15. D. Precup. Temporal abstraction in reinforcement learning. PhD thesis, University of Massachusetts Amherst, 2000.
16. A. McGovern, R. S. Sutton, and A. H. Fagg. Roles of macro-actions in accelerating reinforcement learning. In Grace Hopper Celebration of Women in Computing, 1997.
17. S. Amarel. On representations of problems of reasoning about actions. In Machine Intelligence 3, pages 131-171. Edinburgh University Press, 1968.