M. Abouelhoda and M. Ghanem, String Mining in Bioinformatics, Scientific Data Mining and Knowledge Discovery: Principles and Foundations, pp.207-247, 2010.
DOI : 10.1007/978-3-642-02788-8_9

R. C. Agarwal, C. C. Aggarwal, and V. V. Prasad, A Tree Projection Algorithm for Generation of Frequent Item Sets, Journal of Parallel and Distributed Computing, vol.61, issue.3, pp.350-371, 2001.
DOI : 10.1006/jpdc.2000.1693

R. Agrawal and R. Srikant, Fast Algorithms for Mining Association Rules, Int'l Conf. Very Large Databases (VLDB '94), pp.487-499, 1994.

R. Agrawal and R. Srikant, Mining sequential patterns, Proceedings of the Eleventh International Conference on Data Engineering, pp.3-14380415, 1995.
DOI : 10.1109/ICDE.1995.380415

R. Agrawal, T. Imielinski, and A. Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp.207-216, 1993.

F. Stephen, . Altschul, W. Bruce, and . Erickson, Optimal sequence alignment using affine gap costs, Bulletin of Mathematical Biology, vol.48, issue.5-6, pp.603-616, 1986.

F. Stephen, W. Altschul, W. Gish, E. W. Miller, D. J. Myers et al., Basic local alignment search tool, Journal of Molecular Biology, vol.215, pp.403-410, 1990.

A. Amir and M. Farach, Efficient 2-dimensional approximate matching of non-rectangular figures, SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, pp.212-223, 1991.

S. Singh, A. , and B. Mobasher, Contextual Recommendation From Web to Social Web Discovering and Deploying User and Content Profiles, Lecture Notes in Computer Science, vol.4737, pp.142-160, 2007.

A. Apostolico, L. Parida, and S. E. Rombo, Motif patterns in 2D, Theoretical Computer Science, vol.390, issue.1, pp.40-55, 2008.
DOI : 10.1016/j.tcs.2007.10.019

D. Ashbrook and T. Starner, Learning significant locations and predicting user movement with GPS, Proceedings. Sixth International Symposium on Wearable Computers,, pp.101-108, 2002.
DOI : 10.1109/ISWC.2002.1167224

J. Ayres, J. Flannick, J. Gehrke, and T. Yiu, Sequential PAttern mining using a bitmap representation, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '02, p.429, 2002.
DOI : 10.1145/775047.775109

R. A. Baeza-yates and G. Navarro, Fast two-dimensional approximate pattern matching, p.98
DOI : 10.1007/BFb0054334

B. S. Baker, A program for identifying duplicated code, In Computing Science and Statistics, vol.24, pp.49-57, 1992.

T. P. Baker, A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension, SIAM Journal on Computing, vol.7, issue.4, pp.533-541, 1978.
DOI : 10.1137/0207043

M. Baldauf, S. Dustdar, and F. Rosenberg, A survey on context-aware systems, International Journal of Ad Hoc and Ubiquitous Computing, vol.2, issue.4, pp.263-277, 2007.
DOI : 10.1504/IJAHUC.2007.014070

L. E. Baum, T. Petrie, G. Soules, and N. Weiss, A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. The annals of mathematical statistics, pp.164-171, 1970.

V. Bellotti, B. Begole, E. H. Chi, N. Ducheneaut, J. Fang et al., Activity-based serendipitous recommendations with the Magitti mobile leisure guide, Proceeding of the twenty-sixth annual CHI conference on Human factors in computing systems , CHI '08, pp.1157-1166, 2008.
DOI : 10.1145/1357054.1357237

M. Berchtold, M. Budde, H. R. Schmidtke, and M. Beigl, An Extensible Modular Recognition Concept That Makes Activity Recognition Practical, Proceedings of the 33rd annual German conference on Advances in artificial intelligence, pp.400-409, 2010.
DOI : 10.1007/978-3-642-16111-7_46
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.2195

K. Beyer and R. Ramakrishnan, Bottom-up computation of sparse and Iceberg CUBEs, SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international

V. Boonjing and P. Songram, Efficient Algorithms for Mining Closed Multidimensional Sequential Patterns, Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007.
DOI : 10.1109/FSKD.2007.265

