Yan, Yihe; Niu, Xinzheng; Zhang, Zhiheng; Fournier-Viger, Philippe; Ye, Libin; Min, Fan Efficient high utility itemset mining without the join operation. (English) Zbl 1543.68104 Inf. Sci. 681, Article ID 121218, 18 p. (2024). MSC: 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Ignatov, D. I. On the number of maximal antichains in Boolean lattices for \(n\) up to 7. (English) Zbl 07688799 Lobachevskii J. Math. 44, No. 1, 137-146 (2023); erratum ibid. 44, No. 4, 1528 (2023). MSC: 06-XX 68-XX × Cite Format Result Cite Review PDF Full Text: DOI
Delacroix, T.; Lenca, P.; Lallich, S. What to expect from a set of itemsets? (English) Zbl 1535.68313 Inf. Sci. 593, 314-340 (2022). MSC: 68T10 14P10 62B11 68T05 94A17 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Lin, Ming-Yen; Fu, Cheng-Tai; Hsueh, Sue-Chen Interactive mining of probabilistic frequent patterns in uncertain databases. (English) Zbl 1504.68055 Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 30, No. 2, 263-283 (2022). MSC: 68P15 68T05 68T37 × Cite Format Result Cite Review PDF Full Text: DOI
Liu, Jiang; Li, Jing; Ni, Feng; Xia, Xiang; Li, Shunlong; Dong, Wenhui An algebraic semigroup method for discovering maximal frequent itemsets. (English) Zbl 1511.68226 Open Math. 20, 1432-1443 (2022). MSC: 68T05 20M99 68Q25 68W40 × Cite Format Result Cite Review PDF Full Text: DOI OA License
Galbrun, Esther The minimum description length principle for pattern mining: a survey. (English) Zbl 1509.68240 Data Min. Knowl. Discov. 36, No. 5, 1679-1727 (2022). MSC: 68T09 68P30 68T10 68-02 × Cite Format Result Cite Review PDF Full Text: DOI arXiv OA License
Krishnamoorthy, Srikumar A two-stage integer programming model considering transaction equivalence for privacy preservation. (English) Zbl 1520.68033 Comput. Oper. Res. 148, Article ID 105997, 14 p. (2022). MSC: 68P27 90C10 × Cite Format Result Cite Review PDF Full Text: DOI
Sukanya, N. S.; Thangaiah, P. Ranjit Jeba An integrated cuckoo search-genetic algorithm for mining frequent itemsets. (English) Zbl 1496.68281 J. Discrete Math. Sci. Cryptography 25, No. 3, 671-690 (2022). MSC: 68T05 68T20 68W50 × Cite Format Result Cite Review PDF Full Text: DOI
Makhalova, Tatiana; Buzmakov, Aleksey; Kuznetsov, Sergei O.; Napoli, Amedeo Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset. (English) Zbl 1529.68262 Int. J. Approx. Reasoning 145, 75-90 (2022). MSC: 68T05 68T09 68T10 68T30 × Cite Format Result Cite Review PDF Full Text: DOI
Liu, Weiyi; Yue, Kun; Li, Jianyu; Li, Jie; Li, Jin; Zhang, Zhijian Inferring range of information diffusion based on historical frequent items. (English) Zbl 1494.62029 Data Min. Knowl. Discov. 36, No. 1, 82-107 (2022). MSC: 62R40 62H22 91D30 × Cite Format Result Cite Review PDF Full Text: DOI
Moreira de Sousa, Marques; González, Pedro Henrique; Ochi, Luiz Satoru; de Lima Martins, Simone A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection. (English) Zbl 1510.90046 Comput. Oper. Res. 129, Article ID 105229, 17 p. (2021). MSC: 90B06 90C27 90C59 × Cite Format Result Cite Review PDF Full Text: DOI
Fournier-Viger, Philippe; Zhang, Yimin; Lin, Jerry Chun-Wei; Dinh, Duy-Tai; Bac Le, Hoai Mining correlated high-utility itemsets using various measures. (English) Zbl 1492.68047 Log. J. IGPL 28, No. 1, 19-32 (2020). MSC: 68P15 68T10 91B14 × Cite Format Result Cite Review PDF Full Text: DOI
Francia, Matteo; Golfarelli, Matteo; Rizzi, Stefano Summarization and visualization of multi-level and multi-dimensional itemsets. (English) Zbl 1457.68230 Inf. Sci. 520, 63-85 (2020). MSC: 68T05 62H30 68T10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Lee, Taito; Matsushima, Shin; Yamanishi, Kenji Grafting for combinatorial binary model using frequent itemset mining. (English) Zbl 1458.68172 Data Min. Knowl. Discov. 34, No. 1, 101-123 (2020). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI OA License
Bostanoǧlu, Belgin Ergenç; Öztürk, Ahmet Cumhur Minimizing information loss in shared data: hiding frequent patterns with multiple sensitive support thresholds. (English) Zbl 07260682 Stat. Anal. Data Min. 13, No. 4, 309-323 (2020). MSC: 62-XX 68-XX × Cite Format Result Cite Review PDF Full Text: DOI Link
Trabold, Daniel; Horváth, Tamás; Wrobel, Stefan Effective approximation of parametrized closure systems over transactional data streams. (English) Zbl 1497.68440 Mach. Learn. 109, No. 6, 1147-1177 (2020). MSC: 68T05 68P15 68W27 × Cite Format Result Cite Review PDF Full Text: DOI
Paramonov, Sergey; Stepanova, Daria; Miettinen, Pauli Hybrid ASP-based approach to pattern mining. (English) Zbl 1472.68152 Theory Pract. Log. Program. 19, No. 4, 505-535 (2019). MSC: 68T05 68N17 68T10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Djenouri, Youcef; Belhadi, Asma; Fournier-Viger, Philippe; Lin, Jerry Chun-Wei Fast and effective cluster-based information retrieval using frequent closed itemsets. (English) Zbl 1440.68062 Inf. Sci. 453, 154-167 (2018). MSC: 68P20 × Cite Format Result Cite Review PDF Full Text: DOI Link
Dzyuba, Vladimir; van Leeuwen, Matthijs; De Raedt, Luc Flexible constrained sampling with guarantees for pattern mining. (English) Zbl 1411.68097 Data Min. Knowl. Discov. 31, No. 5, 1266-1293 (2017). MSC: 68T05 62D05 68T10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Lin, Jerry Chun-Wei; Gan, Wensheng; Fournier-Viger, Philippe; Hong, Tzung-Pei; Tseng, Vincent S. Efficiently mining uncertain high-utility itemsets. (English) Zbl 1381.68246 Soft Comput. 21, No. 11, 2801-2820 (2017). MSC: 68T05 68P15 68T37 × Cite Format Result Cite Review PDF Full Text: DOI
Guns, Tias; Dries, Anton; Nijssen, Siegfried; Tack, Guido; De Raedt, Luc MiningZinc: a declarative framework for constraint-based mining. (English) Zbl 1404.68106 Artif. Intell. 244, 6-29 (2017). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Quadrana, Massimo; Bifet, Albert; Gavaldà, Ricard An efficient closed frequent itemset miner for the MOA stream mining system. (English) Zbl 1373.68333 AI Commun. 28, No. 1, 143-158 (2015). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Huang, Mingxuan; Huang, Faliang; Yan, Xiaowei; Lan, Huihong Weighted positive and negative association rules mining based on dynamic item weight and SCCI framework. (Chinese. English summary) Zbl 1349.68148 Control Decis. 30, No. 10, 1729-1741 (2015). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, Le; Xiong, Songquan; Chang, Yanfen; Wang, Shui An algorithm for mining high utility patterns based on pattern-growth. (Chinese. English summary) Zbl 1349.68064 Acta Autom. Sin. 41, No. 9, 1616-1626 (2015). MSC: 68P15 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Vimieiro, Renato; Moscato, Pablo Disclosed: an efficient depth-first, top-down algorithm for mining disjunctive closed itemsets in high-dimensional data. (English) Zbl 1355.68235 Inf. Sci. 280, 171-187 (2014). MSC: 68T05 68T10 × Cite Format Result Cite Review PDF Full Text: DOI
Shin, Se Jung; Lee, Dae Su; Lee, Won Suk CP-tree: an adaptive synopsis structure for compressing frequent itemsets over online data streams. (English) Zbl 1354.68075 Inf. Sci. 278, 559-576 (2014). MSC: 68P30 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Baralis, Elena; Cagliero, Luca; Cerquitelli, Tania; D’Elia, Vincenzo; Garza, Paolo Expressive generalized itemsets. (English) Zbl 1354.68220 Inf. Sci. 278, 327-343 (2014). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Szathmary, Laszlo; Valtchev, Petko; Napoli, Amedeo; Godin, Robert; Boc, Alix; Makarenkov, Vladimir A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes. (English) Zbl 1357.68186 Ann. Math. Artif. Intell. 70, No. 1-2, 81-105 (2014). MSC: 68T05 68T30 × Cite Format Result Cite Review PDF Full Text: DOI Link
Cagliero, Luca; Garza, Paolo Itemset generalization with cardinality-based constraints. (English) Zbl 1355.68225 Inf. Sci. 244, 161-174 (2013). MSC: 68T05 68T10 × Cite Format Result Cite Review PDF Full Text: DOI Link
Kirsch, Adam; Mitzenmacher, Michael; Pietracaprina, Andrea; Pucci, Geppino; Upfal, Eli; Vandin, Fabio An efficient rigorous approach for identifying statistically significant frequent itemsets. (English) Zbl 1281.68098 J. ACM 59, No. 3, Article No. 12, 22 p. (2012). MSC: 68P15 68T10 62P99 × Cite Format Result Cite Review PDF Full Text: DOI
Deng, Zhihong; Wang, Zhonghui; Jiang, Jiajian A new algorithm for fast mining frequent itemsets using N-lists. (English) Zbl 1270.68239 Sci. China, Inf. Sci. 55, No. 9, 2008-2030 (2012). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Farzanyar, Zahra; Kangavari, Mohammadreza; Cercone, Nick MAX-FISM: mining (recently) maximal frequent itemsets over data streams using the sliding window model. (English) Zbl 1268.68071 Comput. Math. Appl. 64, No. 6, 1706-1718 (2012). MSC: 68P15 68T10 × Cite Format Result Cite Review PDF Full Text: DOI
Outrata, Jan; Vychodil, Vilem Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. (English) Zbl 1239.68070 Inf. Sci. 185, No. 1, 114-127 (2012). MSC: 68T30 68T05 06A15 × Cite Format Result Cite Review PDF Full Text: DOI
Jiménez, Aída; Berzal, Fernando; Cubero, Juan-Carlos Using trees to mine multirelational databases. (English) Zbl 1235.68067 Data Min. Knowl. Discov. 24, No. 1, 1-39 (2012). MSC: 68P15 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Thi, Vu Duc; Duc, Nguyen Huy Mining High Utility Itemsets in massive transactional datasets. (English) Zbl 1265.68044 Acta Cybern. 20, No. 2, 331-346 (2011). MSC: 68P10 68P20 × Cite Format Result Cite Review PDF Full Text: DOI
Wang, En Tzu; Chen, Arbee L. P. Mining frequent itemsets over distributed data streams by continuously maintaining a global synopsis. (English) Zbl 1235.68202 Data Min. Knowl. Discov. 23, No. 2, 252-299 (2011). MSC: 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Xiang, Yang; Jin, Ruoming; Fuhry, David; Dragan, Feodor F. Summarizing transactional databases with overlapped hyperrectangles. (English) Zbl 1235.68068 Data Min. Knowl. Discov. 23, No. 2, 215-251 (2011). MSC: 68P15 68T05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Guns, Tias; Nijssen, Siegfried; De Raedt, Luc Itemset mining: a constraint programming perspective. (English) Zbl 1353.68233 Artif. Intell. 175, No. 12-13, 1951-1983 (2011). MSC: 68T05 68T20 × Cite Format Result Cite Review PDF Full Text: DOI Link
Zhang, Xin; Liao, Pin; Guo, Bo Depth-first search algorithm for mining frequent closed itemsets. (Chinese. English) Zbl 1221.68236 J. Comput. Appl. 30, No. 3, 806-809 (2010). MSC: 68T20 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Grudziński, Przemysław; Wojciechowski, Marek Integration of candidate hash trees in concurrent processing of frequent itemset queries using Apriori. (English) Zbl 1235.93093 Control Cybern. 38, No. 1, 47-65 (2009). MSC: 93B40 68T10 93-04 × Cite Format Result Cite Review PDF Full Text: EuDML Link
Emilion, Richard; Lévy, Gérard Size of random Galois lattices and number of closed frequent itemsets. (English) Zbl 1187.68389 Discrete Appl. Math. 157, No. 13, 2945-2957 (2009). MSC: 68T05 06A15 × Cite Format Result Cite Review PDF Full Text: DOI
Song, Wei; Li, Jinhong; Xu, Zhangyan Meta itemset: a new concise representation of frequent itemset. (English) Zbl 1320.68147 J. Exp. Theor. Artif. Intell. 21, No. 4, 259-272 (2009). MSC: 68T05 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Ding, Junfeng; Yau, Stephen S. T. TCOM, an innovative data structure for mining association rules among infrequent items. (English) Zbl 1165.68385 Comput. Math. Appl. 57, No. 2, 290-301 (2009). MSC: 68P99 62P30 × Cite Format Result Cite Review PDF Full Text: DOI
Han, Congying; Xu, Lijun; He, Guoping Mining recent frequent itemsets in sliding windows over data streams. (English) Zbl 1324.68089 Comput. Inform. 27, No. 3, 315-339 (2008). MSC: 68T05 × Cite Format Result Cite Review PDF
Sun, Xing; Nobel, Andrew B. On the size and recovery of submatrices of ones in a random binary matrix. (English) Zbl 1225.60016 J. Mach. Learn. Res. 9, 2431-2453 (2008). MSC: 60B20 60C05 × Cite Format Result Cite Review PDF Full Text: Link
Guo, Yuhong; Tong, Yunhai; Tang, Shiwei; Yang, Dongqing Inverse frequent itemset mining based on FP-tree. (Chinese. English summary) Zbl 1199.68088 J. Softw. 19, No. 2, 338-350 (2008). MSC: 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Hamrouni, Tarek; Ben Yahia, Sadok; Nguifo, Engelbert Mephu Succint minimal generators: theoretical foundations and applications. (English) Zbl 1156.68534 Int. J. Found. Comput. Sci. 19, No. 2, 271-296 (2008). MSC: 68T05 68P15 68T10 × Cite Format Result Cite Review PDF Full Text: DOI
Calders, Toon Itemset frequency satisfiability: complexity and axiomatization. (English) Zbl 1136.68021 Theor. Comput. Sci. 394, No. 1-2, 84-111 (2008). MSC: 68P15 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Arimura, Hiroki; Uno, Takeaki An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. (English) Zbl 1123.68134 J. Comb. Optim. 13, No. 3, 243-262 (2007). MSC: 68W05 68W40 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Tatti, Nikolaj Computational complexity of queries based on itemsets. (English) Zbl 1187.68255 Inf. Process. Lett. 98, No. 5, 183-187 (2006). MSC: 68Q17 68P15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Wu, Chienwen Applying frequent itemset mining to identify a small itemset that satisfies a large percentage of orders in a warehouse. (English) Zbl 1113.90092 Comput. Oper. Res. 33, No. 11, 3161-3170 (2006). MSC: 90B90 × Cite Format Result Cite Review PDF Full Text: DOI
Jaroszewicz, Szymon; Simovici, Dan A.; Rosenberg, Ivo Measures on Boolean polynomials and their applications in data mining. (English) Zbl 1050.68033 Discrete Appl. Math. 144, No. 1-2, 123-139 (2004). MSC: 68P15 68T05 28A12 × Cite Format Result Cite Review PDF Full Text: DOI
Bodon, F.; Rónyai, L. Trie: An alternative data structure for data mining algorithms. (English) Zbl 1074.68013 Math. Comput. Modelling 38, No. 7-9, 739-751 (2003). MSC: 68P05 68T05 × Cite Format Result Cite Review PDF Full Text: DOI
Zhang, Chengqi; Zhang, Shichao; Webb, Geoffrey I. Identifying approximate itemsets of interest in large databases. (English) Zbl 1033.68042 Appl. Intell. 18, No. 1, 91-104 (2003). MSC: 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Hong, Tzung-Pei; Wang, Ching-Yao; Tao, Yu-Hui A new incremental data mining algorithm using pre-large itemsets. (English) Zbl 1088.68568 Intell. Data Anal. 5, No. 2, 111-129 (2001). MSC: 68P15 68T05 × Cite Format Result Cite Review PDF Full Text: Link
Huang, Liusheng; Chen, Huaping; Wang, Xun; Chen, Guoliang A fast algorithm for mining association rules. (English) Zbl 0970.68581 J. Comput. Sci. Technol. 15, No. 6, 619-624 (2000). MSC: 68U99 68P15 × Cite Format Result Cite Review PDF Full Text: DOI