暂无分享,去创建一个
[1] Torsten Suel,et al. Inverted index compression and query processing with optimized document ordering , 2009, WWW '09.
[2] Zhonghui Wang,et al. A new algorithm for fast mining frequent itemsets using N-lists , 2012, Science China Information Sciences.
[3] Angela Repanovici,et al. Expert Systems with Applications in the Legal Domain , 2015 .
[4] Giuseppe Ottaviano,et al. Partitioned Elias-Fano indexes , 2014, SIGIR.
[5] Zhi-Hong Deng,et al. DiffNodesets: An efficient structure for fast mining frequent itemsets , 2015, Appl. Soft Comput..
[6] Bay Vo,et al. A novel approach for mining maximal frequent patterns , 2017, Expert Syst. Appl..
[7] Mohammad Teshnehlab,et al. negFIN: An efficient algorithm for fast mining frequent itemsets , 2018, Expert Syst. Appl..
[8] Zhi-Hong Deng,et al. PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning , 2015, Expert Syst. Appl..
[9] Leonid Boytsov,et al. Decoding billions of integers per second through vectorization , 2012, Softw. Pract. Exp..
[10] Tzung-Pei Hong,et al. Mining frequent itemsets using the N-list and subsume concepts , 2014, Int. J. Mach. Learn. Cybern..
[11] Alistair Moffat,et al. Binary Interpolative Coding for Effective Index Compression , 2000, Information Retrieval.
[12] Alexander A. Stepanov,et al. SIMD-based decoding of posting lists , 2011, CIKM '11.
[13] Jian Chen,et al. Efficiently Mining Frequent Itemsets on Massive Data , 2019, IEEE Access.
[14] Zhi-Hong Deng,et al. Fast mining frequent itemsets using Nodesets , 2014, Expert Syst. Appl..