On nested palindromes in clickstream data

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1460-1468

  Speiser, Michel ^a,b   Antonini, Gianluca ^a   Labbi, Abderrahim ^a   Sutanto, Juliana ^b  

^a IBM RESEARCH ZURICH   (Switzerland)

^b ETH ZURICH   (Switzerland)

Author keywords

backtrack; palindrome; refresh; web usage mining

Indexed keywords

BACKTRACK; CLICKSTREAM DATA; LINEAR-TIME ALGORITHMS; MINING ALGORITHMS; PALINDROME; PALINDROMIC; REAL DATA SETS; REFRESH; SEQUENCE DATA; SYMBOL REPETITION; USEFUL PROPERTIES; WEB USAGE MINING;

CLUSTERING ALGORITHMS; LINGUISTICS; WEBSITES;

DATA MINING;

EID: 84866010150     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339758     Document Type: Conference Paper

References (24)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487-499, 1994.
2. R. Agrawal and R. Srikant. Mining sequential patterns. Data Engineering, International Conference on, 0:3, 1995.
3. T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, PKDD '02, pages 74-85, London, UK, UK, 2002. Springer-Verlag.
4. G. Casas-Garriga. Summarizing sequential data with closed partial orders. In Proceedings of the Fifth SIAM International Conference on Data Mining, pages 380-390, 2005.
5. S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan-Kauffman, 2002.
6. N. Chomsky. Three models for the description of language. Information Theory, IRE Transactions on, 2(3):113-124, september 1956.
7. A. Clauset, C. R. Shalizi, and M. E. J. Newman. Power-law distributions in empirical data. SIAM Reviews, June 2007.
8. D. J. Cook and L. B. Holder. Mining Graph Data. John Wiley & Sons Inc., 2007.
9. A. Davison. Statistical Models. Cambridge University Press, The Pitt Building, Trumpington Street, Cambridge, UK, 2003.
10. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
11. M. Giel-Pietraszuk, M. Hoffmann, S. Dolecka, J. Rychlewski, and J. Barciszewski. Palindromes in proteins. Journal of Protein Chemistry, 22:109-113, 2003. 10.1023/A:1023454111924.
12. D. Gusfield. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York, NY, USA, 1997.
13. J. Han, H. Cheng, D. Xin, and X. Yan. Frequent pattern mining: Current status and future directions. Data Mining and Knowledge Discovery, 14(1), 2007.
14. R. Kolpakov and G. Kucherov. Searching for gapped palindromes. In P. Ferragina and G. Landau, editors, Combinatorial Pattern Matching, volume 5029 of Lecture Notes in Computer Science, pages 18-30. Springer Berlin / Heidelberg, 2008.
15. B. Liu. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data (Data-Centric Systems and Applications). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
16. M. Mampaey, N. Tatti, and J. Vreeken. Tell me what i need to know: succinctly summarizing data with itemsets. In KDD, pages 573-581, 2011.
17. H. Mannila and C. Meek. Global partial orders from sequential data. In KDD '00: Proceedings of the sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 161-168. ACM, 2000.
18. H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. pages 181-192. AAAI Press, 1994.
19. S. Morgenthaler. A survey of robust statistics. Statistical Methods & Applications, 16:171-172, 2007.
20. J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, U. Dayal, and M.-C. Hsu. Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Transactions on Knowledge and Data Engineering, 16(11):2004, 2004.
21. J. Pei, H. Wang, J. Liu, K. Wang, J. Wang, and P. S. Yu. Discovering frequent closed partial orders from strings. IEEE Transactions on Knowledge and Data Engineering, 18:1467-1481, November 2006.
22. M. Speiser, G. Antonini, and A. Labbi. Ranking web-based partial orders by significance using a markov reference model. In IEEE 11th International Conference on Data Mining (ICDM), 2011.
23. X. Yan, J. Han, and R. Afshar. Clospan: Mining closed sequential patterns in large datasets. In In SDM, pages 166-177, 2003.
24. M. Zaki, N. Parimi, N. De, F. Gao, B. Phoophakdee, J. Urban, V. Chaoji, M. Hasan, and S. Salem. Towards generic pattern mining. In B. Ganter and R. Godin, editors, Formal Concept Analysis, volume 3403 of Lecture Notes in Computer Science, pages 1-20. Springer Berlin / Heidelberg, 2005.