Ping Qiu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ping Qiu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Xiangjun Dong
Qilu University of Technology (Shandong Academy of Sciences)
5 shared publications - Long Zhao
Qilu University of Technology (Shandong Academy of Sciences)
2 shared publications - Tiantian Xu
School of Information and Control Engineering, Qingdao University of Technology, Qingdao, China
2 shared publications - Wenpeng Lu
Qilu University of Technology (Shandong Academy of Sciences)
2 shared publications Yuhai Zhao
2 shared publications- Chengqi Zhang
Department of Data Science and Artificial Intelligence, The Hong Kong Polytechnic University, Hong Kong
1 shared publication
Latest Publications
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
TaNSP: An efficient target pattern mining algorithm based on negative sequential pattern
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
TaNSP: An efficient target pattern mining algorithm based on negative sequential pattern
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
DS_HURNSP: An effective method for mining high utility repeated negative sequential patterns from data streams
- 22 January 2026
- Published by Elsevier in Information Processing & Management
- Vol. 63 (4)
DS_HURNSP: An effective method for mining high utility repeated negative sequential patterns from data streams
- 11 November 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 241
A fusion of centrality and correlation for feature selection
- 11 November 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 241
A fusion of centrality and correlation for feature selection
- 17 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (4) , 1864-1878
An Efficient Method for Modeling Nonoccurring Behaviors by Negative Sequential Patterns With Loose Constraints
The sequence analysis handles sequential discrete events and behaviors, which can be represented by temporal point processes (TPPs). However, TPP models only occurring events and behaviors. This article explores an efficient method for the negative sequential pattern (NSP) mining to leverage TPP in modeling both frequently occurring and nonoccurring events and behaviors. NSP mining is good at the challenging \ modeling of nonoccurrences of events and behaviors and their combinations with occurring events, with existing methods built on incorporating various constraints into NSP representations, e.g., simplifying NSP formulations and reducing computational costs. Such constraints restrict the flexibility of NSPs, and nonoccurring behaviors (NOBs) cannot be comprehensively exposed. This article addresses this issue by loosening some inflexible constraints in NSP mining and solves a series of consequent challenges. First, we provide a new definition of negative containment with the set theory according to the loose constraints. Second, an efficient method quickly calculates the supports of negative sequences. Our method only uses the information about the corresponding positive sequential patterns (PSPs) and avoids additional database scans. Finally, a novel and efficient algorithm, NegI-NSP, is proposed to efficiently identify highly valuable NSPs. Theoretical analyses, comparisons, and experiments on four synthetic and two real-life data sets clearly show that NegI-NSP can efficiently discover more useful NOBs.
- 17 March 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 34 (4) , 1864-1878
An Efficient Method for Modeling Nonoccurring Behaviors by Negative Sequential Patterns With Loose Constraints
The sequence analysis handles sequential discrete events and behaviors, which can be represented by temporal point processes (TPPs). However, TPP models only occurring events and behaviors. This article explores an efficient method for the negative sequential pattern (NSP) mining to leverage TPP in modeling both frequently occurring and nonoccurring events and behaviors. NSP mining is good at the challenging \ modeling of nonoccurrences of events and behaviors and their combinations with occurring events, with existing methods built on incorporating various constraints into NSP representations, e.g., simplifying NSP formulations and reducing computational costs. Such constraints restrict the flexibility of NSPs, and nonoccurring behaviors (NOBs) cannot be comprehensively exposed. This article addresses this issue by loosening some inflexible constraints in NSP mining and solves a series of consequent challenges. First, we provide a new definition of negative containment with the set theory according to the loose constraints. Second, an efficient method quickly calculates the supports of negative sequences. Our method only uses the information about the corresponding positive sequential patterns (PSPs) and avoids additional database scans. Finally, a novel and efficient algorithm, NegI-NSP, is proposed to efficiently identify highly valuable NSPs. Theoretical analyses, comparisons, and experiments on four synthetic and two real-life data sets clearly show that NegI-NSP can efficiently discover more useful NOBs.
- Open Access
- 1 January 2018
- Published by National Library of Serbia in Filomat
- Vol. 32 (5) , 1765-1776
Mining negative sequential patterns from frequent and infrequent sequences based on multiple level minimum supports
Negative sequential patterns (NSP) are critical and sometimes much more informative than positive sequential patterns (PSP) in many intelligent systems and applications. However, the existing NSP algorithms do not allow negative items being contained in an element except the NegI-NSP algorithm, which can obtain many meaningful sequences with negative items in an element. NegI-NSP, however, hasn?t considered the following problems: (1) it uses a single minimum support to all size sequences, which is unfair to a long size sequence; (2) it only mines NSP from PSP, not from infrequent positive sequences (IPS), which also contain many useful NSP. So we propose an efficient algorithm, named MLMS-NSP, to mine NSP based on multiple level minimum supports (MLMS) from PSP and IPS. Firstly, MLMS scheme is proposed by assigning different minimum supports to sequences with different sizes. Secondly, IPS are constrained by combining MLMS, and then the NSP is obtained from these IPS. Finally, experimental results show that the MLMS-NSP algorithm can effectively mine NSP from IPS, and the time efficiency is higher than using single minimum support.
- 1 January 2018
- Published by National Library of Serbia in Filomat
- Vol. 32 (5) , 1765-1776
Open AccessMining negative sequential patterns from frequent and infrequent sequences based on multiple level minimum supports
Negative sequential patterns (NSP) are critical and sometimes much more informative than positive sequential patterns (PSP) in many intelligent systems and applications. However, the existing NSP algorithms do not allow negative items being contained in an element except the NegI-NSP algorithm, which can obtain many meaningful sequences with negative items in an element. NegI-NSP, however, hasn?t considered the following problems: (1) it uses a single minimum support to all size sequences, which is unfair to a long size sequence; (2) it only mines NSP from PSP, not from infrequent positive sequences (IPS), which also contain many useful NSP. So we propose an efficient algorithm, named MLMS-NSP, to mine NSP based on multiple level minimum supports (MLMS) from PSP and IPS. Firstly, MLMS scheme is proposed by assigning different minimum supports to sequences with different sizes. Secondly, IPS are constrained by combining MLMS, and then the NSP is obtained from these IPS. Finally, experimental results show that the MLMS-NSP algorithm can effectively mine NSP from IPS, and the time efficiency is higher than using single minimum support.
- Open Access
- 1 January 2018
- Published by National Library of Serbia in Filomat
- Vol. 32 (5) , 1875-1885
Mining negative sequential patterns from infrequent positive sequences with 2-level multiple minimum supports
Negative sequential patterns (NSP) referring to both occurring items (positive items) and nonoccurring items (negative items) play a very important role in many real applications. Very few methods have been proposed to mine NSP and most of them only mine NSP from frequent positive sequences, not from infrequent positive sequences (IPS). In fact, many useful NSP can be mined from IPS, just like many useful negative association rules can be obtained from infrequent itemsets. e-NSPFI is a method to mine NSP from IPS, but its constraint is very strict to IPS and many useful NSP would be missed. In addition, e-NSPFI only uses a single minimum support, which implicitly assumes that all items in the database are of the similar frequencies. In order to solve the above problems and optimize NSP mining, a 2-level multiple minimum supports (2-LMMS) constraint to IPS is proposed in this paper. Firstly, we design two minimum supports constraints to mine frequent and infrequent positive sequences. Secondly, we use Select Actionable Pattern (SAP) method to select actionable NSP. Finally, we propose a corresponding algorithm msNSPFI to mine actionable NSP from IPS with 2-LMMS. Experiment results show that msNSPFI is very efficient for mining actionable NSP.
- 1 January 2018
- Published by National Library of Serbia in Filomat
- Vol. 32 (5) , 1875-1885
Open AccessMining negative sequential patterns from infrequent positive sequences with 2-level multiple minimum supports
Negative sequential patterns (NSP) referring to both occurring items (positive items) and nonoccurring items (negative items) play a very important role in many real applications. Very few methods have been proposed to mine NSP and most of them only mine NSP from frequent positive sequences, not from infrequent positive sequences (IPS). In fact, many useful NSP can be mined from IPS, just like many useful negative association rules can be obtained from infrequent itemsets. e-NSPFI is a method to mine NSP from IPS, but its constraint is very strict to IPS and many useful NSP would be missed. In addition, e-NSPFI only uses a single minimum support, which implicitly assumes that all items in the database are of the similar frequencies. In order to solve the above problems and optimize NSP mining, a 2-level multiple minimum supports (2-LMMS) constraint to IPS is proposed in this paper. Firstly, we design two minimum supports constraints to mine frequent and infrequent positive sequences. Secondly, we use Select Actionable Pattern (SAP) method to select actionable NSP. Finally, we propose a corresponding algorithm msNSPFI to mine actionable NSP from IPS with 2-LMMS. Experiment results show that msNSPFI is very efficient for mining actionable NSP.