Registration and maintenance of address data for each service point in a territory

• US 20070282900A1
• Filed: 01/27/2006
• Published: 12/06/2007
• Est. Priority Date: 01/28/2005
• Status: Active Grant

• Current Assignee: United Parcel Service Of America Incorporated (United Parcel Service Incorporated)
• Original Assignee: United Parcel Service Of America Incorporated (United Parcel Service Incorporated)
• Inventors: Anderson, Duane, Owens, Timothy
• Granted Patent: US 7,542,972 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2465 Query processing support for facilitating data mining operations in structured databases
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06Q 10/063 Operations research, analysis or management
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 30/0283 Price estimation or determination
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99936 Pattern matching access

Abstract

A computer system and method is disclosed for mining current and archived address data in order to identify a preferred address for each service point in a territory. The data mining system may start in response to the presentation of a candidate address for matching. The set of mined data may be prioritized by clustering like characteristics, building similarity matrices, and by constructing dendrograms with nodes joined according to common characteristics. A computer system and method for maintaining a central database of preferred addresses is also disclosed. Selected address data gathered in a queue may be scored by characteristic, grouped by consignee location, and staged for processing. The scored queue of data may be prioritized by clustering like characteristics, building similarity matrices, and by constructing dendrograms.

Claims

1. A method of mining address data to locate a preferred address for each of a plurality of parcels, comprising:

maintaining a package-level detail database of active shipment records, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code;

maintaining an archive of delivery records, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier;

receiving a current parcel bearing address indicia;

assigning a mining key to said current parcel, said mining key comprising a parcel tracking number and a current delivery pattern code related to said address indicia;

comparing said mining key to said package-level detail database and said archive by;

