Patent ID: 11966807
Assignee: NANJING UNIVERSITY OF INFORMATION SCIENCE AND TECHNOLOGY
Field: Computer technology (Electrical engineering)
Classification: CPC G  Y | IPC G

Claim 6:
7. The multi-tag concurrent identification method for a query tree based on feature groups according to claim 1, wherein in the step 2, specific steps of the group query generation method comprise:
step 2.21: initializing a group query set Qini and a K-dimensional vector space SK={0, 1}K, and vector lengths in the vector space are both K, Qini is an empty set in the initial state;
step 2.22: randomly selecting a vector a0 from SK;
step 2.23: selecting a vector a1 from SK to make a Hamming distance between a1 and a0 as 1;
step 2.24: pressing a0 and a1 into the set Qini and removing them from SK at a same time;
step 2.25: judging whether a number of elements in the set Qini exceeds N at this time, wherein N=2K/K, if yes, ending a group query generation process and outputting Qout=Qini, Qout is a finally generated group query set; if not, a skip is made to a step 2.26;
step 2.26: selecting a vector b0 from SK to make Hamming distances between each vector in the set Qini and b0 greater than or equal to 3, and then a skip is made to a step 2.27;
step 2.27: selecting a vector b1 from SK to make a Hamming distance between b1 and b0 equal to 1; and
step 2.28: pressing b0 and b1 into the set Qini and removing them from SK at a same time, and a skip is made to the step 2.25.