Subgraph mining in a large graph: A review
Large graphs are often used to simulate and model complex systems in various research
and application fields. Because of its importance, frequent subgraph mining (FSM) in single …
and application fields. Because of its importance, frequent subgraph mining (FSM) in single …
Mining weighted subgraphs in a single large graph
Weighted single large graphs are often used to simulate complex systems, and thus mining
frequent subgraphs in a weighted large graph is an important issue that has attracted the …
frequent subgraphs in a weighted large graph is an important issue that has attracted the …
DIMSpan: Transactional frequent subgraph mining with distributed in-memory dataflow systems
A Petermann, M Junghanns, E Rahm - Proceedings of the Fourth IEEE …, 2017 - dl.acm.org
Transactional frequent subgraph mining identifies frequent structural patterns in a collection
of graphs. This research problem has wide applicability and increasingly requires higher …
of graphs. This research problem has wide applicability and increasingly requires higher …
Revealing Urban Spatial Interaction Characteristics and Crowd Travel Patterns from Trajectory Data
H Liu, W Chen, J Tang, M Deng, Y Guo… - Annals of the American …, 2024 - Taylor & Francis
The accelerated urbanization process has raised higher demands for urban planning and
management, and a precise understanding of urban spatial interaction characteristics is …
management, and a precise understanding of urban spatial interaction characteristics is …
A Parallel Strategy for the Logical‐probabilistic Calculus‐based Method to Calculate Two‐terminal Reliability
The theory of network reliability has been applied to many complicated network structures,
such as computer and communication networks, pi** systems, electricity networks, and …
such as computer and communication networks, pi** systems, electricity networks, and …
SparkFSM: A highly scalable frequent subgraph mining approach using apache spark
Knowledge mining from graph data has attracted many researchers over the past several
years. With the evolution of internet, computer technology, social networking sites, and web …
years. With the evolution of internet, computer technology, social networking sites, and web …
[PDF][PDF] Parallel frequent subgraph mining on multi-core processor systems
Frequent subgraph mining is an important topic of graph mining, which has practical
applications in many areas such as web link analysis, molecular substructure explorer, fraud …
applications in many areas such as web link analysis, molecular substructure explorer, fraud …
Modelando con UML el proceso de evaluación de productos de software utilizando el enfoque GQM
JR Hernández Vega, S Verona Marcos… - Revista Cubana de …, 2015 - scielo.sld.cu
El enfoque GQM (Meta-Pregunta-Métrica, por sus siglas en inglés) ha sido utilizado en el
proceso de evaluación de calidad de productos de software, como instancia de un …
proceso de evaluación de calidad de productos de software, como instancia de un …
Survey of algorithms based on dynamic graph mining
N Chaudhary, HK Thakur - 2018 Fifth International Conference …, 2018 - ieeexplore.ieee.org
Now a days people find social networks as an effective means of communication and
interaction. Therefore, it is beneficial to analyse the information from these social networks to …
interaction. Therefore, it is beneficial to analyse the information from these social networks to …
A Vertex-extension based Algorithm for Frequent Pattern Mining from Graph Databases
Frequent pattern mining is a core problem in data mining. Algorithms for frequent pattern
mining have been proposed for itemsets, sequences, and graphs. However, existing graph …
mining have been proposed for itemsets, sequences, and graphs. However, existing graph …