Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rong Gao 0003

dblp:79/518-3 · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
4since 2021 · last 2025
0000-0003-2267-3153ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 6 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 78% Data integration and cleaning · 22%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data forgetting
0.812024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024
Data mining › pattern mining › sequential pattern mining
order-preserving pattern mining
0.812024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024
Data mining
pattern mining
0.812024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024
Data mining › pattern mining
sequential pattern mining
0.812024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024
Data mining
clustering
0.212024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024
Data mining › clustering
time series clustering
0.212024
OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series · IEEE Trans. Knowl. Data Eng. 2024

Methods — techniques the papers use, named apart from their topics

prefix and suffix pattern pruning · 0.8maximal support priority strategy · 0.8group pattern fusion · 0.8
YearPublicationVenuePosition
2025 CoTP-Miner: Co-occurrence three-way sequential pattern mining
Yan Li 0087, Jie Li 0061, Rong Gao 0003, Philippe Fournier-Viger, Youxi Wu
Knowl. Based Syst.4
2024 OPF-Miner: Order-Preserving Pattern Mining With Forgetting Mechanism for Time Series
abstract
Order-preserving pattern (OPP) mining is a type of sequential pattern mining method in which a group of ranks of time series is used to represent an OPP. This approach can discover frequent trends in time series. Existing OPP mining algorithms consider data points at different time to be equally important; however, newer data usually have a more significant impact, while older data have a weaker impact. We therefore introduce the forgetting mechanism into OPP mining to reduce the importance of older data. This paper explores the mining of OPPs with forgetting mechanism (OPF) and proposes an algorithm called OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks, candidate pattern generation and support calculation. In candidate pattern generation, OPF-Miner employs a maximal support priority strategy and a group pattern fusion strategy to avoid redundant pattern fusions. For support calculation, we propose an algorithm called support calculation with forgetting mechanism, which uses prefix and suffix pattern pruning strategies to avoid redundant support calculations. The experiments are conducted on nine datasets and 12 alternative algorithms. The results verify that OPF-Miner is superior to other competitive algorithms. More importantly, OPF-Miner yields good clustering performance for time series, since the forgetting mechanism is employed.
Yan Li 0087, Chenyu Ma, Rong Gao 0003, Youxi Wu, Xindong Wu 0001
IEEE Trans. Knowl. Data Eng.3
2021 Elliptic entropy of uncertain random variables with application to portfolio selection
Rong Gao 0003, Yuxiang Bian, Huafei Di
Soft Comput.2
2021 Asian rainbow option pricing formulas of uncertain stock model
Rong Gao 0003
Soft Comput.1
2020 Partial divergence measure of uncertain random variables and its application
Hamed Ahmadzade, Rong Gao 0003, Habib Naderi, Mehran Farahikia
Soft Comput.2
2020 Frugal innovation in supply chain cooperation considering e-retailer's platform value
Rong Gao 0003
Soft Comput.3
2020 Green supply chain analysis under cost sharing contract with uncertain information based on confidence level
Nana Ma, Rong Gao 0003, Xiaobin Wang
Soft Comput.2
2019 Uncertain Wave Equation for Vibrating String
abstract
Wave equation is a commonly used tool for describing various kinds of wave phenomena in nature such as sound wave, water wave, electromagnetic wave and string vibration. It is a second-order partial differential equation and describe the wave propagation without noises. However, real world is filled with noises everywhere. So deterministic wave equation is not enough to model some problems with additive noises. As a remedy method, stochastic wave equation driven by Wiener process was presented where the noise is considered random and modeled by using Wiener process. Except for randomness, uncertainty associated belief degrees is another different type of indeterministic phenomenon. For modeling the wave phenomena with uncertain noises, this paper aims at deriving an uncertain wave equation driven by Liu process, which is a type of partial differential equation. Here, Liu process is a Lipschitz continuous uncertain process with stationary and independent increments. Then, we prove the existence and uniqueness of the solution of an uncertain wave equation. Additionally, we give the inverse uncertainty distribution of a solution of an uncertain wave equation.
Rong Gao 0003, Dan A. Ralescu
IEEE Trans. Fuzzy Syst.1
2018 Elliptic entropy of uncertain set and its applications
abstract
Entropy is commonly used as a way to measure the uncertainty of random variables. In uncertain set theory, a concept of entropy for uncertain sets has been defined by using logarithm. However, such an entropy fails to measure the uncertain degree of some uncertain sets. This paper aims at proposing a concept of elliptic entropy for uncertain sets and investigating its properties such as translation invariance and positive linearity. It also provides some formulas for calculating the elliptic entropy via inverse membership functions. Additionally, elliptic relative entropy for uncertain sets is presented as a measure of the difference between two membership functions, and some applications are considered in portfolio selection and clustering.
Rong Gao 0003, Dan A. Ralescu
Int. J. Intell. Syst.1
2018 Complex uncertain random variables
Rong Gao 0003, Zhiqiang Zhang 0003, Hamed Ahmadzade, Dan A. Ralescu
Soft Comput.1
2018 Convergence in Distribution for Uncertain Random Variables
abstract
A random variable is a measurable function from an uncertainty space to the set of real numbers, which is used to model randomness. An uncertain variable is a measurable function from uncertainty space to the set of real numbers, which is used to describe uncertainty. However, randomness and uncertainty often simultaneously appear in a complex system. Uncertain random variable provides a useful tool to handle such a hybrid case. This concept integrates random variable and uncertain variable into a broader view. For uncertain random variables, a basic and important topic is to discuss the convergence of its sequence. Specifically, this paper focuses on studying the convergence in distribution for a sequence of uncertain random variables without a common chance distribution.
Rong Gao 0003, Dan A. Ralescu
IEEE Trans. Fuzzy Syst.1
2016 Importance index of components in uncertain random systems
Rong Gao 0003, Kai Yao 0002
Knowl. Based Syst.1