Gabriel Graph Transductive Approach to Dataset Shift

2019 ◽  
Author(s):  
Carla C. Takahashi ◽  
Luiz C. B. Torres ◽  
Antonio P. Braga
Keyword(s):  
Gabriel Graph ◽  
Dataset Shift

Location and Scatter Matching for Dataset Shift in Text Mining

2010 ◽  
Author(s):  
Bo Chen ◽  
Wai Lam ◽  
Ivor Tsang ◽  
Tak-Lam Wong
Keyword(s):  
Text Mining ◽  
Dataset Shift

Tackling MeSH Indexing Dataset Shift with Time-Aware Concept Embedding Learning

2020 ◽  
pp. 474-488
Author(s):  
Qiao Jin ◽  
Haoyang Ding ◽  
Linfeng Li ◽  
Haitao Huang ◽  
Lei Wang ◽  
...  
Keyword(s):  
Dataset Shift ◽  
Time Aware

Gabriel graph-based connectivity and density for internal validity of clustering

2020 ◽  
Vol 9 (3) ◽  
pp. 221-238
Author(s):  
Fatima Boudane ◽  
Ali Berrichi
Keyword(s):  
Internal Validity ◽  
Gabriel Graph

Out-of-time cross-validation strategies for classification in the presence of dataset shift

2021 ◽  
Author(s):  
Sebastián Maldonado ◽  
Julio López ◽  
Andrés Iturriaga
Keyword(s):  
Cross Validation ◽  
Dataset Shift

Large Margin Gaussian Mixture Classifier With a Gabriel Graph Geometric Representation of Data Set Structure

2020 ◽  
pp. 1-7
Author(s):  
Luiz C. B. Torres ◽  
Cristiano L. Castro ◽  
Frederico Coelho ◽  
Antonio P. Braga
Keyword(s):  
Gaussian Mixture ◽  
Geometric Representation ◽  
Data Set ◽  
Large Margin ◽  
Gabriel Graph

An Energy-Saving Algorithm of WSN Based on Gabriel Graph

2009 ◽  
Author(s):  
Ke Wang ◽  
Liqiang Wang ◽  
Shiyu Cai ◽  
Song Qu
Keyword(s):  
Energy Saving ◽  
Gabriel Graph ◽  
Saving Algorithm

HARDNESS RESULTS FOR COMPUTING OPTIMAL LOCALLY GABRIEL GRAPHS

2014 ◽  
Vol 24 (02) ◽  
pp. 153-171
Author(s):  
ABHIJEET KHOPKAR ◽  
SATHISH GOVINDARAJAN
Keyword(s):  
Geometric Graph ◽  
Problem Instance ◽  
Np Hard ◽  
Wireless Routing ◽  
Gabriel Graph ◽  
Point Set ◽  
Delaunay Graphs

Delaunay and Gabriel graphs are widely studied geometric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Locally Gabriel Graphs (LGGs) were proposed. We propose another generalization of LGGs called Generalized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily included or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge maximum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤ k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G = (V,E) is a valid LGG.

Study on the Impact of Partition-Induced Dataset Shift on $k$-Fold Cross-Validation

2012 ◽  
Vol 23 (8) ◽  
pp. 1304-1312 ◽  
Author(s):  
J. G. Moreno-Torres ◽  
J. A. Saez ◽  
F. Herrera
Keyword(s):  
Cross Validation ◽  
Dataset Shift ◽  
The Impact ◽  
Fold Cross Validation

Continuum percolation in the Gabriel graph

2002 ◽  
Vol 34 (04) ◽  
pp. 689-701 ◽  
Author(s):  
Etienne Bertin ◽  
Jean-Michel Billiot ◽  
Rémy Drouilhet
Keyword(s):  
Stationary Point ◽  
Point Processes ◽  
Hard Core ◽  
Continuum Percolation ◽  
Site Percolation ◽  
Gabriel Graph ◽  
Stationary Point Processes

In the present study, we establish the existence of site percolation in the Gabriel graph for Poisson and hard-core stationary point processes.

Sign in / Sign up

Export Citation Format

Share Document