A. J. Bernheim-brush, A. K. Karlson, J. Scott, R. Sarin, A. Jacobs et al., User experiences with activity-based navigation on mobile devices, Proceedings of the 12th international conference on Human computer interaction with mobile devices and services, pp.73-82, 2010.

A. Rea and D. Wyatt, The mobile sensing platform: An embedded activity recognition system, Pervasive Computing, vol.7, issue.2, pp.32-41, 2008.

B. Clarkson and A. Pentland, Unsupervised clustering of ambulatory audio and video, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), pp.3037-3040, 1999.
DOI : 10.1109/ICASSP.1999.757481

B. Patrick and C. , The pattern of life., Journal of Applied Psychology, vol.14, issue.4, 2003.
DOI : 10.1037/h0069147

P. Domingos and G. Hulten, Mining high-speed data streams, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '00, pp.71-80, 2000.
DOI : 10.1145/347090.347107
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.3124

P. Dourish, What we talk about when we talk about context. Personal and Ubiquitous Computing, pp.19-30, 2004.

N. Eagle and A. Pentland, Reality mining: sensing complex social systems, Personal and Ubiquitous Computing, vol.10, issue.2, pp.255-268, 2005.
DOI : 10.1007/s00779-005-0046-3

N. Eagle and A. Pentland, Eigenbehaviors: identifying structure in routine, Behavioral Ecology and Sociobiology, vol.10, issue.1, pp.1057-1066, 2009.
DOI : 10.1007/s00265-009-0739-0

V. Etter, M. Kafsi, and E. Kazemi, Been There, Done That : What Your Mobility Traces Reveal about Your Behavior, Nokia Mobile Data Challenge -Next Place Prediction, 2012.

S. Faro and T. Lecroq, The exact online string matching problem, ACM Computing Surveys, vol.45, issue.2
DOI : 10.1145/2431211.2431212

H. Gao, J. Tang, and H. Liu, Mobile Location Prediction in Spatio-Temporal Context. In Nokia Mobile Data Challenge -Next Place Prediction, 2012.

F. Giannotti, M. Nanni, and D. Pedreschi, Efficient Mining of Temporally Annotated Sequences, Proc. SDM'06, pp.348-359, 2006.
DOI : 10.1137/1.9781611972764.31

F. Giannotti, M. Nanni, D. Pedreschi, and F. Pinelli, Trajectory pattern mining, Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '07, pp.330-339, 2007.
DOI : 10.1145/1281192.1281230

M. C. Gonzalez, C. A. Hidalgo, and A. Barabasi, Understanding individual human mobility patterns, Nature, vol.89, issue.7196, pp.779-782, 2008.
DOI : 10.1038/nature06958

G. Grahne and J. Zhu, Efficiently Using Prefix-trees in Mining Frequent Itemsets, Proceedings of the ICDM'03 international workshop on requent itemset mining implementations (FIMI '03), pp.123-132, 2003.

M. Hall, Correlation-based feature selection for machine learning, 1999.

