Bottom-k document retrieval

Baeza-Yates, 2011 Belazzougui, 2013, Improved compressed indexes for full-text document retrieval, J. Discrete Algorithms, 18, 3, 10.1016/j.jda.2012.07.005 Burns, 2001, A systematic approach to discovering correlation rules for event management Büttcher, 2010 Cagliero, 2014, Infrequent weighted itemset mining using frequent pattern growth, IEEE Trans. Knowl. Data Eng., 26, 903, 10.1109/TKDE.2013.69 Chan, 2012, Linear-space data structures for range minority query in arrays, 295 Dong, 2011, Mining interesting infrequent and frequent itemsets based on minimum correlation strength, vol. 7002, 437 Durocher, 2013, Linear-space data structures for range frequency queries on arrays and trees, 325 El-Falah, 2013, Extraction of infrequent simple motifs from a finite set of sequences using a lattice structure, Recent Pat DNA Gene Seq., 7, 123, 10.2174/1872215611307020006 Fischer, 2012, Forbidden patterns, vol. 7256, 327 Gagie, 2013, Colored range queries and document retrieval, Theor. Comput. Sci., 483, 36, 10.1016/j.tcs.2012.08.004 Gupta Haglin, 2007, On minimal infrequent itemset mining, 141 Herold, 2008, Efficient computation of absent words in genomic sequences, BMC Bioinform., 9, 167, 10.1186/1471-2105-9-167 Hon, 2013, Faster compressed top-k document retrieval, 341 Hon, 2009, Space-efficient framework for top-k string retrieval problems, 713 Ji, 2013, A method for mining infrequent causal associations and its application in finding adverse drug reaction signal pairs, IEEE Trans. Knowl. Data Eng., 25, 721, 10.1109/TKDE.2012.28 Manber, 1993, Suffix arrays: a new method for on-line string searches, SIAM J. Comput., 22, 935, 10.1137/0222058 Navarro, 2014, Spaces, trees and colors: the algorithmic landscape of document retrieval on sequences, ACM Comput. Surv., 46, 10.1145/2535933 Navarro, 2007, Compressed full-text indexes, ACM Comput. Surv., 39, 10.1145/1216370.1216372 Navarro, 2012, Top-k document retrieval in optimal time and linear space, 1066 Navarro, 2013, Faster top-k document retrieval in optimal space, vol. 8214, 255 Navarro, 2013, Top-k document retrieval in compact space and near-optimal time, vol. 8283, 394 Navarro, 2012, Space-efficient top-k document retrieval, 307 Rahman, 2010, WiFi Miner: an online apriori-infrequent based wireless intrusion system, vol. 5840, 76 Raman, 2007, Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets, ACM Trans. Algorithms, 3, 10.1145/1290672.1290680 Sadakane, 2007, Succinct data structures for flexible text retrieval systems, J. Discrete Algorithms, 5, 12, 10.1016/j.jda.2006.03.011 Shah, 2013, Top-k document retrieval in external memory, vol. 8125, 803 Tsur, 2013, Top-k document retrieval in optimal space, Inf. Process. Lett., 113, 440, 10.1016/j.ipl.2013.03.012 Vens, 2010, Identifying proteins involved in parasitism by discovering degenerated motifs, 81 Weiner, 1973, Linear pattern matching algorithm, 1 Wu, 2004, Efficient mining of both positive and negative association rules, ACM Trans. Inf. Syst., 22, 381, 10.1145/1010614.1010616