# Mining Top-\(k\) High Average-Utility Sequential Patterns for Resource Transformation
## 4 Proposed TKAUS Algorithm
### Proposed TKAUS Algorithm
TKUS: Mining top-\(k\) high utility sequential patterns. _Inf. Sci._**2021**, _570_, 342-359. [CrossRef]
* (49) [PERSON]; [PERSON]; [PERSON] Effective utility mining with the measure of average utility. _Expert Syst. Appl._**2011**, _38_, 8259-8265. [CrossRef]
* (50) [PERSON]; [PERSON]; [PERSON] Efficiently Mining High Average Utility Itemsets with a Tree Structure. In Proceedings of the Intelligent Information and Database Systems, Hue City, Vietnam, 24-26 March 2010; [PERSON], [PERSON], [PERSON], [PERSON]; Springer: Berlin/Heidelberg, Germany, 2010; pp. 131-139. * (51) [PERSON]; [PERSON]; [PERSON]; [PERSON] A New Method for Mining High Average Utility Itemsets. In Proceedings of the Computer Information Systems and Industrial Management-13 th IFIP TCS International Conference, CISIM 2014, Ho Chi Minh City, Vietnam, 5-7 November 2014; [PERSON], [PERSON], Eds. ; Proceedings; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2014; Volume 8838, pp. 33-42. [CrossRef]
* (52) [PERSON]; [PERSON] Mining of high average-utility itemsets using novel list structure and pruning strategy. _Future Gener. Comput. Syst._**2017**, _68_, 346-360. [CrossRef]
* (53) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Maintenance Algorithm for High Average-Utility Itemsets with Transaction Deletion. _Appl. Intell._**2018**, _48_, 3691-3706. [CrossRef]
* (54) [PERSON]; [PERSON]; [PERSON]; [PERSON] EHAUPM: Efficient High Average-Utility Pattern Mining With Tighter Upper Bounds. _IEEE Access_**2017**, \(5\), 12927-12940. [CrossRef]
* (55) [PERSON]; [PERSON]; [PERSON]; [PERSON] TUB-HAUPM: Tighter Upper Bound for Mining High Average-Utility Patterns. _IEEE Access_**2018**, \(6\), 18655-18669. [CrossRef]
* (56) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient high average-utility itemset mining using novel vertical weak upper-bounds. _Knowl.-Based Syst._**2019**, _183_, 104847. [CrossRef]
* (57) [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] [PERSON] Efficient Vertical Mining of High Average-Utility Itemsets Based on Novel Upper-bounds. _IEEE Trans. Knowl. Data Eng._**2019**, _31_, 301-314. [CrossRef]
* (58) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] [PERSON] H-FHAUI: Hiding frequent high average utility itemsets. _Inf. Sci._**2022**, _611_, 408-431. [CrossRef]
* (59) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Efficient list based mining of high average utility patterns with maximum average pruning strategies. _Inf. Sci._**2021**, _543_, 85-105. [CrossRef]
* (60) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] High average-utility sequential pattern mining based on uncertain databases. _Knowl. Inf. Syst._**2020**, _62_, 1199-1228. [CrossRef]
* (61) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining. _Expert Syst. Appl._**2021**, _184_, 115449. [CrossRef]
* (62) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] HANP-Miner: High average utility nonoverlapping sequential pattern mining. _Knowl.-Based Syst._**2021**, _229_, 107361. [CrossRef]
* (63) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. _Appl. Intell._**2022**, _52_, 6106-6128. [CrossRef]* _[PERSON] et al. (2022)_ [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Mining interesting sequences with low average cost and high average utility. _Appl. Intell._**2022**, _52_, 7136-7157. [CrossRef]
* [PERSON] et al. (2007) [PERSON]; [PERSON]; [PERSON]; [PERSON] Frequent pattern mining: Current status and future directions. _Data Min. Knowl. Discov._**2007**, _432_, 55-86. [CrossRef]
* _Disclaimer/Publisher's Note_: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s).