{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:28:59Z","timestamp":1760981339443,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650829"},{"type":"electronic","value":"9783540496557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056006","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:28:08Z","timestamp":1154248088000},"page":"248-259","source":"Crossref","is-referenced-by-count":3,"title":["Using stem rules to refine document retrieval queries"],"prefix":"10.1007","author":[{"given":"Ye","family":"Liu","sequence":"first","affiliation":[]},{"given":"Hanxiong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Nobuo","family":"Ohbo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,31]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T.Imielinski and A.Swami: Mining Association Rules between Sets of Items in Large Databases. ACM SIGMOD'93, pp.207\u2013216, Washington, DC, USA.","DOI":"10.1145\/170036.170072"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"J.Allan: Relevance Feedback With Too Much Data. ACM SIGIR'95, pp.337\u2013343, Seattll, WA, USA.","DOI":"10.1145\/215206.215380"},{"key":"20_CR3","volume-title":"Lecture Notes in Artificial Intelligence","author":"T. Andreasen","year":"1998","unstructured":"T. Andreasen, H. L. Larsen, & H. Christiansen: Term Associations and Flexible Querying. Proc. FQAS'98, International Conference on Flexible Query Answering Systems, May 13\u201315, 1998, Roskilde, Danmark. Lecture Notes in Artificial Intelligence, Springer-Verlag 1998 (this volume)."},{"key":"20_CR4","unstructured":"C. Buckley et al. Automatic query expansion using SMART: TREC 3. In D. K. Harman ed. Overview of the 3rd Text REtrieval Conference. NIST Special Publication, 1995."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"C.M.Chen and N.Roussopoulos: Adaptive Selectivity Estimation Using Query Feedback. ACM SIGMOD'94, pp.161\u2013172, Minneapolis, Minnesota, USA.","DOI":"10.1145\/191843.191874"},{"issue":"64","key":"20_CR6","first-page":"227","volume":"97","author":"H. Chen","year":"1997","unstructured":"H. Chen, Y. Liu & N. Ohbo: Keyword Document Retrieval by Data Mining. IPSJ SIG Notes, Vol.97(64), pp.227\u2013232, Sapporo, Japan, 1997 (in Japanese)","journal-title":"IPSJ SIG Notes"},{"key":"20_CR7","unstructured":"U.Fayyad, G.Piatestsky & P.Smyth: From Data Mining to Knowledge Discovery in Databases. The 3rd Knowledge Discovery and Data Mining, pp.37\u201353, California, USA, 1996."},{"key":"20_CR8","unstructured":"J.Han and Y.Fu: Discovery of Multiple-Level Association Rules from Large Databases. 21st VLDB, pp.420\u2013431, Zurich, Swizerland, 1995."},{"key":"20_CR9","unstructured":"M. Nagao et al. ed. Encyclopedic Dictionary of Computer Science. ISBN4-00-080074-4, pp.215, 1990(in Japanese)."},{"issue":"5","key":"20_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1002\/(SICI)1097-4571(199106)42:5<378::AID-ASI8>3.0.CO;2-8","volume":"42","author":"H.J. Peat","year":"1991","unstructured":"H.J. Peat and P. Willett: The Limitations of Term Co-Occurrence Data for Data for Query Expansion in Document Retrieval Systems. Journal of The American Society for Information Science, vol.42(5), pp.378\u2013383, 1991.","journal-title":"Journal of The American Society for Information Science"},{"key":"20_CR11","unstructured":"A.Savasere, E.Omiecinski and S.Navathe: An Efficient Algorithm for Mining Association Rules in Large Databases. 21st VLDB, pp.432\u2013444, Zurich, Swizerland, 1995."},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1002\/(SICI)1097-4571(199006)41:4<288::AID-ASI8>3.0.CO;2-H","volume":"41","author":"G. Salton","year":"1990","unstructured":"G. Salton and C. Buckley: Improving Retrieval Performance By Relevance Feedback. Journal of The American Society for Information Science, vol.41(4), pp.288\u2013297, 1990.","journal-title":"Journal of The American Society for Information Science"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"R.Srikant and R.Agrawal: Mining Quantitative Association Rules in Large Relational Tables. ACM SIGMOD'96, pp.1\u201312, Montreal, Canada, 1996.","DOI":"10.1145\/233269.233311"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Jinxi Xu and W.Bruce Croft: Query Expansion Using Local and Global Document Analysis. ACM SIGIR '96, pp.4\u201311, Zurich, Switzerland, 1996.","DOI":"10.1145\/243199.243202"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"B. V\u00e9lez, et al: Fast and Effective Query Refinement. ACM SIGIR'97, pp.6\u201315, Philadelphia, PA, USA 1997.","DOI":"10.1145\/278459.258528"}],"container-title":["Lecture Notes in Computer Science","Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T07:06:39Z","timestamp":1736492799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650829","9783540496557"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0056006","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}