Motivating Problem

• Understanding user interaction patterns

  • Logs of User Sessions:
    • WORD, EXPLORER, OUTLOOK, WORD
  • Use patterns to inform interface design

• Model as string search problem

  • ABCA…
  • Find common repeated subsequences of some length > k

• Brute-force O(n2) algorithm based on diagonals of incidence matrix, but…

• We want approximate matches:

  • xxxxxABCxxxxCBAxxxxxBAC

• Still looking for an answer – I don’t think it’s an easy problem.

Previous slide

Next slide

Back to first slide

View graphic version