(a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address;

(b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records;

building a set of mined data comprising said select delivery records and said select active shipment records;

prioritizing said set of mined data in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first; and

assigning said preferred address to said current parcel for delivery.

2. The method of claim 1, wherein said step of comparing further comprises:

(c) retrieving from said archive those additional delivery records having a past delivery pattern code that matches any said current delivery pattern code in said select active shipment records, each of said additional delivery records having an additional past ship-to address;

(d) retrieving from said package-level detail database those additional active shipment records having an active ship-to address that matches any said select additional ship-to address in said additional delivery records; and

repeating steps (c) and (d) in a plurality of iterations until said step of building a set of mined data reaches a limit condition.

3. The method of claim 1, further comprising:

selecting said preferred address as a preferred consignee address for a single consignee location;

assigning a unique consignee token related to said single consignee location; and

storing said unique consignee token and said preferred consignee address in a master address database.

4. The method of claim 1, wherein said step of prioritizing said set of mined data comprises:

replacing one or more sequence values in a plurality of ship-to address records stored in said set of mined data with a representative symbol;

clustering together those said ship-to address records having the same stop identifier; and

clustering together those said ship-to address records having the same delivery pattern code.

5. The method of claim 4, wherein said step of prioritizing said set of mined data further comprises:

building a delivery pattern similarity matrix by counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data;

summing the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses;

building a stop identifier similarity matrix by counting the coincidence of each stop identifier and each ship-to address within said set of mined data;

summing the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and

sorting said set of mined data in order the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences.

6. The method of claim 5, wherein said step of prioritizing said set of mined data further comprises:

converting said stop identifier similarity matrix into a stop identifier dendrogram;

constructing a stop-joined dendrogram by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, summing said number of occurrences to form a joined stop node, and by joining the next stop pair of ship-to addresses or joined stop nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next stop pair is zero;

converting said delivery pattern similarity matrix into a delivery pattern dendrogram; and

constructing a pattern-joined dendrogram by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, using the minimum of said number of occurrences to form a joined pattern node, and by joining the next pattern pair of ship-to addresses or joined pattern nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next pattern pair is zero.

7. The method of claim 1, wherein said step of assigning said preferred address to said current parcel for delivery comprises:

presenting said set of mined data to an address database administrator; and

receiving a selection of said preferred address by said administrator.

8. A method of scoring and maintaining address data for any of a plurality of records in an address database, comprising:

maintaining a package-level detail database of active shipment records, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code;

maintaining an archive of delivery records, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier;

gathering address data from said detail database and said archive into a queue for a period of days;

scoring said address data in said queue;

building a consignee staging queue for storing those data in said queue related to a select consignee location;

assigning a mining key to a current parcel selected from said consignee staging queue, said mining key comprising a parcel tracking number and a current delivery pattern code;

comparing said mining key to said package-level detail database and said archive by;

(a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address;

(b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records;

building a set of mined data comprising said select delivery records and said select active shipment records;

prioritizing said set of mined data in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first; and

assigning said preferred address to said current parcel and updating said address database.

9. The method of claim 8, wherein said step of comparing further comprises:

(c) retrieving from said archive those additional delivery records having a past delivery pattern code that matches any said current delivery pattern code in said select active shipment records, each of said additional delivery records having an additional past ship-to address;

(d) retrieving from said package-level detail database those additional active shipment records having an active ship-to address that matches any said select additional ship-to address in said additional delivery records; and

repeating steps (c) and (d) in a plurality of iterations until said step of building a set of mined data reaches a limit condition.

10. The method of claim 8, further comprising:

selecting said preferred address as a preferred consignee address for a single consignee location;

assigning a unique consignee token related to said single consignee location; and

storing said unique consignee token and said preferred consignee address in a master address database.

11. The method of claim 8, wherein said step of prioritizing said set of mined data comprises:

replacing one or more sequence values in a plurality of ship-to address records stored in said set of mined data with a representative symbol;

clustering together those said ship-to address records having the same stop identifier; and

clustering together those said ship-to address records having the same delivery pattern code.

12. The method of claim 11, wherein said step of prioritizing said set of mined data further comprises:

building a delivery pattern similarity matrix by counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data;

summing the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses;

building a stop identifier similarity matrix by counting the coincidence of each stop identifier and each ship-to address within said set of mined data;

summing the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and

sorting said set of mined data in order the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences.

13. The method of claim 12, wherein said step of prioritizing said set of mined data further comprises:

converting said stop identifier similarity matrix into a stop identifier dendrogram;

constructing a stop-joined dendrogram by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, summing said number of occurrences to form a joined stop node, and by joining the next stop pair of ship-to addresses or joined stop nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next stop pair is zero;

converting said delivery pattern similarity matrix into a delivery pattern dendrogram; and

constructing a pattern-joined dendrogram by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, using the minimum of said number of occurrences to form a joined pattern node, and by joining the next pattern pair of ship-to addresses or joined pattern nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next pattern pair is zero.

14. The method of claim 8, wherein said step of scoring said address data in said queue comprises:

generating a count table for the number of occurrences of each of a plurality of delivery conditions on each day of said period;

calculating for each stop identifier a measure number for each of a plurality of corresponding outcomes, based upon said count table and a plurality of measure equations; and

building an output message for each parcel tracking number based upon said measure number and said corresponding outcome.

15. The method of claim 8, wherein said step of assigning said preferred address to said current parcel and updating said address database comprises:

presenting said set of mined data to an address database administrator; and

receiving a selection of said preferred address by said administrator.

16. A system for locating a preferred address for each of a plurality of parcels, comprising:

a package-level detail database of active shipment records, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code;

an archive of delivery records, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier;

a current parcel bearing address indicia;

a mining key assigned to said current parcel, said mining key comprising a parcel tracking number and a current delivery pattern code related to said address indicia;

an association process for comparing said mining key to said package-level detail database and said archive by;

(a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address;

(b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records;

a set of mined data comprising said select delivery records and said select active shipment records, said set of mined data prioritized in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first; and

an address database administrator for assigning said preferred address to said current parcel for delivery.

17. The system of claim 16, wherein said association process further comprises:

(c) retrieving from said archive those additional delivery records having a past delivery pattern code that matches any said current delivery pattern code in said select active shipment records, each of said additional delivery records having an additional past ship-to address;

(d) retrieving from said package-level detail database those additional active shipment records having an active ship-to address that matches any said select additional ship-to address in said additional delivery records; and

repeating steps (c) and (d) in a plurality of iterations until said step of building a set of mined data reaches a limit condition.

18. The system of claim 16, further comprising a unique consignee token related to a single consignee location associated with said preferred address.

19. The system of claim 16, wherein said set of mined data further comprises:

a plurality of ship-to address records having a representative symbol in place of one or more sequence values;

clusters of said ship-to address records having the same stop identifier; and

clusters of said ship-to address records having the same delivery pattern code.

20. The system of claim 19, further comprising:

a delivery pattern similarity matrix built upon a counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data;

a sum of the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses;

a stop identifier similarity matrix built upon a counting the coincidence of each stop identifier and each ship-to address within said set of mined data;

a sum of the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and

said set of mined data sorted in order the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences.

21. The system of claim 20, further comprising:

a stop identifier dendrogram built by converting said stop identifier similarity matrix;

a stop-joined dendrogram constructed by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, summing said number of occurrences to form a joined stop node, and by joining the next stop pair of ship-to addresses or joined stop nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next stop pair is zero;

a delivery pattern dendrogram built by converting said delivery pattern similarity matrix; and

a pattern-joined dendrogram constructed by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, using the minimum of said number of occurrences to form a joined pattern node, and by joining the next pattern pair of ship-to addresses or joined pattern nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next pattern pair is zero.

22. A system for scoring and maintaining address data for any of a plurality of records in an address database, comprising:

a package-level detail database of active shipment records, each active shipment record comprising an active tracking number, an active ship-to address, and an active delivery pattern code;

an archive of delivery records, each delivery record comprising a past tracking number, a past ship-to address, a past delivery pattern code, and a stop identifier;

a queue of address data gathered from said detail database and said archive for a period of days;

a scoring process for assigning a score to said address data in said queue;

a consignee staging queue for storing those data in said queue related to a select consignee location;

a mining key assigned to a current parcel selected from said consignee staging queue, said mining key comprising a parcel tracking number and a current delivery pattern code;

an association process for comparing said mining key to said package-level detail database and said archive by;

(a) retrieving from said archive those select delivery records having a past delivery pattern code that matches said current delivery pattern code, each of said select delivery records having a select past ship-to address;

(b) retrieving from said package-level detail database those select active shipment records having an active ship-to address that matches any said select past ship-to address in said select delivery records;

a set of mined data comprising said select delivery records and said select active shipment records, said set of mined data prioritized in order of the records most closely associated with said mining key, such that a preferred address related to said mining key occurs first; and

an address database administrator for assigning said preferred address to said current parcel and for updating said address database.

23. The system of claim 22, wherein said association process further comprises:

(c) retrieving from said archive those additional delivery records having a past delivery pattern code that matches any said current delivery pattern code in said select active shipment records, each of said additional delivery records having an additional past ship-to address;

(d) retrieving from said package-level detail database those additional active shipment records having an active ship-to address that matches any said select additional ship-to address in said additional delivery records; and

repeating steps (c) and (d) in a plurality of iterations until said step of building a set of mined data reaches a limit condition.

24. The system of claim 22, further comprising a unique consignee token related to a single consignee location associated with said preferred address.

25. The system of claim 22, wherein said set of mined data further comprises:

a plurality of ship-to address records having a representative symbol in place of one or more sequence values;

clusters of said ship-to address records having the same stop identifier; and

clusters of said ship-to address records having the same delivery pattern code.

26. The system of claim 25, further comprising:

a delivery pattern similarity matrix built upon a counting the coincidence of each delivery pattern code and each ship-to address within said set of mined data;

a sum of the overlapping delivery pattern occurrences within said delivery pattern similarity matrix for each pair of ship-to addresses;

a stop identifier similarity matrix built upon a counting the coincidence of each stop identifier and each ship-to address within said set of mined data;

a sum of the overlapping stop occurrences within said stop identifier similarity matrix for each pair of ship-to addresses; and

said set of mined data sorted in order the highest number of overlapping delivery pattern occurrences and the highest number of overlapping stop occurrences.

27. The system of claim 26, further comprising:

a stop identifier dendrogram built by converting said stop identifier similarity matrix;

a stop-joined dendrogram constructed by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, summing said number of occurrences to form a joined stop node, and by joining the next stop pair of ship-to addresses or joined stop nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next stop pair is zero;

a delivery pattern dendrogram built by converting said delivery pattern similarity matrix; and

a pattern-joined dendrogram constructed by joining the pair of ship-to addresses having the highest number of overlapping stop occurrences, using the minimum of said number of occurrences to form a joined pattern node, and by joining the next pattern pair of ship-to addresses or joined pattern nodes having the highest number of overlapping stop occurrences, by successive iterations, until said number of overlapping stop occurrences for each said next pattern pair is zero.

28. The system of claim 22, wherein scoring process for assigning a score to said address data in said queue further comprises:

a count table for storing the number of occurrences of each of a plurality of delivery conditions on each day of said period;

for each stop identifier, a measure number calculated and stored for each of a plurality of corresponding outcomes, based upon said count table and a plurality of measure equations; and

an output message constructed for each parcel tracking number based upon said measure number and said corresponding outcome.