According to Metcalfe's Law, the value of a network grows exponentially with the number of the nodes in the network. This premise holds true for people networks as well as digital networks. Also, Reed's Law suggests that communities are composed of all the permutations of groups that can be formed within the overall population—a number that grows exponentially with the number of people in the population. Extracting the network value, however, can be a significant challenge. For instance, in an organization such as a medium or large corporation, much of the knowledge of the organization may be held by individuals, who may be considered subject matter experts (SMEs).
When members of an organization need to solve a problem, they seek out SMEs, typically relying on their own personal networks, or extending to their associates' networks. It is often the case that there is a relevant SME with the necessary knowledge, but that expert is outside the set of personal contacts reachable by the person seeking the knowledge. The knowledge or expertise of the SME is, therefore, not leveraged, and the optimal solution is either not achieved, or achieved at a greater cost and time. Moreover, location of the proper SMEs is often hindered by typical organizational hierarchies and time zones, limiting the contacts among the right people, who might not even know of each other's existence. Additionally, the faster pace of business and global competition requires faster development of solutions, further underscoring the need for quickly connecting the right people to address an opportunity.
The features and advantages of the inventions as well as additional features and advantages thereof will be more clearly understood hereinafter as a result of a detailed description of particular embodiments of the invention when taken in conjunction with the following drawings in which:
The following discussion is directed to various embodiments. Although one or more of these embodiments may be discussed in detail, the embodiments disclosed should not be interpreted, or otherwise used, as limiting the scope of the disclosure, including the claims. In addition, one skilled in the art will understand that the following description has broad application, and the discussion of any embodiment is meant only to be an example of that embodiment, and not intended to intimate that the scope of the disclosure, including the claims, is limited to that embodiment. Furthermore, as used herein, the designators “A”, “B” and “N” particularly with respect to the reference numerals in the drawings, indicate that a number of the particular feature so designated can be included with examples of the present disclosure. The designators can represent the same or different numbers of the particular features.
The figures herein follow a numbering convention in which the first digit or digits correspond to the drawing figure number and the remaining digits identify an element or component in the drawing. Similar elements or components between different figures may be identified by the user of similar digits. For example, 143 may reference element “43” in
Today, there is an increasing demand for faster time to decision in enterprises so that organizations can remain competitive by rapidly leveraging opportunities and/or responding to threats. One prior approach has been the development of applications for finding the right expert(s) for a specific request. Such applications often use linguistic analysis of content authored by experts, and infer their expertise. The outcome of such applications is typically a list of experts for a requested expertise. For example, if there is a request for “cloud security”, fifteen different experts may be recommended. In larger enterprises, however, the number of recommended experts may be of substantial size as many people may have expressed knowledge in a specific expertise. In such cases, simple identification of known experts may not be adequate. Instead, a ranking may be desired, where the requester would need to know the top experts in the specific field. Identifying such experts can help quickly find the right person to approach to address an opportunity/challenge, and hence reduce time to decision. Due to the large number of employees in enterprises, dynamic organizational structures, changing workforce, and massive content repositories, manual ranking of the authority of all known experts has proven to be a near impossible task. Therefore, there is a need in the art for an automated method for determining the authority of an expert for a specific expertise.
Examples of the present invention disclose a method for determining the authority of the individual experts. Generally, experts write about their areas of expertise in their work products such that the nature of the content can be indicative of the degree of expertise. According to one example embodiment, computing the authority of an expert in a specific area of expertise is accomplished via semantic analysis of a corpus of personally-authored documents and externally available information. Furthermore, various document parameters (e.g., citations and timeliness) as well as the attributes of the author can further contribute to an inference about the expert's authority for an expertise. More particularly, computing the authority of an expert may also be based on direct and indirect content from a mixed corpus of tagged and untagged documents. In one example, text analysis techniques are used to infer an expert's rank based on the content they have authored relative to other content. Additionally, external data may be leveraged to enhance the authority analysis of an expert.
Referring now in more detail to the drawings in which like numerals identify corresponding parts throughout the views,
According to one example embodiment, the authority analyzing module 105 is configured to construct a graph that embodies the conceptual competence of the organization. Such a graph is referred to hereinafter as the “conceptual competence graph” or “CC graph.” Once the conceptual competence graph is constructed, analytical methods based on expertise flow are applied to the graph to analyze the expertise and to provide various functions for users to explore and rank the conceptual competence and authority of experts within the organization. In one example, the authority analyzing module 105 provides various functions to allow a user to explore the CC graph to derive various types of expertise information, such as a ranking of expertise amongst experts, a ranking of documents associated with an identified expertise, and the ranking of expertise associated with an identified expert. To that end, the authority analyzing module 105 includes analytics tools to generate the desired expertise information by analyzing the CC graph. For instance, the authority analyzing module 105 may include a flow analyzer for applying authority flow analyses to the conceptual competence graph. Furthermore, the graphical user interface 119 may be utilized to provide rankings of the expertise authority on the display device 118 for viewing by a user or requester.
Computer-readable storage medium 130 represents volatile storage (e.g. random access memory), non-volatile store (e.g. hard disk drive, read-only memory, compact disc read only memory, flash storage, etc.), or combinations thereof. Furthermore, storage medium 130 includes software 132 that is executable by processor 120 and, that when executed, causes the processor 120 to perform some or all of the functionality described herein. For example, the authority analyzing module may 105 may be implemented as executable software within the storage medium 130, or on a separate storage medium that is non-transitory. The storage medium 130 may also be used to store the input data for the authority analyzing module 105, such as the document resources and expert information, as well as the output data of the expert authority analyzing module 105, such as the expert authority data generated by the authority analyzing tools, and the visual display data for display by the display device. Alternatively, the input and output data of the authority analyzing module 105 may be received from and transmitted to a data network 122, such as the intranet of an organization or the internet, or a combination thereof.
The document resources 202 (Di) may also be linked and tagged to a particular expertise 208 (Ck) via tag edge 211 having a weight fki. Similarly, an expertise 208 (Ck) may be tagged to a person node 206 (Pn) by a tag edge 209 having weight ekn. In addition, the taxonomy or hierarchy from expertise (concept) Ck1 to expertise (concept) Ck2 may be linked via edge 215 with a weight hk1,k2. The CC graph may also include organizational or hierarchal employment information. For instance, a person and their manager may be connected by a “manager” edge 213. In this way, the CC graph not only identifies the association of the document resources with the people, but also the organizational relations among the people. By forming the connections among the document resources, terms, expertise, and people, examples of the present invention enable automatic determination of expertise authority with respect to individuals and documents within an organization.
Moreover, similarities among digital documents within a corpus and terminology associated with an expertise may be evaluated in number of various ways. Based on a taxonomy, which can be manually constructed or automatically derived from the documents, each document can be fully or partially associated with various expertise or concepts. One document similarity assessment method is the Vector Space Model (VSM). Under VSM, each document is represented as a vector in the space of all available words. The ith entry holds the number of times the ith word appears in the document. Another similarity evaluation method, which is a modification of the VSM method, is Latent Semantic Indexing (LSI) or Latent Semantic Analysis (LSA). LSA computes the singular vectors that correspond to the largest singular values of the matrix that includes all documents represented as columns using VSM. Then, a new representation of a document is formed by calculating its projections onto those first singular vectors. The similarity between two documents is defined as the cosine distance between the two document vectors represented as projections onto the first singular vectors.
Another embodiment of the invention utilizes a document similarity method that leverages the idea of LSI, and enhances it with semantic topics computed by a Principal Atoms Recognition In Sets (PARIS) approach. The PARIS approach handles words as sets. Given a large number of sets, PARIS detects principal sets of elements that tend to frequently appear together in the data. The PARIS approach allows non-exact repetitions of the detected patterns in the data, and allows additional elements in the input sets that are not covered by any of the detected sets. Applying PARIS to the documents in the corpus results in sets of words that tend to appear together in many documents. These sets of words could be used to represent “concepts” discussed in the documents in the given corpus.
The similarity computation may be updated whenever the document corpus evolves so as to take into account the new items. It should be noted that the similarity computation methods described above are only example approaches to evaluating the similarity (or relevance) between documents and terms in a given corpus, and the invention may be implemented using other methods of similarity computation to link document resources in the conceptual competence graph as will be appreciated by one skilled in the art.
As shown in
The table above simply list sample static weights for a small subset of document types, however, and examples of the present invention are not limited thereto. That is, a recursive and/or parametric function may be utilized to fine tune the weight (W) of the source document. For example, Patent A may have 5 backward and 100 forward references while Patent B includes 30 backward and 5 forward references. Here, the authority analyzing module may be configured to adjust the weight (W) of Patent A by a percentage to be more valuable than the weight given to Patent B. Similarly, the value of blogs may be modified by the number of responses received, while the value of technical papers and similar documents may be modified by their citations or other references. Thus, the weight (W) of a particular document resource (D) may be determined or adjusted by a percentage in accordance with citations or performance of the documents, the documents referenced therein, and so forth.
Additionally, each unique document (D) may include an expertise frequency count (F) such that Dik defines the frequency of expertise “k” in document “i”. Each unique expert (E) may also include a knowledge index for each unique expertise (K), with Emn defining the knowledge index of expert “m” in expertise “n”, and computed as follows:
E
mn=Σ(Dij*log((a*Dik+1)̂b)) for all l, j, k, m, and n.
Coefficients “a” and “b” may vary in accordance with examples of the present invention (e.g., 10 and 1.5 respectively). Thus and in according to one example embodiment, the authority of expert Em in a specific expertise Kn may be given by Emn as shown above.
Moreover, determination of expert authority may be augmented by leveraging external contextual data including the quality of the content, the timeliness of the content, the length of the content, and the position or job code of the author/expert. For example, the quality of the content may be determined—so as to increase the weight of the document relative to other documents—based upon the number of forward citations in a patent; the number of references to a paper; or the number of comments on a blog for example. With respect to the timeliness of the document or content, a higher relative value may be assigned to more recent content. Furthermore, the length of the content may be an indicator of the expert's depth of knowledge (assuming the content is substantive and not prolixity). Such factors may serve to influence the document-specific Dij value on a percentage basis for example. In another example, the employment level or position of the author/expert may be another example of expertise as the higher the job code of the author, the higher the value of all content produced by that author, particularly when the job code is relevant to the expertise. This factor may influence the overall Emn value by a relevant or absolute quantity.
Once the CC graph is constructed, information regarding expertise inside the organization can be derived using the graph. In some example embodiments of the invention, an authority flow analysis is applied to the CC graph to answer expertise questions or queries related to the expert authority within the organization. For example, the authority questions may be: “For a given expertise (concept node), what is the ranking of documents relevant to this expertise?”, “For a given expertise (concept node), what is the ranking of experts relevant to this expertise, “For a given document, what is the ranking of expertise (concept nodes) relevant to this document?”, “For a given expert, what is the ranking of expertise (concept nodes) relevant to this expert”, etc.
Moreover, several possible computations are possible for ranking experts for a given expertise Ck. According to one example, each computation may take into account additional inferences, which are represented by paths in the CC graph. Expert rank may be denoted as Enk values, the rank of Person Pn with respect to expertise Ck. If the expertise taxonomy is not hierarchical such that tagged documents are utilized, then the expert rank may be formulated as:
In such a formulation, wi is incorporated into gin (i.e., node weights are avoided). The various parameters, e.g., gjn and fki, may fold in a variety of factors. For example, fki may be set to the log of the frequencies for concept Ek in document Di, with wi being incorporated into gin so as to reduce the linear influence or biasing relating to excessive frequency of authorship in the computation of authority (e.g., bias based on a prolix report).
Another example embodiment allows ranking through similarity nodes such that untagged documents are used to infer expertise and compute rank. For example, given an expertise taxonomy that is not hierarchical, the expert rank Enk may be formulated as:
Here, wi is incorporated into fki and wj is incorporated into gjn so that when relevance flows from one document to another, the importance of each document affects the overall expert ranking.
In yet another example embodiment, the authority analyzing module could set up flow formulation for a single matrix over all the nodes of the graph, with all the edges included as entries in the matrix. Furthermore, setting 0 on the diagonals would correspond to self-loops for every node. Steps of the flow algorithm may then correspond to multiplications of the matrix. One step of the flow, which includes paths of length 1 in the graph, may correspond to a single multiplication, with two steps corresponding to two multiplications, etc. The sum of these matrices would then give the required expertise in the appropriate entry.
Still further, flow to rank expertise may still be accomplished when the expertise taxonomy is hierarchical. In this example, relevance from the query expertise node Ck is first flowed to all expertise nodes below it in the hierarchy, using the weights hk1,k2 for example. Accordingly, weights Ck′ are produced for each expertise node Ck′. The rank for a specific Pn, which is an expert's expertise in Ck, is computed by flowing from every expertise node and summing over these paths:
In addition, if an expert is tagged explicitly, the direct flow may be added from any expertise node Ck′ to the person Pn as follows:
In some application it may desirable to flow expertise through the expert hierarchy. In hierarchies such as the hierarchy formed by advisor/advisee relations, inheritance of expertise is a reasonable assumption. In such a scenario, interest may be flowed through the people hierarchy using a dual procedure to the formula used for the expertise hierarchy. More particularly, weights pn′ may be pre-computed for each person Pn′ based on the people hierarchy from Pn, and in the ranking computation, summed over all the paths containing all people Pn′.
As mentioned above with respect to
In step 410, a knowledge index score for the associated experts is determined. According to one example, each expert may also be assigned a weight based on his/her position or role within an enterprise and/or the level of expertise for establishing the knowledge index of a particular expert. That is, different types of content, in general, may imply different levels of expertise and the frequency of references to expertise may further contribute to the level of authority of the expert. For example, an inventor in a patent for technology X is more likely to have a higher authority and higher weighted index score than the author of a single blog about technology X. By the same measure, an expert who has referenced a specific expertise only a few times is less likely to be as authoritative and thus a lower knowledge index score than another expert who has been profusely writing about the expertise over an extended period of time. Thus, the authority score for each expert for a particular expertise may then be computed in step 414 based on the quality index score of the authored documents, document expertise and weight thereof, and the knowledge index score of the individual expert. Lastly, in step 414 the authority analyzing module returns a ranking of experts with respect to the selected expertise based on authority score of identified experts (i.e. highest to lowest).
Embodiments of the present invention provide a method and system for automated determination of expertise authority. Many advantages are afforded by configuration of the present examples. For instance, the method and system described herein is capable of ranking of experts for a specific expertise without manual labor. Moreover, rapid identification of the right expert(s) who can most effectively respond to an opportunity or a challenge serves to promote collaboration within an enterprise while also effectively reducing time to decision—a critical aspect of large enterprises. Still further, competitive advantage and cost reduction are maximized and customer satisfaction is increased by leveraging the best available resources in a timely manner.
In the foregoing description, numerous details are set forth to provide an understanding of the present invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these details. While the invention has been disclosed with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover such modifications and variations as fall within the true spirit and scope of the invention.