GraphScope

swMATH20427MaRDI QIDQ32245FDOQ32245

Author name not available (Why is that?)

Cited In (25)

• Hierarchical two-part MDL code for multinomial distributions
• The minimum description length principle for pattern mining: a survey
• A survey on enhanced subspace clustering
• Discovering recurring activity in temporal networks
• Community detection using local neighborhood in complex networks
• Discovering patterns in time-varying graphs: a triclustering approach
• The many faces of graph dynamics
• Adaptive evolutionary clustering
• Community detection via measuring the strength between nodes for dynamic networks
• Online summarization of dynamic graphs using subjective interestingness for sequential data
• Influence of the User Importance Measure on the Group Evolution Discovery
• Kernel spectral clustering with memory effect
• Krimp: mining itemsets that compress
• Mining preserving structures in a graph sequence
• Evolutionary soft co-clustering: formulations, algorithms, and applications
• Noise-tolerance community detection and evolution in dynamic social networks
• Dynamic community detection based on network structural perturbation and topological similarity
• Clustering and community detection in directed networks: a survey
• A classification for community discovery methods in complex networks
• Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
• Quantitative evaluation of snapshot graphs for the analysis of temporal networks
• Clustering large attributed information networks: an efficient incremental computing approach
• Change point detection in network models: preferential attachment and long range dependence
• Nonparametric Anomaly Detection on Time Series of Graphs
• Evolutionary Network Analysis

This page was built for software: GraphScope