Intelligent contact search using graph models
A system, method, and computer-readable medium are disclosed for improved searching of contact information that includes receiving a request for a member's contact information. An initial list of candidates is returned. Based on organizational charts, distances between candidates and a point of reference are calculated, calculation is made as to a number of messages that are exchanged between candidates and the point of reference. Scores are determined based on the calculations. The scores are aggregated, and a refined list of candidates' contact information based on the aggregated scores is returned.
1. A computer-implementable method for searching of contact information comprising:
receiving a request for a member's contact information;
returning an initial list of candidates;
calculating distance of the candidates to a point of reference on an organizational chart and assigning a score to the candidates based on distance, wherein a distance algorithm is used to determine lowest common ancestor (LCA) of the organizational chart represented as an n-nary tree;
calculating a number of email message exchanges between the candidates and the point of reference based on geographical location and generating a graph based on the number of email message exchanges and assigning scores to the candidates based on the email message exchanges, wherein the graph includes edges representing a number of message exchanges between the point of reference and candidates;
aggregating the scores based on the calculating distance and the graph;
refining the initial list of candidates based on the aggregating; and
mapping geographical location of the candidates and the point of reference and taking into account geographical location when aggregating scores.
2. The computer-implementable method of claim 1 , wherein the returning the list of candidates includes phonetically similar candidates.
3. The computer-implementable method of claim 1 , wherein the message exchanges are email messages.
4. The computer-implementable method of claim 1 , wherein the messages exchanges are taken over a period of time and taken periodically.
5. The computer-implementable method of claim 1 , wherein the aggregating the scores is adjusted based on feedback of choice of a user as to candidates.
6. A system comprising:
a processor;
a data bus coupled to the processor; and
a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for searching of contact information comprising instructions executable by the processor and configured for:
receiving a request for a member's contact information;
returning an initial list of candidates;
calculating distance of the candidates to a point of reference on an organizational chart and assigning a score to the candidates based on distance, wherein a distance algorithm is used to determine lowest common ancestor (LCA) of the organizational chart represented as an n-nary tree;
calculating a number of email message exchanges between the candidates and the point of reference based on geographical location and generating a graph based on the number of email message exchanges and assigning scores to the candidates based on the email message exchanges, wherein the graph includes edges representing a number of message exchanges between the point of reference and candidates;
aggregating the scores based on the calculating distance and the graph;
refining the initial list of candidates based on the aggregating; and
mapping geographical location of the candidates and the point of reference and taking into account geographical location when aggregating scores.
7. The system of claim 6 , wherein the returning the list of candidates includes phonetically similar candidates.
8. The system of claim 6 , wherein the message exchanges are email messages.
9. The system of claim 6 , wherein the messages exchanges are taken over a period of time and taken periodically.
10. The system of claim 6 , wherein the aggregating the scores is adjusted based on feedback of choice of a user as to candidates.
11. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
receiving a request for a member's contact information;
returning an initial list of candidates;
calculating distance of the candidates to a point of reference on an organizational chart and assigning a score to the candidates based on distance, wherein a distance algorithm is used to determine lowest common ancestor (LCA) of the organizational chart represented as an n-nary tree;
calculating a number of email message exchanges between the candidates and the point of reference based on geographical location and generating a graph based on the number of email message exchanges and assigning scores to the candidates based on the email message exchanges, wherein the graph includes edges representing a number of message exchanges between the point of reference and candidates;
aggregating the scores based on the calculating distance and the graph;
refining the initial list of candidates based on the aggregating; and
mapping geographical location of the candidates and the point of reference and taking into account geographical location when aggregating scores.
12. The non-transitory, computer-readable storage medium of claim 11 , wherein the returning the list of candidates includes phonetically similar candidates.
13. The non-transitory, computer-readable storage medium of claim 11 , wherein the messages are email messages.
14. The non-transitory, computer-readable storage medium of claim 11 , wherein the aggregating the scores is adjusted based on feedback of choice of a user as to candidates.