Detecting Multielement Algorithmically Generated Domain Names Based on Adaptive Embedding Model

Algorithm 1

	Step 1: Domain D is segmented to obtain multiple parse tree: , where each tree contains x elements: .
	Step 2: Calculate the average priority of the elements in each tree and take the result with the smallest average priority value: , where , is the value of the element priority.
	Step 3: The above steps lead to a set of parse trees with the same priority: , calculate the average element entropy value of each parse tree, and take the result with the highest entropy value: , where is the cooccurrence probability of two elements obtained from the statistical samples.
	Step 4: After obtaining the result of the maximum entropy , if there are multiple results with the same entropy value, the average probability of occurrence of the elements in the domain name is further calculated and the maximum result is taken: , where , denotes the probability of occurrence of the elements obtained from the statistical samples.