Loading...
Search for: translation--languages
0.006 seconds
Total 24 records

    Cellular learning automata-based color image segmentation using adaptive chains

    , Article 2009 14th International CSI Computer Conference, CSICC 2009, 20 October 2009 through 21 October 2009, Tehran ; 2009 , Pages 452-457 ; 9781424442621 (ISBN) Abin, A. A ; Fotouhi, M ; Kasaei, S ; Sharif University of Technology
    Abstract
    This paper presents a new segmentation method for color images. It relies on soft and hard segmentation processes. In the soft segmentation process, a cellular learning automata analyzes the input image and closes together the pixels that are enclosed in each region to generate a soft segmented image. Adjacency and texture information are encountered in the soft segmentation stage. Soft segmented image is then fed to the hard segmentation process to generate the final segmentation result. As the proposed method is based on CLA it can adapt to its environment after some iterations. This adaptive behavior leads to a semi content-based segmentation process that performs well even in presence of... 

    Effective page recommendation algorithms based on distributed learning automata

    , Article 4th International Multi-Conference on Computing in the Global Information Technology, ICCGI 2009, 23 August 2009 through 29 August 2009, Cannes, La Bocca ; 2009 , Pages 41-46 ; 9780769537511 (ISBN) Forsati, R ; Rahbar, A ; Mahdavi, M ; Sharif University of Technology
    Abstract
    Different efforts have been done to address the problem of information overload on the Internet. Recommender systems aim at directing users through this information space, toward the resources that best meet their needs and interests by extracting knowledge from the previous users' interactions. In this paper, we propose an algorithm to solve the web page recommendation problem. In our algorithm, we use distributed learning automata to learn the behavior of previous users' and recommend pages to the current user based on learned pattern. Our experiments on real data set show that the proposed algorithm performs better than the other algorithms that we compared to and, at the same time, it is... 

    Adaptive limited fractional guard channel algorithms: A learning automata approach

    , Article International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems ; Volume 17, Issue 6 , 2009 , Pages 881-913 ; 02184885 (ISSN) Beigy, H ; Meybodi, M. R ; Sharif University of Technology
    Abstract
    In this paper, two learning automata based adaptive limited fractional guard channel algorithms for cellular mobile networks are proposed. These algorithms try to minimize the blocking probability of new calls subject to the constraint on the dropping probability of the handoff calls. To evaluate the proposed algorithms, computer simulations are conducted. The simulation results show that the performance of the proposed algorithms are close to the performance of the limited fractional guard channel algorithm for which prior knowledge about traffic parameters are needed. The simulation results also show that the proposed algorithms outperforms the recently introduced dynamic guard channel... 

    A learning automata-based algorithm for determination of the number of hidden units for three-layer neural networks

    , Article International Journal of Systems Science ; Volume 40, Issue 1 , 2009 , Pages 101-118 ; 00207721 (ISSN) Beigy, H ; Meybodi, M. R ; Sharif University of Technology
    Abstract
    There is no method to determine the optimal topology for multi-layer neural networks for a given problem. Usually the designer selects a topology for the network and then trains it. Since determination of the optimal topology of neural networks belongs to class of NP-hard problems, most of the existing algorithms for determination of the topology are approximate. These algorithms could be classified into four main groups: pruning algorithms, constructive algorithms, hybrid algorithms and evolutionary algorithms. These algorithms can produce near optimal solutions. Most of these algorithms use hill-climbing method and may be stuck at local minima. In this article, we first introduce a...