Method and system for identifying a task sequence from an interaction stream

A non-transitory computer readable medium including instructions stored thereon that when processed by at least one processor causes a computing system to perform operations comprising:

• receiving an interaction stream related to one or more interactions of one or more users with the computing system, one or more events that occurred from the one or more interactions, wherein the processed interaction stream is transformed into n-grams;
• identifying a plurality of potential data candidates for each of the n-grams by interpreting corresponding start markers and end markers;
• transforming for each of the n-grams each of the identified plurality of potential data candidates into a corresponding potential data candidate vector, wherein the potential data candidate vectors are numerical representation of the plurality of potential data candidates;
• determining a similarity score for each pair of the plurality of potential data candidates based on comparison of each of the plurality of the potential data candidate vectors of the corresponding pair of the plurality of potential data candidates, wherein determining the similarity score comprises:
• for each pair of the plurality of potential data candidates, comparing each interaction of each of the plurality of the potential data candidate vectors with each corresponding interaction of each of rest of the plurality of potential data candidate vectors;
• assigning:
• a predefined first score to each interaction of the plurality of potential data candidates, when a comparison results in an exact match of frequency of a type of interaction,
• a predefined second score to each interaction of the plurality of potential data candidates when the comparison results in mismatch of frequency of the type of interaction,
• a predefined third score to each interaction of the plurality of potential data candidates when the comparison results in absence of a common type of interaction;
• determining a cumulative score based on the predefined first score, the predefined second score and the predefined third score assigned to each interaction of the corresponding plurality of potential data candidates;
• and
• determining the similarity score based on the corresponding cumulative score and a predefined weightage of each of the n-grams;
• and
• grouping the plurality of potential data candidates into one or more groups based on the similarity score of a corresponding plurality of potential data candidates, wherein each of the one or more groups indicates a unique task sequence of the processed interaction stream.

A computing system of identifying a task sequence from an interaction stream, the computing system comprising:

• a processor;
• and
• a memory communicatively coupled to the processor, wherein the memory stores the processor-executable instructions, which, on execution, causes the processor to:
• receive an interaction stream related to one or more interactions of one or more users with the computing system, one or more events that occurred from the one or more interactions, wherein the processed interaction stream is transformed into n-grams;
• identify a plurality of potential data candidates for each of the n-grams by defining corresponding start markers and end markers;
• transform for each of the n-grams each of the identified plurality of potential data candidates into a corresponding potential data candidate vector, wherein the potential data candidate vectors are numerical representation of the plurality of potential data candidates;
• determine a similarity score for each pair of the plurality of potential data candidates based on comparison of each of the plurality of the potential data candidate vectors of the corresponding pair of the plurality of potential data candidates, wherein to determine the similarity score, the processor is configured to:
• for each pair of the plurality of potential data candidates, compare each interaction of each of the plurality of the potential data candidate vectors with each corresponding interaction of each of rest of the plurality of potential data candidate vectors;
• assign:
• a predefined first score to each interaction of the plurality of potential data candidates, when a comparison results in an exact match of frequency of a type of interaction,
• a predefined second score to each interaction of the plurality of potential data candidates when the comparison results in mismatch of frequency of the type of interaction,
• a predefined third score to each interaction of the plurality of potential data candidates when the comparison results in absence of a common type of interaction;
• determine a cumulative score based on the predefined first score, the predefined second score and the predefined third score assigned to each interaction of the corresponding plurality of potential data candidates;
• and
• determine the similarity score based on the corresponding cumulative score and a predefined weightage of each of the n-grams;
• and
• group the plurality of potential data candidates into one or more groups based on the similarity score of a corresponding plurality of potential data candidates, wherein each of the one or more groups indicates a unique task sequence of the processed interaction stream.