A data processing system for object classification

Abstract

This invention provides a data processing system for object classification, comprising: a target geographic region, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps: obtaining a list of object types corresponding to the target geographic region; obtaining a list of object identifiers corresponding to the list of object types; obtaining a list of object quantities corresponding to the list of object types; and obtaining a list of object information corresponding to the list of object types based on the list of object identifiers and the object quantities. It is understood that this invention sets multiple object types, processes data collected by all devices capable of collecting object information within the target region, and records the object information, obtaining object identifiers and corresponding object characteristics within the target region, and further obtaining object identifiers and object quantities corresponding to object types, which helps improve the accuracy of object classification.

Description

Technical Field

[0001] This invention relates to the field of information retrieval and classification technology, and in particular to a data processing system for object classification. Background Technology

[0002] With the rapid development of the urban economy, the number of objects also increases. When the number of objects is too large, it is necessary to control the classification of objects to strengthen object management. In the existing technology, when classifying objects, the data collected by the device that can collect the location information of the object's movement, the data collected by the device that can collect the image of the person, or the object information registered in the area are processed and the objects are classified into the set object types.

[0003] However, existing technologies also have the following technical problems:

[0004] It cannot process data collected by all devices capable of collecting object information within the area. It can only process data collected by designated devices capable of collecting object movement location information, data collected by devices capable of collecting human images, or object information registered within the area. Furthermore, the object information registered within the area is outdated, resulting in inaccurate data. Consequently, the range of object classification obtained is quite broad, reducing the accuracy of object classification. Summary of the Invention

[0005] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0006] A data processing system for object classification includes: a target geographic region, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps:

[0007] S100. Obtain the object type list corresponding to the target geographic region: VA = {VA1, VA2, VA3, VA4}, VA1 = {VA... 11 VA 12 VA 13 VA 14}, VA2={VA 21 VA 22 VA 23 VA 24 VA 25 VA 26}, VA3={VA 31 VA 32 VA 33}, VA4 = {VA 41 VA 42 VA 43 VA 44VA 45}, VA 11 VA is the first registered object type in the list of registered object types. 12 VA is the second registered object type in the list of registered object types. 13 VA is the third registered object type in the list of registered object types. 14 VA is the fourth registered object type in the list of registered object types. 21 VA is the first non-fixed object type in the list of non-fixed object types. 22 VA is the second non-fixed object type in the list of non-fixed object types. 23 VA is the third non-fixed object type in the list of non-fixed object types. 24 VA is the fourth non-fixed object type in the list of non-fixed object types. 25 VA is the fifth non-fixed object type in the list of non-fixed object types. 26 VA is the sixth non-fixed object type in the list of non-fixed object types. 31 As the first external object type in the list of external object types, VA 32 As the second external object type in the list of external object types, VA 33 VA is the third external object type in the list of external object types. 41 VA is the first of the list of other object types in the list of other object types. 42 VA is the second list of other object types in the list of other object types. 43 VA is the third other object type in the list of other object types. 44 VA is the fourth other object type in the list of other object types. 45 This is the fifth item in the list of other object types.

[0008] S200. Obtain the object identifier list corresponding to VA: VB = {VB1, VB2, VB3, VB4}, VB1 = {VB... 11 VB 12 VB 13 VB 14}, VB2 = {VB 21 VB 22 VB 23 VB 24 VB 25 VB 26}, VB3 = {VB 31 VB 32 VB 33}, VB4 = {VB 41 VB 42 VB43 VB 44 VB 45}, VB 11 For VA 11 The corresponding object identifier list, VB 12 For VA 12 The corresponding object identifier list, VB 13 For VA 13 The corresponding object identifier list, VB 14 For VA 14 The corresponding object identifier list, VB 21 For VA 21 The corresponding object identifier list, VB 22 For VA 22 The corresponding object identifier list, VB 23 For VA 23 The corresponding object identifier list, VB 24 For VA 24 The corresponding object identifier list, VB 25 For VA 25 The corresponding object identifier list, VB 26 For VA 26 The corresponding object identifier list, VB 31 For VA 31 The corresponding object identifier list, VB 32 For VA 32 The corresponding object identifier list, VB 33 For VA 33 The corresponding object identifier list, VB 34 For VA 34 The corresponding object identifier list, VB 41 For VA 41 The corresponding object identifier list, VB 42 For VA 42 The corresponding object identifier list, VB 43 For VA 43 The corresponding object identifier list, VB 44 For VA 44 The corresponding object identifier list, VB 45 For VA 45 The corresponding list of object identifiers.

[0009] S300. Obtain the list of objects corresponding to VA: VC = {VC1, VC2, VC3, VC4}, VC1 = {VC...} 11 VC 12 VC 13 VC 14}, VC2={VC 21 VC 22 VC23 VC 24 VC 25 VC 26}, VC3 = {VC 31 VC 32 VC 33}, VC4 = {VC 41 VC 42 VC 43 VC 44 VC 45}, VC 11 For VA 11 The corresponding number of objects, VC 12 For VA 12 The corresponding number of objects, VC 13 For VA 13 The corresponding number of objects, VC 14 For VA 14 The corresponding number of objects, VC 21 For VA 21 The corresponding number of objects, VC 22 For VA 22 The corresponding number of objects, VC 23 For VA 23 The corresponding number of objects, VC 24 For VA 24 The corresponding number of objects, VC 25 For VA 25 The corresponding number of objects, VC 26 For VA 26 The corresponding number of objects, VC 31 For VA 31 The corresponding number of objects, VC 32 For VA 32 The corresponding number of objects, VC 33 For VA 33 The corresponding number of objects, VC 34 For VA 34 The corresponding number of objects, VC 41 For VA 41 The corresponding number of objects, VC 42 For VA 42 The corresponding number of objects, VC 43 For VA 43 The corresponding number of objects, VC 44 For VA 44 The corresponding number of objects, VC 45 For VA 45 The corresponding number of objects, where the number of objects is the number of object identifiers in the object identifier list.

[0010] S400. Based on VB and VC, obtain the object information list corresponding to VA: VD = {VD1, VD2, VD3, VD4}, VD1 = {VD... 11 VD 12 VD 13 VD 14}, VD2={VD 21 VD 22 VD 23 VD 24 VD 25 VD 26}, VD3={VD 31 VD 32 VD 33}, VD4={VD 41 VD 42 VD 43 VD 44 VD 45}, VD 11 ={VB 11 VC 11}, VD 12 ={VB 12 VC 12}, VD 13 ={VB 13 VC 13}, VD 14 ={VB 14 VC 14}, VD 21 ={VB 21 VC 21}, VD 22 ={VB 22 VC 22}, VD 23 ={VB 23 VC 23}, VD 24 ={VB 24 VC 24}, VD 25 ={VB 25 VC 25}, VD 26 ={VB 26 VC 26}, VD 31 ={VB 31 VC 31}, VD 32 ={VB 32 VC 32}, VD 33 ={VB 33 VC33}, VD 41 ={VB 41 VC 41}, VD 42 ={VB 42 VC 42}, VD 43 ={VB 43 VC 43}, VD 44 ={VB 44 VC 44}, VD 45 ={VB 45 VC 45}, VD 11 For VA 11 Corresponding object information, VD 12 For VA 12 Corresponding object information, VD 13 For VA 13 Corresponding object information, VD 14 For VA 14 Corresponding object information, VD 21 For VA 21 Corresponding object information, VD 22 For VA 22 Corresponding object information, VD 23 For VA 23 Corresponding object information, VD 24 For VA 24 Corresponding object information, VD 25 For VA 25 Corresponding object information, VD 26 For VA 26 Corresponding object information, VD 31 For VA 31 Corresponding object information, VD 32 For VA 32 Corresponding object information, VD 33 For VA 33 Corresponding object information, VD 34 For VA 34 Corresponding object information, VD 41 For VA 41 Corresponding object information, VD 42 For VA 42 Corresponding object information, VD 43 For VA 43 Corresponding object information, VD 44 For VA 44 Corresponding object information, VD 45 For VA 45The corresponding object information includes a list of object identifiers and the number of object identifiers.

[0011] The present invention has at least the following beneficial effects:

[0012] This invention provides a data processing system for object classification, comprising: a target geographic region, a first geographic region, a second geographic region, a third geographic region, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps: obtaining a list of object types corresponding to the target geographic region; obtaining a list of object identifiers corresponding to the list of object types; obtaining a list of object quantities corresponding to the list of object types; and obtaining a list of object information corresponding to the list of object types based on the list of object identifiers and the object quantities. It can be seen that this invention sets multiple object types with relatively small scopes, processes data collected by all devices capable of collecting object information within the target region, and processes the registered object information to obtain object identifiers and corresponding object features within the target region. Processing the object features of the object identifiers further yields the object identifiers and object quantities corresponding to the object types, which helps improve the accuracy of object classification. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0014] Figure 1 This is a flowchart illustrating the execution of a computer program in a data processing system for object classification, as provided in an embodiment of the present invention. Detailed Implementation

[0015] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0016] Embodiments of the present invention provide a data processing system for object classification, comprising: a target geographic region, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps, such as... Figure 1 As shown:

