Title page for etd-0907112-232124


[Back to Results | New Search]

URN etd-0907112-232124
Author Tzu-Yuan Lin
Author's Email Address No Public.
Statistics This thesis had been viewed 5357 times. Download 0 times.
Department Computer Science and Engineering
Year 2011
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Continuous Space Pattern Reduction Enhanced Metaheuristics for Clustering
Date of Defense 2012-07-27
Page Count 59
Keyword
  • Pattern reduction over continuous space
  • clustering
  • metaheuristics
  • Abstract The pattern reduction (PR) algorithm we proposed previously, which works by eliminating patterns that are unlikely to change their membership during the convergence process, is obviously one of the most efficient methods for reducing the computation time of clustering algorithms. However, it is limited to problems with solutions that can be binary or integer encoded, such as combinatorial optimization problems. As such, this study is aimed at developing a new pattern reduction algorithm, called pattern reduction over continuous space, to get rid of this limitation. Like the PR, the proposed algorithm consists of two operators: detection and compression. Unlike the PR, the detection operator is divided into two steps. The first step is aimed at finding out subsolutions that can be considered as the candidate subsolutions for compression. The second step is performed to ensure that the candidate subsolutions have reached the final state so that any further computation is eventually a waste and thus can be compressed. To evaluate the performance of the proposed algorithm, we apply it to metaheuristics for clustering.
    Advisory Committee
  • Chung-Nan Lee - chair
  • Tzung-Pei Hong - co-chair
  • Chun-Wei Tsai - co-chair
  • Ming-Chao Chiang - advisor
  • Files
  • etd-0907112-232124.pdf
  • Indicate in-campus at 99 year and off-campus access at 99 year.
    Date of Submission 2012-09-07

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys