Loading...
Search for:
automatic-discovery
0.004 seconds
BlogDisc: A system for automatic discovery and accumulation of persian blogs
, Article 2006 International Conference on Systems, Computing Sciences and Software Engineering, SCSS 2006, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2006, 4 December 2006 through 14 December 2006 ; 2007 , Pages 269-273 ; 9781402062636 (ISBN) ; Abolhassani, H ; Abbassi, Z ; Sharif University of Technology
2007
Abstract
One of the important elements of the new generation of the Web is the emergence of blogs. Currently a considerable number of users are creating content using blogs. Although Persian blogs have a short history, they have improved significantly during this short period. Because of fundamental differences between Persian and other languages, limited work has been done to analyze Persian blogs. In this work, a system named BlogDisc for automatic discovery and accumulation of Persian blogs is developed. This system uses content as well as link structure of the blogs. As an important part of this research, we propose an algorithm to recognize blogs that are not hosted on special blog hosts. © 2007...
Automatic discovery of subgoals in reinforcement learning using strongly connected components
, Article 15th International Conference on Neuro-Information Processing, ICONIP 2008, Auckland, 25 November 2008 through 28 November 2008 ; Volume 5506 LNCS, Issue PART 1 , 2009 , Pages 829-834 ; 03029743 (ISSN); 3642024890 (ISBN); 9783642024894 (ISBN) ; Beigy, H ; Asia Pacific Neural Network Assembly (APNNA); International Neural Network Society (INNS); IEEE Computational Intelligence Society; Japanese Neural Network Society (JNNS); European Neural Network Society (ENNS) ; Sharif University of Technology
2009
Abstract
The hierarchical structure of real-world problems has resulted in a focus on hierarchical frameworks in the reinforcement learning paradigm. Preparing mechanisms for automatic discovery of macro-actions has mainly concentrated on subgoal discovery methods. Among the proposed algorithms, those based on graph partitioning have achieved precise results. However, few methods have been shown to be successful both in performance and also efficiency in terms of time complexity of the algorithm. In this paper, we present a SCC-based subgoal discovery algorithm; a graph theoretic approach for automatic detection of subgoals in linear time. Meanwhile a parameter tuning method is proposed to find the...