Feature Selection Using Maximum Feature Tree Embedded with Mutual Information and Coefficient of Variation for Bird Sound Classification

Algorithm 2

BMFT.

	Name: BMFT (building max feature tree).
	Input: Correlation coefficient matrix #n is the number of features.
	Step:(1)Initialize root .(2)Set the elements on the main diagonal as −1. # set the value as −1 on the main diagonal to eliminate the influence from the feature itself.(3)whiledoSince is a Strongly Connected Graph, and records the adjacency relationship of the elements in , there are +1 elements in including the initial node. (4) D records the correlation coefficients of the neighboring nodes of the nodes in T (D is a column vector mapped from T to ) (5) The nodes that have been visited are recorded in T. This operation is equivalent to deleting the accessed data in D. (6) #Find the maximum value of all nodes adjacent to and record the row index.(7) records the adjacency relationship, for example, and are adjacent nodes (8)end while(9)return T
	Output: Maximum feature tree T.