{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:30:34Z","timestamp":1760596234421},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T00:00:00Z","timestamp":1395705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10115-014-0738-y","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T10:50:41Z","timestamp":1395658241000},"page":"529-553","source":"Crossref","is-referenced-by-count":5,"title":["SFP-Rank: significant frequent pattern analysis for effective ranking"],"prefix":"10.1007","volume":"43","author":[{"given":"Yuanfeng","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth Wai-Ting","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,25]]},"reference":[{"key":"738_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB \u201994, pp 487\u2013499"},{"key":"738_CR2","unstructured":"AOL Dataset (n.d.), http:\/\/zola.di.unipi.it\/smalltext\/datasets.html"},{"key":"738_CR3","volume-title":"Modern information retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates R, Ribeiro-Neto B (1999) Modern information retrieval. Addison Wesley, Reading, MA"},{"key":"738_CR4","doi-asserted-by":"crossref","unstructured":"Batal I, Hauskrecht M (2010) Constructing classification features using minimal predictive patterns. In: Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM \u201910. ACM, New York, NY, USA, pp 869\u2013878","DOI":"10.1145\/1871437.1871549"},{"key":"738_CR5","unstructured":"Burges C, Ragno R, Le Q (2006) Learning to rank with nonsmooth cost functions. In: NIPS \u201906, pp 193\u2013200"},{"key":"738_CR6","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E et al (2005) Learning to rank using gradient descent. In: ICML \u201905, pp 89\u201396","DOI":"10.1145\/1102351.1102363"},{"key":"738_CR7","doi-asserted-by":"crossref","unstructured":"Cao H, Jiang D, Pei J et al (2008) Context-aware query suggestion by mining click-through and session data. In: KDD \u201908, pp 875\u2013883","DOI":"10.1145\/1401890.1401995"},{"key":"738_CR8","doi-asserted-by":"crossref","unstructured":"Cao Y, Xu J, Liu T-Y et al (2006) Adapting ranking svm to document retrieval. In: SIGIR \u201906, pp 186\u2013193","DOI":"10.1145\/1148170.1148205"},{"key":"738_CR9","doi-asserted-by":"crossref","unstructured":"Cao Z, Qin T, Liu T-Y et al (2007) Learning to rank: from pairwise approach to listwise approach. In: ICML \u201907, pp 129\u2013136","DOI":"10.1145\/1273496.1273513"},{"key":"738_CR10","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J et al (2007) Discriminative frequent pattern analysis for effective classification. In: ICDE \u201907, pp 169\u2013178","DOI":"10.1109\/ICDE.2007.367917"},{"key":"738_CR11","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J et al (2008) Direct discriminative pattern mining for effective classification. In: ICDE \u201908, pp. 169\u2013178","DOI":"10.1109\/ICDE.2008.4497425"},{"key":"738_CR12","doi-asserted-by":"crossref","unstructured":"Cossock D, Zhang T (2006) Subset ranking using regression. In: Learning theory, volume 4005 of LNCS\u201906, pp 605\u2013619","DOI":"10.1007\/11776420_44"},{"key":"738_CR13","doi-asserted-by":"crossref","unstructured":"Fagin R, Kumar R, Sivakumar D (2003) Comparing top k lists. In: SODA \u201903, pp 28\u201336","DOI":"10.1137\/S0895480102412856"},{"key":"738_CR14","unstructured":"Fayyad UM, Irani KB (1993) Multi-interval discretization of continuous-valued attributes for classification learning. In: UAI \u201993, pp 1022\u20131027"},{"key":"738_CR15","unstructured":"Freund Y, Iyer R, Schapire RE et al (2003) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4:933\u2013969"},{"key":"738_CR16","doi-asserted-by":"crossref","unstructured":"Geng X, Liu T-Y, Qin T et al (2007) Feature selection for ranking. In: SIGIR \u201907, pp 407\u2013414","DOI":"10.1145\/1277741.1277811"},{"key":"738_CR17","unstructured":"Grahne G, Zhu J (2003) Efficiently using prefix-trees in mining frequent itemsets. In: FIMI\u201903"},{"issue":"1","key":"738_CR18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D et al (2007) Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1):55\u201386","journal-title":"Data Min. Knowl. Discov."},{"key":"738_CR19","doi-asserted-by":"crossref","unstructured":"Hong L, Bekkerman R, Adler J et al (2012) Learning to rank social update streams. In: SIGIR \u201912, pp 651\u2013660","DOI":"10.1145\/2348283.2348371"},{"issue":"1","key":"738_CR20","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/281250.281253","volume":"32","author":"BJ Jansen","year":"1998","unstructured":"Jansen BJ, Spink A, Bateman J et al (1998) Real life information retrieval: a study of user queries on the web. SIGIR Forum 32(1):5\u201317","journal-title":"SIGIR Forum"},{"key":"738_CR21","doi-asserted-by":"crossref","unstructured":"Jiang D, Leung KW-T, Ng W (2011) Context-aware search personalization with concept preference. In: CIKM \u201911, pp 563\u2013572","DOI":"10.1145\/2063576.2063661"},{"key":"738_CR22","doi-asserted-by":"crossref","unstructured":"Joachims T (2006) Training linear svms in linear time. In: KDD \u201906, pp 217\u2013226","DOI":"10.1145\/1150402.1150429"},{"key":"738_CR23","doi-asserted-by":"crossref","unstructured":"Karimzadehgan M, Li W, Zhang R et al (2011) A stochastic learning-to-rank algorithm and its application to contextual advertising. In: WWW \u201911, pp 377\u2013386","DOI":"10.1145\/1963405.1963460"},{"key":"738_CR24","unstructured":"Li P, Burges CJC, Wu Q (2007) Mcrank: learning to rank using multiple classification and gradient boosting. In: NIPS \u201907, pp 845\u2013852"},{"key":"738_CR25","unstructured":"Li W, Han J, Pei J (2001) Cmar: Accurate and efficient classification based on multiple class-association rules. In: ICDM \u201901, vol 0, pp 369\u2013376"},{"key":"738_CR26","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: KDD \u201998, pp 80\u201386"},{"key":"738_CR27","doi-asserted-by":"crossref","unstructured":"Nallapati R (2004) Discriminative models for information retrieval. In: SIGIR \u201904, pp 64\u201371","DOI":"10.1145\/1008992.1009006"},{"key":"738_CR28","unstructured":"Qin T, Liu T, Tsai M et al (2006) Learning to search web pages with query-level loss functions. Technical report, Microsoft Research"},{"key":"738_CR29","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/s10791-009-9123-y","volume":"13","author":"T Qin","year":"2010","unstructured":"Qin T, Liu T, Xu J et al (2010) Letor: a benchmark collection for research on learning to rank for information retrieval. Inf Retr 13:346\u2013374","journal-title":"Inf Retr"},{"key":"738_CR30","doi-asserted-by":"crossref","unstructured":"Qin T, Zhang X-D, Wang D-S et al (2007) Ranking with multiple hyperplanes. In: SIGIR \u201907, pp 279\u2013286","DOI":"10.1145\/1277741.1277791"},{"key":"738_CR31","doi-asserted-by":"crossref","unstructured":"Sculley D (2010) Combined regression and ranking. In: KDD \u201910. ACM, New York, NY, USA, pp 979\u2013988","DOI":"10.1145\/1835804.1835928"},{"key":"738_CR32","doi-asserted-by":"crossref","unstructured":"Song Y, Leung K, Fang Q et al (2013) Fp-rank: an effective ranking approach based on frequent pattern analysis. In: DASFAA \u201913","DOI":"10.1007\/978-3-642-37450-0_27"},{"key":"738_CR33","doi-asserted-by":"crossref","unstructured":"Tan J, Bu Y, Yang B (2009) An efficient close frequent pattern mining algorithm. In: ICICTA \u201909, vol 1, pp 528\u2013531","DOI":"10.1109\/ICICTA.2009.134"},{"key":"738_CR34","unstructured":"Thomas Fasciano RS, Shin MC (2012) Learning to rank biological motion trajectories. Image Vis Comput 31(6\u20137):502\u2013510"},{"key":"738_CR35","doi-asserted-by":"crossref","unstructured":"Tong Y, Chen L, Cheng Y et al (2012) Mining frequent itemsets over uncertain databases. PVLDB\u201912 5(11):1650\u20131661","DOI":"10.14778\/2350229.2350277"},{"key":"738_CR36","doi-asserted-by":"crossref","unstructured":"Tong Y, Chen L, Ding B (2012) Discovering threshold-based frequent closed itemsets over probabilistic data. In: ICDE \u201912, pp 270\u2013281","DOI":"10.1109\/ICDE.2012.51"},{"key":"738_CR37","doi-asserted-by":"crossref","unstructured":"Tong Y, Chen L, Yu PS (2012) Ufimt: an uncertain frequent itemset mining toolbox. In: KDD \u201912, pp 1508\u20131511","DOI":"10.1145\/2339530.2339767"},{"key":"738_CR38","unstructured":"Tsai M-F, Liu T-Y, Qin T et al (2007) Frank: a ranking method with fidelity loss. In: SIGIR \u201907, pp 383\u2013390"},{"key":"738_CR39","unstructured":"Valizadegan H, Jin R, Zhang R et al (2009) Learning to rank by optimizing ndcg measure. In: NIPS \u201909"},{"key":"738_CR40","doi-asserted-by":"crossref","unstructured":"Veloso AA, Almeida HM, Gon\u00e7alves MA et al (2008) Learning to rank at query-time using association rules. In: SIGIR \u201908, pp 267\u2013274","DOI":"10.1145\/1390334.1390381"},{"key":"738_CR41","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10791-010-9136-6","volume":"14","author":"S Verberne","year":"2011","unstructured":"Verberne S, van Halteren H, Theijssen D et al (2011) Learning to rank for why-question answering. Inf Retr 14:107\u2013132","journal-title":"Inf Retr"},{"key":"738_CR42","unstructured":"Volkovs MN, Zemel RS (2009) Boltzrank: learning to maximize expected ranking gain. In: ICML \u201909, pp 1089\u20131096"},{"key":"738_CR43","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/TKDE.2006.179","volume":"18","author":"J Wang","year":"2006","unstructured":"Wang J, Karypis G (2006) On mining instance-centric classification rules. IEEE Trans. Knowl. Data Eng. 18:1497\u20131511","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"738_CR44","doi-asserted-by":"crossref","unstructured":"Xu J, Li H (2007) Adarank: a boosting algorithm for information retrieval. In: SIGIR \u201907, pp 391\u2013398","DOI":"10.1145\/1277741.1277809"},{"key":"738_CR45","doi-asserted-by":"crossref","unstructured":"Yin X, Han J (2003) Cpar: classification based on predictive association rules. In: SDM\u201903","DOI":"10.1137\/1.9781611972733.40"},{"key":"738_CR46","doi-asserted-by":"crossref","unstructured":"Yue Y, Finley T, Radlinski F et al (2007) A support vector method for optimizing average precision. In: SIGIR\u201907, pp 271\u2013278","DOI":"10.1145\/1277741.1277790"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0738-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-014-0738-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-014-0738-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T21:09:02Z","timestamp":1565298542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-014-0738-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,25]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["738"],"URL":"https:\/\/doi.org\/10.1007\/s10115-014-0738-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,25]]}}}