[0017] S100. Obtain the object type list corresponding to the target geographic region: VA = {VA1, VA2, VA3, VA4}, VA1 = {VA... 11 VA 12 VA 13 VA 14}, VA2={VA 21 VA 22 VA 23 VA 24 VA 25 VA 26}, VA3={VA 31 VA 32 VA 33}, VA4 = {VA 41 VA 42 VA 43 VA 44 VA 45}, VA 11 The first registered object type in the list of registered object types is an object whose residential address is within the target geographic area and whose first registration information is on the first platform corresponding to the target geographic area. VA 12 This is the second registration object type in the list of registration object types. The second registration object is the object whose registration information is valid at the first platform corresponding to the target geographic region at the current time. (VA) 13 This is the third registered object type in the list of registered object types. A third registered object is an object whose residential address is not within the target geographic area, but whose first registration information is on the first platform corresponding to the target geographic area. VA 14 This is the fourth registration object type in the list of registration object types. The fourth registration object is an object whose residential address cannot be determined and whose first registration information is on the first platform corresponding to the target geographic area. VA 21 It is the first non-fixed object type in the list of non-fixed object types. The first non-fixed object is an object whose residential address is within the target geographic area and whose first registration information is on the first platform corresponding to the first geographic area. VA 22 It is the second non-fixed object type in the list of non-fixed object types. The second non-fixed object is the object on the second platform corresponding to the second registration information in the target geographic region at the current time. VA 23 It is the third non-fixed object type in the list of non-fixed object types. The third non-fixed object is an object whose residential address cannot be determined and whose second registration information is on the second platform corresponding to the target geographic area. VA 24This is the fourth non-fixed object type in the list of non-fixed object types. The fourth non-fixed object is an object whose residential address is within the target geographic area but for which there is no corresponding second registration information on the second platform corresponding to the target geographic area. VA 25 This is the fifth non-fixed object type in the list of non-fixed object types. The fifth non-fixed object is an object whose residential address is within the target geographic area but for which there is no corresponding third-party registration information on the third platform corresponding to the target geographic area. VA 26 It is the sixth non-fixed object type in the list of non-fixed object types. The sixth non-fixed object is an object whose residential address is within the target geographic area and whose first registration information is on the first platform corresponding to the third geographic area. VA 31 The first external object type in the list of external object types is an object whose residential address is within the target geographic region and whose first registration information is on the first platform corresponding to the second geographic region. VA 32 The second external object type in the list of external object types is an object whose fourth registration information is valid on the fourth platform corresponding to the target geographic region at the current time. VA 33 The third external object type in the list of external object types is an object whose residential address is within the target geographic area and which has no corresponding first registration information on the first platform, no corresponding second registration information on the second platform, and no corresponding fourth registration information on the fourth platform corresponding to the target geographic area. VA 41 This is the first other object type in the list of other object types, where the first other object type is an object existing in the target geographic region at the current time. VA 42 This is the second list of other object types in the list of other object types. The second other object type is an object whose residential address is not within the target geographic area but whose second registration information is on the second platform corresponding to the target geographic area. VA 43 This is the third list of other object types in the list of other object types. The third other object type includes objects whose work address is within the target geographic area but whose residential address is not within the target geographic area, and objects for which there is no corresponding first registration information on the first platform corresponding to the target geographic area and the second geographic area, no corresponding second registration information on the second platform corresponding to the target geographic area, and no fourth registration information on the fourth platform corresponding to the target geographic area. (VA) 44 This is the fourth other object type in the list of other object types. The fourth other object type includes objects for which there is no corresponding first registration information on the first platform corresponding to the target geographic region, no corresponding second registration information on the second platform corresponding to the target geographic region, whose residential address is not within the target geographic region, and whose work address is not within the target geographic region. (VA) 45This is the fifth other object type in the list of other object types. The fifth other object type is an object whose current residential address within the target geographic area is inconsistent with the first registration information.

[0018] Specifically, the scope of the target geographic area is the geographic area at the district level, such as Shangcheng District of Hangzhou City.

[0019] Furthermore, the first geographic region is any geographic region in China whose geographic management level is at the national level, except for geographic regions whose geographic management level is at the municipal level, or any geographic region whose geographic management level is at the county level within the geographic region whose geographic management level is at the municipal level. This can be understood as follows: if the target geographic region is Shangcheng District of Hangzhou City, then the first geographic region is any geographic region in China other than Hangzhou City whose geographic management level is at the municipal level, or any geographic region within Hangzhou City whose geographic management level is at the county level. For example, Shanghai City or Tonglu County of Hangzhou City.

[0020] Furthermore, the second geographic region is any geographic region whose geographic management level is at the national level, excluding the geographic region corresponding to the target geographic region. This can be understood as follows: if the target geographic region is Shangcheng District of Hangzhou City, then the first geographic region is any geographic region whose geographic management level is at the national level other than China, such as the United States.

[0021] Furthermore, the third geographic region is the range of any geographic region in Hangzhou whose geographic management level is at the city level, excluding the target geographic region, whose geographic management level is at the district level. This can be understood as follows: if the target geographic region is Shangcheng District of Hangzhou, then the third geographic region is the range of any geographic region in Hangzhou whose geographic management level is at the district level, excluding Shangcheng District, for example, Xihu District of Hangzhou.

[0022] Specifically, the first platform is an officially recognized third-party platform capable of registering the household registration information of the subject. As those skilled in the art know, any third-party platform capable of registering the household registration information of the subject in the prior art falls within the protection scope of this invention, and will not be elaborated further here.

[0023] Specifically, the second platform is an officially recognized third-party platform capable of registering information on mobile objects. As those skilled in the art know, any existing third-party platform capable of registering information on mobile objects falls within the protection scope of this invention, and will not be elaborated further here.

[0024] Specifically, the third platform is an officially recognized third-party platform that can register the identity card information of the subject. As those skilled in the art know, any third-party platform in the prior art that can register the identity card information of the subject falls within the protection scope of this invention, and will not be elaborated further here.

[0025] Specifically, the fourth platform is an officially recognized third-party platform capable of registering information on foreign objects entering and leaving the country. As those skilled in the art know, any existing third-party platform capable of registering information on foreign objects entering and leaving the country falls within the protection scope of this invention, and will not be elaborated further here.

[0026] Furthermore, the first registration information is the registration information on the first platform, the second registration information is the registration information on the first platform, the third registration information is the registration information on the third platform, and the fourth registration information is the registration information on the fourth platform.

[0027] Furthermore, each of the first, second, third, and fourth registration information corresponds to an object identifier, which can be understood as an ID card number.

[0028] S200. Obtain the object identifier list corresponding to VA: VB = {VB1, VB2, VB3, VB4}, VB1 = {VB... 11 VB 12 VB 13 VB 14}, VB2 = {VB 21 VB 22 VB 23 VB 24 VB 25 VB 26}, VB3 = {VB 31 VB 32 VB 33}, VB4 = {VB 41 VB 42 VB 43 VB 44 VB 45}, VB 11 For VA 11 The corresponding object identifier list, VB 12 For VA 12 The corresponding object identifier list, VB 13 For VA 13 The corresponding object identifier list, VB 14 For VA 14 The corresponding object identifier list, VB 21 For VA 21 The corresponding object identifier list, VB 22 For VA22 The corresponding object identifier list, VB 23 For VA 23 The corresponding object identifier list, VB 24 For VA 24 The corresponding object identifier list, VB 25 For VA 25 The corresponding object identifier list, VB 26 For VA 26 The corresponding object identifier list, VB 31 For VA 31 The corresponding object identifier list, VB 32 For VA 32 The corresponding object identifier list, VB 33 For VA 33 The corresponding object identifier list, VB 34 For VA 34 The corresponding object identifier list, VB 41 For VA 41 The corresponding object identifier list, VB 42 For VA 42 The corresponding object identifier list, VB 43 For VA 43 The corresponding object identifier list, VB 44 For VA 44 The corresponding object identifier list, VB 45 For VA 45 The corresponding list of object identifiers.

[0029] Specifically, each object identifier list includes several object identifiers.

[0030] Furthermore, each object identifier serves as a unique identifier for the object.

[0031] Specifically, step S200 includes the following steps:

[0032] S1, Obtain VA 11 The corresponding first time point, where VA 11 The corresponding first time point is the va time points preceding the current time point.

[0033] Specifically, the value range of va is [1, 30]. As those skilled in the art know, the value of va can be set according to actual needs.

[0034] S2, Obtain VA 11 The corresponding first intermediate object identifier list VE 11 ={VE 1 11 , ..., VE (vi)11 , ..., VE (vm) 11}, VE (vi) 11 For VA 11 The corresponding first intermediate object identifier is (vi), (vi) = 1...(vm), where (vm) is a VA. 11 The corresponding number of first intermediate object identifiers.

[0035] Specifically, in step S2, the first intermediate object identifier list is obtained through the following steps:

[0036] S21. Obtain a list of first key object identifiers corresponding to the target geographic region. The list of first key object identifiers includes several first key object identifiers. The first key object identifier is the object identifier corresponding to any first registration information on the first platform corresponding to the target geographic region. As those skilled in the art know, any method of obtaining object identifiers from registration information in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0037] S22. Obtain a second key object identifier list corresponding to the target geographic region. The second key object identifier list includes several second key object identifiers. The second key object identifier is the object identifier corresponding to any second registration information on the second platform corresponding to the target geographic region. As those skilled in the art know, the method of obtaining the second key object identifier list is the same as the method of obtaining the first key object identifier list, and will not be described again here.

[0038] S23. Obtain a list of third key object identifiers corresponding to the target geographic region. The list of third key object identifiers includes several third key object identifiers. Each third key object identifier is an object identifier corresponding to any third registration information on the third platform corresponding to the target geographic region. As those skilled in the art know, the method of obtaining the list of third key object identifiers is the same as the method of obtaining the list of first key object identifiers, and will not be described again here.

[0039] S24. Obtain the fourth key object identifier list corresponding to the target geographic region. The fourth key object identifier list includes several fourth key object identifiers. The fourth key object identifier is the object identifier corresponding to any fourth registration information on the fourth platform corresponding to the target geographic region. As those skilled in the art know, the method of obtaining the fourth key object identifier list is the same as the method of obtaining the first key object identifier list, and will not be described again here.

