{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:06:23Z","timestamp":1725473183898},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540476634"},{"type":"electronic","value":"9783540476641"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11906070_7","type":"book-chapter","created":{"date-parts":[[2006,11,22]],"date-time":"2006-11-22T08:18:36Z","timestamp":1164183516000},"page":"73-82","source":"Crossref","is-referenced-by-count":0,"title":["Mining Maximum Frequent Access Patterns in Web Logs Based on Unique Labeled Tree"],"prefix":"10.1007","author":[{"given":"Ling","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Jian-ping","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Yu-bin","family":"Zhan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Agrawal, S.: Fast algorithms for mining association rules in large database. In: VLDB 1994, Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., et al.: Mining access patterns efficiently from Web logs. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805. Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-45571-X_47"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Srivastava, J., Cooley, R., et al.: Web usage mining: Discovery and applications of usage patterns from Web data. In: SIGKDD Explorations, vol.\u00a01 (2000)","DOI":"10.1145\/846183.846188"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Kosala, R., Blockeel, H.: Web mining research: a survey. In: ACM SIGKDD Explorations (2000)","DOI":"10.1145\/360402.360406"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335372"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"T. Inokuchi","year":"2000","unstructured":"Inokuchi, T., Washio, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS, vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM 2001, San Jose, USA (2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Sun, L., Zhang, X.: Efficient Frequent Pattern Mining on Web Logs. In: APWeb 2004, pp. 533\u2013542 (2004)","DOI":"10.1007\/978-3-540-24655-8_58"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10618-005-0248-3","volume":"10","author":"Y.L. Ezeife","year":"2005","unstructured":"Ezeife, Y.L.: Mining Web Log Sequential Patterns with Position Coded Pre-Order Linked WAP-Tree. Data Mining and Knowledge Discovery\u00a010, 5\u201338 (2005)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"7_CR10","first-page":"405","volume":"38","author":"H. Jiawei","year":"2001","unstructured":"Jiawei, H., Xiaofeng, M., Jing, W., Shengen, L.: Research on Web Ming: a Survey. Journal of computer research & development\u00a038(4), 405\u2013413 (2001)","journal-title":"Journal of computer research & development"},{"issue":"4","key":"7_CR11","first-page":"230","volume":"38","author":"W. Wei","year":"2005","unstructured":"Wei, W., Haofeng, Z., Qingqing, Y., et al.: Mining Frequent Pattern Based Graph Theory. Journal of computer research & development\u00a038(4), 230\u2013235 (2005)","journal-title":"Journal of computer research & development"},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF03325089","volume":"1","author":"R. Cooley","year":"1999","unstructured":"Cooley, R., Mobasher, B., et al.: Data Preparation for Mining World Wide Web Browsing Patterns. Knowledge and Information System\u00a01, 5\u201323 (1999)","journal-title":"Knowledge and Information System"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF02944901","volume":"19","author":"C. Wang","year":"2004","unstructured":"Wang, C., Hong, M., Wang, W., et al.: Chopper: Efficient Algorithm for Tree Mining. Journal of computer science and technology\u00a019(4), 309\u2013319 (2004)","journal-title":"Journal of computer science and technology"},{"issue":"2","key":"7_CR14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"27","author":"Y. Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees. IEEE Transactions on Knowledge and Data Engineering\u00a027(2), 190\u2013202 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems \u2013 WISE 2006 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11906070_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:38:07Z","timestamp":1619509087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11906070_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540476634","9783540476641"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11906070_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}