{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:19Z","timestamp":1725516259964},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540788072"},{"type":"electronic","value":"9783540788089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78808-9_12","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"129-136","source":"Crossref","is-referenced-by-count":0,"title":["A Phrase Recommendation Algorithm Based on Query Stream Mining in Web Search Engines"],"prefix":"10.1007","author":[{"given":"M.","family":"Barouni-Ebrahimi","sequence":"first","affiliation":[]},{"given":"Ali A.","family":"Ghorbani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Barouni-Ebrahimi, M., Ghorbani, A.A.: A novel approach for frequent phrase mining in web search engine query streams. In: Barouni-Ebrahimi, M. (ed.) Communication Networks and Services Research Conference (CNSR 2007), Fredericton, Canada, 14-17 May, pp. 125\u2013132 (2007)","DOI":"10.1109\/CNSR.2007.5"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Barouni-Ebrahimi, M., Ghorbani, A.A.: An online frequency rate based algorithm for mining frequent sequences in evolving data streams. In: international conference on information technology and management (ICITM 2007), Hong Kong (2007)","DOI":"10.1142\/9789812819079_0009"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bast, H., Weber, I.: Type less, find more: Fast autocompletion search with a succinct index. In: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 2006), New York, NY, USA (2006)","DOI":"10.1145\/1148170.1148234"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Widmayer, P., et al. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"key":"12_CR5","unstructured":"Li, H.-F., Lee, S.-Y., Shan, M.-K.: Online mining (recently) maximal frequent itemsets over data streams. In: 15th International Workshop on Research Issues in Data Engineering: Stream Data Mining and Applications (RIDE-SDMA 2005), pp. 11\u201318 (2005)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Raghavan, V.V., Sever, H.: On the reuse of past optimal queries. In: Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR 1995), New York, NY, USA, pp. 344\u2013350 (1995)","DOI":"10.1145\/215206.215381"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78808-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:15:35Z","timestamp":1606166135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78808-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788072","9783540788089"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78808-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}