[0040] S25. Obtain the fifth key object identifier list corresponding to the target geographical area. The fifth key object identifier list includes several fifth key object identifiers. The fifth key identifier is any object identifier collected by any device capable of collecting object identifiers within the target geographical area. As those skilled in the art know, any method in the prior art for obtaining the object identifiers collected by the device through a device capable of collecting object identifiers is within the protection scope of this invention, and will not be elaborated here.

[0041] S26. Insert the object identifiers from the first key object identifier list, the second key object identifier list, the third key object identifier list, the fourth key object identifier list, and the fifth key object identifier list into an empty list and perform deduplication to obtain the first intermediate object identifier list. It is known to those skilled in the art that any deduplication method in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0042] The above process involves processing the data collected by all devices capable of collecting object information within the target area, as well as the registered object information, to accurately obtain the object identifiers existing within the target area. Based on the object identifiers, object characteristics are obtained, thereby obtaining the object identifiers and object quantities corresponding to the object types, which helps improve the accuracy of object classification.

[0043] S3, Obtain VE 11 The corresponding first feature text list VF 11 ={VF 1 11 , ..., VF (vi) 11 , ..., VF (vm) 11},

[0044] VF (vi) 11 ={VF (vi)1 11 VF (vi)2 11 VF (vi)3 11 VF (vi)4 11 VF (vi)5 11 VF (vi)6 11 VF (vi)7 11 VF (vi )8 11}, VF (vi)1 11 In order to be able

[0045] Presenting VE (vi)11 The text corresponding to the landing point of the first intermediate object, VF (vi)2 11 In order to be able to present VE (vi) 11 The text of the working address of the corresponding first intermediate object, VF (vi)3 11 In order to be able to present VE (vi) 11 The text of the residential address of the corresponding first intermediate object, VF (vi)4 11 For VE (vi) 11 The first registration information of the corresponding first intermediate object, VF (vi)5 11 For VE (vi) 11 The second registration information corresponding to the first intermediate object, VF (vi)6 11 For VE (vi) 11 The fourth registration information corresponding to the first intermediate object, VF (vi)7 11 In order to be able to present VE (vi) 11 The first registration information of the corresponding first intermediate object is the text on the first platform corresponding to the second geographical region, VF (vi)8 11 In order to be able to present VE (vi) 11 The corresponding first intermediate object belongs to the fourth other object type of text. As those skilled in the art know, any existing method capable of obtaining registration information falls within the protection scope of this invention and can present VE. (vi) 11 The text corresponding to the first intermediate object belonging to the fourth other object type is set by those skilled in the art according to actual needs, and will not be elaborated here.

[0046] Specifically, step S3 includes the following steps to obtain text that can represent the location, residential address, and work address of the first intermediate object:

[0047] Get the list of first address strings corresponding to the target object A = {A1, A2}, where A1 is the first residential address string corresponding to the target object and A2 is the first work address string corresponding to the target object.

[0048] Specifically, the target object is any first intermediate object.

[0049] Specifically, the step of obtaining the list of first address strings corresponding to the target object includes the following steps:

[0050] Get the list of preset address text corresponding to the target object, D = {D1, ..., D2}. i , ..., D m}, D i The i-th preset address text corresponding to the target object, i = 1...m, where m is the number of preset address texts. The preset address text is a text that the target object has registered and can display an address, such as: xx community, x building, x unit, xxx. Those skilled in the art know that the source of the preset address text is preset by those skilled in the art, and any method of obtaining address text in the prior art is within the protection scope of this invention, which will not be elaborated here.

[0051] Get the text identifier list P = {P1, ..., P2} corresponding to D. i ..., P m}, P i D i The corresponding text identifier, as those skilled in the art will know, is set by those skilled in the art according to actual needs, and is used to characterize whether the preset address text can be used as a residential address or a work address.

[0052] According to P i Get the first address text list DY = {DY1, ..., DY} k ..., DY t} and the second address text list DE = {DE1, ..., DE} z , ..., DE w}, DY k Let DE be the k-th first address text, k = 1...t, where t is the number of first address texts. z Let z be the z-th second address text, where z = 1...w, and w is the number of second address texts.

[0053] Specifically, according to P i The steps to obtain the first address text list and the second address text list include the following steps: obtaining the first address text and the second address text.

[0054] When P i To identify "1", P i The corresponding D i As the first address text.

[0055] Specifically, the identifier "1" indicates that it can be used as a residential address.

[0056] When P i To identify "2", P i The corresponding D i As the second address text.

[0057] Specifically, the identifier "2" indicates that it can be used as a work address.

[0058] When P i To identify "3", D i Input into the preset keyword extraction model to obtain D i The corresponding first keyword is YG i The preset keyword extraction model is a neural network model that can extract keywords from text. As those skilled in the art know, any neural network model that can extract keywords from text in the prior art is within the protection scope of this invention, and will not be elaborated here. For example, the LDA model.

[0059] Specifically, the identifier "3" indicates that the residential address or work address cannot be distinguished.

[0060] Get the address mapping list YS = {YS1, ..., YS...} e , ..., YS f}, YS e ={YS e1 YS e2}, YS e1 YS is the second key in the e-th record of the address relationship mapping list. e2 For YS e1 The corresponding second keyword identifier, e = 1...f, where f is the number of records in the address relationship mapping list. As those skilled in the art know, the address relationship mapping list is a list that has been pre-set by those skilled in the art according to actual needs.

[0061] Specifically, a record can be understood as a row of data in a list.

[0062] Get D i With YS e1 Keyword similarity between XS ie As those skilled in the art will know, any existing method that can obtain the similarity between two keywords is within the scope of protection of this invention, and will not be elaborated here. For example, the cosine similarity algorithm.

[0063] When XS ie When = 1, YS e1 The corresponding second keyword identifier is D. i Corresponding key identifier U i .

[0064] When U i To identify "4", use U i The corresponding D i As the first address text.

[0065] Specifically, the symbol "4" indicates that it can be used as a residential address.

[0066] When U i To identify "5", use U i The corresponding D i As the second address text.

[0067] Specifically, the symbol "5" indicates that it can be used as a residential address.

[0068] The above process processes the text identifier corresponding to the preset address text to determine the first address text and the second address text. When the text identifier indicates that the residential address or work address cannot be distinguished, the preset address text is input into the preset keyword extraction model to obtain the first keyword corresponding to the preset address text. The keyword similarity between the first keyword and the second keyword in the address relationship mapping list is also obtained. When the keyword similarity is 1, the first address text and the second address text are determined based on the second keyword identifier in the address relationship mapping list. This process can accurately determine the first address text and the second address text, and thus accurately determine the first residential address string and the first work address string, thereby improving the accuracy of obtaining the target address string.

[0069] Based on DY, obtain A1.

[0070] Specifically, the steps to obtain A1 based on DY include the following:

[0071] Obtain the first address weight list I = {I1, ..., I2} corresponding to DY. k , ..., I t}, I k For DY k The corresponding first address weight.

[0072] Specifically, the step of obtaining the first address weight list corresponding to DY includes the following steps: obtaining I k :

[0073] Based on DY, obtain the first address type list YL = {YL1, ..., YL} corresponding to DY. k ..., YL t}, YL k For DY k The corresponding first address type, wherein, as those skilled in the art know, any method for obtaining the address type of address text in the prior art is within the protection scope of this invention, and will not be elaborated here.

[0074] Specifically, the address type can be any one of the following: registered address, current address, social security address, educational address, or real estate address.

[0075] Obtain the preset address weight mapping list Q = {Q1, ..., Q} a Q c}, Q a ={Q a1 Q a2}, Q a1 For the preset address type in the a-th record of the preset address weight mapping list, Q a2 For Q a1 The corresponding preset address weights are a = 1...c, where c is the number of records in the preset address weight mapping list. As those skilled in the art know, the preset address weight mapping list is a list that has been pre-set by those skilled in the art according to actual needs.

[0076] Specifically, Q a2 The value range is [0, 100].

[0077] Get YL k With Q a1 Address similarity between YLQ ka As those skilled in the art will know, the method for obtaining address similarity is the same as the method for obtaining keyword similarity, and will not be described in detail here.

[0078] When YLQ ka When = 1, determine Q. a2 =I k .

[0079] Get the second address weight list I corresponding to DY 0 ={I 0 1, ..., I 0 k , ..., I 0 t}, I 0 k For DY 0 k The corresponding second address weight.

[0080] Specifically, the steps for obtaining the second address weight list corresponding to DY include the following:

[0081] Get the list of first time points corresponding to DY: R = {R1, ..., R2} k , ..., R t}, R k For DY k The corresponding first time point, wherein the first time point is the time point of registration of the first address text, as those skilled in the art know, any method of obtaining the time point of registration address in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0082] According to R k , get I 0 k , among which, I 0 k The following conditions must be met:

[0083] I 0 k =(R k -R min ) / (R max -R min )×100, where R min The longest interval between R and the current time point. k R max R is the R with the shortest interval from the current time point. k .

[0084] According to I and I 0 Obtain the third address weight list I corresponding to DY. 1 ={I 1 1, ..., I 1 k , ..., I 1 t}, I 1 k For DY 1 k The corresponding third address weight, where I 1 k The following conditions must be met:

[0085] I 1 k =I k +I 0 k .

[0086] Determine the largest I 1 k Corresponding DY k This is the third address text.

