# Right-Hand Side Expanding Algorithm for Maximal Frequent Itemset Mining
## 2 Right-Hand Side Expanding Algorithm
### Transaction Set Preprocessing
The practical experimental data also verify that the algorithm is feasible, and even superior, for the standalone operation of high-dimensional big data transaction sets. The algorithm is feasible and accurate for the MFI mining of high-dimensional transaction sets. However, it has a disadvantage in the association rule analysis based on frequent itemset mining. It can be known from the dimension of the reduced transaction set under the given support threshold that the time needed to search all MFIs subsequently is un predictable. At times, the acceptable time is limited, and it is unnecessary to find all MFIs. Instead, the MFI with the maximum support should be first found within the limited time, followed by the MFI with the second largest support, and so on. In this way, the algorithm practicability will be higher. Therefore, the subsequent study of this algorithm should focus on MFI mining under an adaptive support threshold in the following way: no support threshold is given in the algorithm running. Instead, as the time passes by, the algorithm finds the thresholds of all MFIs and sort them in a descending order. Within given time, the algorithm returns the minimum support threshold and the corresponding MFI. Conceptualization, Y.Z. and W.Y. ; methodology, Y.Z., W.Y., X.M. and H.O. ; software, Y.Z. ; validation, Q.Z., W.Y. and Y.Z. ; formal analysis, Q.Z. ; investigation, W.Y. ; resources, W.Y. ; data curation, Y.Z. ; writing--original draft preparation, Y.Z. ; writing--review and editing, Y.Z. ; visualization, Y.Z. ; supervision, W.Y. ; project administration, Y.Z. ; funding acquisition. All authors have read and agreed to the published version of the manuscript. This work was supported by the Zhejiang Basic Public Welfare Research Plan Projects (Item No. LGG19F030009), funded by the Science Technology Department of Zhejiang Province, China. Not applicable. We would also like to extend our gratitude to the website [[http://fimi.uantwerpen.be/data/](http://fimi.uantwerpen.be/data/)]([http://fimi.uantwerpen.be/data/](http://fimi.uantwerpen.be/data/)) (accessed on 21 September 2021) for providing the open test transaction set to a wide range of researchers. The authors declare no conflict of interest. ## References

* [PERSON] (2020) [PERSON] Cause Analysis of Traffic Accidents on Urban Roads Based on an Improved Association Rule Mining Algorithm. _IEEE Access_**2020**, \(8\), 75607-75615. [CrossRef]
* [PERSON] et al. (2004) [PERSON]; [PERSON]; [PERSON] Mining dynamic interdimension association rules for local-scale weather prediction. In Proceedings of the 28 th Annual International Computer Software and Applications Conference (COMPSAC 2004), Hong Kong, China, 28-30 September 2004; IEEE Computer Society: Washington, DC, USA, 2004. * [PERSON] and [PERSON] (2015) [PERSON]; [PERSON] Benchmark of rule-based classifiers in the news recommendation task. In Proceedings of the CLEF 2015 Conference and Labs of the Evaluation Forum, Toulouse, France, 8-11 September 2015; Springer International Publishing: Cham, Switzerland, 2015. * [PERSON] et al. (2003) [PERSON]; [PERSON] Mining fuzzy association rules in a bank-account database. _IEEE Trans. Fuzzy Syst._**2003**, _11_, 238-248. * [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Collaborative filtering and association rule mining-based market basket recommendation on spark. _Cocurr. Comput. Pract. Exp._**2020**, _32_, e5565. [CrossRef]
* [PERSON] et al. (2020) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] A data-driven optimization of large-scale dry port location using the hybrid approach of data mining and complex network theory. _Transp. Res. Part E Logist. Transp. Rev._**2020**, _134_, 101816. [CrossRef]
* [PERSON] and [PERSON] (2008) [PERSON]; [PERSON] Detecting outliers in categorical record databases based on attribute associations. In _Progress in WWW Research and Development. APWeb 2008_; [PERSON], [PERSON], [PERSON], [PERSON], Eds. ; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2008; Volume 4976.