Jun-Feng Qu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jun-Feng Qu has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Bo Tang
School of Mathematics and Statistics, Hubei University of Arts and Science, Xiangyang, Hubei 441053, China
2 shared publications - Philippe Fournier-Viger
Shenzhen University, Shenzhen, China
2 shared publications - Shenwen Wang
School of Information Engineering, Hebei GEO University, Shijiazhuang, China
2 shared publications - Ali Davoudian
Guangzhou Key Laboratory of Big Data and Intelligent Education, School of Computer Science, South China Normal University, Guangzhou, Guangdong, China
1 shared publication Bo Hang
School of Computer Engineering, Hubei University of Arts and Science, Xiangyang 441053, China
1 shared publication- Bo Hang
Computer School, Hubei University of Arts and Science, Xiangyang, China
1 shared publication
Latest Publications
- 20 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 696
Multi-modal prompt interaction for visual unsupervised domain adaptation
- 20 May 2026
- Published by Elsevier in Neurocomputing
- Vol. 696
Multi-modal prompt interaction for visual unsupervised domain adaptation
- 1 November 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 183, 109307
Exploiting the sequential nature of genomic data for improved analysis and identification
- 1 November 2024
- Published by Elsevier in Computers in Biology and Medicine
- Vol. 183, 109307
Exploiting the sequential nature of genomic data for improved analysis and identification
- 13 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10224-10236
Mining High Utility Itemsets Using Prefix Trees and Utility Vectors
High utility itemsets can reveal combinations of items that have a high profit, expense, or importance. Mining high utility itemsets in a database with $n$ items generally results in a huge search space, composed of $2^{n}$ itemsets, and heavy utility calculations for the explored itemsets. Previous algorithms using prefix tree structures perform two phases, namely candidate generation and testing. To avoid generating candidate itemsets, one-phase algorithms use list or hyper-link structures and have been proven to be superior to two-phase algorithms. However, it should be noted that a prefix tree is still an efficient structure for itemset mining problems, and especially algorithms using prefix trees such as FP-Growth have shown excellent performance for mining frequent itemsets. This paper proposes Hamm, a High-performance AlgorithM for Mining high utility itemsets. Hamm employs a novel TV (prefix Tree and utility Vector) structure and mines high utility itemsets in one phase without candidate generation. We also develop an efficient optimization which is incorporated into Hamm as a component. Using prefix trees and utility vectors, Hamm outperforms state-of-the-art algorithms on various databases in experiments. Experimental results also show that the proposed optimization remarkably reduces the search space and speeds up Hamm.
- 13 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (10) , 10224-10236
Mining High Utility Itemsets Using Prefix Trees and Utility Vectors
High utility itemsets can reveal combinations of items that have a high profit, expense, or importance. Mining high utility itemsets in a database with $n$ items generally results in a huge search space, composed of $2^{n}$ itemsets, and heavy utility calculations for the explored itemsets. Previous algorithms using prefix tree structures perform two phases, namely candidate generation and testing. To avoid generating candidate itemsets, one-phase algorithms use list or hyper-link structures and have been proven to be superior to two-phase algorithms. However, it should be noted that a prefix tree is still an efficient structure for itemset mining problems, and especially algorithms using prefix trees such as FP-Growth have shown excellent performance for mining frequent itemsets. This paper proposes Hamm, a High-performance AlgorithM for Mining high utility itemsets. Hamm employs a novel TV (prefix Tree and utility Vector) structure and mines high utility itemsets in one phase without candidate generation. We also develop an efficient optimization which is incorporated into Hamm as a component. Using prefix trees and utility vectors, Hamm outperforms state-of-the-art algorithms on various databases in experiments. Experimental results also show that the proposed optimization remarkably reduces the search space and speeds up Hamm.
- 7 February 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (11) , 12470-12496
Multimodal and multi-objective optimization algorithm based on two-stage search framework
- 7 February 2022
- Published by Springer Nature in Applied Intelligence
- Vol. 52 (11) , 12470-12496
Multimodal and multi-objective optimization algorithm based on two-stage search framework
- Open Access
- 5 December 2020
- Published by Walter de Gruyter GmbH in Open Physics
- Vol. 18 (1) , 871-880
Exact solutions of space–time fractional KdV–MKdV equation and Konopelchenko–Dubrovsky equation
In the present study, we deal with the space–time fractional KdV–MKdV equation and the space–time fractional Konopelchenko–Dubrovsky equation in the sense of the conformable fractional derivative. By means of the extend-expansion method, many exact solutions are obtained, which include hyperbolic function solutions, trigonometric function solutions and rational solutions. The results show that the extend -expansion method is an efficient technique for solving nonlinear fractional partial equations. We also provide some graphical representations to demonstrate the physical features of the obtained solutions. - 5 December 2020
- Published by Walter de Gruyter GmbH in Open Physics
- Vol. 18 (1) , 871-880
Open AccessExact solutions of space–time fractional KdV–MKdV equation and Konopelchenko–Dubrovsky equation
In the present study, we deal with the space–time fractional KdV–MKdV equation and the space–time fractional Konopelchenko–Dubrovsky equation in the sense of the conformable fractional derivative. By means of the extend-expansion method, many exact solutions are obtained, which include hyperbolic function solutions, trigonometric function solutions and rational solutions. The results show that the extend -expansion method is an efficient technique for solving nonlinear fractional partial equations. We also provide some graphical representations to demonstrate the physical features of the obtained solutions. - Open Access
- 21 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 194015-194026
An Angle-Based Bi-Objective Evolutionary Algorithm for Many-Objective Optimization
One of the main difficulties in solving many-objective optimization is the lack of selection pressure. For an optimization problem, its main purpose is to obtain a nondominated solution set with better convergence and diversity. In this paper, two estimation methods are proposed to convert a many-objective optimization problem into a simple bi-objective optimization problem, that is, the convergence and diversity estimation methods, so as to greatly improve the probability of certain dominance relation between solutions, and then increase the selection pressure. Based on the proposed estimation methods, a new many-objective evolutionary algorithm, termed ABOEA, is proposed. In the convergence estimation method, we use a modified ASF function to solve the performance degradation of the traditional norm distance on the irregular Pareto front. In the diversity estimation method, we innovatively propose a diversity estimation method based on the angle between solutions. Empirical experimental results demonstrate that the proposed algorithm shows its competitiveness against the state-of-art algorithms in solving many-objective optimization problems. Two estimation methods proposed in this paper can greatly improve the performance of algorithms in solving many-objective optimization problems.
- 21 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 194015-194026
Open AccessAn Angle-Based Bi-Objective Evolutionary Algorithm for Many-Objective Optimization
One of the main difficulties in solving many-objective optimization is the lack of selection pressure. For an optimization problem, its main purpose is to obtain a nondominated solution set with better convergence and diversity. In this paper, two estimation methods are proposed to convert a many-objective optimization problem into a simple bi-objective optimization problem, that is, the convergence and diversity estimation methods, so as to greatly improve the probability of certain dominance relation between solutions, and then increase the selection pressure. Based on the proposed estimation methods, a new many-objective evolutionary algorithm, termed ABOEA, is proposed. In the convergence estimation method, we use a modified ASF function to solve the performance degradation of the traditional norm distance on the irregular Pareto front. In the diversity estimation method, we innovatively propose a diversity estimation method based on the angle between solutions. Empirical experimental results demonstrate that the proposed algorithm shows its competitiveness against the state-of-art algorithms in solving many-objective optimization problems. Two estimation methods proposed in this paper can greatly improve the performance of algorithms in solving many-objective optimization problems.
- Open Access
- 7 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 183722-183735
Efficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree
Frequent itemset mining is a fundamental problem in data mining area because frequent itemsets have been extensively used in reasoning, classifying, clustering, and so on. To mine frequent itemsets, previous algorithms based on a prefix tree structure have to construct many prefix trees, which is very time-consuming. In this paper, we propose a novel frequent itemset mining algorithm called DPT (Dynamic Prefix Tree) which uses only one prefix tree. We first introduce the concept of the post-conditional database of an itemset, and analyze the distribution of an itemset’s post-conditional database in a prefix tree representing a database. Subsequently, we illuminate how DPT adjusts the prefix tree to mine frequent itemsets and give three optimization techniques. An interesting advantage of DPT is that the algorithm can directly output a prefix tree representing all frequent itemsets after slight modifications. Using only one dynamic prefix tree, DPT avoids the high cost of constructing many prefix trees and thus gains significant performance improvement. Experimental results show that DPT remarkably outperforms previous algorithms with respect to running time and memory usage, and that a prefix tree representing all frequent itemsets DPT outputs can be used more efficient than a list representing them previous algorithms output.
- 7 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 183722-183735
Open AccessEfficient Mining of Frequent Itemsets Using Only One Dynamic Prefix Tree
Frequent itemset mining is a fundamental problem in data mining area because frequent itemsets have been extensively used in reasoning, classifying, clustering, and so on. To mine frequent itemsets, previous algorithms based on a prefix tree structure have to construct many prefix trees, which is very time-consuming. In this paper, we propose a novel frequent itemset mining algorithm called DPT (Dynamic Prefix Tree) which uses only one prefix tree. We first introduce the concept of the post-conditional database of an itemset, and analyze the distribution of an itemset’s post-conditional database in a prefix tree representing a database. Subsequently, we illuminate how DPT adjusts the prefix tree to mine frequent itemsets and give three optimization techniques. An interesting advantage of DPT is that the algorithm can directly output a prefix tree representing all frequent itemsets after slight modifications. Using only one dynamic prefix tree, DPT avoids the high cost of constructing many prefix trees and thus gains significant performance improvement. Experimental results show that DPT remarkably outperforms previous algorithms with respect to running time and memory usage, and that a prefix tree representing all frequent itemsets DPT outputs can be used more efficient than a list representing them previous algorithms output.
- 19 January 2019
- Published by Springer Nature
- p. 131-160
Efficient Algorithms for High Utility Itemset Mining Without Candidate Generation
- 19 January 2019
- Published by Springer Nature
- p. 131-160
Efficient Algorithms for High Utility Itemset Mining Without Candidate Generation
- Open Access
- 14 May 2018
- Published by MDPI AG in Information
- Vol. 9 (5) , 119
Fast Identification of High Utility Itemsets from Candidates
High utility itemsets (HUIs) are sets of items with high utility, like profit, in a database. Efficient mining of high utility itemsets is an important problem in the data mining area. Many mining algorithms adopt a two-phase framework. They first generate a set of candidate itemsets by roughly overestimating the utilities of all itemsets in a database, and subsequently compute the exact utility of each candidate to identify HUIs. Therefore, the major costs in these algorithms come from candidate generation and utility computation. Previous works mainly focus on how to reduce the number of candidates, without dedicating much attention to utility computation, to the best of our knowledge. However, we find that, for a mining task, the time of utility computation in two-phase algorithms dominates the whole running time of these algorithms. Therefore, it is important to optimize utility computation. In this paper, we first give a basic algorithm for HUI identification, the core of which is a utility computation procedure. Subsequently, a novel candidate tree structure is proposed for storing candidate itemsets, and a candidate tree-based algorithm is developed for fast HUI identification, in which there is an efficient utility computation procedure. Extensive experimental results show that the candidate tree-based algorithm outperforms the basic algorithm and the performance of two-phase algorithms, integrating the candidate tree algorithm as their second step, can be significantly improved.
- 14 May 2018
- Published by MDPI AG in Information
- Vol. 9 (5) , 119
Open AccessFast Identification of High Utility Itemsets from Candidates
High utility itemsets (HUIs) are sets of items with high utility, like profit, in a database. Efficient mining of high utility itemsets is an important problem in the data mining area. Many mining algorithms adopt a two-phase framework. They first generate a set of candidate itemsets by roughly overestimating the utilities of all itemsets in a database, and subsequently compute the exact utility of each candidate to identify HUIs. Therefore, the major costs in these algorithms come from candidate generation and utility computation. Previous works mainly focus on how to reduce the number of candidates, without dedicating much attention to utility computation, to the best of our knowledge. However, we find that, for a mining task, the time of utility computation in two-phase algorithms dominates the whole running time of these algorithms. Therefore, it is important to optimize utility computation. In this paper, we first give a basic algorithm for HUI identification, the core of which is a utility computation procedure. Subsequently, a novel candidate tree structure is proposed for storing candidate itemsets, and a candidate tree-based algorithm is developed for fast HUI identification, in which there is an efficient utility computation procedure. Extensive experimental results show that the candidate tree-based algorithm outperforms the basic algorithm and the performance of two-phase algorithms, integrating the candidate tree algorithm as their second step, can be significantly improved.
- 12 December 2015
- Published by Elsevier in Information Sciences
- Vol. 334-335, 323-337
An efficient algorithm for attribute-based subsequence matching
- 12 December 2015
- Published by Elsevier in Information Sciences
- Vol. 334-335, 323-337
An efficient algorithm for attribute-based subsequence matching