Author of the publication

FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction.

, , , and . IEA/AIE, volume 9799 of Lecture Notes in Computer Science, page 115-127. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Multiple Dense Subtensor Estimation with High Density Guarantee., , and . ICDE, page 637-648. IEEE, (2020)A Nested Decomposition Model for Reliable NFV 5G Network Slicing., and . INOC, page 107-112. OpenProceedings.org, (2019)Efficient Make Before Break Capacity Defragmentation., , , and . HPSR, page 1-6. IEEE, (2018)An efficient algorithm for mining top-k on-shelf high utility itemsets., , , and . Knowl. Inf. Syst., 52 (3): 621-655 (2017)A Column Generation Algorithm for Dedicated-Protection O-RAN VNF Deployment., , , and . IWCMC, page 1206-1211. IEEE, (2022)A Nested Decomposition Model for Reliable NFV 5G Network Slicing., and . IEEE Trans. Netw. Serv. Manag., 20 (3): 2186-2200 (September 2023)An efficient algorithm for mining top-rank-k frequent patterns., , , and . Appl. Intell., 45 (1): 96-111 (2016)PHM: Mining Periodic High-Utility Itemsets., , , and . ICDM, volume 9728 of Lecture Notes in Computer Science, page 64-79. Springer, (2016)FHM + : Faster High-Utility Itemset Mining Using Length Upper-Bound Reduction., , , and . IEA/AIE, volume 9799 of Lecture Notes in Computer Science, page 115-127. Springer, (2016)Density Guarantee on Finding Multiple Subgraphs and Subtensors., , , and . ACM Trans. Knowl. Discov. Data, 15 (5): 76:1-76:32 (2021)