[0087] The third address text is input into a preset map platform to obtain the third address coordinates corresponding to the third address text. The third address coordinates are the coordinates of the corresponding position of the third address text in the preset map platform. As those skilled in the art know, any map platform in the prior art that can obtain the coordinates of the position corresponding to the text is within the protection scope of this invention, and will not be elaborated here.

[0088] The third address coordinates are processed using the geohash8 algorithm to obtain A1.

[0089] The above process involves determining the first address weight based on the first address type of the first address text, determining the second address weight based on the registration time of the first address text, obtaining the third address weight based on the first and second address weights, and identifying the first address text with the highest third address weight as the third address text. This third address text is then input into the map and processed using the geohash8 algorithm to obtain the first residential address string. Similarly, the first work address string is obtained. This process filters out outdated registration information and selects more accurate registration information as the first residential address string and the first work address string, thus improving the accuracy of obtaining the target address string.

[0090] According to DE z To obtain A2, as those skilled in the art know, the method of obtaining the first work address string based on the second address text is the same as the method of obtaining the first residential address string based on the first address text, and will not be described again here.

[0091] The above process processes the preset address text and its corresponding text identifier to obtain the first address text and the second address text. The first address text is then processed to filter out outdated registered addresses, resulting in the first residential address string. The second address text is also processed to filter out outdated registered addresses, resulting in the first work address string. Subsequently, the target residential address string is obtained based on the first and second residential address strings, and the target work address string is obtained based on the first and second work address strings. This process helps improve the accuracy of obtaining the target address string.

[0092] Get the list of second address strings corresponding to the target object B = {B1, B2}, where B1 is the second residential address string corresponding to the target object and B2 is the second work address string corresponding to the target object.

[0093] Specifically, the step of obtaining the list of second address strings corresponding to the target object includes the following step to obtain B:

[0094] Get the first time period list T = {T1, ..., T2} j , ..., T n}, T j Let j be the j-th first time period, j = 1...n, where n is the number of first time periods.

[0095] Specifically, the value of n is in the range of [25, 35]. As those skilled in the art know, the value of n is set according to actual needs.

[0096] Specifically, the first time period is from 0:00 to 7:00 and from 19:00 to 24:00.

[0097] Based on T, obtain B1.

[0098] Specifically, the steps to obtain B1 based on T include the following:

[0099] Based on T, obtain the fourth intermediate address string cluster L = {L1, ..., L...} r , ..., L s}, L r ={L r1 , ..., L rg , ..., L rh}, L rg Let g be the fourth intermediate address string cluster corresponding to the r-th trajectory data source, where r = 1...s, s is the number of trajectory data sources, and g = 1...h, h is the number of fourth intermediate address string clusters corresponding to the r-th trajectory data source.

[0100] Specifically, trajectory data sources include: probes, ETC (Electronic Toll Collection) systems, and other platforms that generate trajectory-related data.

[0101] Specifically, the step of obtaining the fourth intermediate address string cluster based on T includes the following steps:

[0102] Based on T, obtain the list F = {F1, ..., F2} of the first intermediate address strings corresponding to T. j , ..., F n}, F j ={F j1 , ..., F jr , ..., F js}, F jr ={F 1 jr , ..., F x jr , ..., F p jr}, F x jr For T j The x-th first intermediate address string reported by the r-th trajectory data source, x = 1...p, where p is the number of first intermediate address strings reported by the trajectory data source, and the first intermediate address string is the data reported by the trajectory data source.

[0103] Based on F, obtain the first intermediate address coordinate list G = {G1, ..., G...} corresponding to F. j , ..., G n}, G j ={G j1 , ..., G jr, ..., G js}, G jr ={G 1 jr , ..., G x jr , ..., G p jr}, G x jr For F x jr The corresponding first intermediate address coordinates are the coordinates of the location corresponding to the first intermediate address string in the preset map platform. As those skilled in the art know, any method in the prior art that converts data reported by the trajectory data source into coordinates of the location in the map is within the protection scope of this invention, and will not be elaborated here.

[0104] Based on the geohash8 algorithm, G x jr Process and obtain G x jr The corresponding second intermediate address string G 0x jr .

[0105] According to G 0x jr Obtain the third intermediate address string cluster H = {H1, ..., H...} j H n}, H j ={H j1 H jr H js}, H jr ={H 1 jr H y jr H q jr}, H y jr For T j The y-th intermediate address string cluster corresponding to the r-th trajectory data source, y = 1...q, where q is T j The number of third intermediate address string clusters corresponding to the r-th trajectory data source, wherein the third intermediate address string cluster is formed by clustering the second intermediate address strings belonging to the same time period and the same trajectory data source according to the unsupervised clustering algorithm. Those skilled in the art know that any unsupervised clustering method in the prior art is within the protection scope of this invention, and will not be described in detail here, such as the k-means algorithm.

[0106] According to H yjr , obtain L rg .

[0107] Specifically, according to H y jr , obtain L rg The steps include the following:

[0108] Get H y jr The corresponding first data volume M y jr The first data volume is the data volume of the third intermediate address string cluster. As those skilled in the art know, any method for obtaining the data volume of a cluster in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0109] According to M y jr Obtain the second data list N = {N1, ..., N} r , ..., N s}, N r For the r-th trajectory data source, the second data volume is N. r The following conditions must be met:

[0110] N r =(Σ n j＝1 ((Σ q y＝1 M y ir ) / q)) / n.

[0111] When H y jr >N r At that time, H y jr As L rg .

[0112] The above process involves processing the first intermediate address string to obtain the first intermediate address coordinates and the second intermediate address string. Then, using an unsupervised clustering method, the second intermediate address string is clustered according to time period and its associated trajectory data source to obtain the third intermediate address string cluster. Based on the data volume of the third intermediate address string cluster, the fourth intermediate address string cluster is determined. Clusters with smaller data volumes are filtered out, which helps improve the accuracy of obtaining the second residential address string, and thus, improves the accuracy of obtaining the target address string.

[0113] Based on L, obtain the list of third address strings J = {J1, ..., J...} corresponding to L. r , ..., J s}, J r ={Jr1 , ..., J rg , ..., J rh}, J rg For L rg The corresponding third address string, wherein the third address string is the center of the fourth intermediate address string cluster, wherein, as those skilled in the art know, any method for obtaining the center of a cluster in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0114] According to J rg Get the list of fourth address strings K = {K1, ..., K2} u , ..., K v}, K u ={K u1 , ..., K ub , ..., K ud}, K ub Let b be the fourth address string in the u-th fourth address string list, u = 1 ... v, v is the number of the fourth address string list, b = 1 ... d, d is the number of the fourth address strings in the fourth address string list, where the fourth address string list is composed of any third address string in any order from each third address string list.

[0115] Specifically, c = s.

[0116] According to K ub Obtain the first address priority list S = {S1, ..., S2} corresponding to K. u , ..., S v}, S u For K u The corresponding first address priority.

[0117] Specifically, according to K ub The steps to obtain the first address priority list corresponding to K include the following:

[0118] According to K ub Obtain the first string similarity list W = {W1, ..., W2} corresponding to K. u , ..., W v}, W u ={W u1 , ..., W ub , ..., W u(d-1)}, W ub For K ub With K u(b+1)The first string similarity is the similarity between two adjacent fourth address strings in the fourth address string list. As those skilled in the art know, the method of obtaining the first string similarity is the same as the method of obtaining the first residential address string based on the first address text, and will not be described again here.

[0119] According to W ub , obtain S u , among which, S u The following conditions must be met:

[0120] S u =(Σ d-1 b＝1 W ub ) / (d-1).

[0121] According to K ub Obtain the second address priority list S corresponding to K. 0 ={S 0 1, ..., S 0 u , ..., S 0 v}, S 0 u For K u The corresponding second address priority.

[0122] Specifically, according to K ub The steps to obtain the second address priority list corresponding to K include the following:

[0123] According to K ub Obtain the third data list Z = {Z1, ..., Zn} corresponding to K. u , ..., Z v}, Z u ={Z u1 , ..., Z ub , ..., Z ud}, Z ub For K ub The corresponding third data volume is the data volume of the fourth intermediate address string cluster corresponding to the third address string of the fourth address string.

[0124] According to Z ub , obtain S 0 u , among which, S 0 u The following conditions must be met:

[0125] S 0 u =Σ d b＝1Z ub .

[0126] According to S u and S 0 u Determine the first key address string list K 0 ={K 0 1, ..., K 0 b , ..., K 0 d}, where K 0 b This is the first key address string of the b-th element.

[0127] Specifically, according to S u and S 0 u The steps to determine the list of first key address strings include the following:

[0128] When S is the largest S u Corresponding K u With S 0 The largest S in the middle 0 u Corresponding K u When they are the same, determine the largest S among them. u Corresponding K ub For K 0 b .

[0129] When S is the largest S u Corresponding K u With S 0 The largest S in the middle 0 u Corresponding K u When they are not the same, according to S u and S 0 u Obtain the third address priority list S corresponding to K. 1 ={S 1 1, ..., S 1 u , ..., S 1 v}, S 1 u For K u The corresponding third address priority, where S 1 u The following conditions must be met:

