Fast string matching with k-differences
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Patricia tries again revisited
Journal of the ACM (JACM)
String matching under a general matching relation
Information and Computation
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Efficient special cases of Pattern Matching with Swaps
Information Processing Letters
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Towards a taxonomy of intrusion-detection systems
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on computer network security
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Journal of Algorithms
The string edit distance matching problem with moves
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
User Modeling in Human–Computer Interaction
User Modeling and User-Adapted Interaction
Constructing Suffix Trees On-Line in Linear Time
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Direct Construction of Compact Directed Acyclic Word Graphs
CPM '97 Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Communications of the ACM - A game experience in every application
Multimedia Electronic Chronicles
IEEE MultiMedia
Computational models for experiences in the arts, and multimedia
ETP '03 Proceedings of the 2003 ACM SIGMM workshop on Experiential telepresence
Efficient randomized pattern-matching algorithms
IBM Journal of Research and Development - Mathematics and computing
Effects of User Request Patterns on a Multimedia Delivery System
Multimedia Tools and Applications
Teaching Machines about Everyday Life
BT Technology Journal
Topic segmentation of message hierarchies for indexing and navigation support
WWW '05 Proceedings of the 14th international conference on World Wide Web
Information visualization for an intrusion detection system
Proceedings of the sixteenth ACM conference on Hypertext and hypermedia
MyLifeBits: a personal database for everything
Communications of the ACM - Personal information management
A Day in the Life of a Metamorphic Petrologist
ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
CUTS: CUrvature-based development pattern analysis and segmentation for blogs and other Text Streams
Proceedings of the seventeenth conference on Hypertext and hypermedia
RE-Tree: an efficient index structure for regular expressions
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Topic development pattern analysis-based adaptation of information spaces
The New Review of Hypermedia and Multimedia - Adaptive Hypermedia
Hi-index | 0.00 |
As part of our iCare efforts, we are developing mechanisms that provide guidance to individuals who are blind in diverse contexts. A fundamental challenge in this context is to represent and index experiences that can be used to provide recommendations. In this paper, we address the challenge of indexing experiences in order to retrieve them based on their popularities. In particular, we model experiences as sequences of propositional statements from a particular domain (daily life, web browsing, etc.). We then show that knowledge about domain constraints (such as commutativity between possible statements) need to be used for clustering and indexing experiences for popularity-search. We also highlight that don't cares (propositional statements not relevant to the user's query) make the task of popularity indexing challenging. Thus, we develop a canonical-sequence based approach that significantly reduces the experience sequence retrieval time in the presence of commutations. We introduce rule-compression, which helps achieve further reductions in the retrieval cost. We propose a novel two-level index structure, EXPdex, to efficiently answer wildcard (don't care) queries. We compare the proposed approach analytically and experimentally to a don't care-unaware solution, which does not take into account wildcards in queries while constructing the popularity index. Experiments show that the proposed approach provides large savings in retrieval time when commutations between the elements of sequences are allowed.