{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T01:55:23Z","timestamp":1770688523332,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339758","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"1460-1468","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["On nested palindromes in clickstream data"],"prefix":"10.1145","author":[{"given":"Michel","family":"Speiser","sequence":"first","affiliation":[{"name":"IBM Research - Zurich & ETH Zurich, Rueschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Antonini","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Rueschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderrahim","family":"Labbi","sequence":"additional","affiliation":[{"name":"IBM Research - Zurich, Rueschlikon, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juliana","family":"Sutanto","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_2_2_1","volume-title":"International Conference on, 0: 3","author":"Agrawal R.","year":"1995","unstructured":"R. Agrawal and R. Srikant . Mining sequential patterns. Data Engineering , International Conference on, 0: 3 , 1995 . R. Agrawal and R. Srikant. Mining sequential patterns. Data Engineering, International Conference on, 0:3, 1995."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645806.670313"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.34"},{"key":"e_1_3_2_2_5_1","volume-title":"Morgan-Kauffman","author":"Chakrabarti S.","year":"2002","unstructured":"S. Chakrabarti . Mining the Web: Discovering Knowledge from Hypertext Data . Morgan-Kauffman , 2002 . S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan-Kauffman, 2002."},{"issue":"3","key":"e_1_3_2_2_6_1","first-page":"113","article-title":"Three models for the description of language. Information Theory","volume":"2","author":"Chomsky N.","year":"1956","unstructured":"N. Chomsky . Three models for the description of language. Information Theory , IRE Transactions on , 2 ( 3 ): 113 -- 124 , september 1956 . N. Chomsky. Three models for the description of language. Information Theory, IRE Transactions on, 2(3):113--124, september 1956.","journal-title":"IRE Transactions on"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/070710111"},{"key":"e_1_3_2_2_8_1","volume-title":"Mining Graph Data","author":"Cook D. J.","year":"2007","unstructured":"D. J. Cook and L. B. Holder . Mining Graph Data . John Wiley & Sons Inc ., 2007 . D. J. Cook and L. B. Holder. Mining Graph Data. John Wiley & Sons Inc., 2007."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815850","volume-title":"Statistical Models","author":"Davison A.","year":"2003","unstructured":"A. Davison . Statistical Models . Cambridge University Press , The Pitt Building, Trumpington Street, Cambridge, UK, 2003 . A. Davison. Statistical Models. Cambridge University Press, The Pitt Building, Trumpington Street, Cambridge, UK, 2003."},{"key":"e_1_3_2_2_10_1","volume-title":"UCI machine learning repository","author":"Frank A.","year":"2010","unstructured":"A. Frank and A. Asuncion . UCI machine learning repository , 2010 . A. Frank and A. Asuncion. UCI machine learning repository, 2010."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023454111924"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/262228"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69068-9_5"},{"key":"e_1_3_2_2_15_1","volume-title":"Exploring Hyperlinks, Contents, and Usage Data (Data-Centric Systems and Applications)","author":"Liu B.","year":"2006","unstructured":"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 . 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."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020499"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347122"},{"key":"e_1_3_2_2_18_1","first-page":"181","volume-title":"Efficient algorithms for discovering association rules","author":"Mannila H.","year":"1994","unstructured":"H. Mannila , H. Toivonen , and I. Verkamo . Efficient algorithms for discovering association rules . pages 181 -- 192 . AAAI Press , 1994 . H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. pages 181--192. AAAI Press, 1994."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10260-007-0057-5"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.77"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.172"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.122"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32262-7_1"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China","acronym":"KDD '12","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339758","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339758","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:18Z","timestamp":1750239258000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339758"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":24,"alternative-id":["10.1145\/2339530.2339758","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339758","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}