Issue No. 04 - April (2014 vol. 26)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2013.127
Umut Avci , Dept. of Inf. Eng. & Comput. Sci., Univ. of Trento, Trento, Italy
Andrea Passerini , Dept. of Inf. Eng. & Comput. Sci., Univ. of Trento, Trento, Italy
Activity recognition is a key task for the development of advanced and effective ubiquitous applications in fields like ambient assisted living. A major problem in designing effective recognition algorithms is the difficulty of incorporating long-range dependencies between distant time instants without incurring substantial increase in computational complexity of inference. In this paper we present a novel approach for introducing long-range interactions based on sequential pattern mining. The algorithm searches for patterns characterizing time segments during which the same activity is performed. A probabilistic model is learned to represent the distribution of pattern matches along sequences, trying to maximize the coverage of an activity segment by a pattern match. The model is integrated in a segmental labeling algorithm and applied to novel sequences, tagged according to matches of the extracted patterns. The rationale of the approach is that restricting dependencies to span the same activity segment (i.e., sharing the same label), allows keeping inference tractable. An experimental evaluation shows that enriching sensor-based representations with the mined patterns allows improving results over sequential and segmental labeling algorithms in most of the cases. An analysis of the discovered patterns highlights non-trivial interactions spanning over a significant time horizon.
Pattern matching, Hidden Markov models, Labeling, Data mining, Algorithm design and analysis, Inference algorithms
Umut Avci, Andrea Passerini, "Improving Activity Recognition by Segmental Pattern Mining", IEEE Transactions on Knowledge & Data Engineering, vol. 26, no. , pp. 889-902, April 2014, doi:10.1109/TKDE.2013.127