Spatio-temporal graph clustering algorithm based on attribute and structural similarity

2016 ◽  
Vol 20 (3) ◽  
pp. 149-160 ◽  
Author(s):  
M. Parimala ◽  
Daphne Lopez
Keyword(s):  
Clustering Algorithm ◽  
Structural Similarity ◽  
Graph Clustering ◽  
Temporal Graph ◽  
Spatio Temporal

Moving Objects Gathering Patterns Retrieving based on Spatio-Temporal Graph

2016 ◽  
Vol 13 (3) ◽  
pp. 88-107 ◽  
Author(s):  
Junming Zhang ◽  
Jinglin Li ◽  
Zhihan Liu ◽  
Quan Yuan ◽  
Fangchun Yang
Keyword(s):  
Clustering Algorithm ◽  
Moving Objects ◽  
High Volume ◽  
Complete Graphs ◽  
Trajectory Data ◽  
Traffic System ◽  
Spatial Coordinates ◽  
Temporal Graph ◽  
Spatio Temporal ◽  
Retrieving Algorithm

Moving objects gathering pattern represents a group events or incidents that involve congregation of moving objects, enabling the analysis of traffic system. However, effectively and efficiently discovering the specific gathering pattern turns to be a remaining challenging issue since the large number of moving objects will generate high volume of trajectory data. In order to address this issue, the authors propose a moving object gathering pattern retrieving method that aims to support the retrieving of gathering patterns based on spatio-temporal graph. In this method, firstly the authors use an improved R-tree based density clustering algorithm (RT-DBScan) to index the moving objects and collect clusters. Then, they maintain a spatio-temporal graph rather than storing the spatial coordinates to obtain the spatio-temporal changes in real time. Finally, a gathering retrieving algorithm is developed by searching the maximal complete graphs which meet the spatio-temporal constraints. To the best of their knowledge, effectiveness and efficiency of the proposed methods are outperformed other methods on both real and large trajectory data.

Based on spatio-temporal graph convolution networks with residual connection for intelligence behavior recognition

2021 ◽  
pp. 002072092199660
Author(s):  
Yinong Zhang ◽  
Shanshan Guan ◽  
Cheng Xu ◽  
Hongzhe Liu
Keyword(s):  
Human Behavior ◽  
Behavior Recognition ◽  
Convolutional Network ◽  
Skeleton Model ◽  
Basic Technology ◽  
Temporal Model ◽  
Temporal Graph ◽  
Spatio Temporal ◽  
Human Behavior Recognition ◽  
Behavior Characteristics

In the era of intelligent education, human behavior recognition based on computer vision is an important branch of pattern recognition. Human behavior recognition is a basic technology in the fields of intelligent monitoring and human-computer interaction in education. The dynamic changes of human skeleton provide important information for the recognition of educational behavior. Traditional methods usually use manual information to label or traverse rules only, resulting in limited representation capabilities and poor generalization performance of the model. In this paper, a kind of dynamic skeleton model with residual is adopted—a spatio-temporal graph convolutional network based on residual connections, which not only overcomes the limitations of previous methods, but also can learn the spatio-temporal model from the skeleton data. In the big bone NTU-RGB + D dataset, the network model not only improved the representation ability of human behavior characteristics, but also improved the generalization ability, and achieved better recognition effect than the existing model. In addition, this paper also compares the results of behavior recognition on subsets of different joint points, and finds that spatial structure division have better effects.

Efficient Vector Partitioning Algorithms for Graph Clustering

2020 ◽  
Vol 1 (2) ◽  
pp. 101-123
Author(s):  
Hiroaki Shiokawa ◽  
Yasunori Futamura
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Clustering Algorithm ◽  
Ground Truth ◽  
Graph Clustering ◽  
Mining Communities ◽  
Fine Grained ◽  
Efficient Vector ◽  
Public Datasets ◽  
Many Core

This paper addressed the problem of finding clusters included in graph-structured data such as Web graphs, social networks, and others. Graph clustering is one of the fundamental techniques for understanding structures present in the complex graphs such as Web pages, social networks, and others. In the Web and data mining communities, the modularity-based graph clustering algorithm is successfully used in many applications. However, it is difficult for the modularity-based methods to find fine-grained clusters hidden in large-scale graphs; the methods fail to reproduce the ground truth. In this paper, we present a novel modularity-based algorithm, \textit{CAV}, that shows better clustering results than the traditional algorithm. The proposed algorithm employs a cohesiveness-aware vector partitioning into the graph spectral analysis to improve the clustering accuracy. Additionally, this paper also presents a novel efficient algorithm \textit{P-CAV} for further improving the clustering speed of CAV; P-CAV is an extension of CAV that utilizes the thread-based parallelization on a many-core CPU. Our extensive experiments on synthetic and public datasets demonstrate the performance superiority of our approaches over the state-of-the-art approaches.

scholarly journals Multiscale Spatio-Temporal Graph Neural Networks for 3D Skeleton-Based Motion Prediction

2021 ◽  
Vol 30 ◽  
pp. 7760-7775
Author(s):  
Maosen Li ◽  
Siheng Chen ◽  
Yangheng Zhao ◽  
Ya Zhang ◽  
Yanfeng Wang ◽  
...  
Keyword(s):  
Neural Networks ◽  
Motion Prediction ◽  
Temporal Graph ◽  
3D Skeleton ◽  
Spatio Temporal ◽  
Graph Neural Networks

scholarly journals AN EFFICIENT CLUSTERING METHOD FOR DBSCAN GEOGRAPHIC SPATIO-TEMPORAL LARGE DATA WITH IMPROVED PARAMETER OPTIMIZATION

2020 ◽  
Vol XLII-3/W10 ◽  
pp. 581-584
Author(s):  
J. W. Li ◽  
X. Q. Han ◽  
J. W. Jiang ◽  
Y. Hu ◽  
L. Liu
Keyword(s):  
Parameter Optimization ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Large Data ◽  
Parameter Selection ◽  
Physical Analysis ◽  
Clustering Method ◽  
K Value ◽  
Dbscan Clustering ◽  
Spatio Temporal

Abstract. How to establish an effective method of large data analysis of geographic space-time and quickly and accurately find the hidden value behind geographic information has become a current research focus. Researchers have found that clustering analysis methods in data mining field can well mine knowledge and information hidden in complex and massive spatio-temporal data, and density-based clustering is one of the most important clustering methods.However, the traditional DBSCAN clustering algorithm has some drawbacks which are difficult to overcome in parameter selection. For example, the two important parameters of Eps neighborhood and MinPts density need to be set artificially. If the clustering results are reasonable, the more suitable parameters can not be selected according to the guiding principles of parameter setting of traditional DBSCAN clustering algorithm. It can not produce accurate clustering results.To solve the problem of misclassification and density sparsity caused by unreasonable parameter selection in DBSCAN clustering algorithm. In this paper, a DBSCAN-based data efficient density clustering method with improved parameter optimization is proposed. Its evaluation index function (Optimal Distance) is obtained by cycling k-clustering in turn, and the optimal solution is selected. The optimal k-value in k-clustering is used to cluster samples. Through mathematical and physical analysis, we can determine the appropriate parameters of Eps and MinPts. Finally, we can get clustering results by DBSCAN clustering. Experiments show that this method can select parameters reasonably for DBSCAN clustering, which proves the superiority of the method described in this paper.

Sign in / Sign up

Export Citation Format

Share Document