[0130] S 1 u =(S u -min(S u)) / (max(S u )-min(S u ))+(S 0 u -min(S 0 u )) / (max(S 0 u )-min(S 0 u ), where min() is

[0131] The function to get the minimum value, and the function to get the maximum value.

[0132] The above describes how to obtain the first and second priorities of the fourth address string list, compare the first and second priorities of the fourth address string list to determine the first key address string list, filter out the trajectory data that does not need to be processed, and process each first key address string in the first key address string list. This can accurately obtain the second residential address string, thereby improving the accuracy of obtaining the target address string.

[0133] Determine the largest S 1 u Corresponding K ub For K 0 b .

[0134] According to K 0 b Obtain B1, where B1 satisfies the following conditions:

[0135] B1=(Σ d b＝1 K 0 b ) / d.

[0136] As described above, based on the fourth intermediate address string cluster, the third address string is obtained. Further, a fourth address string list is obtained, and the first address priority and second address priority corresponding to each fourth string list are obtained. The first address priority and second address priority are processed to determine the first key address string list. Trajectory data that does not need to be processed is filtered out. Each first key address string in the first key address string list is processed to accurately obtain the second residential address string, thereby improving the accuracy of obtaining the target address string.

[0137] Get the second time period list T 0 ={T 0 1, ... T 0 j , ..., T0 n}, T 0 j This is the j-th second time interval.

[0138] Specifically, the second time period is from 7:00 to 19:00.

[0139] According to T 0 To obtain B2, as those skilled in the art know, the method of obtaining the second residential address string based on the second time period is the same as the method of obtaining the second residential address string based on the first time period, and will not be described again here.

[0140] The above describes the process of dividing the data into a first time period and a second time period. Trajectory data uploaded by each trajectory data source within the first time period and the data uploaded by each trajectory data source within the second time period are obtained. The same method is used to process the data uploaded by each trajectory data source within both the first and second time periods, filtering out trajectory data that does not require processing, and obtaining the second address string. This process helps improve the accuracy of obtaining the target address string.

[0141] Specifically, in another specific embodiment, when n is 7, B1 is determined as the daytime landing point of the target object, and B2 is determined as the nighttime landing point of the target object.

[0142] Specifically, the daytime and nighttime locations of the target object are used as text that can present the target object's locations.

[0143] Based on A and B, obtain the target address string list C = {C1, C2} corresponding to the target object, where C1 is the target residential address string corresponding to the target object and C2 is the target work address string corresponding to the target object.

[0144] Specifically, the step of obtaining the list of target address strings corresponding to the target object based on A and B includes the following steps:

[0145] Obtain the second string similarity AB1 between A1 and B1. The method for obtaining the second string similarity is the same as the method for obtaining the first residential address string based on the first address text in step S107, and will not be repeated here.

[0146] Based on AB1, obtain C1.

[0147] Specifically, the steps to obtain C1 based on AB1 include the following:

[0148] When AB1≥AB 0 When A1 is determined to be C1, where AB 0 This is the preset second string similarity threshold.

[0149] Specifically, AB 0 The value range is [0.8, 1]. As those skilled in the art know, they can set the value of the second string similarity threshold according to actual needs.

[0150] When AB1 < AB 0 At that time, B1 is determined to be the specified address string.

[0151] The largest S 1 u In S 1 Delete it, and perform the action to determine the largest S. 1 u Corresponding K ub For K 0 b The steps.

[0152] When S 1 If NULL, the specified address string is determined to be C1.

[0153] Specifically, in another specific embodiment, when the largest S 1 u In S 1 The deletion step is followed by the following step to obtain C1:

[0154] When S 1 When the value is NULL, the age NL of the target object is obtained. As those skilled in the art know, any method for obtaining the age of the target object in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0155] When NL≤16 or NL≥60, the registered address of the target object is determined as C1.

[0156] When NL∈(16,60), the daytime landing point of the target object is determined to be C1.

[0157] Obtain the third string similarity AB2 between A2 and B2. The method for obtaining the third string similarity is the same as the method for obtaining the first residential address string based on the first address text, and will not be repeated here.

[0158] Based on AB2, obtain C2. As those skilled in the art know, the method of obtaining the target work address string based on the similarity of the third string is the same as the method of obtaining the target residential address string based on the second string, and will not be described again here.

[0159] Specifically, the target residential address string of the target object is used as the text that can represent the residential address of the target object, and the target work address string of the target object is used as the text that can represent the work address of the target object.

[0160] The above process processes the first address string and the second address string to obtain the second string similarity between the first residential address string and the second residential address string. The second string similarity is then compared to obtain the target residential address string. Similarly, the target work address string can be obtained, which helps to improve the accuracy of obtaining the target address.

[0161] S4, Obtain VA 11 The corresponding first type identifier VG 11 As those skilled in the art will know, the first type of identifier is set by those skilled in the art according to actual needs, and will not be described in detail here.

[0162] S5, according to VG 11 and VF 11 Get VB 11 The object identifier in the file.

[0163] Specifically, step S5 includes the following steps:

[0164] S51, VF 11 Input into the preset map platform to obtain VF 11 The corresponding feature coordinate list VH 11 ={VH 1 11 , ...,

[0165] VH (vi) 11 , ..., VH (vm) 11}, VH (vi) 11 ={VH (vi)1 11 VH (vi)2 11 VH (vi)3 11 VH (vi)4 11 VH (vi)5 11 VH (vi)6 11 VH (vi)7 11 ,

[0166] VH (vi)8 11}, VH (vi)1 11 For V

[0167] F (vi)1 11 The corresponding feature coordinates, VH (vi)211 For VF (vi)2 11 The corresponding feature coordinates, VH (vi)3 11 For VF (vi)3 11 The corresponding feature coordinates, VH (vi)4 11 For VF (vi)4 11 The corresponding feature coordinates, VH (vi)5 11 For VF (vi)5 11 The corresponding feature coordinates, VH (vi)6 11 For VF (vi)6 11 The corresponding feature coordinates, VH (vi)7 11 For VF (vi)7 11 The corresponding feature coordinates, VH (vi)8 11 For VF (vi)8 11 The corresponding feature coordinates, as those skilled in the art know, are obtained by means of the same method as those for obtaining the third position coordinates, and will not be described in detail here.

[0168] S52. Process the feature coordinates using the geohash algorithm to obtain VH. 11 The corresponding first coordinate string list VL 11 ={VL 1 11 , ..., VL (vi) 11 , ..., VL (vm) 11}, VL (vi) 11 ={VL (vi)1 11 VL (vi)2 11 VL (vi)3 11 VL (vi)4 11 VL (vi)5 11 VL (vi)6 11 VL (vi)7 11 VL (vi)8 11}, VL (vi)1 11 For VH (vi)1 11The corresponding first coordinate string, VL (vi)2 11 For VH (vi)2 11 The corresponding first coordinate string, VL (vi)3 11 For VH (vi)3 11 The corresponding first coordinate string, VL (vi)4 11 For VH (vi )4 11 The corresponding first coordinate string, VL (vi)5 11 For VH (vi)5 11 The corresponding first coordinate string, VL (vi)6 11 For VH (vi)6 11 The corresponding first coordinate string, VL (vi)7 11 For VH (vi)7 11 The corresponding first coordinate string, VL (vi)8 11 For VH (vi)8 11 The corresponding first coordinate string, wherein, as those skilled in the art know, any geohash algorithm is within the protection scope of this invention, and those skilled in the art can choose a specific geohash algorithm according to actual needs, such as geohash8, geohash9, which will not be elaborated here.

[0169] S53. Input the geographical name corresponding to the target geographical area into the preset map platform to obtain the specified coordinate range corresponding to the target geographical area.

[0170] S54. Process the specified coordinate range according to the geohash algorithm to obtain the second coordinate string list VK = {VK1, ..., VK} corresponding to the specified coordinate range. (vj) ..., VK (vn) VK (vj) Let (vj) be the (vj)th second coordinate string corresponding to the specified coordinate range, where (vj) = 1...(vn), and (vn) is the number of second coordinate strings corresponding to the specified coordinate range. As those skilled in the art know, the method of obtaining the second coordinate string is the same as the method of obtaining the first coordinate string, and will not be described again here.

[0171] S55, according to VL (vi) 11 And VK, obtain VL (vi)11 The corresponding first feature identifier list VM (vi) 11 ={VM (vi)1 11 VM (vi)2 11 VM (vi)3 11 VM (vi)4 11 VM (vi)5 11 VM (vi)6 11 VM (vi)7 11 VM (vi)8 11 VM (vi)1 11 VL (vi)1 11 The corresponding first feature identifier, VM (vi)2 11 VL (vi)2 11 The corresponding first feature identifier, VM (vi)3 11 VL (vi)3 11 The corresponding first feature identifier, VM (vi)4 11 VL (vi)4 11 The corresponding first feature identifier, VM (vi)5 11 VL (vi)5 11 The corresponding first feature identifier, VM (vi)6 11 VL (vi)6 11 The corresponding first feature identifier, VM (vi)7 11 VL (vi)7 11 The corresponding first feature identifier, VM (vi)8 11 VL (vi)8 11 The corresponding first feature identifier.

[0172] Specifically, step S55 includes the following steps:

[0173] S551, Obtain VL (vi)1 11 With VK (vj) String similarity VN between (vi)1 11(vj)As those skilled in the art will know, any existing method for obtaining the string similarity between two strings is within the scope of protection of this invention, and will not be elaborated here. For example, the cosine similarity algorithm.

[0174] S552, when any VN (vi)1 11(vj) When = 1, generate VM. (vi)1 11 To indicate "-1", otherwise, generate a VM. (vi)1 11 To identify "0".

[0175] Specifically, the identifier "-1" indicates that the strings are the same.

[0176] Specifically, the identifier "0" indicates that the strings are different.

[0177] S553, according to VL (vi)2 11 With VK (vj) Obtain VM (vi)2 11 Wherein, as those skilled in the art know, obtaining VM (vi )2 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0178] S554, according to VL (vi)3 11 With VK (vj) Obtain VM (vi)3 11 Wherein, as those skilled in the art know, obtaining VM (vi )3 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0179] S555, according to VL (vi)4 11 With VK (vj) Obtain VM (vi)4 11 Wherein, as those skilled in the art know, obtaining VM (vi )4 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0180] S556, According to VL (vi)5 11With VK (vj) Obtain VM (vi)5 11 Wherein, as those skilled in the art know, obtaining VM (vi )5 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0181] S557, according to VL (vi)6 11 With VK (vj) Obtain VM (vi)6 11 Wherein, as those skilled in the art know, obtaining VM (vi )6 11 Methods and ways to obtain VM (vi)6 11 The method is the same, so I will not repeat it here.

