A novel association rule mining method of big data for power transformers state parameters based on probabilistic graph model

G Sheng, H Hou, X Jiang… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
The correlative change analysis of state parameters can provide powerful technical supports
for safe, reliable, and high-efficient operation of the power transformers. However, the …

Clustering large probabilistic graphs using multi-population evolutionary algorithm

Z Halim, M Waqas, SF Hussain - Information Sciences, 2015 - Elsevier
Determining valid clustering is an important research problem. This problem becomes
complex if the underlying data has inherent uncertainties. The work presented in this paper …

[HTML][HTML] Efficient clustering of large uncertain graphs using neighborhood information

Z Halim, M Waqas, AR Baig, A Rashid - International Journal of …, 2017 - Elsevier
This work addresses the problem of clustering large uncertain graphs. The data is
represented as a graph where the proposed solution uses the neighborhood information for …

Density-based clustering of big probabilistic graphs

Z Halim, JH Khattak - Evolving systems, 2019 - Springer
Clustering is a machine learning task to group similar objects in coherent sets. These groups
exhibit similar behavior with-in their cluster. With the exponential increase in the data …

On efficiently finding reverse k-nearest neighbors over uncertain graphs

Y Gao, X Miao, G Chen, B Zheng, D Cai, H Cui - The VLDB journal, 2017 - Springer
Reverse k-nearest neighbor (R k NN R k NN) query on graphs returns the data objects that
take a specified query object q as one of their k-nearest neighbors. It has significant …

Clustering probabilistic graphs using neighbourhood paths

SF Hussain, I Maab - Information sciences, 2021 - Elsevier
Probabilistic graphs have gained much interest in the data mining community since the big
data revolution. Graph clustering is a widely used technique in exploratory data analysis …

Ensemble-based clustering of large probabilistic graphs using neighborhood and distance metric learning

M Danesh, M Dorrigiv, F Yaghmaee - The Journal of Supercomputing, 2021 - Springer
Graphs are commonly used to express the communication of various data. Faced with
uncertain data, we have probabilistic graphs. As a fundamental problem of such graphs …

Mining frequent itemsets in correlated uncertain databases

YX Tong, L Chen, J She - Journal of Computer Science and Technology, 2015 - Springer
Recently, with the growing popularity of Internet of Things (IoT) and pervasive computing, a
large amount of uncertain data, eg, RFID data, sensor data, real-time video data, has been …

Preprocessed Spectral Clustering with Higher Connectivity for Robustness in Real-World Applications

F Sadjadi, V Torra, M Jamshidi - International Journal of Computational …, 2024 - Springer
This paper introduces a novel model for spectral clustering to solve the problem of poor
connectivity among points within the same cluster as this can negatively impact the …

A spectral clustering approach to identifying cuts in wireless sensor networks

H Hu, X Wang, Z Yang, B Zheng - IEEE Sensors Journal, 2014 - ieeexplore.ieee.org
Wireless sensor networks (WSNs) often suffer from the disrupted connectivity due to
unpredictable wireless channels, early depletion of node energy, and physical tampering by …