Jove
Visualize
Contact Us

Related Concept Videos

Cluster Sampling Method01:20

Cluster Sampling Method

11.6K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
11.6K
Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

1.5K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
1.5K
Survival Tree01:19

Survival Tree

60
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
60
Time-Series Graph00:54

Time-Series Graph

4.3K
A time-series graph is a line graph with repeated measurements taken at successive intervals of time. It is also called a time series chart. To construct a time-series graph, one must look at both pieces of a paired data set. The horizontal axis is used to plot the time increments, and the vertical axis is used to plot the values of the variable that one is measuring. By using the axes in this way, each point on the graph will correspond to time and a measured quantity. The points on the graph...
4.3K
Heuristics01:21

Heuristics

74
Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...
74
Kaplan-Meier Approach01:24

Kaplan-Meier Approach

98
The Kaplan-Meier estimator is a non-parametric method used to estimate the survival function from time-to-event data. In medical research, it is frequently employed to measure the proportion of patients surviving for a certain period after treatment. This estimator is fundamental in analyzing time-to-event data, making it indispensable in clinical trials, epidemiological studies, and reliability engineering. By estimating survival probabilities, researchers can evaluate treatment effectiveness,...
98

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

TurkMedNLI: a Turkish medical natural language inference dataset through large language model based translation.

PeerJ. Computer science·2025
Same author

k-Clique counting on large scale-graphs: a survey.

PeerJ. Computer science·2024
Same journal

DARUMA: a gateway to fast and easy prediction of intrinsically disordered regions.

PeerJ. Computer science·2026
Same journal

Alzheimer's disease detection using a quantum deep neural network with Haralick feature extraction and simulated annealing optimization.

PeerJ. Computer science·2026
Same journal

Network anomaly detection using Deep Autoencoder and parallel Artificial Bee Colony algorithm-trained neural network.

PeerJ. Computer science·2026
Same journal

An anomaly detection model for multivariate time series with anomaly perception.

PeerJ. Computer science·2026
Same journal

Retraction: A wormhole attack detection method for tactical wireless sensor networks.

PeerJ. Computer science·2026
Same journal

Evaluation of mental disorder with prioritization of its type by utilizing the bipolar complex fuzzy decision-making approach based on Schweizer-Sklar prioritized aggregation operators.

PeerJ. Computer science·2026
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Jun 5, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K

Dynamic frequent subgraph mining algorithms over evolving graphs: a survey.

Belgin Ergenç Bostanoğlu1, Nourhan Abuzayed1

  • 1Computer Engineering, Izmir Institute of Technology, Izmir, Turkey.

Peerj. Computer Science
|December 9, 2024
PubMed
Summary
This summary is machine-generated.

This review compares dynamic frequent subgraph mining algorithms for evolving graphs. It highlights characteristics of exact and approximate methods, identifying research opportunities in this challenging graph mining area.

Keywords:
Approximate frequent subgraph miningDynamic graphEvolving graphExact frequent subgraph miningFrequent subgraph miningIncremental subgraph mining

More Related Videos

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms
08:36

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms

Published on: March 21, 2019

7.2K
Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
09:32

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

Published on: December 18, 2016

12.3K

Related Experiment Videos

Last Updated: Jun 5, 2025

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.4K
Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms
08:36

Dynamic Inter-subject Functional Connectivity Reveals Moment-to-Moment Brain Network Configurations Driven by Continuous or Communication Paradigms

Published on: March 21, 2019

7.2K
Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients
09:32

Network Analysis of Foramen Ovale Electrode Recordings in Drug-resistant Temporal Lobe Epilepsy Patients

Published on: December 18, 2016

12.3K

Area of Science:

  • Data Science
  • Graph Mining
  • Machine Learning

Background:

  • Frequent subgraph mining (FSM) is crucial but challenging in data science.
  • Modern applications use evolving graphs, increasing FSM complexity.
  • Existing FSM algorithms struggle with dynamic and large-scale graph data.

Purpose of the Study:

  • To provide a comparative review of dynamic frequent subgraph mining algorithms for evolving graphs.
  • To analyze and contrast exact and approximate FSM algorithms tailored for dynamic graph data.
  • To identify and discuss future research directions in this specialized domain.

Main Methods:

  • Comparative analysis of dynamic FSM algorithms based on attributes like increment type, graph representation, and algorithmic approach.
  • Detailed comparison of approximate dynamic FSM algorithms, including sampling strategies and statistical guarantees.
  • Systematic review of FSM techniques applicable to evolving graph structures.

Main Results:

  • Categorization and comparison of dynamic FSM algorithms based on key characteristics.
  • Evaluation of approximate FSM methods for dynamic graphs, focusing on their sampling techniques and objectives.
  • Identification of research gaps and opportunities in dynamic subgraph mining.

Conclusions:

  • A comprehensive overview of dynamic FSM algorithms for evolving graphs is presented.
  • The review serves as a reference for researchers in dynamic graph mining.
  • Further research is needed to address the challenges of FSM on evolving graph data.