Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization.
Yu NakahataTakashi HoriyamaShin-ichi MinatoKatsuhisa YamanakaPublished in: CoRR (2020)
Keyphrases
- random sampling
- active learning
- sampling algorithm
- adaptive sampling
- sample size
- sampling procedure
- random projections
- topological information
- sliding window
- stratified sampling
- query by committee
- random samples
- random sample
- graph mining
- search space
- sampling methods
- connected components
- robust estimator
- feature extraction
- learning algorithm
- data mining