遺傳類神經樹在衛星影像分類之研究

林宏樅

doi:10.6845/NCHU.2012.00358

3.238.118.78，Hello！

Close
Search Quick Search Advanced Search Publication Search	Personal Service Member Login Searching History Use Bonus Card SYMSKAN
Browse Browse by University of Graduate Thesis Browse by Pinyin of Graduate Thesis Browse by Conference Proceedings Topic Browse by Conference Proceedings Publisher Browse by Pinyin of Conference Proceedings Browse by eBook Category Browse by eBook Topic Browse by eBook Publisher
Customer Services Authorize Airiti Recommend a Journal

Search Symbol (Half-width)	Description of Search Symbols
Space	"AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " )	Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" ： " image process "
?	Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
*	Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )
AND、OR、NOT	Boolean logic combinations of key words is a skill used to expand or refine search parameters. (1) AND (1) AND: Refines search parameters (2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters

DOI stands for Digital Object Identifier （ D igital O bject I dentifier ） ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「http://dx.doi.org/」「 http://dx.doi.org/ 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: http://dx.doi.org/ 10.5297/ser.1201.002 。
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI Registration （ doi.airiti.com ）。

Data Source

Basic & Applied Sciences > Information Science
College of Electrical Engineering & Computer Science > Department of Computer Science and Engineering

Bibliography Management Tool

Related Links

Report an Issue

Purchase Single Articles

Download PDF

遺傳類神經樹在衛星影像分類之研究

On Genetic Neural Trees for Satellite Image Classification

林宏樅 , Masters　　Advisor：洪國寶　　

繁體中文 DOI： 10.6845/NCHU.2012.00358

決策樹；類神經樹；遺傳演算法；分類； Decision trees ； Neural trees ； Genetic algorithms ； Classification

Abstract │ Reference (28) │ Altmetrics

Abstract 〈TOP〉

Parallel Abstract 〈TOP〉

The neural trees (NTs) and their variants recently have been proposed. In a NT, each internal node contains a neural network. That is, the input samples can be classified in a NT by these neural networks. In general, the performance of NTs outperforms the decision trees (DTs). The reason is that DTs are only suitable to classify the samples in which the distribution of samples is linear. However, NTs can classify the samples in which the distribution of samples is nonlinear. In NTs, the neural network is designed by the back-propagation method. The disadvantage of the back-propagation method is that it can easily search for the local minimal solution. In this thesis, the genetic algorithm (GA) is proposed to replace the back-propagation method to design the neural network. Therefore, the proposed NT is called the genetic neural tree (GNT) in this thesis. Also, the growing method is proposed to design the GNT according to the recognition rate and computing complexity of GNT. Thus, the GNT is near-optimal.

Reference ( 28 ) 〈TOP〉

[1]J. R. Quinlann, “Induction of decision tree,” Mach. Learn. 1, pp. 81-106, 1986.
連結：
[5]W. Pedrycz and Z. A. Sosnowski, “Designing decision trees with the use of fuzzy granulation,” IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol. 30, no. 2, pp. 151-159, 2000.
連結：
[7]S. B. Gelfand, C. S. Ravishankar, and E. J. Delp, “An iterative growing and pruning algorithm for classification tree design,” IEEE Trans. Pattern Analysis and Machine Intell., vol. 13, no. 2, pp. 163-174, 1991.
連結：
[8]O. T. Yildiz and E. Alpaydin, “Omnivariate decision tree,” IEEE Trans. Neural Network, vol. 12, no. 6, pp. 1539–1546, 2001.
連結：
[9]H. Zhao, and S. Ram, “Constrained cascade generalization of decision trees,” IEEE Trans. Knowledgement and data Engineering, vol. 16, no. 6, pp. 727-739, 2004.
連結：

Altmetrics

〈TOP〉

E-mail ：

When an article is available to download, a notice will be sent to your mailbox address.

E-mail ：