J. Han and Y. Fu, Discovery of multiple-level association rules from large databases, Proceeding of the 21st international conference on very large data bases (VLDB'95), pp.420-431, 1995.

C. Hsu, FreeSpan: frequent pattern-projected sequential pattern mining, KDD '00 Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pp.355-259, 2000.

J. Han, J. Pei, and Y. Yin, Mining frequent patterns without candidate generation, SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pp.1-12, 2000.

J. Han, M. Kamber, and J. Pei, Data Mining
DOI : 10.1007/978-1-4899-7993-3_104-2

J. Han, H. Cheng, D. Xin, and X. Yan, Frequent pattern mining: current status and future directions, Data Mining and Knowledge Discovery, vol.1, issue.1, pp.55-86
DOI : 10.1007/s10618-006-0059-1

M. Heidegger, Sein und Zeit, p.10, 1927.

S. Henikoff and J. G. Henikoff, Amino acid substitution matrices from protein blocks., Proceedings of the National Academy of Sciences, vol.89, issue.22, pp.10915-10919, 1992.
DOI : 10.1073/pnas.89.22.10915

. Toivonen, Time series segmentation for context recognition in mobile devices, Proceedings 2001 IEEE International Conference on Data Mining, pp.203-210, 2001.

S. Daniel and . Hirschberg, A Linear Space Algorithm for Computing Maximal Common Subsequences, Communications of the ACM, vol.18, issue.6, pp.341-343, 1975.

W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, Journal of the American Statistical Association, vol.1, issue.301, pp.13-30, 1963.
DOI : 10.1214/aoms/1177730491

G. Holmes, B. Pfahringer, R. Kirkby, E. Frank, and M. Hall, Multiclass Alternating Decision Trees, ECML, pp.161-172, 2001.
DOI : 10.1007/3-540-36755-1_14

G. Holmes, B. Pfahringer, R. Kirkby, E. Frank, and M. Hall, Multiclass Alternating Decision Trees, Proceedings of the 13th European Conference on Machine Learning, ECML '02, pp.161-172, 2002.
DOI : 10.1007/3-540-36755-1_14

. Verlag, ISBN 3-540-44036-4. URL http

H. George, P. John, and . Langley, Estimating Continuous Distributions in Bayesian Classifiers, Eleventh Conference on Uncertainty in Artificial Intelligence, pp.338-345, 1995.

J. Kang and H. Yong, Mining Spatio-Temporal Patterns in Trajectory Data, Journal of Information Processing Systems, vol.6, issue.4, pp.521-536, 2010.
DOI : 10.3745/JIPS.2010.6.4.521

T. Kärkkäinen, T. Vaittinen, and K. Väänänen-vainio-mattila, I don't mind being logged, but want to remain in control, Proceedings of the 28th international conference on Human factors in computing systems, CHI '10, pp.163-172, 2010.
DOI : 10.1145/1753326.1753351

M. Richard, M. Karp, and . Rabin, Efficient randomized pattern-matching algorithms, 1987.

D. Katsaros and Y. Manolopoulos, A Suffix Tree Based Prediction Scheme for Pervasive Computing Environments, 10th Panhellenic Conference on Informatics, PCI 2005, pp.267-277, 2005.
DOI : 10.1007/11573036_25

D. Katsaros, A. Nanopoulos, M. Karakaya, and G. Yavas, Ozg ur Ulusoy, and Yannis Manolopoulos. Clustering mobile trajectories for resource allocation in mobile environments, Proceedings of the 5th International Symposium on Intelligent Data Analysis, pp.319-329, 2003.

E. Keogh, J. Lin, and W. Truppel, Clustering of time-series subsequences is meaningless: implications for previous and future research, Proceedings of the Third IEEE International Conference on Data Mining (ICDM'03), pp.115-122, 2003.

N. Kiukkonen, J. Blom, O. Dousse, D. Gatica-perez, and J. K. Laurila, Towards rich mobile phone datasets: Lausanne data collection campaign, Proceedings of ACM international conference on pervasive services (ICPS), 2010.

E. Donald, J. H. Knuth, . Morris, V. R. Jr, and . Pratt, Fast pattern matching in strings, SIAM journal on computing, vol.6, issue.2, pp.323-350, 1977.

D. Kotz and K. Essien, Analysis of a Campus-Wide Wireless Network, Wireless Networks, vol.8, issue.2?3, pp.115-133, 2005.
DOI : 10.1007/s11276-004-4750-0

K. Krithivasan and R. Sitalakshmi, Efficient two-dimensional pattern matching in the presence of errors, Information Sciences, vol.43, issue.3, pp.169-184, 1987.
DOI : 10.1016/0020-0255(87)90037-5

H. Kum, J. Pei, W. Wang, and D. Duncan, ApproxMAP: Approximate Mining of Consensus Sequential Patterns, Third SIAM International Conference on Data Mining (SIAM-DM), pp.311-315, 2003.
DOI : 10.1137/1.9781611972733.36

K. Laasonen, Clustering and Prediction of Mobile User Routes from Cellular Data, Knowledge Discovery in Databases: PKDD 2005, pp.569-576, 2005.
DOI : 10.1007/11564126_59

P. Laird, Identifying and using patterns in sequential data, Lecture Notes in Computer Science, vol.744, pp.1-18, 1993.
DOI : 10.1007/3-540-57370-4_33

K. Juha, D. Laurila, I. A. Gatica-perez, O. Blom, T. Bornet et al., The mobile data challenge: Big data for mobile computing research, Mobile Data Challenge by Nokia Workshop in Conjunction with Int. Conf. on Pervasive Computing, 2012.

T. Lecroq, A. Pauchet, E. Chanoni, and G. S. Ayala, Pattern discovery in annotated dialogues using dynamic programming, International Journal of Intelligent Information and Database Systems, vol.6, issue.6, pp.603-618, 2012.
DOI : 10.1504/IJIIDS.2012.050097

I. S. Philip, A. K. Lei, and . Wong, The Multiple-Touch User Interface Revolution, IT Professional, vol.11, pp.42-49, 2009.

J. Lester, T. Choudhury, and G. Borriello, A practical approach to recognizing physical activities. Pervasive Computing, pp.1-16, 2006.

C. Li and K. Willis, Modeling context aware interaction for wayfinding using mobile devices, Proceedings of the 8th conference on Human-computer interaction with mobile devices and services , MobileHCI '06, p.97, 2006.
DOI : 10.1145/1152215.1152235

J. David, W. R. Lipman, and . Pearson, Rapid and sensitive protein similarity searches, Science, vol.227, issue.4693, pp.1435-1441, 1985.

H. Liu and R. Setiono, A probabilistic approach to feature selection -A filter solution, 13th International Conference on Machine Learning, pp.319-327, 1996.

R. Nizar, C. I. Mabroukeh, and . Ezeife, A taxonomy of sequential pattern mining algorithms, ACM Computing Surveys, vol.433, issue.1, pp.1-3, 2010.

H. Mannila, H. Toivonen, and A. I. Verkamo, Efficient Algorithms for Discovering Association Rules, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), number July, pp.181-192, 1994.

J. Mäntyjärvi, J. Himberg, P. Kangas, U. Tuomela, and P. Huuskonen, Sensor Signal Data Set for Exploring Context Recognition of Mobile Devices Benchmarks and a database for context recognition, conjuction with the 2nd Int. Conf. on Pervasive Computing, 2004.

M. Edward and . Mccreight, A space-economical suffix tree construction algorithm, Journal of the ACM (JACM), vol.23, issue.2, pp.262-272, 1976.

H. Carl, J. F. Mooney, and . Roddick, Sequential Pattern Mining -Approaches and Algorithms, ACM Computing Surveys (CSUR), vol.4519, issue.2, 2431218.

C. S. Myers and L. R. Rabiner, A Comparative Study of Several Dynamic Time-Warping Algorithms for Connected-Word Recognition, Bell System Technical Journal, vol.60, issue.7, pp.1389-1409, 1981.
DOI : 10.1002/j.1538-7305.1981.tb00272.x

E. W. Myers and W. Miller, Optimal alignments in linear space Computer applications in the biosciences, CABIOS, vol.4, issue.1, pp.11-17, 1988.

M. Nanni, R. Trasarti, C. Renso, F. Giannotti, and D. Pedreschi, Advanced knowledge discovery on movement data with the GeoPKDD system, Proceedings of the 13th International Conference on Extending Database Technology, EDBT '10, pp.693-696, 2010.
DOI : 10.1145/1739041.1739129

G. Navarro, A guided tour to approximate string matching, ACM Computing Surveys, vol.33, issue.1, pp.31-88, 2001.
DOI : 10.1145/375360.375365

B. Saul, C. D. Needleman, and . Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, Journal of molecular biology, vol.48, issue.3, pp.443-453, 1970.

K. Partridge and B. Price, Enhancing Mobile Recommender Systems with Activity Inference. User Modeling, Adaptation, and Personalization, pp.307-318, 2009.

N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Database Theory ? ICDT '99 SE -25, pp.398-416, 1999.
DOI : 10.1007/3-540-49257-7_25
URL : https://hal.archives-ouvertes.fr/hal-00467747

A. Pauchet, A. M. El, T. Merabti, E. Prieur, T. Lecroq et al., Identification de r??p??titions dans les navigations au sein d'un catalogue de sant??, Revue d'intelligence artificielle, vol.23, issue.1, pp.113-132, 2009.
DOI : 10.3166/ria.23.113-132

J. Pei, J. Han, B. Mortazavi, and H. Zhu, Mining Access Patterns Efficiently from Web Logs, Proceedings of the 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp.396-407, 2000.
DOI : 10.1007/3-540-45571-X_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.3204

J. Pei, J. Han, B. Mortazavi-asl, H. Pinto, Q. Chen et al., Prefixspan: Mining sequential patterns efficiently by prefixprojected pattern growth, Proceeding of the 2001 international conference on data engineering (ICDE'01), pp.215-224, 2001.

J. Pei, J. Han, B. Mortazavi-asl, J. Wang, H. Pinto et al., Mining Sequential Patterns by Pattern-Growth : The PrefixSpan Approach, IEEE Transactions on Knowledge and Data Engineering, issue.10, pp.161424-1440, 2004.

D. Pelleg and A. Moore, X-means: Extending k-means with efficient estimation of the number of clusters, Proceedings of the Seventeenth International Conference on Machine Learning, pp.727-734, 2000.

J. Pitkow and P. Pirolli, Mining longest repeating subsequences to predict world wide web surfing, Proceedings of USITS '99: The 2nd USENIX Symposium on Internet Technologies & Systems, pp.139-150, 1999.

M. Plantevit, A. Laurent, D. Laurent, M. Teisseire, and Y. W. Choong, Mining multidimensional and multilevel sequential patterns, ACM Transactions on Knowledge Discovery from Data, vol.4, issue.1
DOI : 10.1145/1644873.1644877
URL : https://hal.archives-ouvertes.fr/hal-01381826

C. John and . Platt, Advances in kernel methods. chapter Fast train, pp.185-208, 1999.

M. Raento, Mobile communication and context dataset, Proceedings of the Workshop towards Benchmarks and a Database for Context Recognition, International Conference on Pervasive Computing, 2004.

M. Raento, A. Oulasvirta, R. Petit, and H. Toivonen, ContextPhone: A Prototyping Platform for Context-Aware Mobile Applications, IEEE Pervasive Computing, vol.4, issue.2, pp.51-5929, 2005.
DOI : 10.1109/MPRV.2005.29

M. Sherif-rashad, A. Kantardzic, and . Kumar, PAC-WHN: Predictive Admission Control for Wireless Heterogeneous Networks, IEEE Symposium on Computers and Communications, pp.139-144, 2007.

M. Sherif-rashad, A. Kantardzic, and . Kumar, MSP-CACRR: Multidimensional Sequential Patterns Based Call Admission Control and Resource Reservation for Next-Generation Wireless Cellular Networks, Cidm), pp.552-559, 2007.

S. E. Rombo, Optimal extraction of motif patterns in 2D, Information Processing Letters, vol.109, issue.17, pp.1015-1020, 2009.
DOI : 10.1016/j.ipl.2009.06.007

D. Sankoff, Matching Sequences under Deletion/Insertion Constraints, Proceedings of the National Academy of Sciences, vol.69, issue.1, pp.4-6, 1972.
DOI : 10.1073/pnas.69.1.4

A. Schmidt, M. Beigl, and H. Gellersen, There is more to context than location, Computers & Graphics, vol.23, issue.6, pp.893-901, 1999.
DOI : 10.1016/S0097-8493(99)00120-X

S. Sigg, S. Haseloff, and K. David, An Alignment Approach for Context Prediction Tasks in UbiComp Environments, IEEE Pervasive Computing, vol.9, issue.4, pp.90-97, 2010.
DOI : 10.1109/MPRV.2010.23

F. Temple, M. S. Smith, and . Waterman, Identification of common molecular subsequences, Journal of Molecular Biology, vol.147, issue.1, pp.195-197, 1981.

L. Song, D. Kotz, R. Jain, and X. He, Evaluating location predictors with extensive Wi-Fi mobility data, INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, pp.1414-1424, 2004.
DOI : 10.1145/965732.965747
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.848

P. Songram, V. Boonjing, and S. Intakosum, Closed Multidimensional Sequential Pattern Mining, Third International Conference on Information Technology: New Generations (ITNG'06), pp.512-517, 2006.
DOI : 10.1504/ijkms.2008.019752

R. Srikant and R. Agrawal, Mining generalized association rules, Proceeding of the 21st international conference on very large data bases (VLDB'95), pp.407-419, 1995.
DOI : 10.1016/S0167-739X(97)00019-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.7602

R. Srikant and R. Agrawal, Mining sequential patterns: Generalizations and performance improvements, EDBT'96 Proceeding of the 5th international conference on extending database technology: Advances in Database Technology, pp.3-17, 1996.
DOI : 10.1007/BFb0014140
URL : http://arbor.ee.ntu.edu.tw/~chyun/dmpaper/srikms96.pdf

P. Mark, K. L. Styczynski, I. Jensen, G. Rigoutsos, and . Stephanopoulos, BLOSUM62 miscalculations improve search performance, Nat Biotech, vol.26, issue.3, pp.274-275, 2008.

C. Voigtmann, K. David, H. Skistims, and A. Roßnagel, Legal assessment of context prediction techniques. 2012 IEEE Vehicular Technology Conference (VTC Fall), pp.1-5, 2012.

J. Wang and J. Han, BIDE: efficient mining of frequent closed sequences, Proceedings. 20th International Conference on Data Engineering, pp.79-90, 2004.
DOI : 10.1109/ICDE.2004.1319986

J. Wang and B. Prabhala, Periodicity Based Next Place Prediction, Nokia Mobile Data Challenge -Next Place Prediction, 2012.

W. Wang, J. Yang, and P. S. Yu, Mining patterns in long sequential data with noise, ACM SIGKDD Explorations Newsletter, vol.2, issue.2, pp.28-33, 2000.
DOI : 10.1145/380995.381008

J. L. Wesson, A. Singh, and B. Van-tonder, Can Adaptive Interfaces Improve the Usability of Mobile Applications? Human-Computer Interaction, pp.187-198, 2010.

X. Yan, J. Han, and R. Afshar, CloSpan: Mining: Closed Sequential Patterns in Large Datasets, Proc. 2003 SIAM Int'l Conf. Data Mining (SDM'03), pp.166-177, 2003.
DOI : 10.1137/1.9781611972733.15

G. Yang, The complexity of mining maximal frequent itemsets and maximal frequent patterns, Proceedings of the 2004 ACM SIGKDD international conference on Knowledge discovery and data mining , KDD '04, pp.344-353, 2004.
DOI : 10.1145/1014052.1014091

J. Yang, W. Wang, P. S. Yu, and J. Han, Mining long sequential patterns in a noisy environment, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, p.406, 2002.
DOI : 10.1145/564691.564738

Z. Yang and M. Kitsuregawa, LAPIN-SPAM: An Improved Algorithm for Mining Sequential Pattern, 21st International Conference on Data Engineering Workshops (ICDEW'05), pp.1222-1222, 2005.

Z. Yang, Y. Wang, and M. Kitsuregawa, LAPIN: Effective Sequential Pattern Mining Algorithms by Last Position Induction for Dense Databases, 12th International Conference on Database Systems for Advanced Applications, pp.1020-1023, 2007.
DOI : 10.1007/978-3-540-71703-4_95

M. Yoshida, T. Iizuka, H. Shiohara, and M. Ishiguro, Mining sequential patterns including time intervals, pp.213-220, 2000.
DOI : 10.1117/12.381735

J. Mohammed and . Zaki, Efficient enumeration of frequent sequences, Proceedings of the seventh international conference on Information and knowledge management, pp.68-75, 1998.

J. Mohammed and . Zaki, Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, vol.12, issue.3, pp.372-390, 2000.

J. Mohammed and . Zaki, SPADE: An Efficient Algorithm for Mining Frequent Sequences, Machine Learning, pp.31-601007652502315, 2001.

Q. Zhao and S. S. Bhowmick, Sequential pattern mining: A survey, 2003.

Z. Zhao, D. Yan, and W. Ng, Mining Probabilistically Frequent Sequential Patterns in Large Uncertain Databases, IEEE Transactions on Knowledge and Data Engineering, vol.26, issue.5, 2013.
DOI : 10.1109/TKDE.2013.124

Y. Zheng, L. Zhang, Z. Ma, X. Xie, and W. Ma, Recommending friends and locations based on individual location history, ACM Transactions on the Web, vol.5, issue.1, pp.1-44, 2011.
DOI : 10.1145/1921591.1921596

R. Feng, Z. , and T. Takaoka, A technique for two-dimensional pattern matching, Communications of the ACM, vol.32, issue.9, pp.1110-1120, 1989.

J. Ziv and A. Lempel, Compression of individual sequences via variablerate coding. Information Theory, IEEE Transactions on, vol.24, issue.5, pp.530-536, 1978.

B. Table, Similarity score table for battery

B. Table, Similarity score table for orientation values

G. Loglux, Batt Ori date Figure B.1.1.: Reference pattern 1 -evening and night at the week-end home

G. Loglux, Batt Ori date Figure B.1.2.: Reference pattern 2 -morning and transit to work on a week-day