[0182] S558, according to VL (vi)7 11 With VK (vj) Obtain VM (vi)7 11 Wherein, as those skilled in the art know, obtaining VM (vi )7 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0183] S559, according to VL (vi)8 11 With VK (vj) Obtain VM (vi)8 11 Wherein, as those skilled in the art know, obtaining VM (vi )8 11 Methods and ways to obtain VM (vi)1 11 The method is the same, so I will not repeat it here.

[0184] The above describes how obtaining the string similarity between the first coordinate string and the second coordinate string and comparing the string similarity can accurately obtain the first feature identifier. Combining the first feature identifier with the first preset feature identifier in the first preset algorithm list or the second preset feature identifier in the preset algorithm list for processing can more accurately obtain the object identifier corresponding to the object type, thereby improving the accuracy of object classification.

[0185] S56, when VG 11To identify "-2", retrieve VB. 11 The object identifier in the context.

[0186] Specifically, the identifier "-2" indicates that the first preset algorithm is used.

[0187] Specifically, step S56 includes the following steps:

[0188] S561. Obtain the first preset algorithm list VP = {VP1, ..., VP1} (ve) ..., VP (vf)}, VP (ve) ={VP (ve)1 VP (ve)2}, VP (ve)1 ={VP 1 (ve)1 VP 2 (ve)1 VP 3 (ve)1 VP 4 (ve)1 VP 5 (ve)1 VP 6 (ve)1 VP 7 (ve)1 VP 8 (ve)1}, VP 1 (ve)1 For the first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset calculation list, VP 2 (ve)1 VP is the second first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 3 (ve)1 VP is the third first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 4 (ve)1 VP is the fourth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 5 (ve)1 VP is the fifth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 6 (ve)1 VP is the sixth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 7 (ve)1VP is the seventh first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 8 (ve)1 For the eighth first preset feature identifier in the first preset feature identifier list of the (ve)th record in the first preset algorithm list, VP (ve)2 VP (ve)1 The corresponding first preset algorithm, (ve) = 1...(vf), where (vf) is the number of records in the first preset algorithm list. As those skilled in the art know, the first preset feature identifier and the first preset algorithm in the first preset algorithm list are set by those skilled in the art according to actual needs.

[0189] S563, according to VM (vi) 11 and VP (ve)1 Acquisition, VM (vi) 11 With VP (ve)1 List similarity between VW (vi)(ve) 11 .

[0190] Specifically, step S563 includes the following steps:

[0191] S10. When (vb)∈[1,8], obtain VM. (vi)(vb) 11 With VP (vb) (ve)1 Similarity between identifiers VZ (vi )(vb) 11(ve) As those skilled in the art will know, the method for obtaining identifier similarity is the same as the method for obtaining string similarity, and will not be described in detail here.

[0192] S30, according to VZ (vi)(vb) 11(ve) Get VW (vi)(ve) 11 Among them, VW (vi)(ve) 11 The following conditions must be met:

[0193] VW (vi)(ve) 11 =(Σ 8 (vb)＝1 VZ (vi)(vb) 11(ve) ) / 8.

[0194] S565, when VW (vi)(ve) 11 When = 1, execute VP. (ve)2 Get VB 11 The object identifier in the context.

[0195] As described above, based on the first type identifier of the object type, the first feature identifier and the first preset feature identifier in the first preset algorithm list are selected for processing to obtain the object identifier corresponding to the object type, which helps to improve the accuracy of object classification.

[0196] S57, when VG 11 To identify "-3", retrieve VB. 11 The object identifier in the context.

[0197] Specifically, the identifier "-3" indicates that the second preset algorithm is used.

[0198] Specifically, step S57 includes the following steps:

