Solving weighted graph matching problem by modified microgenetic algorithm

Cheng Wen Liu; Kuo Chin Fan; Jorng Tzong Horng; Yuan Kai Wang

Solving weighted graph matching problem by modified microgenetic algorithm

Cheng Wen Liu
, Kuo Chin Fan
, Jorng Tzong Horng
, Yuan Kai Wang

資訊工程學系

研究成果: 雜誌貢獻 › 會議論文 › 同行評審

5 引文斯高帕斯（Scopus）

摘要

Microgenetic Algorithm(MGA) is Genetic Algorithm(GA) using a very small population size (population size < 20). The weighted graph matching problem (WGMP) receives tremendous attention in the field of pattern recognition recently. In this paper, a hybrid MGA with larger population is proposed to solved the weighted graph matching problem. In our hybrid microgenetic algorithm, many modules, such as local search algorithm, biased initial population, a modified selection scheme, and a refining procedure, are embedded to improve the performance of the algorithm. Experimental results show that our method outperforms a well-known method, the Symmetric Polynomial Transform (SPT), on most instances of the weighted graph matching problems.

原文	???core.languages.en_GB???
頁（從 - 到）	638-643
頁數	6
期刊	Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
卷	1
出版狀態	已出版 - 1995
事件	Proceedings of the 1995 IEEE International Conference on Systems, Man and Cybernetics. Part 2 (of 5) - Vancouver, BC, Can 持續時間: 22 10月 1995 → 25 10月 1995

引用此

@article{7bdb0b6f6bb6402abd0e91cbab092d9d,

title = "Solving weighted graph matching problem by modified microgenetic algorithm",

abstract = "Microgenetic Algorithm(MGA) is Genetic Algorithm(GA) using a very small population size (population size < 20). The weighted graph matching problem (WGMP) receives tremendous attention in the field of pattern recognition recently. In this paper, a hybrid MGA with larger population is proposed to solved the weighted graph matching problem. In our hybrid microgenetic algorithm, many modules, such as local search algorithm, biased initial population, a modified selection scheme, and a refining procedure, are embedded to improve the performance of the algorithm. Experimental results show that our method outperforms a well-known method, the Symmetric Polynomial Transform (SPT), on most instances of the weighted graph matching problems.",

author = "Liu, \{Cheng Wen\} and Fan, \{Kuo Chin\} and Horng, \{Jorng Tzong\} and Wang, \{Yuan Kai\}",

year = "1995",

language = "???core.languages.en\_GB???",

volume = "1",

pages = "638--643",

journal = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",

issn = "0884-3627",

note = "Proceedings of the 1995 IEEE International Conference on Systems, Man and Cybernetics. Part 2 (of 5) ; Conference date: 22-10-1995 Through 25-10-1995",

}

TY - JOUR

T1 - Solving weighted graph matching problem by modified microgenetic algorithm

AU - Liu, Cheng Wen

AU - Fan, Kuo Chin

AU - Horng, Jorng Tzong

AU - Wang, Yuan Kai

PY - 1995

Y1 - 1995

N2 - Microgenetic Algorithm(MGA) is Genetic Algorithm(GA) using a very small population size (population size < 20). The weighted graph matching problem (WGMP) receives tremendous attention in the field of pattern recognition recently. In this paper, a hybrid MGA with larger population is proposed to solved the weighted graph matching problem. In our hybrid microgenetic algorithm, many modules, such as local search algorithm, biased initial population, a modified selection scheme, and a refining procedure, are embedded to improve the performance of the algorithm. Experimental results show that our method outperforms a well-known method, the Symmetric Polynomial Transform (SPT), on most instances of the weighted graph matching problems.

AB - Microgenetic Algorithm(MGA) is Genetic Algorithm(GA) using a very small population size (population size < 20). The weighted graph matching problem (WGMP) receives tremendous attention in the field of pattern recognition recently. In this paper, a hybrid MGA with larger population is proposed to solved the weighted graph matching problem. In our hybrid microgenetic algorithm, many modules, such as local search algorithm, biased initial population, a modified selection scheme, and a refining procedure, are embedded to improve the performance of the algorithm. Experimental results show that our method outperforms a well-known method, the Symmetric Polynomial Transform (SPT), on most instances of the weighted graph matching problems.

UR - https://www.scopus.com/pages/publications/0029487603

M3 - 會議論文

AN - SCOPUS:0029487603

SN - 0884-3627

VL - 1

SP - 638

EP - 643

JO - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

JF - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

T2 - Proceedings of the 1995 IEEE International Conference on Systems, Man and Cybernetics. Part 2 (of 5)

Y2 - 22 October 1995 through 25 October 1995

ER -

Solving weighted graph matching problem by modified microgenetic algorithm

摘要

指紋

引用此