{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:22:29Z","timestamp":1742937749779,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319238258"},{"type":"electronic","value":"9783319238265"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23826-5_5","type":"book-chapter","created":{"date-parts":[[2015,9,4]],"date-time":"2015-09-04T08:20:20Z","timestamp":1441354820000},"page":"46-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Term Set Prediction Using the Bell-Wigner Inequality"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Melucci","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,5]]},"reference":[{"key":"5_CR1","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Pearson International Edition (2006)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD, Washington, D.C., pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF01594946","volume":"50","author":"I Pitowsky","year":"1991","unstructured":"Pitowsky, I.: Correlation polytopes: Their geometry and complexity. Mathematical Programming 50, 395\u2013414 (1991)","journal-title":"Mathematical Programming"},{"key":"5_CR5","unstructured":"Pitowsky, I.: Quantum Probability - Quantum Logic. Springer (1989)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Blanco, R., Boldi, P.: Extending BM25 with multiple query operators. In: Proceedings of SIGIR, pp. 921\u2013930 (2012)","DOI":"10.1145\/2348283.2348406"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery 15, 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M., Pietracaprina, A., Pucci, G., Upfal, E., Vandin, F.: An efficient rigorous approach for identifying statistically significant frequent itemsets. Journal of the ACM 59(3) (2012)","DOI":"10.1145\/2220357.2220359"},{"key":"5_CR9","unstructured":"Wang, K., He, Y., Han, J.: Mining frequent itemsets using support constraints. In: Proceedings of VLDB (2000)"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"11","author":"D Burdick","year":"2005","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: MAFIA: A maximal frequent itemset algorithm. IEEE Transactions on Knowledge and Data Engineering 11, 1490\u20131504 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5_CR11","unstructured":"Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proceedings of ICDM (2001)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: Proceedings of KDD, pp. 401\u2013406. ACM New York (2001)","DOI":"10.1145\/502512.502572"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Liu, J., Pan, Y., Wang, K., Han, J.: Mining frequent item sets by opportunistic projection. In: Proceedings of KDD, pp. 229\u2013238. ACM, New York (2002)","DOI":"10.1145\/775047.775081"},{"key":"5_CR14","unstructured":"Pei, J., Han, J., Lu, H., Nishio, S., Tang, S., Yang, D.: H-mine: Hyper-structure mining of frequent patterns in large databases. In: Proceedings of ICDM, pp. 441\u2013448. IEEE Computer Society, Washington, DC (2001)"},{"key":"5_CR15","unstructured":"Pietracaprina, A., Zandolin, D.: Mining frequent itemsets using patricia tries. In: Goethals, B., Zaki, M.J. (eds.) FIMI. CEUR Workshop Proceedings, vol. 90. CEUR-WS.org (2003)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Schlegel, B., Gemulla, R., Lehner, W.L.W.: Memory-efficient frequent-itemset mining. In: Proceedings of EDBT, pp. 461\u2013472 (2011)","DOI":"10.1145\/1951365.1951420"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1145\/1095872.1095874","volume":"23","author":"B P\u00f4ssas","year":"2005","unstructured":"P\u00f4ssas, B., Ziviani, N., Meira Jr, W., Ribeiro-Neto, B.: Set-based vector model: An efficient approach for correlation-based ranking. ACM Trans. Inf. Syst. 23(4), 397\u2013429 (2005)","journal-title":"ACM Trans. Inf. Syst."},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10844-005-0196-9","volume":"25","author":"A Amir","year":"2005","unstructured":"Amir, A., Aumann, Y., Feldman, R., Fresko, M.: Maximal association rules: A tool for mining associations in text. J. Intell. Inf. Syst. 25(3), 333\u2013345 (2005)","journal-title":"J. Intell. Inf. Syst."},{"issue":"2\u20133","key":"5_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1009887712954","volume":"4","author":"S Sarawagi","year":"2000","unstructured":"Sarawagi, S., Thomas, S., Agrawal, R.: Integrating association rule mining with relational database systems: Alternatives and implications. Data Min. Knowl. Discov. 4(2\u20133), 89\u2013125 (2000)","journal-title":"Data Min. Knowl. Discov."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Fonseca, B.M., Golgher, P., P\u00f4ssas, B., Ribeiro-Neto, B., Ziviani, N.: Concept-based interactive query expansion. In: Proceedings of CIKM, CIKM 2005, pp. 696\u2013703. ACM, New York (2005)","DOI":"10.1145\/1099554.1099726"},{"issue":"4","key":"5_CR21","first-page":"215","volume":"2","author":"BM Fonseca","year":"2003","unstructured":"Fonseca, B.M., Golgher, P.B., De Moura, E.S., P\u00f4ssas, B., Ziviani, N.: Discovering search engine related queries using association rules. J. Web Eng. 2(4), 215\u2013227 (2003)","journal-title":"J. Web Eng."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-540-78646-7_31","volume-title":"Advances in Information Retrieval","author":"D Song","year":"2008","unstructured":"Song, D., Huang, Q., R\u00fcger, S.M., Bruza, P.D.: Facilitating Query Decomposition in Query Language Modeling by Association Rule Mining Using Multiple Sliding Windows. In: Macdonald, C., Ounis, I., Plachouras, V., Ruthven, I., White, R.W. (eds.) ECIR 2008. LNCS, vol. 4956, pp. 334\u2013345. Springer, Heidelberg (2008)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2) (2006)","DOI":"10.1145\/1132956.1132959"},{"issue":"4","key":"5_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1561\/1500000019","volume":"3","author":"S Robertson","year":"2009","unstructured":"Robertson, S., Zaragoza, H.: The probabilistic relevance framework: BM25 and beyond. Foundations and Trends in Information Retrieval 3(4), 333\u2013389 (2009)","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"5_CR25","unstructured":"Keyword Discovery. http:\/\/www.keyworddiscovery.com\/keyword-stats.html (visited on April 2014)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Bendersky, M., Croft, W.B.: Analysis of long queries in a large scale search log. In: Proceedings of the Workshop on Web Search Click Data, WSCD 2009, pp. 8\u201314. ACM, New York (2009)","DOI":"10.1145\/1507509.1507511"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Gan, Q., Attenberg, J., Markowetz, A., Suel, T.: Analysis of geographic queries in a search engine log. In: Proceedings of the International Workshop on Location and the Web, LOCWEB 2008, pp. 49\u201356. ACM New York (2008)","DOI":"10.1145\/1367798.1367806"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ipm.2004.10.007","volume":"42","author":"BJ Jansen","year":"2006","unstructured":"Jansen, B.J., Spink, A.: How are we searching the world wide web?: a comparison of nine search engine transaction logs. Inf. Process. Manage. 42, 248\u2013263 (2006)","journal-title":"Inf. Process. Manage."},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Jansen, B.J., Booth, D.L., Spink, A.: Determining the user intent of Web search engine queries. In: Proceedings of WWW, pp. 1149\u20131150. ACM, New York (2007)","DOI":"10.1145\/1242572.1242739"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1016\/j.ipm.2007.07.015","volume":"44","author":"BJ Jansen","year":"2008","unstructured":"Jansen, B.J., Booth, D.L., Spink, A.: Determining the informational, navigational, and transactional intent of Web queries. Inf. Process. Manage. 44, 1251\u20131266 (2008)","journal-title":"Inf. Process. Manage."},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"1358","DOI":"10.1002\/asi.21071","volume":"60","author":"BJ Jansen","year":"2009","unstructured":"Jansen, B.J., Booth, D.L., Spink, A.: Patterns of query reformulation during Web searching. Journal of the American Society for Information Science and Technology 60, 1358\u20131371 (2009)","journal-title":"Journal of the American Society for Information Science and Technology"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Huston, S., Croft, W.B.: Evaluating verbose query processing techniques. In: Proceedings of SIGIR, pp. 291\u2013298. ACM, New York (2010)","DOI":"10.1145\/1835449.1835499"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23826-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T11:33:36Z","timestamp":1676979216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23826-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319238258","9783319238265"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23826-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"5 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}