{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:46:48Z","timestamp":1743061608368,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642230905"},{"type":"electronic","value":"9783642230912"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23091-2_10","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:52:27Z","timestamp":1312951947000},"page":"107-117","source":"Crossref","is-referenced-by-count":2,"title":["How to Use \u201dClassical\u201d Tree Mining Algorithms to Find Complex Spatio-Temporal Patterns?"],"prefix":"10.1007","author":[{"given":"Nazha","family":"Selmaoui-Folcher","sequence":"first","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Flouvat","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"487","volume-title":"VLDB","author":"R. Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB, pp. 487\u2013499. Morgan Kaufmann, San Francisco (1994)"},{"key":"10_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T. Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.I.: Discovering frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-009-5123-9","volume":"78","author":"J.L. Balc\u00e1zar","year":"2010","unstructured":"Balc\u00e1zar, J.L., Bifet, A., Lozano, A.: Mining frequent closed rooted trees. Machine Learning\u00a078(1-2), 1\u201333 (2010)","journal-title":"Machine Learning"},{"key":"10_CR4","first-page":"82","volume-title":"ICDM","author":"H. Cao","year":"2005","unstructured":"Cao, H., Mamoulis, N., Cheung, D.W.: Mining frequent spatio-temporal sequential patterns. In: ICDM, pp. 82\u201389. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"10","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1109\/TKDE.2008.97","volume":"20","author":"M. Celik","year":"2008","unstructured":"Celik, M., Shekhar, S., Rogers, J.P., Shine, J.A.: Mixed-drove spatiotemporal co-occurrence pattern mining. IEEE Trans. Knowl. Data Eng.\u00a020(10), 1322\u20131335 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-24775-3_9","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Chi","year":"2004","unstructured":"Chi, Y., Yang, Y., Xia, Y., Muntz, R.R.: Cmtreeminer: Mining both closed and maximal frequent subtrees. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 63\u201373. Springer, Heidelberg (2004)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Du, X., Jin, R., Ding, L., Lee, V.E., Thornton Jr., J.H.: Migration motif: a spatial - temporal pattern mining approach for financial markets. In: KDD, pp. 1135\u20131144 (2009)","DOI":"10.1145\/1557019.1557142"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: KDD, pp. 330\u2013339 (2007)","DOI":"10.1145\/1281192.1281230"},{"issue":"6","key":"10_CR9","doi-asserted-by":"crossref","first-page":"603","DOI":"10.3233\/IDA-2010-0443","volume":"14","author":"A. Jim\u00e9nez","year":"2010","unstructured":"Jim\u00e9nez, A., Berzal, F., Talavera, J.C.C.: Frequent tree pattern mining: A survey. Intell. Data Anal.\u00a014(6), 603\u2013622 (2010)","journal-title":"Intell. Data Anal."},{"volume-title":"Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","year":"2004","key":"10_CR10","unstructured":"Kim, W., Kohavi, R., Gehrke, J., DuMouchel, W. (eds.): Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 22-25. ACM Press, USA (2004)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Mohan, P., Shekhar, S., Shine, J.A., Rogers, J.P.: Cascading spatio-temporal pattern discovery: A summary of results. In: SDM, pp. 327\u2013338 (2010)","DOI":"10.21236\/ADA543073"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Monreale, A., Pinelli, F., Trasarti, R., Giannotti, F.: Wherenext: a location predictor on trajectory pattern mining. In: KDD, pp. 637\u2013646 (2009)","DOI":"10.1145\/1557019.1557091"},{"key":"10_CR13","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. Kim et\u00a0al [10], 647\u2013652"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-02457-3_57","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2009","author":"F. Qian","year":"2009","unstructured":"Qian, F., He, Q., He, J.: Mining spread patterns of spatio-temporal co-occurrences over zones. In: Gervasi, O., Taniar, D., Murgante, B., Lagan\u00e0, A., Mun, Y., Gavrilova, M.L. (eds.) ICCSA 2009. LNCS, vol.\u00a05593, pp. 677\u2013692. Springer, Heidelberg (2009)"},{"key":"10_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/11731139_52","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Tan","year":"2006","unstructured":"Tan, H., Dillon, T.S., Hadzic, F., Chang, E., Feng, L.: Imb3-miner: Mining induced\/embedded subtrees by constraining the level of embedding. In: Ng, W.-K., Kitsuregawa, M., Li, J., Chang, K. (eds.) PAKDD 2006. LNCS (LNAI), vol.\u00a03918, pp. 450\u2013461. Springer, Heidelberg (2006)"},{"issue":"3","key":"10_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2007.190695","volume":"20","author":"A. Termier","year":"2008","unstructured":"Termier, A., Rousset, M.C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng.\u00a020(3), 300\u2013320 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Hsu, W., Mong Li Lee, J.W.: Mining generalized flow patterns. In: Temporal and Spatio-Temporal Data Mining, pp. 189\u2013208. IGI Publishing (2009)","DOI":"10.4018\/978-1-59904-387-6.ch009"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Hsu, W., Mong Li Lee, J.W.: Mining spatio-temporal trees. In: Temporal and Spatio-Temporal Data Mining, pp. 209\u2013226. IGI Publishing (2009)","DOI":"10.4018\/978-1-59904-387-6.ch010"},{"key":"10_CR19","first-page":"379","volume-title":"ICDM","author":"Y. Xiao","year":"2003","unstructured":"Xiao, Y., Yao, J.F., Li, Z., Dunham, M.H.: Efficient data mining for maximal frequent subtrees. In: ICDM, pp. 379\u2013386. IEEE Computer Society, Los Alamitos (2003)"},{"key":"10_CR20","unstructured":"Yao, X.: Research issues in spatio-temporal data mining. In: White paper UCGIS (2003)"},{"key":"10_CR21","first-page":"347","volume-title":"Geographic Data Mining and Knowledge Discovery","author":"M. Yuan","year":"2008","unstructured":"Yuan, M.: Toward knowledge discovery about geographic dynamics in spatiotemporal databases. In: Han, J., Miller, H.J. (eds.) Geographic Data Mining and Knowledge Discovery, pp. 347\u2013365. Taylor and Francis, Abington (2008)"},{"issue":"1-2","key":"10_CR22","first-page":"33","volume":"66","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform.\u00a066(1-2), 33\u201352 (2005)","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23091-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:39:16Z","timestamp":1560454756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23091-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642230905","9783642230912"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23091-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}