[0199] S571. Obtain the second preset algorithm list VQ = {VQ1, ..., VQ} (vg) ..., VQ (vh) VQ (vg) ={VQ (vg)1 VQ (vg)2 VQ (vg)1 ={VQ 1 (vg)1 VQ 2 (vg)1 VQ 3 (vg)1 VQ 4 (vg)1 VQ 5 (vg)1 VQ 6 (vg)1 VQ 7 (vg)1 VQ 8 (vg)1 VQ 1 (vg)1 VQ is the first second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset calculation list. 2 (vg)1 VQ is the second second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. 3 (vg)1 VQ is the third second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. 4 (vg)1 VQ is the fourth second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. 5 (vg)1VQ is the fifth second preset feature identifier in the second preset feature identifier list of the (vg)th record in the second preset algorithm list. 6 (vg)1 VQ is the sixth second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. 7 (vg)1 VQ is the seventh second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. 8 (vg)1 VQ is the eighth second preset feature identifier in the second preset feature identifier list of the (vg)th record of the second preset algorithm list. (vg)2 For VQ (vg)1 The corresponding second preset algorithm, (vg) = 1...(vh), where (vh) is the number of records in the second preset algorithm list. As those skilled in the art know, the second preset feature identifier and the second preset algorithm in the second preset algorithm list are set by those skilled in the art according to actual needs.

[0200] S573, according to VM (vi) 11 and VQ (vg)1 Acquisition, VM (vi) 11 With VQ (vg)1 List similarity VU (vi)(vg) 11 Those skilled in the art will know that obtaining VU (vi)(vg) 11 Methods and ways to obtain VW (vi)(ve) 11 The method is the same, so I will not repeat it here.

[0201] S575, when VU (vi)(vg) 11 When = 1, execute VQ. (vg)2 Get VB 11 The object identifier in the context.

[0202] As described above, by selecting the first type identifier of the object type and processing the first feature identifier and the second preset feature identifier in the second preset algorithm list to obtain the object identifier corresponding to the object type, it is beneficial to improve the accuracy of object classification.

[0203] S6. Obtain VB 12 VB 13 VB 14 VB 21 VB 22 VB 23 VB 24 VB 25VB 26 VB 31 VB 32 VB 33 VB 41 VB 42 VB 43 VB 44 VB 45 The object identifier in the VB file, which is known to those skilled in the art, is used to obtain VB. 12 VB 13 VB 14 VB 21 VB 22 VB 23 VB 24 VB 25 VB 26 VB 31 VB 32 VB 33 VB 41 VB 42 VB 43 VB 44 VB 45 The methods of object identification and retrieval in VB 11 The object identification method is the same as in the previous section, so it will not be repeated here.

[0204] The above process of processing the first type identifier and the first feature text of the object type to obtain the object identifier corresponding to the object type, and obtaining the number of objects corresponding to the object type based on the object identifier, helps to improve the accuracy of object classification.

[0205] S300. Obtain the list of objects corresponding to VA: VC = {VC1, VC2, VC3, VC4}, VC1 = {VC...} 11 VC 12 VC 13 VC 14}, VC2={VC 21 VC 22 VC 23 VC 24 VC 25 VC 26}, VC3 = {VC 31 VC 32 VC 33}, VC4 = {VC 41 VC 42 VC 43 VC 44 VC 45}, VC 11 For VA 11The corresponding number of objects, VC 12 For VA 12 The corresponding number of objects, VC 13 For VA 13 The corresponding number of objects, VC 14 For VA 14 The corresponding number of objects, VC 21 For VA 21 The corresponding number of objects, VC 22 For VA 22 The corresponding number of objects, VC 23 For VA 23 The corresponding number of objects, VC 24 For VA 24 The corresponding number of objects, VC 25 For VA 25 The corresponding number of objects, VC 26 For VA 26 The corresponding number of objects, VC 31 For VA 31 The corresponding number of objects, VC 32 For VA 32 The corresponding number of objects, VC 33 For VA 33 The corresponding number of objects, VC 34 For VA 34 The corresponding number of objects, VC 41 For VA 41 The corresponding number of objects, VC 42 For VA 42 The corresponding number of objects, VC 43 For VA 43 The corresponding number of objects, VC 44 For VA 44 The corresponding number of objects, VC 45 For VA 45 The corresponding number of objects, wherein the number of objects is the number of object identifiers in the object identifier list. As those skilled in the art know, any method in the prior art for obtaining the number of data items in a data list is within the protection scope of this invention, and will not be elaborated here.

[0206] S400. Based on VB and VC, obtain the object information list corresponding to VA: VD = {VD1, VD2, VD3, VD4}, VD1 = {VD... 11 VD 12 VD 13 VD 14}, VD2={VD 21 VD 22 VD 23 VD 24 VD25 VD 26},VD3={VD 31 VD 32 VD 33},VD4={VD 41 VD 42 VD 43 VD 44 VD 45},VD 11 ={VB 11 ,YOU 11},VD 12 ={VB 12 ,YOU 12},VD 13 ={VB 13 ,YOU 13},VD 14 ={VB 14 ,YOU 14},VD 21 ={VB 21 ,YOU 21},VD 22 ={VB 22 ,YOU 22},VD 23 ={VB 23 ,YOU 23},VD 24 ={VB 24 ,YOU 24},VD 25 ={VB 25 ,YOU 25},VD 26 ={VB 26 ,YOU 26},VD 31 ={VB 31 ,YOU 31},VD 32 ={VB 32 ,YOU 32},VD 33 ={VB 33 ,YOU 33},VD 41 ={VB 41 ,YOU 41},VD 42 ={VB 42 ,YOU 42},VD 43 ={VB 43 ,YOU 43},VD 44 ={VB 44VC 44}, VD 45 ={VB 45 VC 45}, VD 11 For VA 11 Corresponding object information, VD 12 For VA 12 Corresponding object information, VD 13 For VA 13 Corresponding object information, VD 14 For VA 14 Corresponding object information, VD 21 For VA 21 Corresponding object information, VD 22 For VA 22 Corresponding object information, VD 23 For VA 23 Corresponding object information, VD 24 For VA 24 Corresponding object information, VD 25 For VA 25 Corresponding object information, VD 26 For VA 26 Corresponding object information, VD 31 For VA 31 Corresponding object information, VD 32 For VA 32 Corresponding object information, VD 33 For VA 33 Corresponding object information, VD 34 For VA 34 Corresponding object information, VD 41 For VA 41 Corresponding object information, VD 42 For VA 42 Corresponding object information, VD 43 For VA 43 Corresponding object information, VD 44 For VA 44 Corresponding object information, VD 45 For VA 45 The corresponding object information includes a list of object identifiers and the number of object identifiers.

[0207] This invention provides a data processing system for object classification, comprising: a target geographic region, a first geographic region, a second geographic region, a third geographic region, a processor, and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps: obtaining a list of object types corresponding to the target geographic region; obtaining a list of object identifiers corresponding to the list of object types; obtaining a list of object quantities corresponding to the list of object types; and obtaining a list of object information corresponding to the list of object types based on the list of object identifiers and the object quantities. It can be seen that this invention sets multiple object types with relatively small scopes, processes data collected by all devices capable of collecting object information within the target region, and processes the registered object information to obtain object identifiers and corresponding object features within the target region. Processing the object features of the object identifiers further yields the object identifiers and object quantities corresponding to the object types, which helps improve the accuracy of object classification.

[0208] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the examples are for illustrative purposes only and not intended to limit the scope of the invention. It should also be understood that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A data processing system for object classification, characterized in that, The system includes: a target geographic area, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are performed: S100. Obtain the object type list corresponding to the target geographic region: VA={VA1, VA2, VA3, VA4}, VA1={VA... 11 VA 12 VA 13 VA 14 }, VA2={VA 21 VA 22 VA 23 VA 24 VA 25 VA 26 }, VA3={VA 31 VA 32 VA 33 }, VA4={VA 41 VA 42 VA 43 VA 44 VA 45 }, VA 11 The type of the first registered object in the list of registered object types, VA 12 VA is the second registered object type in the list of registered object types. 13 VA is the third registered object type in the list of registered object types. 14 VA is the fourth registered object type in the list of registered object types. 21 VA is the first non-fixed object type in the list of non-fixed object types. 22 VA is the second non-fixed object type in the list of non-fixed object types. 23 VA is the third non-fixed object type in the list of non-fixed object types. 24 VA is the fourth non-fixed object type in the list of non-fixed object types. 25 VA is the fifth non-fixed object type in the list of non-fixed object types. 26 VA is the sixth non-fixed object type in the list of non-fixed object types. 31 As the first external object type in the list of external object types, VA 32 As the second external object type in the list of external object types, VA 33 VA is the third external object type in the list of external object types. 41 VA is the first of the list of other object types in the list of other object types. 42 VA is the second list of other object types in the list of other object types. 43 VA is the third other object type in the list of other object types. 44 VA is the fourth other object type in the list of other object types. 45 The fifth of the list of other object types; S200. Obtain the object identifier list corresponding to VA: VB={VB1, VB2, VB3, VB4}, VB1={VB 11 VB 12 VB 13 VB 14 }, VB2={VB 21 VB 22 VB 23 VB 24 VB 25 VB 26 }, VB3={VB 31 VB 32 VB 33 }, VB4={VB 41 VB 42 VB 43 VB 44 VB 45 }, VB 11 For VA 11 The corresponding object identifier list, VB 12 For VA 12 The corresponding object identifier list, VB 13 For VA 13 The corresponding object identifier list, VB 14 For VA 14 The corresponding object identifier list, VB 21 For VA 21 The corresponding object identifier list, VB 22 For VA 22 The corresponding object identifier list, VB 23 For VA 23 The corresponding object identifier list, VB 24 For VA 24 The corresponding object identifier list, VB 25 For VA 25 The corresponding object identifier list, VB 26 For VA 26 The corresponding object identifier list, VB 31 For VA 31 The corresponding object identifier list, VB 32 For VA 32 The corresponding object identifier list, VB 33 For VA 33 The corresponding object identifier list, VB 34 For VA 34 The corresponding object identifier list, VB 41 For VA 41 The corresponding object identifier list, VB 42 For VA 42 The corresponding object identifier list, VB 43 For VA 43 The corresponding object identifier list, VB 44 For VA 44 The corresponding object identifier list, VB 45 For VA 45 The corresponding object identifier list includes the following steps S1-S6: S1, Obtain VA 11 The corresponding first time point, where VA 11 The corresponding first time point is the va time points preceding the current time point; S2, Obtain VA 11 The corresponding first intermediate object identifier list VE 11 ={VE 1 11 , ..., VE (vi) 11 , ..., VE (vm) 11 }, VE (vi) 11 For VA 11 The corresponding first intermediate object identifier is (vi), (vi) = 1...(vm), where (vm) is a VA. 11 The corresponding number of first intermediate object identifiers; S3, Obtain VE 11 The corresponding first feature text list VF 11 ={VF 1 11 , ..., VF (vi) 11 , ..., VF (vm) 11 }, VF (vi) 11 ={VF (vi)1 11 VF (vi)2 11 VF (vi)3 11 VF (vi)4 11 VF (vi)5 11 VF (vi)6 11 VF (vi)7 11 VF (vi)8 11 }, VF (vi)1 11 In order to be able to present VE (vi) 11 The text corresponding to the landing point of the first intermediate object, VF (vi)2 11 In order to be able to present VE (vi) 11 The text of the working address of the corresponding first intermediate object, VF (vi)3 11 In order to be able to present VE (vi) 11 The text of the residential address of the corresponding first intermediate object, VF (vi)4 11 For VE (vi) 11 The first registration information of the corresponding first intermediate object, VF (vi)5 11 For VE (vi) 11 The second registration information corresponding to the first intermediate object, VF (vi)6 11 For VE (vi) 11 The fourth registration information corresponding to the first intermediate object, VF (vi )7 11 In order to be able to present VE (vi) 11 The first registration information of the corresponding first intermediate object is the text on the first platform corresponding to the second geographical region, VF (vi)8 11 In order to be able to present VE (vi) 11 The corresponding first intermediate object is text belonging to the fourth other object type; S4, Obtain VA 11 The corresponding first type identifier VG 11 ; S5, according to VG 11 and VF 11 Get VB 11 The object identifier in the process includes the following steps S51-S57: S51, VF 11 Input into the preset map platform to obtain VF 11 The corresponding feature coordinate list VH 11 ={VH 1 11 , ..., VH (vi) 11 , ..., VH (vm) 11 }, VH (vi) 11 ={VH (vi)1 11 VH (vi)2 11 VH (vi)3 11 VH (vi)4 11 VH (vi)5 11 VH (vi)6 11 VH (vi )7 11 VH (vi)8 11 }, VH (vi)1 11 For VF (vi)1 11 The corresponding feature coordinates, VH (vi)2 11 For VF (vi)2 11 The corresponding feature coordinates, VH (vi)3 11 For VF (vi)3 11 The corresponding feature coordinates, VH (vi)4 11 For VF (vi)4 11 The corresponding feature coordinates, VH (vi)5 11 For VF (vi)5 11 The corresponding feature coordinates, VH (vi)6 11 For VF (vi)6 11 The corresponding feature coordinates, VH (vi)7 11 For VF (vi)7 11 The corresponding feature coordinates, VH (vi)8 11 For VF (vi)8 11 The corresponding feature coordinates; S52. Process the feature coordinates using the geohash algorithm to obtain VH. 11 The corresponding first coordinate string list VL 11 ={VL 1 11 , ..., VL (vi) 11 , ..., VL (vm) 11 }, VL (vi) 11 ={VL (vi)1 11 VL (vi)2 11 VL (vi)3 11 VL (vi)4 11 VL (vi)5 11 VL (vi)6 11 VL (vi)7 11 VL (vi)8 11 }, VL (vi)1 11 For VH (vi)1 11 The corresponding first coordinate string, VL (vi)2 11 For VH (vi)2 11 The corresponding first coordinate string, VL (vi)3 11 For VH (vi)3 11 The corresponding first coordinate string, VL (vi)4 11 For VH (vi)4 11 The corresponding first coordinate string, VL (vi)5 11 For VH (vi)5 11 The corresponding first coordinate string, VL (vi)6 11 For VH (vi)6 11 The corresponding first coordinate string, VL (vi)7 11 For VH (vi)7 11 The corresponding first coordinate string, VL (vi)8 11 For VH (vi)8 11 The corresponding first coordinate string; S53. Input the geographical name corresponding to the target geographical area into the preset map platform to obtain the specified coordinate range corresponding to the target geographical area; S54. Process the specified coordinate range according to the geohash algorithm to obtain the second coordinate string list VK={VK1, ..., VK} corresponding to the specified coordinate range. (vj) ..., VK (vn) VK (vj) This is the (vj)th second coordinate string corresponding to the specified coordinate range, where (vj) = 1...(vn), and (vn) is the number of second coordinate strings corresponding to the specified coordinate range. S55, according to VL (vi) 11 And VK, obtain VL (vi) 11 The corresponding first feature identifier list VM (vi) 11 ={VM (vi)1 11 VM (vi )2 11 VM (vi)3 11 VM (vi)4 11 VM (vi)5 11 VM (vi)6 11 VM (vi)7 11 VM (vi)8 11 VM (vi)1 11 VL (vi)1 11 The corresponding first feature identifier, VM (vi)2 11 VL (vi)2 11 The corresponding first feature identifier, VM (vi)3 11 VL (vi)3 11 The corresponding first feature identifier, VM (vi)4 11 VL (vi)4 11 The corresponding first feature identifier, VM (vi)5 11 VL (vi)5 11 The corresponding first feature identifier, VM (vi )6 11 For VL (vi)6 11 The corresponding first feature identifier, VM (vi)7 11 VL (vi)7 11 The corresponding first feature identifier, VM (vi)8 11 VL (vi)8 11 The corresponding first feature identifier; S56, when VG 11 To identify "-2", retrieve VB. 11 The object identifier in; S57, when VG 11 To identify "-3", retrieve VB. 11 The object identifier in; S6. Obtain VB 12 VB 13 VB 14 VB 21 VB 22 VB 23 VB 24 VB 25 VB 26 VB 31 VB 32 VB 33 VB 41 VB 42 VB 43 VB 44 VB 45 The object identifier in; S300. Obtain the list of objects corresponding to VA: VC = {VC1, VC2, VC3, VC4}, VC1 = {VC...} 11 VC 12 VC 13 VC 14 }, VC2={VC 21 VC 22 VC 23 VC 24 VC 25 VC 26 }, VC3={VC 31 VC 32 VC 33 }, VC4={VC 41 VC 42 VC 43 VC 44 VC 45 }, VC 11 For VA 11 The corresponding number of objects, VC 12 For VA 12 The corresponding number of objects, VC 13 For VA 13 The corresponding number of objects, VC 14 For VA 14 The corresponding number of objects, VC 21 For VA 21 The corresponding number of objects, VC 22 For VA 22 The corresponding number of objects, VC 23 For VA 23 The corresponding number of objects, VC 24 For VA 24 The corresponding number of objects, VC 25 For VA 25 The corresponding number of objects, VC 26 For VA 26 The corresponding number of objects, VC 31 For VA 31 The corresponding number of objects, VC 32 For VA 32 The corresponding number of objects, VC 33 For VA 33 The corresponding number of objects, VC 34 For VA 34 The corresponding number of objects, VC 41 For VA 41 The corresponding number of objects, VC 42 For VA 42 The corresponding number of objects, VC 43 For VA 43 The corresponding number of objects, VC 44 For VA 44 The corresponding number of objects, VC 45 For VA 45 The corresponding number of objects, where the number of objects is the number of object identifiers in the object identifier list; S400. Based on VB and VC, obtain the object information list corresponding to VA: VD={VD1, VD2, VD3, VD4}, VD1={VD... 11 VD 12 VD 13 VD 14 }, VD2={VD 21 VD 22 VD 23 VD 24 VD 25 VD 26 }, VD3={VD 31 VD 32 VD 33 }, VD4={VD 41 VD 42 VD 43 VD 44 VD 45 }, VD 11 ={VB 11 VC 11 }, VD 12 ={VB 12 VC 12 }, VD 13 ={VB 13 VC 13 }, VD 14 ={VB 14 VC 14 }, VD 21 ={VB 21 VC 21 }, VD 22 ={VB 22 VC 22 }, VD 23 ={VB 23 VC 23 }, VD 24 ={VB 24 VC 24 }, VD 25 ={VB 25 VC 25 }, VD 26 ={VB 26 VC 26 }, VD 31 ={VB 31 VC 31 }, VD 32 ={VB 32 VC 32 }, VD 33 ={VB 33 VC 33 }, VD 41 ={VB 41 VC 41 }, VD 42 ={VB 42 VC 42 }, VD 43 ={VB 43 VC 43 }, VD 44 ={VB 44 VC 44 }, VD 45 ={VB 45 VC 45 }, VD 11 For VA 11 Corresponding object information, VD 12 For VA 12 Corresponding object information, VD 13 For VA 13 Corresponding object information, VD 14 For VA 14 Corresponding object information, VD 21 For VA 21 Corresponding object information, VD 22 For VA 22 Corresponding object information, VD 23 For VA 23 Corresponding object information, VD 24 For VA 24 Corresponding object information, VD 25 For VA 25 Corresponding object information, VD 26 For VA 26 Corresponding object information, VD 31 For VA 31 Corresponding object information, VD 32 For VA 32 Corresponding object information, VD 33 For VA 33 Corresponding object information, VD 34 For VA 34 Corresponding object information, VD 41 For VA 41 Corresponding object information, VD 42 For VA 42 Corresponding object information, VD 43 For VA 43 Corresponding object information, VD 44 For VA 44 Corresponding object information, VD 45 For VA 45 The corresponding object information includes a list of object identifiers and the number of object identifiers.

2. The data processing system for object classification according to claim 1, characterized in that, The target geographic area is the geographic area at a certain geographic management level of district.

3. The data processing system for object classification according to claim 1, characterized in that, Step S2 includes the following steps: S21. Obtain the list of first key object identifiers corresponding to the target geographic region. The list of first key object identifiers includes several first key object identifiers. The first key object identifier is the object identifier corresponding to any first registration information on the first platform corresponding to the target geographic region. S22. Obtain the list of second key object identifiers corresponding to the target geographic region. The list of second key object identifiers includes several second key object identifiers. The second key object identifier is the object identifier corresponding to any second registration information on the second platform corresponding to the target geographic region. S23. Obtain the list of third key object identifiers corresponding to the target geographic region. The list of third key object identifiers includes several third key object identifiers. The third key object identifier is the object identifier corresponding to any third registration information on the third platform corresponding to the target geographic region. S24. Obtain the list of fourth key object identifiers corresponding to the target geographic region. The list of fourth key object identifiers includes several fourth key object identifiers. The fourth key object identifier is the object identifier corresponding to any fourth registration information on the fourth platform corresponding to the target geographic region. S25. Obtain the list of fifth key object identifiers corresponding to the target geographic area. The list of fifth key object identifiers includes several fifth key object identifiers. The fifth key identifier is any object identifier collected by any device in the target geographic area that can collect object identifiers. S26. Insert the object identifiers from the first key object identifier list, the second key object identifier list, the third key object identifier list, the fourth key object identifier list, and the fifth key object identifier list into an empty list and perform deduplication to obtain the first intermediate object identifier list.

4. The data processing system for object classification according to claim 1, characterized in that, Step S55 includes the following steps: S551, Obtain VL (vi)1 11 With VK (vj) String similarity VN between (vi)1 11(vj) ; S552, when any VN (vi)1 11(vj) When =1, a VM is generated. (vi)1 11 The identifier is "-1"; otherwise, a VM is generated. (vi)1 11 To identify "0"; S553, according to VL (vi)2 11 With VK (vj) Obtain VM (vi)2 11 ; S554, according to VL (vi)3 11 With VK (vj) Obtain VM (vi)3 11 ; S555, according to VL (vi)4 11 With VK (vj) Obtain VM (vi)4 11 ; S556, According to VL (vi)5 11 With VK (vj) Obtain VM (vi)5 11 ; S557, according to VL (vi)6 11 With VK (vj) Obtain VM (vi)6 11 ; S558, according to VL (vi)7 11 With VK (vj) Obtain VM (vi)7 11 ; S559, according to VL (vi)8 11 With VK (vj) Obtain VM (vi)8 11 .

5. The data processing system for object classification according to claim 1, characterized in that, Step S56 includes the following steps: S561. Obtain the first preset algorithm list VP={VP1, ..., ...2, ..., VP3, ..., VP4, ..., VP5, ... (ve) ..., VP (vf) }, VP (ve) ={VP (ve)1 VP (ve)2 }, VP (ve)1 ={VP 1 (ve)1 VP 2 (ve)1 VP 3 (ve)1 VP 4 (ve)1 VP 5 (ve)1 VP 6 (ve)1 VP 7 (ve)1 VP 8 (ve)1 }, VP 1 (ve)1 For the first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset calculation list, VP 2 (ve)1 VP is the second first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 3 (ve)1 VP is the third first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 4 (ve)1 VP is the fourth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 5 (ve)1 VP is the fifth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 6 (ve)1 VP is the sixth first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 7 (ve)1 VP is the seventh first preset feature identifier in the first preset feature identifier list of the (ve)th record of the first preset algorithm list. 8 (ve)1 For the eighth first preset feature identifier in the first preset feature identifier list of the (ve)th record in the first preset algorithm list, VP (ve)2 VP (ve)1 The corresponding first preset algorithm, (ve) = 1……(vf), where (vf) is the number of records in the first preset algorithm list; S563, according to VM (vi) 11 and VP (ve)1 Acquisition, VM (vi) 11 With VP (ve)1 List similarity between VW (vi)(ve) 11 ; S565, when VW (vi)(ve) 11 When =1, execute VP. (ve)2 Get VB 11 The object identifier in the file.

6. The data processing system for object classification according to claim 5, characterized in that, Step S563 includes the following steps: S10, when (vb) When [1, 8], obtain VM (vi)(vb) 11 With VP (vb) (ve)1 Similarity between identifiers VZ (vi)(vb) 11(ve) ; S30, according to VZ (vi)(vb) 11(ve) Get VW (vi)(ve) 11 Among them, VW (vi)(ve) 11 Meets the following conditions: VW (vi)(ve) 11 =(Σ 8 (vb)=1 VZ (vi)(vb) 11(ve) ) / 8。

Images